The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Optimized Projections for Compressed Sensing
Abstract
Compressed sensing (CS) offers a joint compression and sensing processes, based on the existence of a sparse representation of the treated signal and a set of projected measurements. Work on CS thus far typically assumes that the projections are drawn at random. In this paper, we consider the optimization of these projections. Since such a direct optimization is prohibitive, we target an average measure of the mutual coherence of the effective dictionary, and demonstrate that this leads to better CS reconstruction performance. Both the basis pursuit (BP) and the orthogonal matching pursuit (OMP) are shown to benefit from the newly designed projections, with a reduction of the error rate by a factor of 10 and beyond.
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
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
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
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
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
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
Self-citation
Cited by
Sparse Representation for Computer Vision and Pattern Recognition
Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T. S., & Yan, S. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044470 · Cited by 1,847
Sensitivity to Basis Mismatch in Compressed Sensing
Chi, Y., Scharf, L. L., Pezeshki, A., & Calderbank, A. R. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2112650 · Cited by 920
Ramirez, I., Sprechmann, P., & Sapiro, G. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539964 · Cited by 753
Lee, J., Gil, G.-T., & Lee, Y. H. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2557791 · Cited by 691
Duarte-Carvajalino, J. M., & Sapiro, G. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2022459 · Cited by 571
Channel Estimation for Reconfigurable Intelligent Surface Aided Multi-User mmWave MIMO Systems
Chen, J., Liang, Y.-C., Cheng, H. V., & Yu, W. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2023.3246264 · Cited by 410
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
Xenaki, A., Gerstoft, P., & Mosegaard, K. (2014) · The Journal of the Acoustical Society of America · doi:10.1121/1.4883360 · Cited by 326
Spatial-spectral encoded compressive hyperspectral imaging
Lin, X., Liu, Y., Wu, J., & Dai, Q. (2014) · ACM Transactions on Graphics · doi:10.1145/2661229.2661262 · Cited by 309
Compressed-Sensing MRI With Random Encoding
Haldar, J. P., Hernando, D., & Liang, Z.-P. (2011) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2010.2085084 · Cited by 308
Sampling of Graph Signals With Successive Local Aggregations
Marques, A. G., Segarra, S., Leus, G., & Ribeiro, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2507546 · Cited by 287
On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
Bruckstein, A. M., Elad, M., & Zibulevsky, M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929920 · Cited by 285
Self-citationDictionary 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
Energy-Efficient Multi-Mode Compressed Sensing System for Implantable Neural Recordings
Suo, Y., Zhang, J., Xiong, T., Chin, P. S., Etienne-Cummings, R., & Tran, T. D. (2014) · IEEE Transactions on Biomedical Circuits and Systems · doi:10.1109/tbcas.2014.2359180 · Cited by 47
A closed-loop compressive-sensing-based neural recording system
Zhang, J., Mitra, S., Suo, Y., Cheng, A., Xiong, T., Michon, F., Welkenhuysen, M., Kloosterman, F., Chin, P. S., Hsiao, S., et al. (2015) · Journal of Neural Engineering · doi:10.1088/1741-2560/12/3/036005 · Cited by 33
Metadata
- Authors
- Elad, M.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2007-12
- Volume
- 55
- Issue
- 12
- Pages
- 5695-5702
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2134033146
- Cited by
- 835
- References
- 17
- FWCI
- 24.60
- 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.