.png){kind=icon}
.png){kind=icon}
Return
A sparse proximal Newton splitting method for constrained image deblurring
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2013.06.027.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
It is a challenging task to recover a high quality image from the degraded images. This paper proposes a fast image deblurring algorithm. To deal with the limitations of the proximal Newton splitting scheme, a sparse framework is presented, which characterized by utilizing the sparse pattern of the approximated inverse Hessian matrix and relaxing the original assumption on the constant penalty parameter. The proposed framework provides a common update strategy by exploiting the second derivative information. To alleviate the difficulties introduced by the sub-problem of this framework, an approximate solution to the weighted norm based primal-dual problem is derived and studied. Moreover, its theoretical aspects are also investigated. Compared with the state-of-the-art methods in several numerical experiments, the proposed algorithm demonstrates the performance improvement and efficiency. Crown Copyright (C) 2013 Published by Elsevier B.V. All rights reserved.
Keywords:
Image deblurring
Optimization method
Total variation minimization
Proximal Newton splitting