On the computational model of a kind of deconvolution problem
It is known that discretization of a continuous deconvolution problem can alleviate the ill-posedness of the problem. The currently used circulant matrix model, however, does not play such a role. Moreover, the approximation of deconvolution problems by circulant matrix model is rational only if the...
| Veröffentlicht in: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 4(1995), 10 vom: 15., Seite 1464-7 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1995
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
| Schlagworte: | Journal Article |
| Zusammenfassung: | It is known that discretization of a continuous deconvolution problem can alleviate the ill-posedness of the problem. The currently used circulant matrix model, however, does not play such a role. Moreover, the approximation of deconvolution problems by circulant matrix model is rational only if the size of the kernel function is very small. We propose an aperiodic model of deconvolution. For discrete and finite deconvolution problems the new model is an exact one. In the general case, the new model can lead to a nonsingular system of equations that has a lower condition number than the circulant one, and the related computations in the deconvolution can be done efficiently by means of the DFT technique, as in the ease for circulant matrices. The rationality of the new model holds without regard to the size of the kernel and the image. The use of the aperiodic model is illustrated by gradient-based algorithms |
|---|---|
| Beschreibung: | Date Completed 02.10.2012 Date Revised 22.02.2008 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1057-7149 |