The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Dictionary Learning Algorithms for Sparse Representation
Open accessAbstract
Algorithms for data-driven learning of domain-specific overcomplete dictionaries are developed to obtain maximum likelihood and maximum a posteriori dictionary estimates based on the use of Bayesian models with concave/Schur-concave (CSC) negative log priors. Such priors are appropriate for obtaining sparse representations of environmental signals within an appropriately chosen (environmentally matched) dictionary. The elements of the dictionary can be interpreted as concepts, features, or words capable of succinct expression of events encountered in the environment (the source of the measured signals). This is a generalization of vector quantization in that one is interested in a description involving a few dictionary entries (the proverbial “25 words or less”), but not necessarily as succinct as one entry. To learn an environmentally adapted dictionary capable of concise expression of signals generated by the environment, we develop algorithms that iterate between a representative set of sparse representations found by variants of FOCUSS and an update of the dictionary using these sparse representations. Experiments were performed using synthetic data and natural images. For complete dictionaries, we demonstrate that our algorithms have improved performance over other independent component analysis (ICA) methods, measured in terms of signal-to-noise ratios of separated sources. In the overcomplete case, we show that the true underlying dictionary and sparse sources can be accurately recovered. In tests with natural images, learned overcomplete dictionaries are shown to have higher coding efficiency than complete dictionaries; that is, images encoded with an overcomplete dictionary have both higher compression (fewer bits per pixel) and higher accuracy (lower mean square error).
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
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
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
An Information-Maximization Approach to Blind Separation and Blind Deconvolution
Bell, A. J., & Sejnowski, T. J. (1995) · Neural Computation · doi:10.1162/neco.1995.7.6.1129 · Cited by 8,986
Independent component analysis, A new concept?
Comon, P. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90029-9 · Cited by 8,205
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694 · cited 17×
“More recently, the desirability of obtaining " overcomplete " sets of vectors (or " dictionaries " ) has been noted (Olshausen & Field, 1996; Lewicki & Sejnowski, 2000; Coifman & Wickerhauser, 1992; Mallat & Zhang, 1993; Donoho, 1994; Rao & Kreutz- Delgado, 1997).”
BackgroundMethodInfluentialThe Principles of Quantum Mechanics
Dirac, P. A. M., & Polkinghorne, J. C. (1958) · Physics Today · doi:10.1063/1.3062610 · Cited by 5,409
Inequalities: Theory of Majorization and its Applications.
Arnold, B. C., Marshall, A. W., & Olkin, I. (1981) · Journal of the American Statistical Association · doi:10.2307/2287859 · Cited by 4,870
Sparse coding with an overcomplete basis set: A strategy employed by V1?
Olshausen, B. A., & Field, D. J. (1997) · Vision Research · doi:10.1016/s0042-6989(97)00169-7 · Cited by 3,642
Entropy-based algorithms for best basis selection
Coifman, R. R., & Wickerhauser, M. V. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119732 · Cited by 3,188
The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
Hansen, P. C., & O’Leary, D. P. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914086 · Cited by 3,137
Lee, T.-W., Girolami, M., & Sejnowski, T. J. (1999) · Neural Computation · doi:10.1162/089976699300016719 · Cited by 1,967
Self-citationSparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
Gorodnitsky, I. F., & Rao, B. D. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558475 · Cited by 1,834
Self-citationSparse solutions to linear inverse problems with multiple measurement vectors
Cotter, S. F., Rao, B. D., Engan, K., & Kreutz-Delgado, K. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.849172 · Cited by 1,393
Self-citationAdapted wavelet analysis from theory to software
Wickerhauser, M. V. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,204
What Is the Goal of Sensory Coding?
Field, D. J. (1994) · Neural Computation · doi:10.1162/neco.1994.6.4.559 · Cited by 1,183
Learning Overcomplete Representations
Lewicki, M. S., & Sejnowski, T. J. (2000) · Neural Computation · doi:10.1162/089976600300015826 · Cited by 1,129
Self-citationThe statistics of natural images
Ruderman, D. (1994) · Network: Computation in Neural Systems · doi:10.1088/0954-898x/5/4/006 · Cited by 941
Blind Source Separation by Sparse Decomposition in a Signal Dictionary
Zibulevsky, M., & Pearlmutter, B. A. (2001) · Neural Computation · doi:10.1162/089976601300014385 · Cited by 766
Neuromagnetic source imaging with FOCUSS: a recursive weighted minimum norm algorithm
Gorodnitsky, I. F., George, J. S., & Rao, B. D. (1995) · Electroencephalography and Clinical Neurophysiology · doi:10.1016/0013-4694(95)00107-a · Cited by 567
Self-citationAn 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
Self-citationAttias, H. (1999) · Neural Computation · doi:10.1162/089976699300016458 · Cited by 504
Minimax Entropy Principle and Its Application to Texture Modeling
Zhu, S. C., Wu, Y. N., & Mumford, D. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1627 · Cited by 420
Statistical Factor Analysis and Related Methods: Theory and Applications.
Jolliffe, I. T., & Basilevsky, A. (1997) · Biometrics · doi:10.2307/2533129 · Cited by 395
Subset selection in noise based on diversity measure minimization
Rao, B. D., Engan, K., Cotter, S. F., Palmer, J., & Kreutz-Delgado, K. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.808076 · Cited by 324
Self-citationProbabilistic framework for the adaptation and comparison of image codes
Lewicki, M. S., & Olshausen, B. A. (1999) · Journal of the Optical Society of America A · doi:10.1364/josaa.16.001587 · Cited by 308
An Information-Theoretic Approach to Neural Computing
Deco, G., & Obradovic, D. (1996) · Perspectives in Neural Computing · doi:10.1007/978-1-4612-4016-7 · Cited by 292
Nonlinear neurons in the low-noise limit: a factorial code maximizes information transfer
Nadal, J., & Parga, N. (1994) · Network Computation in Neural Systems · doi:10.1088/0954-898x/5/4/008 · Cited by 282
A Variational Method for Learning Sparse and Overcomplete Representations
Girolami, M. (2001) · Neural Computation · doi:10.1162/089976601753196003 · Cited by 192
Blind separation of instantaneous mixture of sources via an independent component analysis
Pham, D. T. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.542183 · Cited by 185
Adaptive system identification and signal processing algorithms
Kalouptsidis, N., & Theodoridis, S. (1993) · Prentice-Hall, Inc eBooks · Cited by 169
What is the Goal of Sensory Coding?
Field, D. J. (1999) · The MIT Press eBooks · doi:10.7551/mitpress/7011.003.0008 · Cited by 130
Pattern recognition as a quest for minimum entropy
Watanabé, S. (1981) · Pattern Recognition · doi:10.1016/0031-3203(81)90094-7 · Cited by 103
Signal processing with the sparseness constraint
Rao, B. D. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1998.681826 · Cited by 95
Self-citationA fast algorithm for estimating overcomplete ICA bases for image windows
Hyvärinen, A., Cristescu, R., & Erkki Oja, A. (2003) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1999.831071 · Cited by 65
Resolution, separation of retinal ganglion cells, and cortical magnification in humans
Popović, Z., & Sjöstrand, J. (2001) · Vision Research · doi:10.1016/s0042-6989(00)00290-x · Cited by 63
Basis selection in the presence of noise
Rao, B. D., & Kreutz-Delgado, K. (2002) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.1998.750962 · Cited by 20
Self-citation
Cited by
$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
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Dictionaries for Sparse Representation Modeling
Rubinstein, R., Bruckstein, A. M., & Elad, M. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2040551 · Cited by 1,306
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
Metadata
- Authors
- Kreutz-Delgado, K., Murray, J. F., Rao, B. D., Engan, K., Lee, T.-W., & Sejnowski, T. J.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 2003-02-01
- Volume
- 15
- Issue
- 2
- Pages
- 349-396
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2142940228
- Cited by
- 838
- References
- 36
- FWCI
- 20.67
- 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.