National University of Defense Technology

About: National University of Defense Technology is a education organization based out in Changsha, China. It is known for research contribution in the topics: Computer science & Radar. The organization has 39430 authors who have published 40181 publications receiving 358979 citations. The organization is also known as: Guófáng Kēxuéjìshù Dàxué & NUDT.

Parallax-Tolerant Image Stitching Based on Robust Elastic Warping

Abstract: Image stitching aims at generating high-quality panoramas with the lowest computational cost. In this paper, we propose a parallax-tolerant image stitching method based on robust elastic warping, which could achieve accurate alignment and efficient processing simultaneously. Given a group of point matches between images, an analytical warping function is constructed to eliminate the parallax errors. Then, the input images are warped according to the computed deformations over the meshed image plane. The seamless panorama is composed by directly reprojecting the warped images. As an important complement to the proposed method, a Bayesian model of feature refinement is proposed to adaptively remove the incorrect local matches. This ensures a more robust alignment than existing approaches. Moreover, our warp is highly compatible with different transformation types. A flexible strategy of combining it with the global similarity transformation is provided as an example. The performance of the proposed approach is demonstrated using several challenging cases.

A Unified Framework and Sparse Bayesian Perspective for Direction-of-Arrival Estimation in the Presence of Array Imperfections

Abstract: Self-calibration methods play an important role in reducing the negative effects of array imperfections during direction-of-arrival (DOA) estimation. However, the dependence of most such methods on the eigenstructure techniques greatly degrades their adaptation to demanding scenarios, such as low signal-to-noise ratio (SNR) and limited snapshots. This paper aims at formulating a unified framework and sparse Bayesian perspective for array calibration and DOA estimation. A comprehensive model of the array output is presented first when a single type of array imperfection is considered, with mutual coupling, gain/phase uncertainty, and sensor location error treated as typical examples. The spatial sparsity of the incident signals is then exploited, and a Bayesian method is proposed to realize array calibration and source DOA estimation. The array perturbation magnitudes are assumed to be small according to most application scenarios, and the geometries of mutually coupled arrays are assumed to be uniform linear and those of arrays with sensor location errors are assumed to be linear. Cramer-Rao lower bounds (CRLBs) for the array calibration and DOA estimation precisions are also obtained. The sparse Bayesian method is finally extended to deal with the DOA estimation problem when more than one type of array perturbation coexists.

Multiple kernel k -means clustering with matrix-induced regularization

Abstract: Multiple kernel k-means (MKKM) clustering aims to optimally combine a group of pre-specified kernels to improve clustering performance. However, we observe that existing MKKM algorithms do not sufficiently consider the correlation among these kernels. This could result in selecting mutually redundant kernels and affect the diversity of information sources utilized for clustering, which finally hurts the clustering performance. To address this issue, this paper proposes an MKKM clustering with a novel, effective matrix-induced regularization to reduce such redundancy and enhance the diversity of the selected kernels. We theoretically justify this matrix-induced regularization by revealing its connection with the commonly used kernel alignment criterion. Furthermore, this justification shows that maximizing the kernel alignment for clustering can be viewed as a special case of our approach and indicates the extendability of the proposed matrix-induced regularization for designing better clustering algorithms. As experimentally demonstrated on five challenging MKL benchmark data sets, our algorithm significantly improves existing MKKM and consistently outperforms the state-of-the-art ones in the literature, verifying the effectiveness and advantages of incorporating the proposed matrix-induced regularization.