TY - JOUR
T1 - Split-Bregman iteration for framelet based image inpainting
AU - Li, Qia
AU - Shen, Lixin
AU - Yang, Lihua
N1 - Funding Information:
✩ This research is supported in part by the US National Science Foundation under grants DMS-0712827 and DMS-1115523, by Guangdong Provincial Government of China through the “Computational Science Innovative Research Team” program, and by Guangdong Province Key Lab of Computational Science. * Corresponding author at: Department of Mathematics, Syracuse University, Syracuse, NY 13244, United States. E-mail address: [email protected] (L. Shen). 1 All correspondence should be sent to this author.
PY - 2012/1
Y1 - 2012/1
N2 - Image inpainting plays a significant role in image processing and has many applications. Framelet based inpainting methods were introduced recently by Cai et al. (2007, 2009) [6,7,9] under an assumption that images can be sparsely approximated in the framelet domain. By analyzing these methods, we present a framelet based inpainting model in which the cost functional is the weighted ℓ-1 norm of the framelet coefficients of the underlying image. The split-Bregman iteration is exploited to derive an iterative algorithm for the model. The resulting algorithm assimilates advantages while avoiding limitations of the framelet based inpainting approaches in Cai et al. (2007, 2009) [6,7,9]. The convergence analysis of the proposed algorithm is presented. Our numerical experiments show that the algorithm proposed here performs favorably.
AB - Image inpainting plays a significant role in image processing and has many applications. Framelet based inpainting methods were introduced recently by Cai et al. (2007, 2009) [6,7,9] under an assumption that images can be sparsely approximated in the framelet domain. By analyzing these methods, we present a framelet based inpainting model in which the cost functional is the weighted ℓ-1 norm of the framelet coefficients of the underlying image. The split-Bregman iteration is exploited to derive an iterative algorithm for the model. The resulting algorithm assimilates advantages while avoiding limitations of the framelet based inpainting approaches in Cai et al. (2007, 2009) [6,7,9]. The convergence analysis of the proposed algorithm is presented. Our numerical experiments show that the algorithm proposed here performs favorably.
KW - Bregman iteration
KW - Framelet
KW - Inpainting
UR - http://www.scopus.com/inward/record.url?scp=81355146582&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=81355146582&partnerID=8YFLogxK
U2 - 10.1016/j.acha.2011.09.007
DO - 10.1016/j.acha.2011.09.007
M3 - Letter/Newsletter
AN - SCOPUS:81355146582
SN - 1063-5203
VL - 32
SP - 145
EP - 154
JO - Applied and Computational Harmonic Analysis
JF - Applied and Computational Harmonic Analysis
IS - 1
ER -