Abstract
Real images usually have two layers, namely, cartoons (the piece-wise smooth part of the image) and textures (the oscillating pattern part of the image). Both these two layers have sparse approximations under some tight frame systems such as framelet, translation invariant wavelet, curvelet, and local DCTs. In this paper, we solve image inpainting problems by using two separate tight frame systems which can sparsely represent cartoons and textures respectively. Different from existing schemes in the literature which are either analysis-based or synthesis-based sparsity priors, our minimization formulation balances these two priors. We also derive iterative algorithms to find their solutions and prove their convergence. Numerical simulation examples are given to demonstrate the applicability and usefulness of our proposed algorithms in image inpainting. © 2010 American Institute of Mathematical Sciences.
Author supplied keywords
Cite
CITATION STYLE
Cai, J. F., Chan, R. H., & Shen, Z. (2010). Simultaneous cartoon and texture Inpainting. Inverse Problems and Imaging, 4(3), 379–395. https://doi.org/10.3934/ipi.2010.4.379
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.