The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Sparse solutions to linear inverse problems with multiple measurement vectors
Abstract
We address the problem of finding sparse solutions to an underdetermined system of equations when there are multiple measurement vectors having the same, but unknown, sparsity structure. The single measurement sparse solution problem has been extensively studied in the past. Although known to be NP-hard, many single-measurement suboptimal algorithms have been formulated that have found utility in many different applications. Here, we consider in depth the extension of two classes of algorithms-Matching Pursuit (MP) and FOCal Underdetermined System Solver (FOCUSS)-to the multiple measurement case so that they may be used in applications such as neuromagnetic imaging, where multiple measurement vectors are available, and solutions with a common sparsity structure must be computed. Cost functions appropriate to the multiple measurement problem are developed, and algorithms are derived based on their minimization. A simulation study is conducted on a test-case dictionary to show how the utilization of more than one measurement vector improves the performance of the MP and FOCUSS classes of algorithm, and their performances are compared.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
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
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694 · cited 1×
“It has also been argued that overcomplete representations and basis selection have a role in the coding of sensory information in biological systems [13], [14].”
BackgroundLinear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Pati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (2002) · Proceedings of 27th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.1993.342465 · Cited by 4,323
Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
Hansen, P. C. (1992) · SIAM Review · doi:10.1137/1034115 · Cited by 3,903
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
The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
Hansen, P. C., & O’Leary, D. P. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914086 · Cited by 3,137
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
Cited by
Spatially Sparse Precoding in Millimeter Wave MIMO Systems
Ayach, O. E., Rajagopal, S., Abu-Surra, S., Pi, Z., & Heath, R. W. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.011714.130846 · Cited by 3,557
Online Learning for Matrix Factorization and Sparse Coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0050 · Cited by 2,258
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
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
From 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
Hyperspectral Image Classification Using Dictionary-Based Sparse Representation
Chen, Y., Nasrabadi, N. M., & Tran, T. D. (2011) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2011.2129595 · Cited by 1,155
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
Spectrum Sensing for Cognitive Radio : State-of-the-Art and Recent Advances
Axell, E., Leus, G., Larsson, E. G., & Poor, H. V. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2183771 · Cited by 1,116
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
Zhu, W., Lan, C., Xing, J., Zeng, W., Li, Y., Shen, L., & Xie, X. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10451 · Cited by 915
An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
Wipf, D. P., & Rao, B. D. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.894265 · Cited by 911
Self-citationSparse Signal Recovery With Temporally Correlated Source Vectors Using Sparse Bayesian Learning
Zhang, Z., & Rao, B. D. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2159773 · Cited by 868
Self-citationDictionary Learning Algorithms for Sparse Representation
Kreutz-Delgado, K., Murray, J. F., Rao, B. D., Engan, K., Lee, T.-W., & Sejnowski, T. J. (2003) · Neural Computation · doi:10.1162/089976603762552951 · Cited by 838
Self-citationBlind 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
Spectrum Sensing for Cognitive Radio
Haykin, S., Thomson, D. J., & Reed, J. H. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2015711 · Cited by 812
Theoretical 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
Zhang, Z., Pi, Z., & Liu, B. (2015) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2014.2359372 · Cited by 748
Yardibi, T., Li, J., Stoica, P., Xue, M., & Baggeroer, A. B. (2010) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2010.5417172 · Cited by 699
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
Nonlocal Image Restoration With Bilateral Variance Estimation: A Low-Rank Approach
Dong, W., Shi, G., & Li, X. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2221729 · Cited by 655
Extension of SBL Algorithms for the Recovery of Block Sparse Signals With Intra-Block Correlation
Zhang, Z., & Rao, B. D. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2241055 · Cited by 558
Self-citationJi, S., Dunson, D., & Carin, L. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2005866 · Cited by 502
Accelerating SENSE using compressed sensing
Liang, D., Liu, B., Wang, J., & Ying, L. (2009) · Magnetic Resonance in Medicine · doi:10.1002/mrm.22161 · Cited by 474
Robust PCA via Outlier Pursuit
Xu, H., Caramanis, C., & Sanghavi, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173156 · Cited by 445
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
Modern regularization methods for inverse problems
Benning, M., & Burger, M. (2018) · Acta Numerica · doi:10.1017/s0962492918000016 · Cited by 412
Zhang, Z. (2015) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2015.2406332 · Cited by 388
“This paper adopts the regularized M-FOCUSS algorithm [13] because it has fast speed and reliable performance even if Φ is highly coherent.”
BackgroundMethodInfluentialAverage 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
Compressed Sensing for Wireless Communications: Useful Tips and Tricks
Choi, J. W., Shim, B., Ding, Y., Rao, B., & Kim, D. I. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2664421 · Cited by 351
Self-citationRank Awareness in Joint Sparse Recovery
Davies, M. E., & Eldar, Y. C. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173722 · Cited by 351
A unified Bayesian framework for MEG/EEG source imaging
Wipf, D., & Nagarajan, S. (2009) · NeuroImage · doi:10.1016/j.neuroimage.2008.02.059 · 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
Sparse 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
Xenaki, A., Gerstoft, P., & Mosegaard, K. (2014) · The Journal of the Acoustical Society of America · doi:10.1121/1.4883360 · Cited by 326
Direction-of-Arrival Estimation Using a Mixed $\ell _{2,0}$ Norm Approximation
Hyder, M. M., & Mahata, K. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2050477 · Cited by 325
Distributed Compressed Sensing
Coluccia, G., Ravazzi, C., & Magli, E. (2015) · SpringerBriefs in Electrical and Computer Engineering · doi:10.1007/978-981-287-390-3_2 · Cited by 323
Deep learning in ultrasound imaging
van Sloun, R. J. G., Cohen, R., & Eldar, Y. C. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2932116 · Cited by 316
Xampling: Signal Acquisition and Processing in Union of Subspaces
Mishali, M., Eldar, Y. C., & Elron, A. J. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161472 · Cited by 311
Latent Variable Bayesian Models for Promoting Sparsity
Wipf, D. P., Rao, B. D., & Nagarajan, S. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2162174 · Cited by 305
Self-citationAccurate Heart Rate Monitoring During Physical Exercises Using PPG
Temko, A. (2017) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2017.2676243 · Cited by 293
Spatial Compressive Sensing for MIMO Radar
Rossi, M., Haimovich, A. M., & Eldar, Y. C. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2289875 · Cited by 269
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
Sparse regression using mixed norms
Kowalski, M. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.05.006 · Cited by 265
Theoretical 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
Heart Rate Estimation From Wrist-Worn Photoplethysmography: A Review
Biswas, D., Simoes-Capela, N., Van Hoof, C., & Van Helleputte, N. (2019) · IEEE Sensors Journal · doi:10.1109/jsen.2019.2914166 · Cited by 258
Dictionary Learning-Based Sparse Channel Representation and Estimation for FDD Massive MIMO Systems
Ding, Y., & Rao, B. D. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2843786 · Cited by 161
Self-citationCombining sparsity and rotational invariance in EEG/MEG source reconstruction
Haufe, S., Nikulin, V. V., Ziehe, A., Müller, K.-R., & Nolte, G. (2008) · NeuroImage · doi:10.1016/j.neuroimage.2008.04.246 · Cited by 130
“…used, as for example in beamforming (Veen and Buckley, 1988), subspace methods like MUSIC and (RAP)MUSIC (Schmidt, 1986; Mosher and Leahy, 1999) and the methods proposed in (Baillet and Garnero, 1997; Huang et al., 2006; Malioutov et al., 2005; Cotter et al., 2005; Polonsky and Zibulevsky, 2004).”
Method(2011) · Cited by 42
Deep learning on sparse manifolds for faster object segmentation
Nascimento, J. C., & Carneiro, G. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2725582 · Cited by 17
Metadata
- Authors
- Cotter, S. F., Rao, B. D., Engan, K., & Kreutz-Delgado, K.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2005-07
- Volume
- 53
- Issue
- 7
- Pages
- 2477-2488
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2162409952
- Cited by
- 1,393
- References
- 45
- FWCI
- 23.52
- Type
- journal article
- Language
- en
- Open access
- closed
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.