The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
Abstract
The sparse representation of a multiple-measurement vector (MMV) is a relatively new problem in sparse representation. Efficient methods have been proposed. Although many theoretical results that are available in a simple case-single-measurement vector (SMV)-the theoretical analysis regarding MMV is lacking. In this paper, some known results of SMV are generalized to MMV. Some of these new results take advantages of additional information in the formulation of MMV. We consider the uniqueness under both an lscr0-norm-like criterion and an lscr1-norm-like criterion. The consequent equivalence between the lscr0-norm approach and the lscr1-norm approach indicates a computationally efficient way of finding the sparsest representation in a redundant dictionary. For greedy algorithms, it is proven that under certain conditions, orthogonal matching pursuit (OMP) can find the sparsest representation of an MMV with computational efficiency, just like in SMV. Simulations show that the predictions made by the proved theorems tend to be very conservative; this is consistent with some recent advances in probabilistic analysis based on random matrix theory. The connections will be discussed
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
A Wavelet Tour of Signal Processing
(1999) · Elsevier eBooks · doi:10.1016/b978-0-12-466606-1.x5000-4 · Cited by 16,227
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
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. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
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
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
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
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
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
A Survey of Sparse Representation: Algorithms and Applications
Zhang, Z., Xu, Y., Yang, J., Li, X., & Zhang, D. (2015) · IEEE Access · doi:10.1109/access.2015.2430359 · Cited by 1,092
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
Off-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference
Yang, Z., Xie, L., & Zhang, C. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222378 · Cited by 968
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
Distributed Compressive CSIT Estimation and Feedback for FDD Multi-User Massive MIMO Systems
(2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2324991 · Cited by 685
Spatially Common Sparsity Based Adaptive Channel Estimation and Feedback for FDD Massive MIMO
Gao, Z., Dai, L., Wang, Z., & Chen, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2463260 · Cited by 497
A Signal Processing Perspective on Hyperspectral Unmixing: Insights from Remote Sensing
Ma, W.-K., Bioucas-Dias, J. M., Chan, T.-H., Gillis, N., Gader, P., Plaza, A. J., Ambikapathi, A., & Chi, C.-Y. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2279731 · Cited by 456
Ke, M., Gao, Z., Wu, Y., Gao, X., & Schober, R. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2967175 · Cited by 417
Deep Networks for Direction-of-Arrival Estimation in Low SNR
Papageorgiou, G., Sellathurai, M., & Eldar, Y. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3089927 · Cited by 400
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
Rank 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
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
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
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
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
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
Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)
Maleki, A., Anitori, L., Yang, Z., & Baraniuk, R. G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2252232 · Cited by 264
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
- Chen, J., & Huo, X.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2006-12
- Volume
- 54
- Issue
- 12
- Pages
- 4634-4643
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2164696938
- Cited by
- 810
- References
- 33
- FWCI
- 15.05
- 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.