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
Linear 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
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Uncertainty principles and ideal atomic decomposition
Donoho, D. L., & Huo, X. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959265 · Cited by 1,949
Introduction to Spectral Analysis
(2005) · Technometrics · doi:10.1198/tech.2005.s841 · Cited by 1,933
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
Self-citationAdapted wavelet analysis from theory to software
Wickerhauser, M. V. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,204
What Is the Goal of Sensory Coding?
Field, D. J. (1994) · Neural Computation · doi:10.1162/neco.1994.6.4.559 · Cited by 1,183
Adaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Sparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
Proportionate normalized least-mean-squares adaptation in echo cancelers
Duttweiler, D. L. (2000) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.861368 · Cited by 879
Linear and Nonlinear Programming
Luenberger, D. G., & Ye, Y. (2021) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-3-030-85450-8 · Cited by 696
A generalized uncertainty principle and sparse representation in pairs of bases
Elad, M., & Bruckstein, A. M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.801410 · Cited by 673
Sparse channel estimation via matching pursuit with application to equalization
Cotter, S. F., & Rao, B. D. (2002) · IEEE Transactions on Communications · doi:10.1109/26.990897 · Cited by 671
Self-citationNeuromagnetic source imaging with FOCUSS: a recursive weighted minimum norm algorithm
Gorodnitsky, I. F., George, J. S., & Rao, B. D. (1995) · Electroencephalography and Clinical Neurophysiology · doi:10.1016/0013-4694(95)00107-a · Cited by 567
Self-citationOn Sparse Representations in Arbitrary Redundant Bases
Fuchs, J.-J. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828141 · Cited by 563
Introduction To Spectral Analysis
(2008) · Springer Texts in Statistics · doi:10.1007/978-0-387-75959-3_13 · Cited by 559
An affine scaling methodology for best basis selection
Rao, B. D., & Kreutz-Delgado, K. (1999) · IEEE Transactions on Signal Processing · doi:10.1109/78.738251 · Cited by 526
Self-citationA new model of LPC excitation for producing natural-sounding speech at low bit rates
Atal, B., & Remde, J. (2005) · ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1982.1171649 · Cited by 510
Chen, S., & Donoho, D. L. (1994) · Cited by 467
Adaptive time-frequency decompositions
Mallat, S. G. (1994) · Optical Engineering · doi:10.1117/12.173207 · Cited by 358
Subset selection in noise based on diversity measure minimization
Rao, B. D., Engan, K., Cotter, S. F., Palmer, J., & Kreutz-Delgado, K. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.808076 · Cited by 324
Self-citationMEG-based imaging of focal neuronal current sources
Phillips, J. W., Leahy, R. M., & Mosher, J. C. (1997) · IEEE Transactions on Medical Imaging · doi:10.1109/42.585768 · Cited by 190
Highly sparse representations from dictionaries are unique and independent of the sparseness measure
Gribonval, R., & Nielsen, M. (2007) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.09.003 · Cited by 185
Forward sequential algorithms for best basis selection
Cotter, S. F., Rao, B. D., Kreutz-Delgado, K., & Adler, J. (1999) · IEE Proceedings - Vision Image and Signal Processing · doi:10.1049/ip-vis:19990445 · Cited by 152
Self-citationFast orthogonal least squares algorithm for efficient subset model selection
Chen, S., & Wigger, J. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.398734 · Cited by 131
Extrapolation and spectral estimation with iterative weighted norm modification
Cabrera, S. D., & Parks, T. W. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.80906 · Cited by 105
Reduced complexity decision feedback equalization for multipath channels with large delay spreads
Fevrier, I. J., Gelfand, S. B., & Fitz, M. P. (1999) · IEEE Transactions on Communications · doi:10.1109/26.771349 · Cited by 104
Signal processing with the sparseness constraint
Rao, B. D. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1998.681826 · Cited by 95
Self-citationThe Application of Wave Form Dictionaries to Stock Market Index Data
Ramsey, J. B., & Zhang, Z. (1996) · Springer series in synergetics · doi:10.1007/978-3-642-80254-6_11 · Cited by 81
Gribonval, R. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2002.5745294 · Cited by 64
Simultaneous approximation by greedy algorithms
Leviatan, D., & Temlyakov, V. N. (2006) · Advances in Computational Mathematics · doi:10.1007/s10444-004-7613-4 · Cited by 63
Backward sequential elimination for sparse vector subset selection
Cotter, S. F., Kreutz-Delgado, K., & Rao, B. D. (2001) · Signal Processing · doi:10.1016/s0165-1684(01)00064-0 · Cited by 56
Self-citationSparse inverse solution methods for signal and image processing applications
Jeffs, B. D. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1998.681832 · Cited by 46
Restoration of blurred star field images by maximally sparse optimization
Jeffs, B. D., & Gunsay, M. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.217223 · Cited by 38
Improvement of discrete band-limited signal extrapolation by iterative subspace modification
Lee, H., Sullivan, D., & Huang, T. S. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1987.1169486 · Cited by 28
Basis selection in the presence of noise
Rao, B. D., & Kreutz-Delgado, K. (2002) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.1998.750962 · Cited by 20
Self-citation
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
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.