Wanchun LI Ting YUAN Bin WANG Qiu TANG Yingxiang LI Hongshu LIAO
In this paper, we explore the relationship between Geometric Dilution of Precision (GDOP) and Cramer-Rao Bound (CRB) by tracing back to the original motivations for deriving these two indexes. In addition, the GDOP is served as a sensor-target geometric uncertainty analysis tool whilst the CRB is served as a statistical performance evaluation tool based on the sensor observations originated from target. And CRB is the inverse matrix of Fisher information matrix (FIM). Based on the original derivations for a same positioning application, we interpret their difference in a mathematical view to show that.
Wei HAN Xiongwei ZHANG Meng SUN Li LI Wenhua SHI
In this letter, we propose a novel speech separation method based on perceptual weighted deep recurrent neural network (DRNN) which incorporate the masking properties of the human auditory system. In supervised training stage, we firstly utilize the clean label speech of two different speakers to calculate two perceptual weighting matrices. Then, the obtained different perceptual weighting matrices are utilized to adjust the mean squared error between the network outputs and the reference features of both the two clean speech so that the two different speech can mask each other. Experimental results on TSP speech corpus demonstrate that the proposed speech separation approach can achieve significant improvements over the state-of-the-art methods when tested with different mixing cases.
Kyohei NAKAJIMA Koichi KOBAYASHI Yuh YAMASHITA
Event-triggered control is a control method that the measured signal is sent to the controller only when a certain triggering condition on the measured signal is satisfied. In this paper, we propose a linear quadratic regulator (LQR) with decentralized triggering conditions. First, a suboptimal solution to the design problem of LQRs with decentralized triggering conditions is derived. A state-feedback gain can be obtained by solving a convex optimization problem with LMI (linear matrix inequality) constraints. Next, the relation between centralized and decentralized triggering conditions is discussed. It is shown that control performance of an LQR with decentralized event-triggering is better than that with centralized event-triggering. Finally, a numerical example is illustrated.
Minoru KURIBAYASHI Masakatu MORII
Quick Response (QR) code is a two dimensional barcode widely used in many applications. A standard QR code consists of black and white square modules, and it appears randomized patterns. By modifying the modules using certain rule, it is possible to display a logo image on the QR code. Such a QR code is called an aesthetic QR code. In this paper, we change the encoding method of the Reed-Solomon (RS) code to produce an aesthetic QR code without sacrificing its error correcting capability. The proposed method randomly produces candidates of RS blocks and finds the best one during encoding. Considering an image to be displayed, we also introduce a weighting function during random selection that classifies the visually important regions in the image. We further investigate the shape of modules which represents the image and consider the trade-off between the visual quality and its readability. As a result, we can produce a beautiful aesthetic QR code, which still can be decoded by standard QR code reader.
Wei-Chiun LIU Bin-Da LIU Chia-Ling WEI
A modularized, low-cost, and non-invasive electrochemical examination platform is proposed in this work. Melatonin has been found to be a possible significant indicator molecule in the detection of breast cancer. 3-hydroxyanthranilic acid and nuclear matrix protein 22 can be used as a significant index for potential bladder cancer risks. The proposed system was verified by measuring the melatonin, 3-hydroxyanthranilic acid and nuclear matrix protein 22. Cyclic voltammetry and molecularly imprinted polymers were used in the experiments. Screen-printed electrodes were coated with a film imprinted with target molecules. The measurement results of the proposed system were compared with those of a commercial potentiostat. The two sets of results were very similar. Moreover, the proposed system can be expanded to a four-channel system, which can perform four measurements simultaneously. The proposed system also provides convenient graphical user interface for real-time monitoring and records the information of the redox reactions.
Sun-Mi PARK Ku-Young CHANG Dowon HONG Changho SEO
We propose subquadratic space complexity multipliers for any finite field $mathbb{F}_{q^n}$ over the base field $mathbb{F}_q$ using the Dickson basis, where q is a prime power. It is shown that a field multiplication in $mathbb{F}_{q^n}$ based on the Dickson basis results in computations of Toeplitz matrix vector products (TMVPs). Therefore, an efficient computation of a TMVP yields an efficient multiplier. In order to derive efficient $mathbb{F}_{q^n}$ multipliers, we develop computational schemes for a TMVP over $mathbb{F}_{q}$. As a result, the $mathbb{F}_{2^n}$ multipliers, as special cases of the proposed $mathbb{F}_{q^n}$ multipliers, have lower time complexities as well as space complexities compared with existing results. For example, in the case that n is a power of 3, the proposed $mathbb{F}_{2^n}$ multiplier for an irreducible Dickson trinomial has about 14% reduced space complexity and lower time complexity compared with the best known results.
Peng SONG Shifeng OU Xinran ZHANG Yun JIN Wenming ZHENG Jinglei LIU Yanwei YU
In practice, emotional speech utterances are often collected from different devices or conditions, which will lead to discrepancy between the training and testing data, resulting in sharp decrease of recognition rates. To solve this problem, in this letter, a novel transfer semi-supervised non-negative matrix factorization (TSNMF) method is presented. A semi-supervised negative matrix factorization algorithm, utilizing both labeled source and unlabeled target data, is adopted to learn common feature representations. Meanwhile, the maximum mean discrepancy (MMD) as a similarity measurement is employed to reduce the distance between the feature distributions of two databases. Finally, the TSNMF algorithm, which optimizes the SNMF and MMD functions together, is proposed to obtain robust feature representations across databases. Extensive experiments demonstrate that in comparison to the state-of-the-art approaches, our proposed method can significantly improve the cross-corpus recognition rates.
Yinan LI Xiongwei ZHANG Meng SUN Chong JIA Xia ZOU
Exploring a parsimonious model that is just enough to represent the temporal dependency of time serial signals such as audio or speech is a practical requirement for many signal processing applications. A well suited method for intuitively and efficiently representing magnitude spectra is to use convolutive non-negative matrix factorization (CNMF) to discover the temporal relationship among nearby frames. However, the model order selection problem in CNMF, i.e., the choice of the number of convolutive bases, has seldom been investigated ever. In this paper, we propose a novel Bayesian framework that can automatically learn the optimal model order through maximum a posteriori (MAP) estimation. The proposed method yields a parsimonious and low-rank approximation by removing the redundant bases iteratively. We conducted intuitive experiments to show that the proposed algorithm is very effective in automatically determining the correct model order.
Shunsuke KOSHITA Masahide ABE Masayuki KAWAMATA Takaaki OHNARI Tomoyuki KAWASAKI Shogo MIURA
This letter presents a simple and explicit formulation of non-unique Wiener filters associated with the linear predictor for processing of sinusoids. It was shown in the literature that, if the input signal consists of only sinusoids and does not include a white noise, the input autocorrelation matrix in the Wiener-Hopf equation becomes rank-deficient and thus the Wiener filter is not uniquely determined. In this letter we deal with this rank-deficient problem and present a mathematical description of non-unique Wiener filters in a simple and explicit form. This description is directly obtained from the tap number, the frequency of sinusoid, and the delay parameter. We derive this result by means of the elementary row operations on the augmented matrix given by the Wiener-Hopf equation. We also show that the conventional Wiener filter for noisy input signal is included as a special case of our description.
We study the correlation matrix element properties in array signal processing and apply them to a Direction-Of-Arrival (DOA) estimation problem of coherent or highly-correlated sources for a Uniform Linear Array (ULA). The proposed algorithm is generally based on the relation between the elements of the array correlation matrix and does not need an eigendecomposition, iteration, or angular peak-search. The performance of the proposed method was evaluated through a computer simulation.
Biphase periodic sequences having elements +1 or -1 with the two-level autocorrelation function are desirable in communications and radars. However, in case of the biphase orthogonal periodic sequences, Turyn has conjectured that there exist only sequences with period 4, i.e., there exist the circulant Hadamard matrices for order 4 only. In this paper, it is described that the conjecture is proved to be true by means of the isomorphic mapping, the Chinese remainder theorem, the linear algebra, etc.
Xiao Lei YUAN Lu GAN Hong Shu LIAO
In this letter, a novel robust adaptive beamforming algorithm is addressed to improve the robustness against steering vector random errors (SVREs), which eliminates the signal of interest (SOI) component from the sample covariance matrix (SCM), based on interference-plus-noise covariance matrix (IPNCM) reconstruction over annulus uncertainty sets. Firstly, several annulus uncertainty sets are used to constrain the steering vectors (SVs) of both interferences and the SOI. Additionally the IPNCM is reconstructed according to its definition by estimating each interference SV over its own annulus uncertainty set via the subspace projection algorithm. Meanwhile, the SOI SV is estimated as the prime eigenvector of the SOI covariance matrix term calculated over its own annulus uncertainty set. Finally, a novel robust beamformer is formulated based on the new IPNCM and the SOI SV, and it outperforms other existing reconstruction-based beamformers when the SVREs exist, especially in low input signal-to-noise ratio (SNR) cases, which is proved through the simulation results.
Shengmiao ZHANG Zishu HE Jun LI Huiyong LI Sen ZHONG
A generalized covariance matrix taper (GCMT) model is proposed to enhance the performance of knowledge-aided space-time adaptive processing (KA-STAP) under sea clutter environments. In KA-STAP, improving the accuracy degree of the a priori clutter covariance matrix is a fundamental issue. As a crucial component in the a priori clutter covariance matrix, the taper matrix is employed to describe the internal clutter motion (ICM) or other subspace leakage effects, and commonly constructed by the classical covariance matrix taper (CMT) model. This work extents the CMT model into a generalized CMT (GCMT) model with a greater degree of freedom. Comparing it with the CMT model, the proposed GCMT model is more suitable for sea clutter background applications for its improved flexibility. Simulation results illustrate the efficiency of the GCMT model under different sea clutter environments.
Zongli RUAN Ping WEI Guobing QIAN Hongshu LIAO
The information maximization (Infomax) based on information entropy theory is a class of methods that can be used to blindly separate the sources. Torkkola applied the Infomax criterion to blindly separate the mixtures where the sources have been delayed with respect to each other. Compared to the frequency domain methods, this time domain method has simple adaptation rules and can be easily implemented. However, Torkkola's method works only in the real valued field. In this letter, the Infomax for blind separation of the delayed sources is extended to the complex case for processing of complex valued signals. Firstly, based on the gradient ascent the adaptation rules for the parameters of the unmixing network are derived and the steps of algorithm are given. Then, a measurement matrix is constructed to evaluate the separation performance. The results of computer experiment support the extended algorithm.
Jianhong WANG Pinzheng ZHANG Linmin LUO
Nonnegative component representation (NCR) is a mid-level representation based on nonnegative matrix factorization (NMF). Recently, it has attached much attention and achieved encouraging result for action recognition. In this paper, we propose a novel hierarchical dictionary learning strategy (HDLS) for NMF to improve the performance of NCR. Considering the variability of action classes, HDLS clusters the similar classes into groups and forms a two-layer hierarchical class model. The groups in the first layer are disjoint, while in the second layer, the classes in each group are correlated. HDLS takes account of the differences between two layers and proposes to use different dictionary learning methods for this two layers, including the discriminant class-specific NMF for the first layer and the discriminant joint dictionary NMF for the second layer. The proposed approach is extensively tested on three public datasets and the experimental results demonstrate the effectiveness and superiority of NCR with HDLS for large-scale action recognition.
In this correspondence, a method of constructing optimal zero correlation zone (ZCZ) sequence sets over the 16-QAM+ constellation is presented. Based on 16-QAM orthogonal matrices and perfect ternary sequences, 16-QAM+ ZCZ sequence sets are obtained. The resulting ZCZ sequence sets are optimal with respect to the Tang-Fan-Matsufuji bound. Moreover, methods for transforming binary or quaternary orthogonal matrices into 16-QAM orthogonal matrices are proposed. The proposed 16-QAM+ ZCZ sequence sets can be potentially applied to communication systems using a 16-QAM constellation to remove the multiple access interference (MAI) and multi-path interference (MPI).
Yefang CHEN Zhipeng HUANG Pei CAO Ming JIN Chengtou DU Jiangbo QIAN
Some networks, such as wireless sensor networks, vehicle networks, etc., are often disconnected and thus fail to provide an end-to-end route for transmission. As a result, a new kind self-organized wireless network, i.e., Delay Tolerant Network (DTN) is proposed to transmit messages using a store-carry-forward method. To efficiently process aggregation queries, this paper proposes a subscription aggregation query processing method that combines query processing and transfer protocols. The basic idea is reducing the number of redundant copy transmissions, increasing the message delivery rate and reducing the transmission delay by matrix summation. Theoretical and experimental results show that the method can attain a good performance in the delay tolerant networks.
Isao MIYAGAWA Yukinobu TANIGUCHI
We propose a practical method that acquires dense light transports from unknown 3D objects by employing orthogonal illumination based on a Walsh-Hadamard matrix for relighting computation. We assume the presence of color crosstalk, which represents color mixing between projector pixels and camera pixels, and then describe the light transport matrix by using sets of the orthogonal illumination and the corresponding camera response. Our method handles not only direct reflection light but also global light radiated from the entire environment. Tests of the proposed method using real images show that orthogonal illumination is an effective way of acquiring accurate light transports from various 3D objects. We demonstrate a relighting test based on acquired light transports and confirm that our method outputs excellent relighting images that compare favorably with the actual images observed by the system.
Qian DENG Li GUO Jiaru LIN Zhihui LIU
In this paper, we propose an efficient regularized zero-forcing (RZF) precoding method that has lower hardware resource requirements and produces a shorter delay to the first transmitted symbol compared with truncated polynomial expansion (TPE) that is based on Neumann series in massive multiple-input multiple-output (MIMO) systems. The proposed precoding scheme, named matrix decomposition-polynomial expansion (MDPE), essentially applies a matrix decomposition algorithm based on polynomial expansion to significantly reduce full matrix multiplication computational complexity. Accordingly, it is suitable for real-time hardware implementations and high-mobility scenarios. Furthermore, the proposed method provides a simple expression that links the optimization coefficients to the ratio of BS/UTs antennas (β). This approach can speed-up the convergence to the matrix inverse by a matrix polynomial with small terms and further reduce computation costs. Simulation results show that the MDPE scheme can rapidly approximate the performance of the full precision RZF and optimal TPE algorithm, while adaptively selecting matrix polynomial terms in accordance with the different β and SNR situations. It thereby obtains a high average achievable rate of the UTs under power allocation.
Hui WANG Sabine VAN HUFFEL Guan GUI Qun WAN
This paper studies the problem of recovering an arbitrarily distributed sparse matrix from its one-bit (1-bit) compressive measurements. We propose a matrix sketching based binary method iterative hard thresholding (MSBIHT) algorithm by combining the two dimensional version of BIHT (2DBIHT) and the matrix sketching method, to solve the sparse matrix recovery problem in matrix form. In contrast to traditional one-dimensional BIHT (BIHT), the proposed algorithm can reduce computational complexity. Besides, the MSBIHT can also improve the recovery performance comparing to the 2DBIHT method. A brief theoretical analysis and numerical experiments show the proposed algorithm outperforms traditional ones.