Blind image deconvolution via Hankel based method for computing the GCD of polynomials
type: Item
instance of: scholarly article
title: Blind image deconvolution via Hankel based method for computing the GCD of polynomials
zbMATH Open document ID: 1484.94005
author: Skander Belhaj
author: Haithem Ben Kahla
author: Marwa Dridi
author: M. Moakher
published in: Mathematics and Computers in Simulation
publication date: 2021-03-01T00:00:00Z
Mathematics Subject Classification ID: 94A08
Mathematics Subject Classification ID: 68U10
zbMATH DE Number: 7316151
zbMATH Keywords: approximate GCD
zbMATH Keywords: Hankel matrix
zbMATH Keywords: triangular Toeplitz inversion
zbMATH Keywords: fast Fourier transform
zbMATH Keywords: blind image deconvolution
describes a project that uses: Matlab
describes a project that uses: MultRoot
MaRDI profile type: Publication
full work available at URL: j.matcom.2017.07.008
OpenAlex ID: W2743379245
cites work: A fast method to block-diagonalize a Hankel matrix
cites work: Computing the block factorization of complex Hankel matrices
cites work: Computing the polynomial remainder sequence via Bézout matrices
cites work: A note on computing the inverse of a triangular Toeplitz matrix
cites work: Q5301644
cites work: Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
cites work: Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
cites work: Q4314299
cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
cites work: On Euclid's Algorithm and the Theory of Subresultants
cites work: Subresultants and Reduced Polynomial Remainder Sequences
cites work: &lt;tex&gt;$QR$&lt;/tex&gt;Factoring to Compute the GCD of Univariate Approximate Polynomials
cites work: Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
cites work: Blind image deconvolution through Bezoutians
cites work: Q4226974
cites work: Q4920836
cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
cites work: Q4227320
cites work: A structured rank-revealing method for Sylvester matrix
cites work: Blind image deconvolution via fast approximate GCD
cites work: Fast inversion of triangular Toeplitz matrices
cites work: Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
cites work: Approximate GCD and its application to ill-conditioned algebraic equations
cites work: Computation of approximate polynomial GCDs and an extension
cites work: Quasi-gcd computations
cites work: Structured total least norm and approximate GCDs of inexact polynomials
cites work: The calculation of the degree of an approximate greatest common divisor of two polynomials
cites work: QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
cites work: The approximate GCD of inexact polynomials
DOI: 10.1016/J.MATCOM.2017.07.008
Recommended article: Polynomial computations for blind image deconvolution
Recommended article: Blind image deconvolution via fast approximate GCD
Recommended article: Blind Image Deconvolution
Recommended article: A greatest common divisor approach to blind super-resolution reconstruction of images
Recommended article: Blind Deconvolution Using Convex Programming
Recommended article: Blind image deconvolution using a banded matrix method
Recommended article: Q5449209
Recommended article: An efficient computational approach for multiframe blind deconvolution
Recommended article: Blind Image Deblurring Using Spectral Properties of Convolution Operators
Recommended article: Blind image deconvolution through Bezoutians
description: scientific article; zbMATH DE number 7316151