SPICE: A Sparse Covariance-Based Estimation Method for Array Processing
Top Cited Papers
- 1 November 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 59 (2) , 629-638
- https://doi.org/10.1109/tsp.2010.2090525
Abstract
This paper presents a novel SParse Iterative Covariance-based Estimation approach, abbreviated as SPICE, to array processing. The proposed approach is obtained by the minimization of a covariance matrix fitting criterion and is particularly useful in many-snapshot cases but can be used even in single-snapshot situations. SPICE has several unique features not shared by other sparse estimation methods: it has a simple and sound statistical foundation, it takes account of the noise in the data in a natural manner, it does not require the user to make any difficult selection of hyperparameters, and yet it has global convergence properties.Keywords
This publication has 9 references indexed in Scilit:
- New Method of Sparse Parameter Estimation in Separable Models and Its Use for Spectral Analysis of Irregularly Sampled DataIEEE Transactions on Signal Processing, 2010
- Monotonic convergence of a general algorithm for computing optimal designsThe Annals of Statistics, 2010
- Optimally Tuned Iterative Reconstruction Algorithms for Compressed SensingIEEE Journal of Selected Topics in Signal Processing, 2010
- Source Localization and Sensing: A Nonparametric Iterative Adaptive Approach Based on Weighted Least SquaresIEEE Transactions on Aerospace and Electronic Systems, 2010
- A sparse signal reconstruction perspective for source localization with sensor arraysIEEE Transactions on Signal Processing, 2005
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Applications of second-order cone programmingLinear Algebra and its Applications, 1998
- Covariance Matching Estimation Techniques for Array Signal Processing ApplicationsDigital Signal Processing, 1998
- Interior-Point Polynomial Algorithms in Convex ProgrammingPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994