Yohei KONISHI Yuyuan CHANG Minseok KIM Jun-ichi TAKADA
This paper presents a $24 imes24$ MIMO channel sounder that has been developed based on a scalable fully parallel MIMO architecture. It can be flexibly configured with 3 sub-transmitters and 3 sub-receivers, each of which consists of 8 RF ports. This flexibility allows the measurement for both purposes of double directional and multi-link MIMO channel measurements. Implementation issues related to the multi-link operation on the fully parallel architecture were successfully solved by appropriate system design and applying several calibration techniques. The performance of the developed system was validated by extensive test experiments. Finally, a multi-link channel measurement example in an indoor environment was presented demonstrating the capability of the proposed system.
This paper proposes a compact three-mode H-shaped resonator bandpass filter fed by antiparallel coupled input/output lines. To investigate the resonant behavior of the H-shaped resonator, even/odd-mode resonance conditions of the resonator are first derived analytically. The multimode resonances of the H-shaped resonator filter are modeled by a multipath circuit formed with resonance paths. Moreover, a direct source/load coupling path is connected in parallel, of which the value shows a frequency dependency because of the antiparallel coupled feeding lines, thereby generating four transmission zeros (TZs) greater than the number of a theoretical limitation. The H-shaped resonator bandpass filter is synthesized, developed, and tested, showing a third-order passband response with four TZs located near the passband, and a wide stopband property.
Tsubasa TERADA Toshihiko NISHIMURA Yasutaka OGAWA Takeo OHGANE Hiroyoshi YAMADA
Much attention has recently been paid to direction of arrival (DOA) estimation using compressed sensing (CS) techniques, which are sparse signal reconstruction methods. In our previous study, we developed a method for estimating the DOAs of multi-band signals that uses CS processing and that is based on the assumption that incident signals have the same complex amplitudes in all the bands. That method has a higher probability of correct estimation than a single-band DOA estimation method using CS. In this paper, we propose novel DOA estimation methods for multi-band signals with frequency characteristics using the Khatri-Rao product. First, we formulate a method that can estimate DOAs of multi-band signals whose phases alone have frequency dependence. Second, we extend the scheme in such a way that we can estimate DOAs of multi-band signals whose amplitudes and phases both depend on frequency. Finally, we evaluate the performance of the proposed methods through computer simulations and reveal the improvement in estimation performance.
Tsutomu SAKATA Atsushi YAMAMOTO Koichi OGAWA Hiroshi IWAI Jun-ichi TAKADA Kei SAKAGUCHI
This paper presents a spatial fading emulator for evaluating handset MIMO antennas in a cluster environment. The proposed emulator is based on Clarke's model and has the ability to control RF signals directly in spatial domain to generate an accurate radio propagation channel model, which includes both uniform and non-uniform angular power spectra (APS) in the horizontal plane. Characteristics of a propagation channel such as fading correlations, eigenvalues and MIMO channel capacities of handset antennas located in the vicinity of the emulator's ring can be evaluated. The measured results show that the fading emulator with 31 antenna probes is sufficient to evaluate fading correlation and MIMO channel capacity of handset antenna in the case of a narrow APS with the standard deviation of more than 20 degrees.
Akihiro TOMITA Xiaoqing WEN Yasuo SATO Seiji KAJIHARA Kohei MIYASE Stefan HOLST Patrick GIRARD Mohammad TEHRANIPOOR Laung-Terng WANG
The applicability of at-speed scan-based logic built-in self-test (BIST) is being severely challenged by excessive capture power that may cause erroneous test responses even for good circuits. Different from conventional low-power BIST, this paper is the first to explicitly focus on achieving capture power safety with a novel and practical scheme, called capture-power-safe logic BIST (CPS-LBIST). The basic idea is to identify all possibly-erroneous test responses caused by excessive capture power and use the well-known approach of masking (bit-masking, slice-masking,vector-masking) to block them from reaching the multiple-input signature register(MISR). Experiments with large benchmark circuits and a large industrial circuit demonstrate that CPS-LBIST can achieve capture power safety with negligible impact on test quality and circuit overhead.
The goal of dimension reduction is to represent high-dimensional data in a lower-dimensional subspace, while intrinsic properties of the original data are kept as much as possible. An important challenge in unsupervised dimension reduction is the choice of tuning parameters, because no supervised information is available and thus parameter selection tends to be subjective and heuristic. In this paper, we propose an information-theoretic approach to unsupervised dimension reduction that allows objective tuning parameter selection. We employ quadratic mutual information (QMI) as our information measure, which is known to be less sensitive to outliers than ordinary mutual information, and QMI is estimated analytically by a least-squares method in a computationally efficient way. Then, we provide an eigenvector-based efficient implementation for performing unsupervised dimension reduction based on the QMI estimator. The usefulness of the proposed method is demonstrated through experiments.
Kazuma SHIMADA Katsumi KONISHI Kazunori URUMA Tomohiro TAKAHASHI Toshihiro FURUKAWA
This paper deals with the problem of reconstructing a high-resolution digital image from a single low-resolution digital image and proposes a new intra-frame super-resolution algorithm based on the mixed lp/l1 norm minimization. Introducing some assumptions, this paper formulates the super-resolution problem as a mixed l0/l1 norm minimization and relaxes the l0 norm term to the lp norm to avoid ill-posedness. A heuristic iterative algorithm is proposed based on the iterative reweighted least squares (IRLS). Numerical examples show that the proposed algorithm achieves super-resolution efficiently.
Mingzhe RONG Tianhui LI Xiaohua WANG Dingxin LIU Anxue ZHANG
When ultra-high-frequency (UHF) method is applied in partial discharge (PD) detection for GIS, the propagation process and rules of electromagnetic (EM) wave need to be understood clearly for conducting diagnosis and assessment about the real insulation status. The preceding researches are mainly concerning about the radial component of the UHF signal, but the propagation of the signal components in axial and radial directions and that perpendicular to the radial direction of the GIS tank are rarely considered. So in this paper, for a 252,kV GIS with T-shaped structure (TS), the propagation and attenuation of PD-induced EM wave in different circumferential angles and directions are investigated profoundly in time and frequency domain based on Finite Difference Time Domain (FDTD) method. The attenuation rules of the peak to peak value (Vpp) and cumulative energy are concluded. By comparing the results of straight branch and T branch, the influence of T-shaped structure over the propagation of different signal components are summarized. Moreover, the new circumferential and axial location methods proposed in the previous work are verified to be still applicable. This paper discusses the propagation mechanism of UHF signal in T-shaped tank, which provides some referential significance towards the utilization of UHF technique and better implementation of PD detection.
This letter describe target classification from the synthesized active sonar returns from targets. A fractional Fourier transform is applied to the sonar returns to extract shape variation in the fractional Fourier domain depending on the highlight points and aspects of the target. With the proposed features, four different targets are classified using two neural network classifiers.
Xiaohui FAN Hiraku OKADA Kentaro KOBAYASHI Masaaki KATAYAMA
Energy harvesting technology was introduced into wireless sensor networks (WSNs) to solve the problem of the short lifetimes of sensor nodes. The technology gives sensor nodes the ability to convert environmental energy into electricity. Sufficient electrical energy can lengthen the lifetime and improve the quality of service of a WSN. This paper proposes a novel use of mutual information to evaluate data transmission behavior in the energy harvesting WSNs. Data at a sink for a node deteriorates over time until the next periodic transmission from the node is received. In this paper, we suggest an optimized intermittent transmission method for WSNs that harvest energy. Our method overcomes the problem of information deterioration without increasing energy cost. We show that by using spatial correlation between different sensor nodes, our proposed method can mitigate information deterioration significantly at the sink.
Kaihong SHI Zongqing LU Qingyun SHE Fei ZHOU Qingmin LIAO
This paper presents a novel filter to keep from over-smoothing the edges and corners and rectify the outliers in the flow field after each incremental computation step, which plays a key role during the process of estimating flow field. This filter works according to the spatial-temporal derivatives distance of the input image and velocity field distance, whose principle is more reasonable in filtering mechanism for optical flow than other existing nonlinear filters. Moreover, we regard the spatial-temporal derivatives as new powerful descriptions of different motion layers or regions and give a detailed explanation. Experimental results show that our proposed method achieves better performance.
Guanwen ZHANG Jien KATO Yu WANG Kenji MASE
In this paper, we propose a novel approach for multiple-shot people re-identification. Due to high variance in camera view, light illumination, non-rigid deformation of posture and so on, there exists a crucial inter-/intra- variance issue, i.e., the same people may look considerably different, whereas different people may look extremely similar. This issue leads to an intractable, multimodal distribution of people appearance in feature space. To deal with such multimodal properties of data, we solve the re-identification problem under a local distance comparison framework, which significantly alleviates the difficulty induced by varying appearance of each individual. Furthermore, we build an energy-based loss function to measure the similarity between appearance instances, by calculating the distance between corresponding subsets in feature space. This loss function not only favors small distances that indicate high similarity between appearances of the same people, but also penalizes small distances or undesirable overlaps between subsets, which reflect high similarity between appearances of different people. In this way, effective people re-identification can be achieved in a robust manner against the inter-/intra- variance issue. The performance of our approach has been evaluated by applying it to the public benchmark datasets ETHZ and CAVIAR4REID. Experimental results show significant improvements over previous reports.
Shoichi KOYAMA Ken'ichi FURUYA Hisashi UEMATSU Yusuke HIWASAKI Yoichi HANEDA
A new real-time sound field transmission system is presented. To construct this system, a large listening area needs to be reproduced at not less than a constant height. Additionally, the driving signals of the loudspeakers should be obtained only from received signals of microphones. Wave field reconstruction (WFR) filtering for linear arrays of microphones and loudspeakers is considered to be suitable for this kind of system. An experimental system was developed to show the feasibility of real-time sound field transmission using the WFR filter. Experiments to measure the reproduced sound field and a subjective listening test of sound localization were conducted to evaluate the proposed system. Although the reproduced sound field included several artifacts such as spatial aliasing and faster amplitude decay, the experimental results indicated that the proposed system was able to provide sound localization accuracy for virtual sound sources comparable to that for real sound sources in a large listening area.
This paper proposes a robust and fast lyric search method for music information retrieval (MIR). The effectiveness of lyric search systems based on full-text retrieval engines or web search engines is highly compromised when the queries of lyric phrases contain incorrect parts due to mishearing. To improve the robustness of the system, the authors introduce acoustic distance, which is computed based on a confusion matrix of an automatic speech recognition experiment, into Dynamic-Programming (DP)-based phonetic string matching to identify the songs that the misheard lyric phrases refer to. An evaluation experiment verified that the search accuracy is increased by 4.4% compared with the conventional method. Furthermore, in this paper a two-pass search algorithm is proposed to realize real-time execution. The algorithm pre-selects the probable candidates using a rapid index-based search in the first pass and executes a DP-based search process with an adaptive termination strategy in the second pass. Experimental results show that the proposed search method reduced processing time by more than 86.2% compared with the conventional methods for the same search accuracy.
Shuang BAI Jianjun HOU Noboru OHNISHI
Local descriptors, Local Binary Pattern (LBP) and Scale Invariant Feature Transform (SIFT) are widely used in various computer applications. They emphasize different aspects of image contents. In this letter, we propose to combine them in sparse coding for categorizing scene images. First, we regularly extract LBP and SIFT features from training images. Then, corresponding to each feature, a visual word codebook is constructed. The obtained LBP and SIFT codebooks are used to create a two-dimensional table, in which each entry corresponds to an LBP visual word and a SIFT visual word. Given an input image, LBP and SIFT features extracted from the same positions of this image are encoded together based on sparse coding. After that, spatial max pooling is adopted to determine the image representation. Obtained image representations are converted into one-dimensional features and classified by utilizing SVM classifiers. Finally, we conduct extensive experiments on datasets of Scene Categories 8 and MIT 67 Indoor Scene to evaluate the proposed method. Obtained results demonstrate that combining features in the proposed manner is effective for scene categorization.
Naushin NOWER Yasuo TAN Azman Osman LIM
Feedback data loss can severely degrade overall system performance. In addition, it can affect the control and computation of the Cyber-physical Systems (CPS). CPS hold enormous potential for a wide range of emerging applications that include different data traffic patterns. These data traffic patterns have wide varieties of diversities. To recover various traffic patterns we need to know the nature of their underlying property. In this paper, we propose a data recovery framework for different traffic patterns of CPS, which comprises data pre-processing step. In the proposed framework, we designed a Data Pattern Analyzer to classify the different patterns and built a model based on the pattern as a data pre-processing step. Inside the framework, we propose a data recovery scheme, called Efficient Temporal and Spatial Data Recovery (ETSDR) algorithm to recover the incomplete feedback for CPS to maintain real time control. In this algorithm, we utilize the temporal model based on the traffic pattern and consider the spatial correlation of the nearest neighbor sensors. Numerical results reveal that the proposed ETSDR outperforms both the weighted prediction (WP) and the exponentially weighted moving average (EWMA) algorithms regardless of the increment percentage of missing data in terms of the root mean square error, the mean absolute error, and the integral of absolute error.
With the phenomenal explosion in online services, social networks are becoming an emerging ubiquitous platform for numerous services where service consumers require the selection of trustworthy service providers before invoking services with the help of other intermediate participants. Under this circumstance, evaluation of the trustworthiness of the service provider along the social trust paths from the service consumer to the service provider is required and to this end, selection of the optimal social trust path (OSTP) that can yield the most trustworthy evaluation result is a pre-requisite. OSTP selection with multiple quality of trust (QoT) constraints has been proven to be NP-Complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions cannot guarantee the search efficiency, that is, they have difficulty in avoiding suboptimal solutions during the search process. Quantum annealing uses delocalization and tunneling to avoid local minima without sacrificing execution time. Several recent studies have proven that it is a promising way to tackle many optimization problems. In this paper, we propose a novel quantum annealing based OSTP selection algorithm (QA_OSTP) for large-scale complex social networks. Experiments show that QA_OSTP has better performance than its heuristic counterparts.
Yoshiki KAYANO Kazuaki MIYANAGA Hiroshi INOUE
Since electromagnetic (EM) noise resulting from an arc discharge disturbs other electric devices, parameters on electromagnetic compatibility, as well as lifetime and reliability, are important properties for electrical contacts. To clarify the characteristics and the mechanism of the generation of the EM noise, the arc column and voltage fluctuations generated by slowly breaking contacts with external direct current (DC) magnetic field, up to 20,mT, was investigated experimentally using Ag$_{90.7{ m wt%}}$SnO$_{2,9.3{ m wt}%}$ material. Firstly the motion of the arc column is measured by high-speed camera. Secondary, the distribution of the motion of the arc and contact voltage are discussed. It was revealed that the contact voltage fluctuation in the arc duration is related to the arc column motion.
Hiroki NAKAHARA Tsutomu SASAO Munehiro MATSUURA
A Decision Diagram Machine (DDM) is a special-purpose processor that has special instructions to evaluate a decision diagram. Since the DDM uses only a limited number of instructions, it is faster than the general-purpose Micro Processor Unit (MPU). Also, the architecture for the DDM is much simpler than that for an MPU. This paper presents a packet classifier using a parallel EVMDD (k) machine. To reduce computation time and code size, first, a set of rules for a packet classifier is partitioned into groups. Then, the parallel EVMDD (k) machine evaluates them. To further speed-up for the standard EVMDD (k) machine, we propose the prefetching EVMDD (k) machine which reads both the index and the jump address at the same time. The prefetching EVMDD (k) machine is 2.4 times faster than the standard one using the same memory size. We implemented a parallel prefetching EVMDD (k) machine consisting of 30 machines on an FPGA, and compared it with the Intel's Core i5 microprocessor running at 1.7GHz. Our parallel machine is 15.1-77.5 times faster than the Core i5, and it requires only 8.1-58.5 percents of the memory for the Core i5.
Ruicong ZHI Lei ZHAO Bolin SHI Yi JIN
A novel Two-dimensional Fuzzy Discriminant Locality Preserving Projections (2D-FDLPP) algorithm is proposed for learning effective subspace of two-dimensional images. The 2D-FDLPP algorithm is derived from the Two-dimensional Locality Preserving Projections (2D-LPP) by exploiting both fuzzy and discriminant properties. 2D-FDLPP algorithm preserves the relationship degree of each sample belonging to given classes with fuzzy k-nearest neighbor classifier. Also, it introduces between-class scatter constrain and label information into 2D-LPP algorithm. 2D-FDLPP algorithm finds the subspace which can best discriminate different pattern classes and weakens the environment factors according to soft assignment method. Therefore, 2D-FDLPP algorithm has more discriminant power than 2D-LPP, and is more suitable for recognition tasks. Experiments are conducted on the MNIST database for handwritten image classification, the JAFFE database and Cohn-Kanade database for facial expression recognition and the ORL database for face recognition. Experimental results reported the effectiveness of our proposed algorithm.