Blind image deconvolution through Bezoutians

DOI10.1016/j.cam.2016.10.021zbMath1391.94069OpenAlexW2549533573MaRDI QIDQ729853

Skander Belhaj, Gema Maria Diaz Toca

Publication date: 22 December 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.10.021

zbMATH Keywords

FFTgreatest common divisorsblind image deconvolutionBezout matrixBarnett's method

Mathematics Subject Classification ID

Factorization of matrices (15A23) Symbolic computation and algebraic computation (68W30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical approximation and computational geometry (primarily algorithms) (65D99) Toeplitz, Cauchy, and related matrices (15B05)

Related Items (3)

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

Uses Software

• Matlab

Cites Work

• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Bézoutians
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
• Blind image deconvolution via fast approximate GCD
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Structured Matrix Based Methods for Approximate Polynomial GCD
• Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices

This page was built for publication: Blind image deconvolution through Bezoutians