Blind image deconvolution using a banded matrix method (Q369456): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FFTW / rank | |||
Normal rank | |||
Revision as of 20:11, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Blind image deconvolution using a banded matrix method |
scientific article |
Statements
Blind image deconvolution using a banded matrix method (English)
0 references
24 September 2013
0 references
For the blind image deconvolution problem the method presented by the authors, is based on structured matrices of small band-width and, more precisely, on Sylvester matrices. It is a fast and stable algorithm computing the blurring function through the greatest common divisor and can handle in an efficient way error measures and noise.
0 references
blind image deconvolution
0 references
blurring function
0 references
greatest common divisor
0 references
banded matrix
0 references
univariate polynomial
0 references
convolution
0 references
algorithm
0 references
