1 January 2005 Bayesian surface estimation for white light interferometry
Michael Hissmann, Fred A. Hamprecht
Author Affiliations +
Abstract
In conventional surface estimation using white light interferometry, data acquisition is followed by a preprocessing step in which the 3-D (space-time) data are reduced to a 2-D surface or height map. Finally, a postprocessing step eliminates the height outliers that arise from the preprocessing under ordinary experimental conditions. We introduce a Bayesian approach that unifies pre- and postprocessing by considering simultaneously both the full 3-D data set and knowledge concerning the surface smoothness. This knowledge is coded into the prior probability of local height configurations. The surface is estimated as the mode of the marginal posterior at each pixel. An adept formulation of the prior allows for the exact computation of the estimate, obviating the need to sample from the posterior using Markov chain Monte Carlo methods. A complete surface can thus be obtained in 3 to 30 s. A quantitative comparison with an (adaptive) median filter shows that all three approaches decimate outliers, but that the Bayesian estimation leads to smaller average absolute errors. For low scanning speeds and good raw data, this is due to a reduced tendency to oversmooth; for poor input data, the enhancement is explained by the more complete exploitation of the observations.
©(2005) Society of Photo-Optical Instrumentation Engineers (SPIE)
Michael Hissmann and Fred A. Hamprecht "Bayesian surface estimation for white light interferometry," Optical Engineering 44(1), 015601 (1 January 2005). https://doi.org/10.1117/1.1829651
Published: 1 January 2005
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital filtering

Error analysis

Data acquisition

Interferometers

Optical engineering

Optical filters

Optical interferometry

RELATED CONTENT


Back to Top