Fast two-dimensional phase-unwrapping algorithm based on sorting by reliability following a noncontinuous path.

813 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The Grid Method for In‐plane Displacement and Strain Measurement: A Review and Analysis (2016, methodology): “There is a broad literature describing various tools for automatically unwrapping phases, since the same problem occurs in fringe processing, [86, 87, 88, 89, 90, 91, 92, 93, 94, 95] for instance.”
Quality-guided phase unwrapping technique: comparison of quality maps and guiding strategies. (2011, background): “…or reliability map from optical metrology [16,18], pseudo correlation coefficient map [28], phase derivative variance map [29], maximum phase gradient map [28], first phase difference map [16], second phase difference map [19,30,31], and amplitude map or ridge map from transform methods [16,21,22].”
Real-time structured light profilometry: a review (2016, methodology): “Examples of theoretical principles that have 431 been used to solve the two-dimensional phase unwrapping problem include the following: multi432 level or discrete quality maps [90,91], Bayesian approaches [92], Markov random fields [93], 433 region growing algorithms [94], neural networks [95], gene”
Fast and robust three-dimensional best path phase unwrapping algorithm. (2007, neutral): “© 2007 Optical Society of America OCIS codes: 100.2650, 120.5050, 100.5070.”