Pages that link to "Item:Q2946534"
From MaRDI portal
The following pages link to Blind image deconvolution via fast approximate GCD (Q2946534):
Displaying 10 items.
- Polynomial computations for blind image deconvolution (Q281962) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- Blind image deconvolution through Bezoutians (Q729853) (← links)
- Factorization results for left polynomials in some associative real algebras: state of the art, applications, and open questions (Q1713132) (← links)
- The Sylvester and Bézout resultant matrices for blind image deconvolution (Q1799667) (← links)
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- The Sylvester Resultant Matrix and Image Deblurring (Q2945991) (← links)
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation (Q6615409) (← links)