In this paper we present an algorithm, that is based on computing approximate greatest common divisors (GCD) of polynomials, for solving the problem of blind image deconvolution. Specifically, we design a specialized ...
详细信息
In this paper we present an algorithm, that is based on computing approximate greatest common divisors (GCD) of polynomials, for solving the problem of blind image deconvolution. Specifically, we design a specialized algorithm for computing the GCD of bivariate polynomials corresponding to z-transforms of blurred images to recover the original image. The new algorithm is based on the fast GCD algorithm for univariate polynomials in which the successive transformation matrices are upper triangulartoeplitz matrices. The complexity of our algorithm is O(n(2) log(n)) where the size of blurred images is n x n. All algorithms have been implemented in Matlab and experimental results with synthetically blurred images are included to illustrate the effectiveness of our approach. (C) 2017 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.
暂无评论