Abstract
In this paper, we study a blind deconvolution problem by using an image decomposition technique. Our idea is to make use of a cartoon-plus-texture image decomposition procedure into the deconvolution problem. Because cartoon and texture components can be represented differently in images, we can adapt suitable regularization methods to restore their components. In particular, the total variational regularization is used to describe the cartoon component, and Meyer’s G-norm is employed to model the texture component. In order to obtain the restored image automatically, we also use the generalized cross validation method efficiently and effectively to estimate their corresponding regularization parameters. Experimental results are reported to demonstrate that the visual quality of restored images by using the proposed method is very good, and is competitive with the other testing methods.
Original language | English |
---|---|
Pages (from-to) | 541-562 |
Number of pages | 22 |
Journal | Multidimensional Systems and Signal Processing |
Volume | 27 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Apr 2016 |
Scopus Subject Areas
- Software
- Signal Processing
- Information Systems
- Hardware and Architecture
- Computer Science Applications
- Artificial Intelligence
- Applied Mathematics
User-Defined Keywords
- Alternating minimization
- Blind deconvolution
- Cartoon
- Image decomposition
- Regularization
- Texture
- Total variation