The DOI matches its Crossref record; 202 of the 202 references it cites were found in a registry or an index.
A Survey of Sparse Representation: Algorithms and Applications
Open accessAbstract
Sparse representation has attracted much attention from researchers in fields of signal processing, image processing, computer vision, and pattern recognition. Sparse representation also has a good reputation in both theoretical research and practical applications. Many different algorithms have been proposed for sparse representation. The main purpose of this paper is to provide a comprehensive study and an updated review on sparse representation and to supply guidance for researchers. The taxonomy of sparse representation methods can be studied from various viewpoints. For example, in terms of different norm minimizations used in sparsity constraints, the methods can be roughly categorized into five groups: 1) sparse representation with l0-norm minimization; 2) sparse representation with lp-norm (01-norm minimization; 4) sparse representation with l2,1-norm minimization; and 5) sparse representation with l2-norm minimization. In this paper, a comprehensive overview of sparse representation is provided. The available sparse representation algorithms can also be empirically categorized into four groups: 1) greedy strategy approximation; 2) constrained optimization; 3) proximity algorithm-based optimization; and 4) homotopy algorithm-based sparse representation. The rationales of different algorithms in each category are analyzed and a wide range of sparse representation applications are summarized, which could sufficiently reveal the potential nature of the sparse representation theory. In particular, an experimentally comparative study of these sparse representation algorithms was presented.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Donoho, D. L. (2004) · Cited by 16,703
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
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Cited by
Infrared and visible image fusion methods and applications: A survey
Ma, J., Ma, Y., & Li, C. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.02.004 · Cited by 1,732
A Survey on Deep Learning for Data-Driven Soft Sensors
Sun, Q., & Ge, Z. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3053128 · Cited by 665
Image Super-Resolution with Non-Local Sparse Attention
Mei, Y., Fan, Y., & Zhou, Y. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00352 · Cited by 607
Zhang, Q., Liu, Y., Blum, R. S., Han, J., & Tao, D. (2018) · Information Fusion · doi:10.1016/j.inffus.2017.05.006 · Cited by 499
Manifold regularized discriminative feature selection for multi-label learning
Zhang, J., Luo, Z., Li, C., Zhou, C., & Li, S. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.06.003 · Cited by 368
Feature Selection Based on Structured Sparsity: A Comprehensive Study
Gui, J., Sun, Z., Ji, S., Tao, D., & Tan, T. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2551724 · Cited by 335
Wang, Y., Gui, G., Gacanin, H., Ohtsuki, T., Dobre, O. A., & Poor, H. V. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3087243 · Cited by 304
Breast Cancer Classification From Histopathological Images Using Patch-Based Deep Learning Modeling
Hirra, I., Ahmad, M., Hussain, A., Ashraf, M. U., Saeed, I. A., Qadri, S. F., Alghamdi, A. M., & Alfakeeh, A. S. (2021) · IEEE Access · doi:10.1109/access.2021.3056516 · Cited by 272
A Review of Sparse Recovery Algorithms
Crespo Marques, E., Maciel, N., Naviner, L., Cai, H., & Yang, J. (2019) · IEEE Access · doi:10.1109/access.2018.2886471 · Cited by 268
Self-citationSparse Polynomial Chaos Expansions: Literature Survey and Benchmark
Lüthen, N., Marelli, S., & Sudret, B. (2021) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/20m1315774 · Cited by 256
Faults and Diagnosis Methods of Permanent Magnet Synchronous Motors: A Review
Chen, Y., Liang, S., Li, W., Liang, H., & Wang, C. (2019) · Applied Sciences · doi:10.3390/app9102116 · Cited by 194
Learning Vector-Quantized Item Representation for Transferable Sequential Recommenders
Hou, Y., He, Z., McAuley, J., & Zhao, W. X. (2023) · Proceedings of the ACM Web Conference 2023 · doi:10.1145/3543507.3583434 · Cited by 172
“Learning sparse codes [28, 51, 52, 66] is a widely adopted way to represent data objects in machine learning, inspiring a variety of studies related to product quantization [5, 13, 20, 27], multi-way compact embedding [6, 7], semantic hashing [26, 40], etc.”
BackgroundSecure image encryption scheme using double random-phase encoding and compressed sensing
Zhou, K., Fan, J., Fan, H., & Li, M. (2020) · Optics & Laser Technology · doi:10.1016/j.optlastec.2019.105769 · Cited by 107
Learning a Class-specific and Shared Dictionary for Classifying Surface Defects of Steel Sheet
Zhou, S., Chen, Y., Zhang, D., Xie, J., & Zhou, Y. (2017) · ISIJ International · doi:10.2355/isijinternational.isijint-2016-478 · Cited by 9
Self-citation
Metadata
- Authors
- Zhang, Z., Xu, Y., Yang, J., Li, X., & Zhang, D.
- Venue
- IEEE Access
- Published
- 2015
- Volume
- 3
- Pages
- 490-530
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2130187411
- Cited by
- 1,092
- References
- 202
- FWCI
- 98.41
- Type
- journal article
- Language
- en
- Open access
- gold
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.