Gradient methods for superresolution
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 917-920
- https://doi.org/10.1109/icip.1997.648116
Abstract
Conjugate gradient methods for superresolution are shown to accelerate convergence to the solution. The ill-posed nature of superresolution, combined with the fast convergence of the conjugate gradient algorithm, results in oscillatory artifacts or "null objects" which must be dealt with by regularization. We utilize a combination of Tikhonov-Miller regularization and positivity constraints as a means of regularizing the conjugate gradient algorithm.Keywords
This publication has 12 references indexed in Scilit:
- Methods for maximum-likelihood deconvolutionJournal of the Optical Society of America A, 1996
- Analysis of the limit to superresolution in incoherent imagingJournal of the Optical Society of America A, 1993
- The instability of some gradient methods for ill-posed problemsNumerische Mathematik, 1990
- Optical microscope tomography II Nonnegative constraint by a gradient-projection methodJournal of the Optical Society of America A, 1988
- The regularizing properties of the adjoint gradient method in ill-posed problemsUSSR Computational Mathematics and Mathematical Physics, 1986
- Unified Hilbert space approach to iterative least-squares linear signal restorationJournal of the Optical Society of America, 1983
- An iterative method for the extrapolation of band-limited functionsJournal of Mathematical Analysis and Applications, 1981
- Generalized Image Restoration by the Method of Alternating Orthogonal ProjectionsIEEE Transactions on Circuits and Systems, 1978
- A new algorithm in spectral analysis and band-limited extrapolationIEEE Transactions on Circuits and Systems, 1975
- Super-resolution through Error Energy ReductionOptica Acta: International Journal of Optics, 1974