Sensor array calibration via tracking with the extended Kalman filter

Starting with a randomly distributed sensor array with unknown sensor orientations, array calibration is needed before target localization and tracking can be performed using classical triangulation methods. In this paper, we assume that the sensors are only capable of accurate direction of arrival (DOA) estimation. The calibration problem cannot be completely solved given the DOA estimates alone, since the problem is not only rotationally symmetric but also includes a range ambiguity. Our approach to calibration is based on tracking a single target moving at a constant velocity. In this case, the sensor array can be calibrated from target tracks generated by an extended Kalman filter (EKF) at each sensor. A simple algorithm based on geometrical matching of similar triangles will align the separate tracks and determine the sensor positions and orientations relative to a reference sensor. Computer simulations show that the algorithm performs well even with noisy DOA estimates at the sensors

Sensor array signal processing : two decades later

Caption title.Includes bibliographical references (p. 55-65).Supported by Army Research Office. DAAL03-92-G-115 Supported by the Air Force Office of Scientific Research. F49620-92-J-2002 Supported by the National Science Foundation. MIP-9015281 Supported by the ONR. N00014-91-J-1967 Supported by the AFOSR. F49620-93-1-0102Hamid Krim, Mats Viberg

Dynamic Algorithms and Asymptotic Theory for Lp-norm Data Analysis

The focus of this dissertation is the development of outlier-resistant stochastic algorithms for Principal Component Analysis (PCA) and the derivation of novel asymptotic theory for Lp-norm Principal Component Analysis (Lp-PCA). Modern machine learning and signal processing applications employ sensors that collect large volumes of data measurements that are stored in the form of data matrices, that are often massive and need to be efficiently processed in order to enable machine learning algorithms to perform effective underlying pattern discovery. One such commonly used matrix analysis technique is PCA. Over the past century, PCA has been extensively used in areas such as machine learning, deep learning, pattern recognition, and computer vision, just to name a few. PCA\u27s popularity can be attributed to its intuitive formulation on the L2-norm, availability of an elegant solution via the singular-value-decomposition (SVD), and asymptotic convergence guarantees. However, PCA has been shown to be highly sensitive to faulty measurements (outliers) because of its reliance on the outlier-sensitive L2-norm. Arguably, the most straightforward approach to impart robustness against outliers is to replace the outlier-sensitive L2-norm by the outlier-resistant L1-norm, thus formulating what is known as L1-PCA. Exact and approximate solvers are proposed for L1-PCA in the literature. On the other hand, in this big-data era, the data matrix may be very large and/or the data measurements may arrive in streaming fashion. Traditional L1-PCA algorithms are not suitable in this setting. In order to efficiently process streaming data, while being resistant against outliers, we propose a stochastic L1-PCA algorithm that computes the dominant principal component (PC) with formal convergence guarantees. We further generalize our stochastic L1-PCA algorithm to find multiple components by propose a new PCA framework that maximizes the recently proposed Barron loss. Leveraging Barron loss yields a stochastic algorithm with a tunable robustness parameter that allows the user to control the amount of outlier-resistance required in a given application. We demonstrate the efficacy and robustness of our stochastic algorithms on synthetic and real-world datasets. Our experimental studies include online subspace estimation, classification, video surveillance, and image conditioning, among other things. Last, we focus on the development of asymptotic theory for Lp-PCA. In general, Lp-PCA for p\u3c2 has shown to outperform PCA in the presence of outliers owing to its outlier resistance. However, unlike PCA, Lp-PCA is perceived as a ``robust heuristic\u27\u27 by the research community due to the lack of theoretical asymptotic convergence guarantees. In this work, we strive to shed light on the topic by developing asymptotic theory for Lp-PCA. Specifically, we show that, for a broad class of data distributions, the Lp-PCs span the same subspace as the standard PCs asymptotically and moreover, we prove that the Lp-PCs are specific rotated versions of the PCs. Finally, we demonstrate the asymptotic equivalence of PCA and Lp-PCA with a wide variety of experimental studies

Design and analysis of adaptive noise subspace estimation algorithms

Ph.DDOCTOR OF PHILOSOPH

Tensor-based tracking schemes for time-delay estimation in GNSS multi-antenna receivers

Trabalho de Conclusão de Curso (graduação)—Universidade de Brasília, Faculdade de Tecnologia, Departamento de Engenharia Elétrica, 2017.Embora os receptores GNSS (Global Navigation Satellite Systems) alcancem atualmente alta precisão ao processar sua localização geográfica sob condições de Linha de Visão (Line of Sight), erros devido a interferência por componentes multipercurso e ruído são as fontes mais degradantes desse sistema. A fim de resolver a interferência multipercurso, receptores baseados em múltiplas antenas tornaram-se o foco de pesquisa e desenvolvimento tecnológico devido ao fato de que podem mitigar a ocorrência de multipercurso fornecendo as melhores estimativas para o atraso do sinal transmitido, que é um parâmetro relevante para determinar a geolocalização do usuário. Neste contexto, abordagens tensoriais baseadas em modelos PARAFAC (PArallel FActor Analysis) têm sido propostas na literatura, proporcionando um ótimo desempenho. Como essas técnicas são baseadas em subespaços, considerando um cenário de rastreamento em tempo real, o cálculo de uma EVD (Eigenvalue Decomposition)/SVD (Singular Value Decomposition) completa para estimativa de subespaço de sinal em cada instante de amostragem não é adequado, devido a razões de complexidade. Portanto, uma alternativa para reduzir o tempo de computação (Time of Computing) de estimativas de subespacos tem sido o desenvolvimento de algoritmos de rastreamento de subespaço. Este trabalho propõe o emprego de dois esquemas de rastreamento de subespaços para fornecer uma redução no desempenho computacional geral das técnicas de estimativa de atraso de tempo baseadas em tensores.Although Global Navigation Satellite Systems (GNSS) receivers nowadays achieve high accuracy when processing their geographic location under conditions of Line of Sight (LOS), errors due to interference by multipath and noise are the most degrading sources of accuracy. In order to solve the multipath interference, receivers based on multiple antennas have become the focus of technological research and development due to the fact they can mitigate multipath occurrence providing best estimates to the transmitted signal time-delay, which is a relevant parameter for determining the user’s geolocation. In this context, tensor-based approaches based on PArallel FActor Analysis (PARAFAC) models have been proposed in the literature, providing optimal performance. As these techniques are subspace-based, considering a real-time tracking scenario, the computation of a full Eigenvalue Decomposition (EVD)/Singular Value Decomposition (SVD) for signal subspace estimation at every sampling instant is not suitable, due to complexity reasons. Therefore, an alternative to reduce the Time of Computing (ToC) of subspace estimations has been the development of subspace tracking algorithms. This work proposes the employment of two subspace tracking schemes to provide a reduction in the overall computational performance of tensor-based time-delay estimation techniques

Spatio-Temporal processing for Optimum Uplink-Downlink WCDMA Systems

The capacity of a cellular system is limited by two different phenomena, namely multipath fading and multiple access interference (MAl). A Two Dimensional (2-D) receiver combats both of these by processing the signal both in the spatial and temporal domain. An ideal 2-D receiver would perform joint space-time processing, but at the price of high computational complexity. In this research we investigate computationally simpler technique termed as a Beamfom1er-Rake. In a Beamformer-Rake, the output of a beamfom1er is fed into a succeeding temporal processor to take advantage of both the beamformer and Rake receiver. Wireless service providers throughout the world are working to introduce the third generation (3G) and beyond (3G) cellular service that will provide higher data rates and better spectral efficiency. Wideband COMA (WCDMA) has been widely accepted as one of the air interfaces for 3G. A Beamformer-Rake receiver can be an effective solution to provide the receivers enhanced capabilities needed to achieve the required performance of a WCDMA system. We consider three different Pilot Symbol Assisted (PSA) beamforming techniques, Direct Matrix Inversion (DMI), Least-Mean Square (LMS) and Recursive Least Square (RLS) adaptive algorithms. Geometrically Based Single Bounce (GBSB) statistical Circular channel model is considered, which is more suitable for array processing, and conductive to RAKE combining. The performances of the Beam former-Rake receiver are evaluated in this channel model as a function of the number of antenna elements and RAKE fingers, in which are evaluated for the uplink WCDMA system. It is shown that, the Beamformer-Rake receiver outperforms the conventional RAKE receiver and the conventional beamformer by a significant margin. Also, we optimize and develop a mathematical formulation for the output Signal to Interference plus Noise Ratio (SINR) of a Beam former-Rake receiver. In this research, also, we develop, simulate and evaluate the SINR and Signal to Noise Ratio (Et!Nol performances of an adaptive beamforming technique in the WCDMA system for downlink. The performance is then compared with an omnidirectional antenna system. Simulation shows that the best perfom1ance can be achieved when all the mobiles with same Angle-of-Arrival (AOA) and different distance from base station are formed in one beam