A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The problem of blind image deconvolution can be solved by computing approximate greatest common divisors (GCD) of polynomials. The bivariate polynomials corresponding to the z-transforms of several blurred images have an approximate GCD corresponding to the z-transform of the original image. Since blurring functions as cofactors have very low degree in general, this GCD will be of high degree. On the other hand, if we only have one blurred image and want to identify the original scene, thedoi:10.1145/1837934.1837967 dblp:conf/issac/LiYZ10 fatcat:xq5i7oiqo5gcrkbppxjmajxbzy