Abstract
Image inpainting is a fundamental problem in image processing and has many applications. Motivated by the recent tight frame based methods on image restoration in either the image or the transform domain, we propose an iterative tight frame algorithm for image inpainting. We consider the convergence of this framelet-based algorithm by interpreting it as an iteration for minimizing a special functional. The proof of the convergence is under the framework of convex analysis and optimization theory. We also discuss the relationship of our method with other wavelet-based methods. Numerical experiments are given to illustrate the performance of the proposed algorithm.
Original language | English |
---|---|
Pages (from-to) | 131-149 |
Number of pages | 19 |
Journal | Applied and Computational Harmonic Analysis |
Volume | 24 |
Issue number | 2 |
DOIs | |
Publication status | Published - Mar 2008 |
Externally published | Yes |
Funding
This work was supported by HKRGC Grant CUHK 400405 and CUHK DAG 2060257. 3 This work was partially supported by Grant R-146-000-060-112 at the National University of Singapore.
Keywords
- Convex analysis
- Inpainting
- Tight frame