Abstract
A new method is proposed for estimating an image from two of its distorted versions without the a priori knowledge of the distortion functions. In z-domain, the original image can be regarded as the greatest common polynomial divisor between the distorted versions. With the assumption that the distortion filters are FIR and relatively co-prime, this becomes a problem of taking the greatest common divisor (GCD) of two or more two-dimensional polynomials. Exact GCD is not desirable because even extremely small variations due to quantization error or additive noise will destroy the integrity of the polynomial system and lead to a trivial solution. Our method of blind image deconvolution translates the two-dimensional GCD problem into a robust one-dimensional Sylvester-type GCD algorithm. Experimental results show that it is computationally efficient and moderately noise robust.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
