Hierarchical quality-guided phase unwrapping algorithm

2019 
A hierarchical quality-guided phase unwrapping algorithm in a shared memory environment is proposed. First, the wrapped phase is divided into regular blocks, and local wrap counts of every block are obtained by a quality-guided strategy. Then, the gradient of the block wrap counts of adjacent blocks and the quality of every block are defined by the boundary local wrap counts of every block. Each block’s data can be regarded as an abstract phase point, and the quality-guided strategy can be used again to solve the block wrap counts of each block. Finally, the absolute wrap counts of each phase point are obtained by adding local wrap counts and corresponding block wrap counts, and then the final unwrapped phase is obtained. The performance of the proposed algorithm is verified through an unwrapping experiment performed on simulated data and the real interferometric synthetic aperture sonar wrapped phase in a shared memory environment. The results show that the proposed method greatly improves phase unwrapping efficiency while maintaining the correctness of unwrapped results.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    13
    References
    3
    Citations
    NaN
    KQI
    []