
Image decomposition‐based blind image deconvolution model by employing sparse representation
Author(s) -
Chen Huasong,
Wang Qinghua,
Wang Chunyong,
Li Zhenhua
Publication year - 2016
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2015.0734
Subject(s) - deblurring , artificial intelligence , sparse approximation , deconvolution , discrete cosine transform , piecewise , blind deconvolution , pattern recognition (psychology) , computer science , image (mathematics) , mathematics , image restoration , computer vision , image processing , algorithm , mathematical analysis
Conventional blind restoration methods often take consideration of images as a whole. However, an image may have different types of components, and each component has different morphology and properties. Using one model only can capture one part of images effectively, but fail to represent the others; the processing results by using conventional methods would lose some important features. In this study, a new sparse prior‐based blind image deconvolution model has been proposed by employing commonly considered image decomposition strategy which separates an image into cartoon (piecewise‐smooth part) and texture (the oscillating pattern part). On the basis of the different properties of cartoon and texture, it, respectively, regularises the texture with the sparsity of discrete cosine transform domain, and the cartoon with a combined term including framelet‐domain‐based sparse prior and a quadratic regularisation. Then a double alternating split Bregman iteration is proposed to address the proposed minimisation problem. It has been demonstrated that images can be recovered with high quality and more abundant features by authors’ proposed algorithm than other popular deblurring methods.