Source power estimation for array processing applications under low sample size constraints

Copyright © 2008 IEEE. All Rights Reserved.This paper proposes a new power estimation technique for array processing applications in the low sample size regime. The technique is especially suitable for applications where the direction of arrival (DoA) detection is performed using subspace identification techniques, because the eigenvalues and eigenvectors of the sample covariance matrix are already computed for DoA estimation and are therefore available for power estimation as well. The performance of the algorithm is similar to that of the traditional maximum likelihood (ML) power estimation technique, but it is more robust to the presence of outliers in the direction of arrival (DoA) detection process. This is because, contrary to the ML estimator, the proposed power estimator only depends on the signature of the source of interest.Mestre, X., Johnson, B.A. and Abramovich, Y.I

A Compact Formulation for the ℓ2,1\ell_{2,1} Mixed-Norm Minimization Problem

Parameter estimation from multiple measurement vectors (MMVs) is a fundamental problem in many signal processing applications, e.g., spectral analysis and direction-of- arrival estimation. Recently, this problem has been address using prior information in form of a jointly sparse signal structure. A prominent approach for exploiting joint sparsity considers mixed-norm minimization in which, however, the problem size grows with the number of measurements and the desired resolution, respectively. In this work we derive an equivalent, compact reformulation of the $\ell_{2,1}$ mixed-norm minimization problem which provides new insights on the relation between different existing approaches for jointly sparse signal reconstruction. The reformulation builds upon a compact parameterization, which models the row-norms of the sparse signal representation as parameters of interest, resulting in a significant reduction of the MMV problem size. Given the sparse vector of row-norms, the jointly sparse signal can be computed from the MMVs in closed form. For the special case of uniform linear sampling, we present an extension of the compact formulation for gridless parameter estimation by means of semidefinite programming. Furthermore, we derive in this case from our compact problem formulation the exact equivalence between the $\ell_{2,1}$ mixed-norm minimization and the atomic-norm minimization. Additionally, for the case of irregular sampling or a large number of samples, we present a low complexity, grid-based implementation based on the coordinate descent method

Parametric high resolution techniques for radio astronomical imaging

The increased sensitivity of future radio telescopes will result in requirements for higher dynamic range within the image as well as better resolution and immunity to interference. In this paper we propose a new matrix formulation of the imaging equation in the cases of non co-planar arrays and polarimetric measurements. Then we improve our parametric imaging techniques in terms of resolution and estimation accuracy. This is done by enhancing both the MVDR parametric imaging, introducing alternative dirty images and by introducing better power estimates based on least squares, with positive semi-definite constraints. We also discuss the use of robust Capon beamforming and semi-definite programming for solving the self-calibration problem. Additionally we provide statistical analysis of the bias of the MVDR beamformer for the case of moving array, which serves as a first step in analyzing iterative approaches such as CLEAN and the techniques proposed in this paper. Finally we demonstrate a full deconvolution process based on the parametric imaging techniques and show its improved resolution and sensitivity compared to the CLEAN method.Comment: To appear in IEEE Journal of Selected Topics in Signal Processing, Special issue on Signal Processing for Astronomy and space research. 30 page

Performance Investigation on Scan-On-Receive and Adaptive Digital Beam-Forming for High-Resolution Wide-Swath Synthetic Aperture Radar

The work investigates the performance of the Smart Multi-Aperture Radar Technique (SMART) Synthetic Aperture Radar (SAR) system for high-resolution wide-swath imaging based on Scan-on-Receive (SCORE) algorithm for receive beam steering. SCORE algorithm works under model mismatch conditions in presence of topographic height. A study on the potentiality of an adaptive approach for receive beam steering based on spatial spectral estimation is presented. The impact of topographic height on SCORE performance in different operational scenarios is examined, with reference to a realistic SAR system. The SCORE performance is compared to that of the adaptive approach by using the Cramèr Rao lower bound analysis

A Low-Cost Robust Distributed Linearly Constrained Beamformer for Wireless Acoustic Sensor Networks with Arbitrary Topology

We propose a new robust distributed linearly constrained beamformer which utilizes a set of linear equality constraints to reduce the cross power spectral density matrix to a block-diagonal form. The proposed beamformer has a convenient objective function for use in arbitrary distributed network topologies while having identical performance to a centralized implementation. Moreover, the new optimization problem is robust to relative acoustic transfer function (RATF) estimation errors and to target activity detection (TAD) errors. Two variants of the proposed beamformer are presented and evaluated in the context of multi-microphone speech enhancement in a wireless acoustic sensor network, and are compared with other state-of-the-art distributed beamformers in terms of communication costs and robustness to RATF estimation errors and TAD errors

Tensor Decompositions for Signal Processing Applications From Two-way to Multiway Component Analysis

The widespread use of multi-sensor technology and the emergence of big datasets has highlighted the limitations of standard flat-view matrix models and the necessity to move towards more versatile data analysis tools. We show that higher-order tensors (i.e., multiway arrays) enable such a fundamental paradigm shift towards models that are essentially polynomial and whose uniqueness, unlike the matrix methods, is guaranteed under verymild and natural conditions. Benefiting fromthe power ofmultilinear algebra as theirmathematical backbone, data analysis techniques using tensor decompositions are shown to have great flexibility in the choice of constraints that match data properties, and to find more general latent components in the data than matrix-based methods. A comprehensive introduction to tensor decompositions is provided from a signal processing perspective, starting from the algebraic foundations, via basic Canonical Polyadic and Tucker models, through to advanced cause-effect and multi-view data analysis schemes. We show that tensor decompositions enable natural generalizations of some commonly used signal processing paradigms, such as canonical correlation and subspace techniques, signal separation, linear regression, feature extraction and classification. We also cover computational aspects, and point out how ideas from compressed sensing and scientific computing may be used for addressing the otherwise unmanageable storage and manipulation problems associated with big datasets. The concepts are supported by illustrative real world case studies illuminating the benefits of the tensor framework, as efficient and promising tools for modern signal processing, data analysis and machine learning applications; these benefits also extend to vector/matrix data through tensorization. Keywords: ICA, NMF, CPD, Tucker decomposition, HOSVD, tensor networks, Tensor Train

Accurate angle-of-arrival measurement using particle swarm optimization

As one of the major methods for location positioning, angle-of-arrival (AOA) estimation is a significant technology in radar, sonar, radio astronomy, and mobile communications. AOA measurements can be exploited to locate mobile units, enhance communication efficiency and network capacity, and support location-aided routing, dynamic network management, and many location-based services. In this paper, we propose an algorithm for AOA estimation in colored noise fields and harsh application scenarios. By modeling the unknown noise covariance as a linear combination of known weighting matrices, a maximum likelihood (ML) criterion is established, and a particle swarm optimization (PSO) paradigm is designed to optimize the cost function. Simulation results demonstrate that the paired estimator PSO-ML significantly outperforms other popular techniques and produces superior AOA estimates