Image inpainting from partial noisy data by directional complex tight framelets

Yi Shen, Bin Han, Elena Braverman

Abstract


Image inpainting methods recover true images from partial noisy observations. Natural images usually have two layers consisting of cartoons and textures. Methods using simultaneous cartoon and texture inpainting are popular in the literature by using two combined tight frames: one (often built from wavelets, curvelets or shearlets) provides sparse representations for cartoons and the other (often built from discrete cosine transforms) offers sparse approximation for textures. Inspired by the recent development on directional tensor product complex tight framelets (TP-\(\mathbb{C}\)TFs) and their impressive performance for the image denoising problem, we propose an iterative thresholding algorithm using tight frames derived from TP-\(\mathbb{C}\)TFs for the image inpainting problem. The tight frame TP-\(\mathbb{C}\)TF\(_6\) contains two classes of framelets; one is good for cartoons and the other is good for textures. Therefore, it can handle both the cartoons and the textures well. For the image inpainting problem with additive zero-mean independent and identically distributed Gaussian noise, our proposed algorithm does not require us to tune parameters manually for reasonably good performance. Experimental results show that our proposed algorithm performs comparatively better than several well-known frame systems for the image inpainting problem.

doi:10.1017/S1446181117000219

Keywords


noisy data, image inpainting, directional tensor product complex tight framelets, sparse representation, iterative scheme.



DOI: http://dx.doi.org/10.21914/anziamj.v58i0.10988



Remember, for most actions you have to record/upload into this online system
and then inform the editor/author via clicking on an email icon or Completion button.
ANZIAM Journal, ISSN 1446-8735, copyright Australian Mathematical Society.