# Analysis of simultaneous inpainting and geometric separation based on sparse decomposition

@article{Do2020AnalysisOS,
title={Analysis of simultaneous inpainting and geometric separation based on sparse decomposition},
author={Van Tiep Do and Ron Levie and Gitta Kutyniok},
journal={Analysis and Applications},
year={2020}
}
• Published 20 September 2020
• Computer Science
• Analysis and Applications
Natural images are often the superposition of various parts of different geometric characteristics. For instance, an image might be a mixture of cartoon and texture structures. In addition, images are often given with missing data. In this paper, we develop a method for simultaneously decomposing an image to its two underlying parts and inpainting the missing data. Our separation–inpainting method is based on an [Formula: see text] minimization approach, using two dictionaries, each sparsifying…
2 Citations

## Figures from this paper

Multi-component separation, inpainting and denoising with recovery guarantees
This paper proposes two main algorithms based on l1 constrained and unconstrained minimization for separating N distinct geometric components and simultaneously filling-in the missing part of the observed image and presents a theoretical guarantee for these algorithms using compressed sensing technique, which is based on a principle that each component can be sparsely represented by a suitably chosen dictionary.
An asymptotic analysis of separating pointlike and $C^{\beta}$-curvelike singularities
• Computer Science, Mathematics
• 2021
This paper proposes a reconstruction framework with theoretical guarantee on convergence, which is extended to use general frames instead of Parseval frames, and constructs a dual pair of bandlimited α-shearlets which possesses a good time and frequency localization.

## References

SHOWING 1-10 OF 69 REFERENCES
Simultaneous cartoon and texture inpainting
• Computer Science
• 2010
This paper solves image inpainting problems by using two separate tight frame systems which can sparsely represent cartoons and textures respectively and derives iterative algorithms to find their solutions and prove their convergence.
Image decomposition via the combination of sparse representations and a variational approach
• Computer Science
IEEE Transactions on Image Processing
• 2005
A novel method for separating images into texture and piecewise smooth (cartoon) parts, exploiting both the variational and the sparsity mechanisms is presented, combining the basis pursuit denoising (BPDN) algorithm and the total-variation (TV) regularization scheme.
Simultaneous structure and texture image inpainting
• Computer Science
2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.
• 2003
The novel contribution of the paper is the combination of these three previously developed components: image decomposition with inpainting and texture synthesis, which permits the simultaneous use of filling-in algorithms that are suited for different image characteristics.
Image decomposition: separation of texture from piecewise smooth content
• Engineering
SPIE Optics + Photonics
• 2003
This paper presents a novel method for separating images into texture and piecewise smooth parts. The proposed approach is based on a combination of the Basis Pursuit Denoising (BPDN) algorithm and
Analysis of Inpainting via Clustered Sparsity and Microlocal Analysis
• Computer Science
Journal of Mathematical Imaging and Vision
• 2013
This paper provides the first comprehensive analysis in the continuum domain utilizing the novel concept of clustered sparsity, which besides leading to asymptotic error bounds also makes the superior behavior of directional representation systems over wavelets precise.
Clustered Sparsity and Separation of Cartoon and Texture
This paper provides a theoretical study of the separation of a combination of cartoon and texture structures in a continuum model situation using this class of algorithms.
Image Decomposition and Restoration Using Total Variation Minimization and the H1
• Computer Science
Multiscale Model. Simul.
• 2003
A new model for image restoration and image decomposition into cartoon and texture is proposed, based on the total variation minimization of Rudin, Osher, and Fatemi, and on oscillatory functions, which follows results of Meyer.
Asymptotic Analysis of Inpainting via Universal Shearlet Systems
• Computer Science
SIAM J. Imaging Sci.
• 2014
This paper introduces universal shearlet systems which are associated with an arbitrary scaling sequence, thereby modeling the previously mentioned flexibility.