Name
Abstract | ||
|---|---|---|
The task of restoring an image that has been contaminated by blur and noise arises in many applications. When the blurring matrix (or equivalently, the point-spread function) is explicitly known, this task commonly is referred to as deconvolution. In many applications only an approximation of the blurring matrix is available. The restoration task then is referred to as blind deconvolution. This paper describes a family of blind deconvolution methods that allow a user to adjust the blurring matrix used in the computation to achieve an improved restoration. The methods are inexpensive to use; the major computational effort required for large-scale problems is the partial reduction of an available large symmetric approximate blurring matrix by a few steps of the symmetric Lanczos process. A real-time application to adaptive optics that requires fast blind deconvolution is described. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.cam.2020.113067 | Journal of Computational and Applied Mathematics |
Keywords | DocType | Volume |
Image restoration,Ill-posed problem,Lanczos tridiagonalization,Discrepancy principle | Journal | 382 |
ISSN | Citations | PageRank |
0377-0427 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. Dykes | 1 | 0 | 0.34 |
| R. Ramlau | 2 | 0 | 0.34 |
| Lothar Reichel | 3 | 453 | 95.02 |
| K.M. Soodhalter | 4 | 0 | 0.34 |
| R. Wagner | 5 | 0 | 0.34 |