Paper
31 October 2016 A cartoon-texture decomposition-based image deburring model by using framelet-based sparse representation
Author Affiliations +
Abstract
Image deblurring is a fundamental problem in image processing. Conventional methods often deal with the degraded image as a whole while ignoring that an image contains two different components: cartoon and texture. Recently, total variation (TV) based image decomposition methods are introduced into image deblurring problem. However, these methods often suffer from the well-known stair-casing effects of TV. In this paper, a new cartoon -texture based sparsity regularization method is proposed for non-blind image deblurring. Based on image decomposition, it respectively regularizes the cartoon with a combined term including framelet-domain-based sparse prior and a quadratic regularization and the texture with the sparsity of discrete cosine transform domain. Then an adaptive alternative split Bregman iteration is proposed to solve the new multi-term sparsity regularization model. Experimental results demonstrate that our method can recover both cartoon and texture of images simultaneously, and therefore can improve the visual effect, the PSNR and the SSIM of the deblurred image efficiently than TV and the undecomposed methods.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Huasong Chen, Xiangju Qu, Ying Jin, Zhenhua Li, and Anzhi He "A cartoon-texture decomposition-based image deburring model by using framelet-based sparse representation", Proc. SPIE 10020, Optoelectronic Imaging and Multimedia Technology IV, 1002012 (31 October 2016); https://doi.org/10.1117/12.2245929
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image restoration

Associative arrays

Image processing

Visualization

Image quality

Cameras

Convolution

Back to Top