Blind image deconvolution using a banded matrix method

DOI10.1007/S11075-012-9654-YMaRDI QIDQ369456zbMATH OpenOpenAlexFDO

Authors Antonios Danelakis, Marilena Mitrouli, D. S. Triantafyllou

Publication date 24 September 2013

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-012-9654-y

zbMATH Keywords

algorithmbanded matrixblind image deconvolutionblurring functionconvolutiongreatest common divisorunivariate polynomial

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Review text

For the blind image deconvolution problem the method presented by the authors, is based on structured matrices of small band-width and, more precisely, on Sylvester matrices. It is a fast and stable algorithm computing the blurring function through the greatest common divisor and can handle in an efficient way error measures and noise.

Recommendations

• Blind image deconvolution via fast approximate GCD
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials
• Blind image deconvolution through Bezoutians
• Polynomial computations for blind image deconvolution
• The Sylvester and Bézout resultant matrices for blind image deconvolution

Cites work

• A greatest common divisor approach to blind super-resolution reconstruction of images
• A new matrix approach to real FFTs and convolutions of length \(2^k\)
• Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
• Alternating Krylov subspace image restoration methods
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Bussgang blind deconvolution for impulsive signals
• Greatest common divisors from generalized sylvester resultant matrices
• Iterative methods for image deblurring: A Matlab object-oriented approach
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• Numerical linear algebra and applications
• On rank and null space computation of the generalized Sylvester matrix
• Regularization in Regression with Bounded Noise: A Chebyshev Center Approach

Cited in

(12)

• Sparse matrix techniques applied to deconvolution
• Separation of variables and the computation of Fourier transforms on finite groups. II
• The Sylvester and Bézout resultant matrices for blind image deconvolution
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials
• Lanczos-based fast blind deconvolution methods
• Parametric PSF estimation based on recursive SURE for sparse deconvolution
• Polynomial computations for blind image deconvolution
• The Sylvester Resultant Matrix and Image Deblurring
• Blind image deconvolution via fast approximate GCD
• On eigenstructure-based direct multichannel blind image restoration
• Separation of variables and the computation of Fourier transforms on finite groups. II
• A wavelet-based multilevel approach for blind deconvolution problems

Describes a project that uses

Uses Software

• RestoreTools
• FFTW

This page was built for publication: Blind image deconvolution using a banded matrix method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q369456)