The DOI matches its Crossref record; 62 of the 62 references it cites were found in a registry or an index.
Inpainting and Zooming Using Sparse Representations
Open accessAbstract
Representing the image to be inpainted in an appropriate sparse representation dictionary, and combining elements from Bayesian statistics and modern harmonic analysis, we introduce an expectation maximization (EM) algorithm for image inpainting and interpolation. From a statistical point of view, the inpainting/interpolation can be viewed as an estimation problem with missing data. Toward this goal, we propose the idea of using the EM mechanism in a Bayesian framework, where a sparsity promoting prior penalty is imposed on the reconstructed coefficients. The EM framework gives a principled way to establish formally the idea that missing samples can be recovered/interpolated based on sparse representations. We first introduce an easy and efficient sparse-representation-based iterative algorithm for image inpainting. Additionally, we derive its theoretical convergence properties. Compared to its competitors, this algorithm allows a high degree of flexibility to recover different structural components in the image (piecewise smooth, curvilinear, texture, etc.). We also suggest some guidelines to automatically tune the regularization parameter.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Statistical Analysis With Missing Data
Lahiff, M., Little, R. J. A., & Rubin, D. B. (1989) · Journal of the American Statistical Association · doi:10.2307/2289883 · Cited by 17,265
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
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
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
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
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Cited by
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Split Bregman Methods and Frame Based Image Restoration
Cai, J.-F., Osher, S., & Shen, Z. (2010) · Multiscale Modeling & Simulation · doi:10.1137/090753504 · Cited by 670
Yu, G., Sapiro, G., & Mallat, S. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2176743 · Cited by 561
Image Inpainting by Patch Propagation Using Patch Sparsity
Xu, Z., & Sun, J. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2042098 · Cited by 518
MAT: Mask-Aware Transformer for Large Hole Image Inpainting
Li, W., Lin, Z., Zhou, K., Qi, L., Wang, Y., & Jia, J. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01049 · Cited by 449
A Generalized Forward-Backward Splitting
Raguet, H., Fadili, J., & Peyré, G. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120872802 · Cited by 352
Gradient Profile Prior and Its Applications in Image Super-Resolution and Enhancement
Sun, J., Sun, J., Xu, Z., & Shum, H.-Y. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2095871 · Cited by 341
Image restoration: Total variation, wavelet frames, and beyond
Cai, J.-F., Dong, B., Osher, S., & Shen, Z. (2012) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-2012-00740-1 · Cited by 339
Ensemble sparse classification of Alzheimer's disease
Liu, M., Zhang, D., & Shen, D. (2012) · NeuroImage · doi:10.1016/j.neuroimage.2012.01.055 · Cited by 313
Super-Resolution With Sparse Mixing Estimators
Mallat, S., & Yu, G. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2049927 · Cited by 296
A Comprehensive Framework for Image Inpainting
Bugeau, A., Bertalmío, M., Caselles, V., & Sapiro, G. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2049240 · Cited by 257
Data-driven tight frame construction and image denoising
Cai, J.-F., Ji, H., Shen, Z., & Ye, G.-B. (2014) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2013.10.001 · Cited by 252
Metadata
- Authors
- Fadili, M. J., Starck, J.-L., & Murtagh, F.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 2008-02-19
- Volume
- 52
- Issue
- 1
- Pages
- 64-79
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2108454251
- Cited by
- 333
- References
- 62
- FWCI
- 23.56
- Type
- journal article
- Language
- en
- Open access
- bronze
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.