The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Learning Multiscale Sparse Representations for Image and Video Restoration
Open accessAbstract
This paper presents a framework for learning multiscale sparse representations of color images and video with overcomplete dictionaries. A single-scale K-SVD algorithm was introduced in [M. Aharon, M. Elad, and A. M. Bruckstein, IEEE Trans. Signal Process., 54 (2006), pp. 4311–4322], formulating sparse dictionary learning for grayscale image representation as an optimization problem, efficiently solved via orthogonal matching pursuit (OMP) and singular value decomposition (SVD). Following this work, we propose a multiscale learned representation, obtained by using an efficient quadtree decomposition of the learned dictionary and overlapping image patches. The proposed framework provides an alternative to predefined dictionaries such as wavelets and is shown to lead to state-of-the-art results in a number of image and video enhancement and restoration applications. This paper describes the proposed framework and accompanies it by numerous examples demonstrating its strength.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
$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-citationImage denoising by sparse 3-D transform-domain collaborative filtering
Dabov, K., Foi, A., Katkovnik, V., & Egiazarian, K. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.901238 · Cited by 9,283
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
Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937655 · Cited by 8,216
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
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-citationA Review of Image Denoising Algorithms, with a New One
Buades, A., Coll, B., & Morel, J. M. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040616024 · Cited by 4,083
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Bertalmio, M., Sapiro, G., Caselles, V., & Ballester, C. (2000) · Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00 · doi:10.1145/344779.344972 · Cited by 3,580
Self-citationRegion Filling and Object Removal by Exemplar-Based Image Inpainting
Criminisi, A., Perez, P., & Toyama, K. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.833105 · Cited by 3,258 · cited 1×
“, [2, 9]) consists of filling in holes in images.”
BackgroundNumerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
The design and use of steerable filters
Freeman, W. T., & Adelson, E. H. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.93808 · Cited by 2,942
Image denoising using scale mixtures of gaussians in the wavelet domain
Portilla, J., Strela, V., Wainwright, M. J., & Simoncelli, E. P. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.818640 · Cited by 2,255
Topology matching for fully automatic similarity estimation of 3D shapes
Hilaga, M., Shinagawa, Y., Kohmura, T., & Kunii, T. L. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383282 · Cited by 2,187
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
Self-citationSparse 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
Self-citationNew tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
Candès, E. J., & Donoho, D. L. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.10116 · Cited by 1,545
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
Shiftable multiscale transforms
Simoncelli, E. P., Freeman, W. T., Adelson, E. H., & Heeger, D. J. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119725 · Cited by 1,333
Adaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Efficient Learning of Sparse Representations with an Energy-Based Model
Ranzato, M., Poultney, C., Chopra, S., & LeCun, Y. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0147 · Cited by 1,106
Fields of Experts: A Framework for Learning Image Priors
Roth, S., & Black, M. J. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.160 · Cited by 1,039
Sparse 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
Image denoising with block-matching and 3D filtering
Dabov, K., Foi, A., Katkovnik, V., & Egiazarian, K. (2006) · SPIE Proceedings · doi:10.1117/12.643267 · Cited by 730
Weighted low-rank approximations
Srebro, N., & Jaakkola, T. (2003) · International Conference on Machine Learning · Cited by 715
Space-Time Completion of Video
Wexler, Y., Shechtman, E., & Irani, M. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.60 · Cited by 682
Wedgelets: nearly minimax estimation of edges
Donoho, D. L. (1999) · The Annals of Statistics · doi:10.1214/aos/1018031261 · Cited by 638
Demosaicing: image reconstruction from color CCD samples
Kimmel, R. (1999) · IEEE Transactions on Image Processing · doi:10.1109/83.784434 · Cited by 472
Dabov, K., Foi, A., Katkovnik, V., & Egiazarian, K. (2007) · 2007 IEEE International Conference on Image Processing · doi:10.1109/icip.2007.4378954 · Cited by 458
Optimal Spatial Adaptation for Patch-Based Image Denoising
Kervrann, C., & Boulanger, J. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.877529 · Cited by 431
Image Denoising Via Learned Dictionaries and Sparse representation
Elad, M., & Aharon, M. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.142 · Cited by 378
Self-citationAdaptive time-frequency decompositions
Mallat, S. G. (1994) · Optical Engineering · doi:10.1117/12.173207 · Cited by 358
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-citationRecovering edges in ill-posed inverse problems: optimality of curvelet frames
Candès, E. J., & Donoho, D. L. (2002) · The Annals of Statistics · doi:10.1214/aos/1028674842 · Cited by 322
What makes a good model of natural images?
Weiss, Y., & Freeman, W. T. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383092 · Cited by 300
Do, M. N., & Vetterli, M. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.815389 · Cited by 267
Video Inpainting Under Constrained Camera Motion
Patwardhan, K. A., Sapiro, G., & Bertalmio, M. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.888343 · Cited by 253
Self-citationDifferentiation of Discrete Multidimensional Signals
Farid, H., & Simoncelli, E. P. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.823819 · Cited by 235
Demosaicing by successive approximation
Li, X. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.840683 · Cited by 221
Bandelet Image Approximation and Compression
Le Pennec, E., & Mallat, S. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040619454 · Cited by 213
Color Demosaicing Using Variance of Color Differences
Chung, K.-H., & Chan, Y.-H. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.877521 · Cited by 202
Demosaicing using optimal recovery
Muresan, D. D., & Parks, T. W. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.838697 · Cited by 79
Learning sparse multiscale image representations
Sallee, P. A., & Olshausen, B. A. (2003) · Cited by 63
Statistical Modeling of Images with Fields of Gaussian Scale Mixtures
Lyu, S., & Simoncelli, E. P. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7503.003.0123 · Cited by 48
Cited by
Image Super-Resolution Via Sparse Representation
Yang, J., Wright, J., Huang, T. S., & Ma, Y. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2050625 · Cited by 5,217
Online Learning for Matrix Factorization and Sparse Coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0050 · Cited by 2,258
Self-citationSparse Representation for Computer Vision and Pattern Recognition
Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T. S., & Yan, S. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044470 · Cited by 1,847
Self-citationImage super-resolution as sparse representation of raw image patches
Yang, J., Wright, J., Huang, T., & Ma, Y. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587647 · Cited by 1,475
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-citation
Metadata
- Authors
- Mairal, J., Sapiro, G., & Elad, M.
- Venue
- Multiscale Modeling & Simulation
- Published
- 2008-01
- Volume
- 7
- Issue
- 1
- Pages
- 214-241
- ISSN
- 1540-3459 (ISSN-L)
- 1540-3467
- OpenAlex
- W2056758595
- Cited by
- 460
- References
- 45
- FWCI
- 43.91
- 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.