A new adaptive Kalman filter-based subspace tracking algorithm and its application to DOA estimation

IEEE International Symposium on Circuits and Systems, Island of Kos, Greece, 21-24 May 2006This paper presents a new Kalman filter-based subspace tracking algorithm and its application to directions of arrival (DOA) estimation. An autoregressive (AR) process is used to describe the dynamics of the subspace and a new adaptive Kalman filter with variable measurements (KFYM) algorithm is developed to estimate the time-varying subspace recursively from the state-space model and the given observations. For stationary subspace, the proposed algorithm will switch to the conventional PAST to lower the computational complexity. Simulation results show that the adaptive subspace tracking method has a better performance than conventional algorithms in DOA estimation for a wide variety of experimental condition. © 2006 IEEE.published_or_final_versio

A new robust Kalman filter-based subspace tracking algorithm in an impulsive noise environment

The conventional projection approximation subspace tracking (PAST) algorithm is based on the recursive least-squares algorithm, and its performance will degrade considerably when the subspace rapidly changes and the additive noise is impulsive. This brief proposes a new robust Kalman filter-based subspace tracking algorithm to overcome these two limitations of the PAST algorithm. It is based on a new extension of the adaptive Kalman filter with variable number of measurements (KFVNM) for tracking fast-varying subspace. Furthermore, M-estimation is incorporated into this KFVNM algorithm to combat the adverse effects of impulsive noise. Simulation results show that the robust KFVNM-based subspace tracking algorithm has a better performance than the PAST algorithm for tracking fast-varying subspace and in an impulsive noise environment. © 2010 IEEE.published_or_final_versio

DOA estimation and tracking of ULAs with mutual coupling

A class of subspace-based methods for direction-of-arrival (DOA) estimation and tracking in the case of uniform linear arrays (ULAs) with mutual coupling is proposed. By treating the angularly-independent mutual coupling as angularly-dependent complex array gains, the middle subarray is found to have the same complex array gains. Using this property, a new way for parameterizing the steering vector is proposed and the corresponding method for joint estimation of DOAs and mutual coupling matrix (MCM) using the whole array data is derived based on subspace principle. Simulation results show that the proposed algorithm has a better performance than the conventional subarray-based method especially for weak signals. Furthermore, to achieve low computational complexity for online and time-varying DOA estimation, three subspace tracking algorithms with different arithmetic complexities and tracking abilities are developed. More precisely, by introducing a better estimate of the subspace to the conventional tracking algorithms, two modified methods, namely modified projection approximate subspace tracking (PAST) (MPAST) and modified orthonormal PAST (MOPAST), are developed for slowly changing subspace, whereas a Kalman filter with a variable number of measurements (KFVM) method for rapidly changing subspace is introduced. Simulation results demonstrate that these algorithms offer high flexibility and effectiveness for tracking DOAs in the presence of mutual coupling. © 2006 IEEE.published_or_final_versio

Localization and tracking of electronic devices with their unintended emissions

The precise localization and tracking of electronic devices via their unintended emissions has a broad range of commercial and security applications. Active stimulation of the receivers of such devices with a known signal generates very low power unintended emissions. This dissertation presents localization and tracking of multiple devices using both simulation and experimental data in the form of five papers. First the localization of multiple emitting devices through active stimulation under multipath fading with a Smooth MUSIC based scheme in the near field region is presented. Spatial smoothing helps to separate the correlated sources and the multipath fading and results confirm improved accuracy. A cost effective near-field localization method is proposed next to locate multiple correlated unintended emitting devices under colored noise conditions using two well separated antenna arrays since colored noise in the environment degrades the subspace-based localization techniques. Subsequently, in order to track moving sources, a near-field scheme by using array output is introduced to monitor direction of arrival (DOA) and the distance between the antenna array and the moving source. The array output, which is a nonlinear function of DOA and distance information, is employed in the Extended Kalman Filter (EKF). In order to show the near- and far-field effect on estimation accuracy, computer simulation results are included for localization and tracking techniques. Finally, an L-shaped array is constructed and a suite of schemes are introduced for localization and tracking of such devices in the three-dimensional environment. Experimental results for localization and tracking of unintended emissions from single and multiple devices in the near-field environment of an antenna array are demonstrated --Abstract, page iv

Robust and Efficient Inference of Scene and Object Motion in Multi-Camera Systems

Multi-camera systems have the ability to overcome some of the fundamental limitations of single camera based systems. Having multiple view points of a scene goes a long way in limiting the influence of field of view, occlusion, blur and poor resolution of an individual camera. This dissertation addresses robust and efficient inference of object motion and scene in multi-camera and multi-sensor systems. The first part of the dissertation discusses the role of constraints introduced by projective imaging towards robust inference of multi-camera/sensor based object motion. We discuss the role of the homography and epipolar constraints for fusing object motion perceived by individual cameras. For planar scenes, the homography constraints provide a natural mechanism for data association. For scenes that are not planar, the epipolar constraint provides a weaker multi-view relationship. We use the epipolar constraint for tracking in multi-camera and multi-sensor networks. In particular, we show that the epipolar constraint reduces the dimensionality of the state space of the problem by introducing a ``shared'' state space for the joint tracking problem. This allows for robust tracking even when one of the sensors fail due to poor SNR or occlusion. The second part of the dissertation deals with challenges in the computational aspects of tracking algorithms that are common to such systems. Much of the inference in the multi-camera and multi-sensor networks deal with complex non-linear models corrupted with non-Gaussian noise. Particle filters provide approximate Bayesian inference in such settings. We analyze the computational drawbacks of traditional particle filtering algorithms, and present a method for implementing the particle filter using the Independent Metropolis Hastings sampler, that is highly amenable to pipelined implementations and parallelization. We analyze the implementations of the proposed algorithm, and in particular concentrate on implementations that have minimum processing times. The last part of the dissertation deals with the efficient sensing paradigm of compressing sensing (CS) applied to signals in imaging, such as natural images and reflectance fields. We propose a hybrid signal model on the assumption that most real-world signals exhibit subspace compressibility as well as sparse representations. We show that several real-world visual signals such as images, reflectance fields, videos etc., are better approximated by this hybrid of two models. We derive optimal hybrid linear projections of the signal and show that theoretical guarantees and algorithms designed for CS can be easily extended to hybrid subspace-compressive sensing. Such methods reduce the amount of information sensed by a camera, and help in reducing the so called data deluge problem in large multi-camera systems

Acoustic Speaker Localization with Strong Reverberation and Adaptive Feature Filtering with a Bayes RFS Framework

The thesis investigates the challenges of speaker localization in presence of strong reverberation, multi-speaker tracking, and multi-feature multi-speaker state filtering, using sound recordings from microphones. Novel reverberation-robust speaker localization algorithms are derived from the signal and room acoustics models. A multi-speaker tracking filter and a multi-feature multi-speaker state filter are developed based upon the generalized labeled multi-Bernoulli random finite set framework. Experiments and comparative studies have verified and demonstrated the benefits of the proposed methods

Angular CMA: A modified Constant Modulus Algorithm providing steering angle updates

Conventional blind beamforming algorithms have no direct notion of the physical Direction of Arrival angle of an impinging signal. These blind adaptive algorithms operate by adjusting the complex steering vector in the case of changing signal conditions and directions. This paper presents Angular CMA, a blind beamforming method that calculates steering angle updates (instead of weight vector updates) to keep track of the desired signal. Angular CMA and its respective steering angle updates are particularly useful in the context of mixed-signal hierarchical arrays as means to find and distribute steering parameters. Simulations of Angular CMA show promising convergence behaviour, while having a lower complexity than alternative methods (e.g., MUSIC)

Robust Subspace Tracking Algorithms in Signal Processing: A Brief Survey

Principal component analysis (PCA) and subspace estimation (SE) are popular data analysis tools and used in a wide range of applications. The main interest in PCA/SE is for dimensionality reduction and low-rank approximation purposes. The emergence of big data streams have led to several essential issues for performing PCA/SE. Among them are (i) the size of such data streams increases over time, (ii) the underlying models may be time-dependent, and (iii) problem of dealing with the uncertainty and incompleteness in data. A robust variant of PCA/SE for such data streams, namely robust online PCA or robust subspace tracking (RST), has been introduced as a good alternative. The main goal of this paper is to provide a brief survey on recent RST algorithms in signal processing. Particularly, we begin this survey by introducing the basic ideas of the RST problem. Then, different aspects of RST are reviewed with respect to different kinds of non-Gaussian noises and sparse constraints. Our own contributions on this topic are also highlighted