A sparse signal reconstruction perspective for source localization with sensor arrays
By Dmitry M. Malioutov, Müjdat Çetin, Alan S. Willsky. IEEE Transactions on Signal Processing, 2005
2,542 citations recorded by the source corpus.
We present a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold. We enforce sparsity by imposing penalties based on the /spl lscr//sub 1/-norm. A number of recent theoretical results on sparsifying properties of /spl lscr//sub 1/ penalties justify this choice. Explicitly enforcing the sparsity of the representation is motivated by a desire to obtain a sharp estimate of the spatial spectrum that exhibits super-resolution. We propose to use the singular value decomposition (SVD) of the data matrix to summarize multiple time or frequency samples. Our formulation leads to an optimization problem, which we solve efficiently in a second-order cone (SOC) programming framework by an interior point implementation. We propose a grid refinement method to mitigate the effects of limiting estimates to a grid of spatial locations and introduce an automatic selection criterion for the regularization parameter involved in our approach. We demonstrate the effectiveness of the method on simulated data by plots of spatial spectra and by comparing the estimator variance to the Crame/spl acute/r-Rao bound (CRB). We observe that our approach has a number of advantages over other source localization techniques, including increased resolution, improved robustness to noise, limitations in data quantity, and correlation of the sources, as well as not requiring an accurate initialization.
Subfields: Civil and Structural Engineering, Computational Mechanics, Signal Processing
View Paper: https://www.semanticscholar.org/paper/20453d9a4ee9a8e3d762b768cded4ba8ca147bb3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Civil and Structural Engineering
In Computational Mechanics
- Richard Baraniuk
- Marco F. Duarte
- Yonina C. Eldar
- Zhilin Zhang
- Lihua Xie
- Zai Yang
- Bhaskar D. Rao
- José M. Bioucas-Dias
In Signal Processing
Citations in the corpus
- Compressed Sensing Off the Grid (2012, methodology): “In order to apply the theory of compressed sensing to such applications, researchers typically adopt a discretization procedure to reduce the continuous parameter space to a fi nite set of grid points [8]–[16].”
- SPICE: A Sparse Covariance-Based Estimation Method for Array Processing (2011, methodology): “A method for array processing based on (6) was pursued in [3].”
- Estimation of Rapidly Time-Varying Sparse Channels (2007, methodology): “Among the explicit sparse estimation techniques are the -norm regularized method [10], [11], [12] and greedy algorithms such as the”
- A New View of Automatic Relevance Determination (2007, background): “The primary difference is that Step 2 becomes a second-order cone (SOC) optimization problem for which a variety of techniques exist for its minimization [2, 9 ].”
- Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling (2010, methodology): “according to the noise level as in [22], Lasso returns four nonzero entries, two around each source at ; while WSS-TLS gives two nonzero estimates at”
- An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem (2007, methodology): “Such a situation arises in many diverse application domains such as neuroelectromagnetic imaging [18], [24], [36]‐[38], communications [7], [14], signal processing [25], [46], and source localization [ 31 ].”
- Direct Localization for Massive MIMO (2016, methodology): “, achieve super-resolution) [29], [35], [36].”
- Structured Compressed Sensing: From Theory to Applications (2011, background): “Similar ideas were also developed in the context of array processing [21], [103], [104], equalization of sparse communication channels [105], [106], and more recently cognitive radio and multiband communications [9], [86], [107]–[109].”
- Robust Recovery of Signals From a Structured Union of Subspaces (2008, methodology): “Using and was suggested in [29], [43], leading to the iterative algorithm M-FOCUSS.”
- Direction-of-Arrival Estimation Using a Mixed $\ell _{2,0}$ Norm Approximation (2010, background): “Color versions of one or more of the figures in this paper are available online at http://ieeexplore.ieee.org.”
- Sparse Reconstruction by Separable Approximation (2008, methodology): “† A GS-‘2 penalty was proposed for source localization in sensor arrays [ 57 ]; second-order cone programming was used to solve the optimization problem.”
- Integrated Sensing and Communications: Recent Advances and Ten Open Challenges (2023, background): “Another family is constituted by the sparse signal reconstruction frameworks, including on-grid [103], off-grid [104], and gridless [105] algorithms.”
- Sparse Signal Recovery With Temporally Correlated Source Vectors Using Sparse Bayesian Learning (2011, methodology): “This single measurement vector (SMV) model (1) has a wide range of applications, such as electroencephalography (EEG)/magnetoencephalography (MEG) source localization [7], direction-ofarrival (DOA) estimation [8], radar detection [9], and magnetic resonance imaging (MRI) [10].”
- Homotopy continuation for sparse signal representation (2005, background): “Dictionaries of this type arise naturally in many signal processing applications, one example being source localization with sensor arrays, where the observation model for linear arrays involves a discrete Fourier transform (DFT) dictionary [9].”
- The null space property for sparse recovery from multiple measurement vectors (2011, positive): “This author is partly supported by the National Science Foundation under grant DMS-0713807 †yliu@math.uga.edu. localization (cf. [21]), neuromagnetic imaging (cf. [11]), and equalization of sparse communication channels (cf. [12, 14]).”