Abstract
The comparison of phase-unwrapping algorithms has been an enigma because there has been no quantitative means of comparison. Noting that unwrapping routines are sensitive to noise and the local gradient of the phase array as well as fringe modulation, we have linked unwrapping performance to the gradient of first failure of the algorithm. When the gradient of first failure is plotted versus the signal-to-noise ratio, this can be used as an indicator of which algorithm to use in a given situation without the need for user intervention during the measurement and calculation. This study introduces three algorithms developed for their trade-offs in speed versus pixel noise (pointwise) sensitivity. The algorithms developed have been applied to live, noisy measurement data and have been proven to be robust.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
