Polynomial computations for blind image deconvolution
From MaRDI portal
Publication:281962
DOI10.1016/j.laa.2015.10.010zbMath1357.68285OpenAlexW2127804996MaRDI QIDQ281962
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
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (4)
Structured matrix methods computing the greatest common divisor of polynomials ⋮ The Sylvester Resultant Matrix and Image Deblurring ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ The Sylvester and Bézout resultant matrices for blind image deconvolution
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Blind image deconvolution using a banded matrix method
- The computation of multiple roots of a polynomial
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- Blind image deconvolution through Bezoutians
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- Certified approximate univariate GCDs
- Self-scaling fast rotations for stiff and equality-constrained linear least squares problems
- Structured matrix methods for the computation of multiple roots of a polynomial
- A method for structured linear total least norm on blind deconvolution problem
- Direct Blind Deconvolution
- QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
- The Sylvester Resultant Matrix and Image Deblurring
- Blind image deconvolution via fast approximate GCD
- On the Perturbation of LU, Cholesky, and QR Factorizations
- On the Method of Weighting for Equality-Constrained Least-Squares Problems
- Structured Total Least Norm for Nonlinear Problems
- Linear and Nonlinear Image Deblurring: A Documented Study
- Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm
- Total Least Norm Formulation and Solution for Structured Problems
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- A greatest common divisor approach to blind super-resolution reconstruction of images
This page was built for publication: Polynomial computations for blind image deconvolution
