Blind image deconvolution using a robust GCD approach

@article{Pillai1999BlindID,
  title={Blind image deconvolution using a robust GCD approach},
  author={S. Unnikrishna Pillai and Ben Liang},
  journal={IEEE transactions on image processing : a publication of the IEEE Signal Processing Society},
  year={1999},
  volume={8 2},
  pages={
          295-301
        }
}
  • S. Pillai, Ben Liang
  • Published 1 February 1999
  • Mathematics
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
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 coprime, in the absence of noise, this becomes a problem of taking the greatest common divisor… 
View on PubMed
comm.toronto.edu
59 Citations
Highly Influential Citations
9
Background Citations
18
Methods Citations
19
Results Citations
1

Figures from this paper

59 Citations

Citation Type

Citation Type

Two-dimensional blind deconvolution using a robust GCD approach
  • S. Pillai, Ben Liang
  • Mathematics
    Proceedings of International Conference on Image Processing
  • 1997
TLDR
The breakdown of two-dimensional GCD into one-dimensional Sylvester-type GCD algorithms is justified, which lowers the computational complexity while maintaining the noise robustness.
Blind image deconvolution via fast approximate GCD
TLDR
A specialized algorithm for computing GCDs of polynomials to recover true images in two different cases is designed and can extract true images of hundreds by hundreds pixel images from blurred images in a few seconds.
Blind image deconvolution using the Sylvester matrix
TLDR
The effectiveness of the proposed solution is demonstrated by experimental results for the deblurred image and the blurring func- tion, and the results are compared with the state-of-the-art image deblurring algorithm.
A greatest common divisor approach to blind super-resolution reconstruction of images
TLDR
Results show that the proposed algorithm succeeds in estimating an HR image from noisy blurred observations in the case of relatively co-prime unknown blurring operators.
Blind image deconvolution via Hankel based method for computing the GCD of polynomials
Blind image deconvolution using approximate greatest common divisor and approximate polynomial factorisation
TLDR
This research study has developed a BID method for image restoration based on the approximate greatest common divisor algorithms, specifically, the approximate polynomial factorization (APF) algorithm of two polynomials that has better performance than all the other state-of-the-art methods.
Multiframe blind deconvolution of heavily blurred astronomical images.
A multichannel blind deconvolution algorithm that incorporates the maximum-likelihood image restoration by several estimates of the differently blurred point-spread function (PSF) into the…
Multichannel blind iterative image restoration
TLDR
A novel iterative algorithm based on recent anisotropic denoising techniques of total variation and a Mumford-Shah functional with the EVAM restoration condition included is proposed and performs well even on very noisy images and does not require an exact estimation of mask orders.
Polynomial computations for blind image deconvolution
Robust Multichannel Blind Deconvolution via Fast Alternating Minimization
TLDR
This work improves the MC idea by adding robustness to noise and stability in the case of large blurs or if the blur size is vastly overestimated, and forms blind deconvolution as an l1 -regularized optimization problem and seeks a solution by alternately optimizing with respect to the image and withrespect to blurs.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
A Novel Recursive Filtering Method for Blind Image Restoration
TLDR
A novel approach to the blind deconvolution problem for images is presented and a novel supportnding algorithm is also proposed for situations in which the exact object support is unknown.
Blind identification of multichannel FIR blurs and perfect image restoration
TLDR
This work establishes existence and uniqueness results which guarantee that single input/multiple-output FIR blurred images can be restored blindly, though perfectly in the absence of noise, using linear FIR filters.
Automatic multidimensional deconvolution
A multiple convolution (e.g., an image formed by convolving several individual components) is automatically deconvolvable, provided that its dimension (i.e., the number of variables of which it is a…
Efficient algorithms for the blind recovery of images blurred by multiple filters
  • G. Harikumar, Y. Bresler
  • Mathematics, Computer Science
    Proceedings of 3rd IEEE International Conference on Image Processing
  • 1996
TLDR
It is shown that the last step of restoring an image from its noisy convolutions with two or more unknown blur functions can be achieved by FIR filtering with a perfect reconstruction filter bank.
Deconvolution and phase retrieval with use of zero sheets
Recent developments in the application of zeros (of the analytically continued spectrum of a compact two-dimensional image) in solving deconvolution and phase retrieval problems are reviewed. New…
Systematic approach to two-dimensional blind deconvolution by zero-sheet separation
TLDR
The major algorithmic steps, where noise or numerical errors can cause problems, are explained, and where special noise-mitigating techniques can be used toward making blind de-convolution practical are explained.
Blur identification by the method of generalized cross-validation
TLDR
Experiments are presented which show that GVC is capable of yielding good identification results and a comparison of the GCV criterion with maximum-likelihood (ML) estimation shows theGCV often outperforms ML in identifying the blur and image model parameters.
Adaptive entropy-coded predictive vector quantization of images
TLDR
A simple adaptive buffer-instrumented implementation of this 2-D entropy-coded PVQ scheme which can accommodate the associated variable-length entropy coding while completely eliminating buffer overflow/underflow problems at the expense of only a slight degradation in performance is described.
Predictive Vector Quantization of Images
TLDR
Simulations on real images show significant improvement over the conventional DPCM and tree codes using these new techniques, and the strong robustness property of these coding schemes is also experimentally demonstrated.
Vector Predictive Coding of Speech at 16 kbits/s
TLDR
This paper proposes and analyzes a waveform coding system, adaptive vector predictive coding (AVPC), in which a low-dimensional vector quantizer is used in an adaptive predictive coding scheme.
...
1
2
3
4
...