Polynomial computations for blind image deconvolution

DOI10.1016/J.LAA.2015.10.010MaRDI QIDQ281962zbMATH OpenOpenAlexFDO

Authors Joab R. Winkler

Publication date 11 May 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2015.10.010

zbMATH Keywords

structured matricesblind image deconvolutionSylvester resultant matrix

Mathematics Subject Classification ID

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

Recommendations

• Blind image deconvolution via fast approximate GCD
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials
• Blind image deconvolution using a banded matrix method
• Blind image deconvolution through Bezoutians
• scientific article; zbMATH DE number 4047573

Cites work

• scientific article; zbMATH DE number 3839766 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 1262453 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• A Kronecker approximation with a convex constrained optimization method for blind image restoration
• A fast algorithm for approximate polynomial gcd based on structured matrix computations
• A greatest common divisor approach to blind super-resolution reconstruction of images
• A method for structured linear total least norm on blind deconvolution problem
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
• An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
• Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm
• Blind image deconvolution through Bezoutians
• Blind image deconvolution using a banded matrix method
• Blind image deconvolution via fast approximate GCD
• Certified approximate univariate GCDs
• Direct blind deconvolution
• Linear and Nonlinear Image Deblurring: A Documented Study
• On the Method of Weighting for Equality-Constrained Least-Squares Problems
• On the Perturbation of LU, Cholesky, and QR Factorizations
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• Self-scaling fast rotations for stiff and equality-constrained linear least squares problems
• Structured Total Least Norm for Nonlinear Problems
• Structured matrix methods for the computation of multiple roots of a polynomial
• Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
• The Sylvester Resultant Matrix and Image Deblurring
• The computation of multiple roots of a polynomial
• Total Least Norm Formulation and Solution for Structured Problems
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials

Cited in

(9)

• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials
• Blind polynomial evaluation and data trading
• Blind image deconvolution using a banded matrix method
• Algorithm and constraints for exact non-blind deconvolution
• The Sylvester and Bézout resultant matrices for blind image deconvolution
• Structured matrix methods computing the greatest common divisor of polynomials
• Blind image deconvolution via fast approximate GCD
• The Sylvester Resultant Matrix and Image Deblurring

Describes a project that uses

Uses Software

• MultRoot

This page was built for publication: Polynomial computations for blind image deconvolution

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