返回
Permuted Coordinate-Wise Optimizations Applied to Lp-Regularized Image Deconvolution
DOI:10.1109/TIP.2018.2825112.png)
摘要
En 中文
Image deconvolution is an ill-posed problem that usually requires prior knowledge for regularizing the feasible solutions. In the literature, iterative methods estimate an intrinsic image, minimizing a cost function regularized by specific prior information. However, it is difficult to directly minimize the constrained cost function, if a nondifferentiable regularization (e.g., the sparsity constraint) is employed. In this paper, we propose a nonderivative image deconvolution algorithm that solves the under-constrained problem (i.e., a non-blind image deconvolution) by successively solving the permuted subproblems. The subproblems, arranged in permuted sequences, directly minimize the nondifferentiable cost functions. Various L-p-regularized (0 < p <= 1, p = 2) objective functions are utilized to demonstrate the pixel-wise optimization, in which the projection operator generates simplified, low-dimensional subproblems for estimating each pixel. The subproblems, after projection, are dealt within the corresponding hyperplanes containing the adjacent pixels of each image coordinate. Furthermore, successively solving the subproblems can accelerate the deconvolution process with a linear speedup, by parallelizing the subproblem sequences. The image deconvolution results with various regularization functionals are presented and the linear speedup is also demonstrated with a parallelized version of the proposed algorithm. Experimental results demonstrate that the proposed method outperforms the conventional methods in terms of the improved signal-to-noise ratio and structural similarity index measure.
Keyword:
Non-blind deconvolution
coordinate descent method
convex optimization
L-p-norm
parallel computing
total variation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W

