Blind image deconvolution using a robust GCD approach

Research output: Contribution to journalArticle

Abstract

In this correspondence, a new viewpoint is proposed for estimating an image from its distorted versions in presence of noise without the a priori knowledge of the distortion functions. In z-domain, the desired image can be regarded as the greatest common polynomial divisor among the distorted versions. With the assumption that the distortion filters are finite impulse response (FIR) and relatively co-prime, in the absence of noise, this becomes a problem of taking the greatest common divisor (GCD) of two or more two-dimensional (2-D) polynomials. Exact GCD is not desirable because even extremely small variations due to quantization error or additive noise can destroy the integrity of the polynomial system and lead to a trivial solution. Our approach to this blind deconvolution approximation problem introduces a new robust interpolative 2-D GCD method based on a one-dimensional (1-D) Sylvester-type GCD algorithm. Experimental results with both synthetically blurred images and real motion-blurred pictures show that it is computationally efficient and moderately noise robust.

Original languageEnglish (US)
Pages (from-to)295-301
Number of pages7
JournalIEEE Transactions on Image Processing
Volume8
Issue number2
DOIs
StatePublished - Dec 1 1999

    Fingerprint

Keywords

  • Blind image deconvolution
  • Equalization
  • Image processing

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design

Cite this