Blind image deconvolution via Hankel based method for computing the GCD of polynomials

DOI10.1016/j.matcom.2017.07.008zbMath1484.94005OpenAlexW2743379245MaRDI QIDQ1996974

Skander Belhaj, Haithem Ben Kahla, Maher Moakher, Marwa Dridi

Publication date: 1 March 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2017.07.008

zbMATH Keywords

fast Fourier transformHankel matrixblind image deconvolutionapproximate GCDtriangular Toeplitz inversion

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, Using skeleton and Hough transform variant to correct skew in historical documents

Uses Software

• Matlab
• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on computing the inverse of a triangular Toeplitz matrix
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• Blind image deconvolution through Bezoutians
• Computing the block factorization of complex Hankel matrices
• Quasi-gcd computations
• Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
• Approximate GCD and its application to ill-conditioned algebraic equations
• Computation of approximate polynomial GCDs and an extension
• Computing the polynomial remainder sequence via Bézout matrices
• A structured rank-revealing method for Sylvester matrix
• A fast method to block-diagonalize a Hankel matrix
• Structured total least norm and approximate GCDs of inexact polynomials
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• Blind image deconvolution via fast approximate GCD
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
• Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
• The approximate GCD of inexact polynomials
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• Fast inversion of triangular Toeplitz matrices
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies