Blind image deconvolution using a banded matrix method

Authors:
Antonios Danelakis;Marilena Mitrouli;Dimitrios Triantafyllou
Affiliations:
Department of Informatics & Telecommunications, University of Athens, Athens, Greece;Department of Mathematics, University of Athens, Athens, Greece 15784;Section of Mathematics & Engineering Sciences, Department of Military Sciences, Hellenic Army Academy, Vari, Greece
Venue:
Numerical Algorithms
Year:
2013

Citing 15
Cited 0

Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform

SIAM Journal on Scientific Computing
Digital Image Processing

Digital Image Processing
A new matrix approach to real FFTs and convolutions of length 2k

Computing
Regularization in Regression with Bounded Noise: A Chebyshev Center Approach

SIAM Journal on Matrix Analysis and Applications
Local Adaptivity to Variable Smoothness for Exemplar-Based Image Regularization and Representation

International Journal of Computer Vision
Fast Fourier Transforms: for fun and profit

AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
Numerical Linear Algebra and Applications, Second Edition

Numerical Linear Algebra and Applications, Second Edition
Alternating Krylov subspace image restoration methods

Journal of Computational and Applied Mathematics
An analytical constant modulus algorithm

IEEE Transactions on Signal Processing
Bussgang blind deconvolution for impulsive signals

IEEE Transactions on Signal Processing
A novel blind deconvolution scheme for image restoration usingrecursive filtering

IEEE Transactions on Signal Processing
Total variation blind deconvolution

IEEE Transactions on Image Processing
Blind image deconvolution using a robust GCD approach

IEEE Transactions on Image Processing
Pointwise Shape-Adaptive DCT for High-Quality Denoising and Deblocking of Grayscale and Color Images

IEEE Transactions on Image Processing
Fast fixed-point neural blind-deconvolution algorithm

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the blind image deconvolution problem in the presence of noise and measurement errors. We use a stable banded matrix based approach in order to robustly compute the greatest common divisor of two univariate polynomials and we introduce the notion of approximate greatest common divisor to encapsulate the above approach, for blind image restoration. Our method is analyzed concerning its stability and complexity resulting to useful conclusions. It is proved that our approach has better complexity than the other known greatest common divisor based blind image deconvolution techniques. Examples illustrating our procedures are given.