We present a phase shifting robust method for irregular and unknown phase steps. The method is formulated as the minimization of a half-quadratic (robust) regularized cost function for simultaneously computing phase maps and arbitrary phase shifts. The convergence to, at least, a local minimum is guaranteed. The algorithm can be understood as a phase refinement strategy that uses as initial guess a coarsely computed phase and coarsely estimated phase shifts. Such a coarse phase is assumed to be corrupted with artifacts produced by the use of a phase shifting algorithm but with imprecise phase steps. The refinement is achieved by iterating alternated minimization of the cost function for computing the phase map correction, an outliers rejection map and the phase shifts correction, respectively. The method performance is demonstrated by comparison with standard filtering and arbitrary phase steps detecting algorithms.
©2006 Optical Society of America
OSA Recommended Articles
OSA participates in Crossref's Cited-By Linking service. Citing articles from OSA journals and other participating publishers are listed here.
Alert me when this article is cited.
Equations on this page are rendered with MathJax. Learn more.