Perfect blind restoration of images blurred by multiple filters: theory and efficient algorithms

  • Authors:
  • G. Harikumar;Y. Bresler

  • Affiliations:
  • Motorola Internet & Networking Group, Mansfield, MA;-

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 1999

Quantified Score

Hi-index 0.02

Visualization

Abstract

We address the problem of restoring an image from its noisy convolutions with two or more unknown finite impulse response (FIR) filters. We develop theoretical results about the existence and uniqueness of solutions, and show that under some generically true assumptions, both the filters and the image can be determined exactly in the absence of noise, and stably estimated in its presence. We present efficient algorithms to estimate the blur functions and their sizes. These algorithms are of two types, subspace-based and likelihood-based, and are extensions of techniques proposed for the solution of the multichannel blind deconvolution problem in one dimension. We present memory and computation-efficient techniques to handle the very large matrices arising in the two-dimensional (2-D) case. Once the blur functions are determined, they are used in a multichannel deconvolution step to reconstruct the unknown image. The theoretical and practical implications of edge effects, and “weakly exciting” images are examined. Finally, the algorithms are demonstrated on synthetic and real data