.Modifled nearest neighbor phase unwrapping algorilthm[J].Optoelectronics Letters,2006,2(4):308-311 Modifled nearest neighbor phase unwrapping algorilthm CHEN Jia-feng CHEN Hai-qing YANG Zhen-gang [1]Institute of Optoelectronic Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China [2]Depart of Electronic and Information Engineering, South-Central University for Nationalities, VVuhan 430074, China Abstract:       Phase unwrapping is so important in interierometry that it determines the veraclty of the absolute phase value. Goldsteins branch-cut algorithm performs path-independent algorithm that uses a nearest neighbor heuristic to link and balance the residues based on identifying the residues. A modified nearest neighbor algorithm is presented based on the principle, the mathematic formula of the Goldsteins algorithm and indepth analysis of the key problem of phase unwrapping. It not only holds the advantage of the Goldsteins algorithm but also solves the problem that the Goldsteins algorithm is incapable to be used at high residue densities. Therefore, it extends the application of the Goldsteins algorithm and enhances the precision of phase unwrapping. Supported by Spaceflight Support Technology Fund Project (04 1. 3 JW05) Hits: 3443 Download times: 177 View Full Text    Download reader