Abstract
The branch-cut algorithm is a powerful noise-immune algorithm for two-dimensional phase unwrapping. Shorter branch-cuts lead to better results for the unwrapped phase. Herein, we propose a branch-cut algorithm with fast search ability for the shortest branch-cuts based on modified GA. First, the local-nearest-neighbor algorithm is used to pair the positive and negative residues so as to optimize the initial population. This step is fast but gives a local optimum. Next, a branch-cut algorithm based on modified GA is used to globally search the paired residues giving branch-cuts with the shortest total length. Finally, the phase is unwrapped while avoiding branch-cuts. The performance of the proposed algorithm is tested by both simulation and experiment, and the results demonstrate that it can rapidly find the branch-cuts with shortest total length and a high solution accuracy.
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.
