We introduce an expectation-maximization (EM) algorithm for image inpainting based on a penalized likelihood formulated using linear sparse representations. Taking advantage of the sparsity of representations, a regularization through a prior penalty is imposed on the reconstructed coefficients. From a statistical point of view, the inpainting can be viewed as an estimation problem with missing data. The EM framework is a general iterative algorithm for ML estimation in such situations. The EM framework gives a principled way to establish formally the idea that missing samples can be recovered based on sparse representations. Furthermore, owing to its well known theoretical properties, the EM algorithm allows to investigate the convergence behavior of the inpainting algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    EM algorithm for sparse representation-based image inpainting


    Contributors:


    Publication date :

    2005-01-01


    Size :

    367062 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Em Algorithm for Sparse Representation-Based Image Inpainting

    Fadill, M. J. / Starck, J.-L. | British Library Conference Proceedings | 2005


    An Image Inpainting Algorithm Based on Sparse Modeling with Double Constraints

    Shi, J. / Qi, C. | British Library Online Contents | 2012


    Efficient Wavelet Image Inpainting Algorithm Based on Pixel Weight Values

    Lü, Yongli / Jiang, Bin / Bao, Jianrong | British Library Online Contents | 2015


    An Image Inpainting Algorithm for 3D Core Images

    Yue, G. / Teng, Q. / He, X. et al. | British Library Online Contents | 2014