Blind image deconvolution using a banded matrix method
DOI10.1007/s11075-012-9654-yzbMath1279.65026MaRDI QIDQ369456
Marilena Mitrouli, Antonios Danelakis, Dimitrios 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
algorithm; convolution; greatest common divisor; univariate polynomial; blind image deconvolution; banded matrix; blurring function
65F50: Computational methods for sparse matrices
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
65Y20: Complexity and performance of numerical algorithms
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Uses Software
Cites Work
- Unnamed Item
- Iterative methods for image deblurring: A Matlab object-oriented approach
- A new matrix approach to real FFTs and convolutions of length \(2^k\)
- Alternating Krylov subspace image restoration methods
- Greatest common divisors from generalized sylvester resultant matrices
- Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
- Regularization in Regression with Bounded Noise: A Chebyshev Center Approach
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Bussgang blind deconvolution for impulsive signals
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- A greatest common divisor approach to blind super-resolution reconstruction of images
- On rank and null space computation of the generalized Sylvester matrix