The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Rank Awareness in Joint Sparse Recovery
Open accessAbstract
This paper revisits the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurements. This problem is an extension of single channel sparse recovery, which lies at the heart of compressed sensing. Inspired by the links to array signal processing, a new family of MMV algorithms is considered that highlight the role of rank in determining the difficulty of the MMV recovery problem. The simplest such method is a discrete version of MUSIC which is guaranteed to recover the sparse vectors in the full rank MMV setting, under mild conditions. This idea is extended to a rank aware pursuit algorithm that naturally reduces to Order Recursive Matching Pursuit (ORMP) in the single measurement case while also providing guaranteed recovery in the full rank setting. In contrast, popular MMV methods such as Simultaneous Orthogonal Matching Pursuit (SOMP) and mixed norm minimization techniques are shown to be rank blind in terms of worst case analysis. Numerical simulations demonstrate that the rank aware techniques are significantly better than existing methods in dealing with multiple measurements.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Multiple emitter location and signal parameter estimation
Schmidt, R. (1986) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1986.1143830 · Cited by 14,718
ESPRIT-estimation of signal parameters via rotational invariance techniques
Roy, R., & Kailath, T. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.32276 · Cited by 7,289
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory
Van Trees, H. L. (2002) · Wiley eBooks · doi:10.1002/0471221104 · Cited by 5,188
Two decades of array signal processing research: the parametric approach
Krim, H., & Viberg, M. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.526899 · Cited by 4,719
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Davidson, G. W., & Crase, D. (1989) · Death Studies · doi:10.1080/07481188908252281 · Cited by 2,848
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Iterative hard thresholding for compressed sensing
Blumensath, T., & Davies, M. E. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.04.002 · Cited by 2,275
Self-citationArray Signal Processing: Concepts and Techniques
Johnson, D. H., & Dudgeon, D. E. (1993) · Medical Entomology and Zoology · Cited by 1,940
Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
Gorodnitsky, I. F., & Rao, B. D. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558475 · Cited by 1,834
Orthogonal least squares methods and their application to non-linear system identification
Chen, S., Billings, S. A., & Luo, W. (1989) · International Journal of Control · doi:10.1080/00207178908953472 · Cited by 1,540
Sparse solutions to linear inverse problems with multiple measurement vectors
Cotter, S. F., Rao, B. D., Engan, K., & Kreutz-Delgado, K. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.849172 · Cited by 1,393
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
Tropp, J. A., Gilbert, A. C., & Strauss, M. J. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.030 · Cited by 1,347
Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
Eldar, Y. C., Kuppinger, P., & Bolcskei, H. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2044837 · Cited by 1,313
Self-citationModel-Based Compressive Sensing
Baraniuk, R. G., Cevher, V., Duarte, M. F., & Hegde, C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2040894 · Cited by 1,308
Iterative Thresholding for Sparse Approximations
Blumensath, T., & Davies, M. E. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9035-z · Cited by 1,248
Self-citationFrom Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals
Mishali, M., & Eldar, Y. C. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042414 · Cited by 1,168
Self-citationAdaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Robust Recovery of Signals From a Structured Union of Subspaces
Eldar, Y. C., & Mishali, M. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030471 · Cited by 1,044
Self-citationCompressed sensing and best 𝑘-term approximation
Cohen, A., Dahmen, W., & DeVore, R. (2008) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-08-00610-3 · Cited by 1,002
Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
Mishali, M., & Eldar, Y. C. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2012791 · Cited by 819
Self-citationTheoretical Results on Sparse Representations of Multiple-Measurement Vectors
Chen, J., & Huo, X. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881263 · Cited by 810
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
Tropp, J. A. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.031 · Cited by 691
Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
Stewart, G. W. (1973) · SIAM Review · doi:10.1137/1015095 · Cited by 573
Normalized Iterative Hard Thresholding: Guaranteed Stability and Performance
Blumensath, T., & Davies, M. E. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042411 · Cited by 485
Self-citationXampling: analog to digital at sub-Nyquist rates
Mishali, M., Eldar, Y. C., Dounaevsky, O., & Shoshan, E. (2011) · IET Circuits, Devices & Systems · doi:10.1049/iet-cds.2010.0147 · Cited by 427
Self-citationSource localization using recursively applied and projected (RAP) MUSIC
Mosher, J. C., & Leahy, R. M. (1999) · IEEE Transactions on Signal Processing · doi:10.1109/78.740118 · Cited by 398
Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
Eldar, Y. C., & Rauhut, H. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034789 · Cited by 356
Self-citationALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATIONPreprint
Tropp, J. A. (2006) · Cited by 350
Distributed Compressive Sensing
Baron, D., Duarte, M. F., Wakin, M. B., Sarvotham, S., & Baraniuk, R. G. (2009) · doi:10.21236/ada521228 · Cited by 346
A Theory for Sampling Signals From a Union of Subspaces
Lu, Y. M., & Do, M. N. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914346 · Cited by 286
Spectrum-blind minimum-rate sampling and reconstruction of multiband signals
Feng, P., & Bresler, Y. (2002) · 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings · doi:10.1109/icassp.1996.544131 · Cited by 273
Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
Blumensath, T., & Davies, M. E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2013003 · Cited by 269
Self-citationTheoretical and Empirical Results for Recovery From Multiple Measurements
van den Berg, E., & Friedlander, M. P. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043876 · Cited by 264
Compressive MUSIC: Revisiting the Link Between Compressive Sensing and Array Signal Processing
Kim, J. M., Lee, O. K., & Ye, J. C. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2171529 · Cited by 253
Gribonval, R., Rauhut, H., Schnass, K., & Vandergheynst, P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9044-y · Cited by 234
Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
Fornasier, M., & Rauhut, H. (2008) · SIAM Journal on Numerical Analysis · doi:10.1137/0606668909 · Cited by 233
Gleichman, S., & Eldar, Y. C. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165821 · Cited by 216
Self-citationCompressed Sensing of Analog Signals in Shift-Invariant Spaces
Eldar, Y. C. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2020750 · Cited by 166
Self-citationOn the Difference Between Orthogonal Matching Pursuit and Orthogonal Least Squares
Blumensath, T., & Davies, M. E. (2007) · ePrints Soton (University of Southampton) · Cited by 93
Self-citationStoica, P., Händel, P., & Nehorai, A. (1995) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.464347 · Cited by 44
Oh, S. K., & Un, C. K. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.1993.193178 · Cited by 37
Lutoborski, A., & Temlyakov, V. N. (2003) · Journal of Complexity · doi:10.1016/s0885-064x(03)00026-8 · Cited by 30
Compressive MUSIC: A Missing Link Between Compressive Sensing and Array Signal ProcessingPreprint
Kim, J., Lee, O. K., & Ye, J. C. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1004.4398 · Cited by 22
Cited by
Structured Compressed Sensing: From Theory to Applications
Duarte, M. F., & Eldar, Y. C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161982 · Cited by 1,128
Self-citationPosition and Orientation Estimation Through Millimeter-Wave MIMO in 5G Systems
Shahmansoori, A., Garcia, G. E., Destino, G., Seco-Granados, G., & Wymeersch, H. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2785788 · Cited by 536
An Overview of Low-Rank Matrix Recovery From Incomplete Observations
Davenport, M. A., & Romberg, J. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2539100 · Cited by 439
Xampling: analog to digital at sub-Nyquist rates
Mishali, M., Eldar, Y. C., Dounaevsky, O., & Shoshan, E. (2011) · IET Circuits, Devices & Systems · doi:10.1049/iet-cds.2010.0147 · Cited by 427
Self-citationSparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Metadata
- Authors
- Davies, M. E., & Eldar, Y. C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2012-02
- Volume
- 58
- Issue
- 2
- Pages
- 1135-1146
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1770500012
- Cited by
- 351
- References
- 51
- FWCI
- 29.55
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.