Abstract
Branch cut method is a powerful noise-immune algorithm for correct phase unwrapping of noisy phase maps. The shortest branch cut length promises the optimal unwrapping result of the wrapped phase maps. A new algorithm is proposed to search for the shortest branch cut length by simple exchange operation. Although the algorithm is on the basis of stochastic search techniques, it has a high probability of finding the shortest branch cut length or an approximation of it. Compared with the traditional algorithms, the algorithm is fast and competitive.
Sign-in/Register to access full text options 
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.
