The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation
Abstract
An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of the dictionary atoms over a base dictionary, and takes the form D = ¿ A, where ¿ is a fixed base dictionary and A is sparse. The sparse dictionary provides efficient forward and adjoint operators, has a compact representation, and can be effectively trained from given example data. In this, the sparse structure bridges the gap between implicit dictionaries, which have efficient implementations yet lack adaptability, and explicit dictionaries, which are fully adaptable but non-efficient and costly to deploy. In this paper, we discuss the advantages of sparse dictionaries, and present an efficient algorithm for training them. We demonstrate the advantages of the proposed structure for 3-D image denoising.
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
A Wavelet Tour of Signal Processing
(1999) · Elsevier eBooks · doi:10.1016/b978-0-12-466606-1.x5000-4 · Cited by 16,227
Jolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
$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
Self-citationHorn, R. A., & Johnson, C. R. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511840371 · Cited by 9,319
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
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
Self-citationAtomic 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
The contourlet transform: an efficient directional multiresolution image representation
Do, M. N., & Vetterli, M. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.859376 · Cited by 3,952
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
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-citationThe dual-tree complex wavelet transform
Selesnick, I. W., Baraniuk, R. G., & Kingsbury, N. C. (2005) · IEEE Signal Processing Magazine · doi:10.1109/msp.2005.1550194 · Cited by 2,475
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
Self-citationA Wavelet Tour of Signal Processing
(2009) · Elsevier eBooks · doi:10.1016/b978-0-12-374370-1.x0001-8 · Cited by 1,886
Sparse 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
Non-local sparse models for image restoration
Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459452 · Cited by 1,666
Curvelets: A Surprisingly Effective Nonadaptive Representation for Objects with Edges
Candès, E. J., & Donoho, D. L. (2000) · Cited by 1,330
Method of optimal directions for frame design
Engan, K., Aase, S. O., & Hakon Husoy, J. (1999) · 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258) · doi:10.1109/icassp.1999.760624 · Cited by 1,253
Adaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Wackernagel, H. (2003) · Multivariate Geostatistics · doi:10.1007/978-3-662-05294-5_17 · Cited by 1,155
Generalized principal component analysis (GPCA)
Vidal, R., Ma, Y., & Sastry, S. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.244 · Cited by 1,038
A Wavelet Tour of Signal Processing, Third Edition: The Sparse Way
Mallat, S. (2008) · Academic Press eBooks · Cited by 947
(2002) · Springer Series in Statistics · doi:10.1007/b98835 · Cited by 919
Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
Elad, M., Starck, J.-L., Querre, P., & Donoho, D. L. (2005) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2005.03.005 · Cited by 904
Self-citationSparse geometric image representations with bandelets
Le Pennec, E., & Mallat, S. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.843753 · Cited by 860
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
Self-citationEfficient Implementation of the K-SVD Algorithm using Batch Orthogonal Matching Pursuit
Rubinstein, R., Zibulevsky, M., & Elad, M. (2008) · Cited by 738
Self-citationSparse Greedy Matrix Approximation for Machine Learning
Smola, A. J., & Schökopf, B. (2000) · doi:10.5555/645529.657980 · Cited by 574
Blumensath, T., & Davies, M. E. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.916124 · Cited by 461
Learning Multiscale Sparse Representations for Image and Video Restoration
Mairal, J., Sapiro, G., & Elad, M. (2008) · Multiscale Modeling & Simulation · doi:10.1137/070697653 · Cited by 460
Self-citationSparse multidimensional representation using shearlets
Labate, D., Lim, W.-Q., Kutyniok, G., & Weiss, G. (2005) · SPIE Proceedings · doi:10.1117/12.613494 · Cited by 455
Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit
Donoho, D. L., Tsaig, Y., Drori, I., & Starck, J. (2006) · Cited by 419
Some Notes on Alternating Optimization
Bezdek, J. C., & Hathaway, R. J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45631-7_39 · Cited by 355
Neural network adaptive wavelets for signal representation and classification
Szu, H. H. (1992) · Optical Engineering · doi:10.1117/12.59918 · Cited by 349
Image Sequence Denoising via Sparse and Redundant Representations
Protter, M., & Elad, M. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2008065 · Cited by 323
Self-citationCompression of facial images using the K-SVD algorithm
Bryt, O., & Elad, M. (2008) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2008.03.001 · Cited by 311
Self-citationWhy Simple Shrinkage Is Still Relevant for Redundant Representations?
Elad, M. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885522 · Cited by 291
Self-citationElad, M., Matalon, B., & Zibulevsky, M. (2007) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.02.002 · Cited by 201
Self-citationOn the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
Aharon, M., Elad, M., & Bruckstein, A. M. (2006) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.06.035 · Cited by 194
Self-citationBlock Coordinate Relaxation Methods for Nonparametric Wavelet Denoising
Sardy, S., Bruce, A. G., & Tseng, P. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474885 · Cited by 171
Sparse 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
Self-citationForward sequential algorithms for best basis selection
Cotter, S. F., Rao, B. D., Kreutz-Delgado, K., & Adler, J. (1999) · IEE Proceedings - Vision Image and Signal Processing · doi:10.1049/ip-vis:19990445 · Cited by 152
Learning Unions of Orthonormal Bases with Thresholded Singular Value Decomposition
Lesage, S., Gribonval, R., Bimbot, F., & Benaroya, L. (2006) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2005.1416298 · Cited by 134
Optimizing the Performance of Sparse Matrix-Vector Multiplication
Im, E. (2000) · UC Berkeley · Cited by 120
Texture characterization and defect detection using adaptive wavelets
Jasper, W. J., Garnier, S. J., & Potlapalli, H. (1996) · Optical Engineering · doi:10.1117/1.601054 · Cited by 108
Block Coordinate Relaxation Methods for Nonparametric Wavelet Denoising
Sardy, S., Bruce, A. G., & Tseng, P. (2000) · Journal of Computational and Graphical Statistics · doi:10.2307/1390659 · Cited by 84
Sparse representations for limited data tomography
Liao, H. Y., & Sapiro, G. (2008) · IEEE International Symposium on Biomedical Imaging (ISBI) · doi:10.1109/isbi.2008.4541261 · Cited by 48
Cited by
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
Self-citationDong, W., Zhang, L., Shi, G., & Wu, X. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2108306 · Cited by 1,124
Data-driven discovery of coordinates and governing equations
Champion, K., Lusch, B., Kutz, J. N., & Brunton, S. L. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1906995116 · Cited by 909
Predicting Parameters in Deep Learning
Denil, M., Shakibi, B., Dinh, L., Ranzato, M., & de Freitas, N. (2013) · arXiv · doi:10.48550/arxiv.1306.0543 · Cited by 853
Deep Learning for Geophysics: Current and Future Trends
Yu, S., & Ma, J. (2021) · Reviews of Geophysics · doi:10.1029/2021rg000742 · Cited by 571
Metadata
- Authors
- Rubinstein, R., Zibulevsky, M., & Elad, M.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-03
- Volume
- 58
- Issue
- 3
- Pages
- 1553-1564
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2099321050
- Cited by
- 616
- References
- 47
- FWCI
- 21.25
- 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.