The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
Open accessAbstract
In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a method for obtaining sparse solutions of underdetermined systems of linear equations, and its applications include underdetermined sparse component analysis (SCA), atomic decomposition on overcomplete dictionaries, compressed sensing, and decoding real field codes. Contrary to previous methods, which usually solve this problem by minimizing thel1norm using linear programming (LP) techniques, our algorithm tries to directly minimize thel1norm. It is experimentally shown that the proposed algorithm is about two to three orders of magnitude faster than the state-of-the-art interior-point LP solvers, while providing the same (or better) accuracy.
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
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
Independent Component Analysis
(2004) · Independent Component Analysis · doi:10.7551/mitpress/3717.003.0014 · Cited by 7,903
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
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
Independent Component Analysis
Hyvärinen, A., Karhunen, J., & Oja, E. (2001) · Wiley eBooks · doi:10.1002/0471221317 · Cited by 5,007
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Compressive Sensing [Lecture Notes]
Baraniuk, R. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.4286571 · Cited by 4,177
Cited by
Expectation-Maximization Gaussian-Mixture Approximate Message Passing
Vila, J. P., & Schniter, P. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2272287 · Cited by 501
Sparse Regularization via Convex Analysis
Selesnick, I. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2711501 · Cited by 429
Image compression–encryption scheme based on hyper-chaotic system and 2D compressive sensing
Zhou, N., Pan, S., Cheng, S., & Zhou, Z. (2016) · Optics & Laser Technology · doi:10.1016/j.optlastec.2016.02.018 · Cited by 360
Zhang, Z., Jung, T.-P., Makeig, S., & Rao, B. D. (2013) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2012.2226175 · Cited by 340
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
Zhou, N., Zhang, A., Zheng, F., & Gong, L. (2014) · Optics & Laser Technology · doi:10.1016/j.optlastec.2014.02.015 · Cited by 325
Image Super-Resolution With Sparse Neighbor Embedding
Gao, X., Zhang, K., Tao, D., & Li, X. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2190080 · Cited by 313
Zhou, N., Li, H., Wang, D., Pan, S., & Zhou, Z. (2015) · Optics Communications · doi:10.1016/j.optcom.2014.12.084 · Cited by 270
Chai, X., Fu, X., Gan, Z., Zhang, Y., Lu, Y., & Chen, Y. (2020) · Neural Computing and Applications · doi:10.1007/s00521-018-3913-3 · Cited by 127
Hu, L.-L., Chen, M.-X., Wang, M.-M., & Zhou, N.-R. (2024) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2024.115521 · Cited by 110
Metadata
- Authors
- Mohimani, H., Babaie-Zadeh, M., & Jutten, C.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2009-01
- Volume
- 57
- Issue
- 1
- Pages
- 289-301
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2100068253
- Cited by
- 1,091
- References
- 26
- FWCI
- 38.16
- 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.