Inpainting and zooming using sparse representations

Jalal M. Fadili (1) , Jean-Luc Starck (2) , Fionn Murtagh (3)

1 Equipe Image - Laboratoire GREYC - UMR6072
2 DEDIP - Département d'Electronique, des Détecteurs et d'Informatique pour la Physique (ex SEDI)
3 Department of Computer Science

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.

Keywords: EM algorithm; sparse representations; inpainting; interpolation; penalized likelihood

Domains: Data Structures and Algorithms [cs.DS]

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