The Sylvester Resultant Matrix and Image Deblurring
From MaRDI portal
Publication:2945991
DOI10.1007/978-3-319-22804-4_32zbMath1360.65078OpenAlexW2254026254MaRDI QIDQ2945991
Publication date: 15 September 2015
Published in: Curves and Surfaces (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/90558/1/winkler.pdf
Related Items
Polynomial computations for blind image deconvolution ⋮ The Sylvester and Bézout resultant matrices for blind image deconvolution ⋮ Structured low-rank approximation: optimization on matrix manifold approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial computations for blind image deconvolution
- Blind image deconvolution using a banded matrix method
- Constrained numerical optimization methods for blind deconvolution
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- On approximate GCDs of univariate polynomials
- Iterative methods for image deblurring: A Matlab object-oriented approach
- QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
- Blind image deconvolution via fast approximate GCD
- Deblurring Images
- An Algorithm for Scaling Matrices
- Structured Total Least Norm for Nonlinear Problems
- Total Least Norm Formulation and Solution for Structured Problems
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Numerical Analysis and Its Applications
This page was built for publication: The Sylvester Resultant Matrix and Image Deblurring