Comparative study of iterative deconvolution algorithms
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 192-195
- https://doi.org/10.1109/icassp.1978.1170394
Abstract
It is shown that a number of well known iterative deconvolution algorithms are closely related members of a general class. This point of view leads to new understanding of previous approaches and to a new algorithm that incorporates both a finite interval constraint and a positivity constraint on the output of the deconvolution process. Examples are given to illustrate performance on gamma-ray spectra. Author(s) Mersereau, R. Georgia Institute of Technology, Atlanta, GA, USA Schafer, R.W.Keywords
This publication has 7 references indexed in Scilit:
- Deconvolution when the convolution kernel has no inverseIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A new algorithm in spectral analysis and band-limited extrapolationIEEE Transactions on Circuits and Systems, 1975
- Image Enhancement and RestorationPublished by Springer Nature ,1975
- Super-resolution through Error Energy ReductionOptica Acta: International Journal of Optics, 1974
- A digital signal processing approach to interpolationProceedings of the IEEE, 1973
- Resolution Enhancement of Spectra*Journal of the Optical Society of America, 1970
- Zum Einfluß der Spaltbreite auf die Intensitätsverteilung in Spektrallinien. IIZeitschrift für Physik, 1931