Skip to Main content Skip to Navigation

Inpainting and zooming using sparse representations

Abstract : 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 sparserepresentation-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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [72 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00091746
Contributor : Yvain Queau <>
Submitted on : Monday, May 20, 2013 - 5:52:52 PM
Last modification on : Monday, February 10, 2020 - 6:12:39 PM
Document(s) archivé(s) le : Wednesday, August 21, 2013 - 2:20:11 AM

File

CJ-Fadili.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Jalal M. Fadili, Jean-Luc Starck, Fionn Murtagh. Inpainting and zooming using sparse representations. The Computer Journal, Oxford University Press (UK), 2007, 52 (1), pp.64-79. ⟨10.1093/comjnl/bxm055⟩. ⟨hal-00091746⟩

Share

Metrics

Record views

622

Files downloads

2698