The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Comparing Measures of Sparsity
Abstract
Sparsity of representations of signals has been shown to be a key concept of fundamental importance in fields such as blind source separation, compression, sampling and signal analysis. The aim of this paper is to compare several commonly-used sparsity measures based on intuitive attributes. Intuitively, a sparse representation is one in which a small number of coefficients contain a large proportion of the energy. In this paper, six properties are discussed: (Robin Hood, Scaling, Rising Tide, Cloning, Bill Gates, and Babies), each of which a sparsity measure should have. The main contributions of this paper are the proofs and the associated summary table which classify commonly-used sparsity measures based on whether or not they satisfy these six propositions. Only two of these measures satisfy all six: the pq-mean with p les 1, q > 1 and the Gini index.
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
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
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
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Non-negative matrix factorization with sparseness constraints
Hoyer, P. O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408058 · Cited by 2,591
Methods of Measuring the Concentration of Wealth
Lorenz, M. O. (1905) · Publications of the American Statistical Association · doi:10.1080/15225437.1905.10503443 · Cited by 2,250
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
Sparse Representation for Color Image Restoration
Mairal, J., Elad, M., & Sapiro, G. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.911828 · Cited by 1,716
Measurement of Inequality of Incomes
Gini, C. (1921) · The Economic Journal · doi:10.2307/2223319 · Cited by 1,710
Blind Separation of Speech Mixtures via Time-Frequency Masking
Yilmaz, O., & Rickard, S. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.828896 · Cited by 1,474
Self-citationThe Measurement of the Inequality of Incomes
Dalton, H. (1920) · The Economic Journal · doi:10.2307/2223525 · Cited by 1,466
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
Sparse coding of sensory inputs
Olshausen, B. A., & Field, D. J. (2004) · Current Opinion in Neurobiology · doi:10.1016/j.conb.2004.07.007 · Cited by 1,404
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
Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
Donoho, D. L., & Tsaig, Y. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929958 · Cited by 829
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
Sparse Sampling of Signal Innovations
Blu, T., Dragotti, P.-L., Vetterli, M., Marziliano, P., & Coulot, L. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914998 · Cited by 427
Recovery of Exact Sparse Representations in the Presence of Bounded Noise
Fuchs, J. J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855614 · Cited by 314
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
Compressive Sampling and Lossy Compression
Goyal, V. K., Fletcher, A. K., & Rangan, S. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.915001 · Cited by 252
Majorization and the Lorenz Order: A Brief Introduction
Arnold, B. C. (1987) · Lecture Notes in Statistics · doi:10.1007/978-1-4615-7379-1 · Cited by 251
Highly scalable parallel algorithms for sparse matrix factorization
Gupta, A., Karypis, G., & Kumar, V. (1997) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.598277 · Cited by 229
Enhancing Sparsity by Reweighted l(1) Minimization
Candes, E. J., Wakin, M. B., & Boyd, S. P. (2008) · doi:10.21236/ada528514 · Cited by 197
Fast Sparse Approximation for Least Squares Support Vector Machine
Jiao, L., Bo, L., & Wang, L. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.889500 · Cited by 188
Survey of sparse and non‐sparse methods in source separation
O'Grady, P. D., Pearlmutter, B. A., & Rickard, S. T. (2005) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.20035 · Cited by 179
Self-citationSparse and Redundant Modeling of Image Content Using an Image-Signature-Dictionary
Aharon, M., & Elad, M. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/07070156x · Cited by 166
The DUET Blind Source Separation Algorithm
Rickard, S. (2007) · Signals and communication technology · doi:10.1007/978-1-4020-6479-1_8 · Cited by 135
Self-citationSparse ICA for blind separation of transmitted and reflected images
Bronstein, A. M., Bronstein, M. M., Zibulevsky, M., & Zeevi, Y. Y. J. (2005) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.20042 · Cited by 118
Lp Norm Iterative Sparse Solution for EEG Source Localization
Xu, P., Tian, Y., Chen, H., & Yao, D. (2007) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2006.886640 · Cited by 110
MEASURING SPARSENESS OF NOISY SIGNALS
Karvanen, J., & Cichocki, A. S. (2003) · Cited by 84
Comparing measures of sparsity
Hurley, N., & Rickard, S. (2008) · Machine learning for signal processing ... · doi:10.1109/mlsp.2008.4685455 · Cited by 67
Self-citationFornasier, M., Ramlau, R., & Teschke, G. (2008) · Advances in Computational Mathematics · doi:10.1007/s10444-008-9103-6 · Cited by 21
Cited by
Blind deconvolution using a normalized sparsity measure
Krishnan, D., Tay, T., & Fergus, R. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995521 · Cited by 1,119
3D Human Pose Estimation from Monocular Images with Deep Convolutional Neural Network
Li, S., & Chan, A. B. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-16808-1_23 · Cited by 443
Optimizing the Channel Selection and Classification Accuracy in EEG-Based BCI
Arvaneh, M., Guan, C., Ang, K. K., & Quek, C. (2011) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2011.2131142 · Cited by 424
Erion, G., Janizek, J. D., Sturmfels, P., Lundberg, S. M., & Lee, S.-I. (2021) · Nature Machine Intelligence · doi:10.1038/s42256-021-00343-w · Cited by 300
Improvement of kurtosis-guided-grams via Gini index for bearing fault feature identification
Miao, Y., Zhao, M., & Lin, J. (2017) · Measurement Science and Technology · doi:10.1088/1361-6501/aa8a57 · Cited by 282
Metadata
- Authors
- Hurley, N., & Rickard, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-10
- Volume
- 55
- Issue
- 10
- Pages
- 4723-4741
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2111854888
- Cited by
- 757
- References
- 32
- FWCI
- 13.49
- 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.