Abstract
In this paper, we study a model for recovering edges in an underlying image from a single blurred image whose entries are only partially known on randomly distributed indices. In the proposed model, blurred image, the underlying image and convolution kernel are all unknowns to be solved. Besides the classical convolution-type data fitting term for image deblurring, our model incorporates nuclear norm prior for blurred image, a total variation (TV) regularization prior for recovering edges, and Tikhonov regularization prior for the blur kernel. We develop a proximal alternating minimization (PAM) iterative method to solve the model and establish its convergence. Efficient implementations are proposed for solving the subproblems arising from PAM iterations. Numerical results are reported to show the performance of our proposed approach is better than the method using TV regularization prior on the blur kernel.
Original language | English |
---|---|
Article number | 54 |
Number of pages | 25 |
Journal | Journal of Scientific Computing |
Volume | 89 |
Issue number | 3 |
Early online date | 17 Oct 2021 |
DOIs | |
Publication status | Published - Dec 2021 |
Scopus Subject Areas
- Software
- Theoretical Computer Science
- Numerical Analysis
- Engineering(all)
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics
User-Defined Keywords
- Blind deconvolution
- Incomplete blurred image
- Matrix completion
- Proximal alternating minimization