Paper
2 October 1998 Smooth or abrupt: a comparison of regularization methods
Author Affiliations +
Abstract
In this paper we compare a new regularizing scheme based on the exponential filter function with two classical regularizing methods: Tikhonov regularization and a variant of truncated singular value regularization. The filter functions for the former methods are smooth, but for the latter discontinuous. These regularization methods are applied to the restoration of images degraded by blur and noise. The norm of the noise is assumed to be known, and this allows application of the Morozov discrepancy principle to determine the amount of regularization. We compare the restored images produced by the three regularization methods with optimal values of the regularization parameter. This comparison sheds light on how these different approaches are related.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Daniela Calvetti, Bryan Lewis, and Lothar Reichel "Smooth or abrupt: a comparison of regularization methods", Proc. SPIE 3461, Advanced Signal Processing Algorithms, Architectures, and Implementations VIII, (2 October 1998); https://doi.org/10.1117/12.325689
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image filtering

Matrices

Visualization

Optical filters

Condition numbers

Distortion

Iterative methods

RELATED CONTENT

Fast adaptive matting based on iterative solution
Proceedings of SPIE (March 17 2017)
Ghosting reduction method for color anaglyphs
Proceedings of SPIE (February 29 2008)
Computational frameworks for discrete Gabor analysis
Proceedings of SPIE (October 24 1997)
Adaptive de-blocking filter for low bit rate applications
Proceedings of SPIE (January 19 2006)

Back to Top