Comparison of the three phase unwrapping algorithm based on the algorithm of Path tracking
Liao We · Jiguang zazhi · 2014
In order to recover the noisy and under-sampled area wrapped phase map rapidly and accurately, the algorithm of Branch cutting method(BC), Quality oriented method(QG) and the algorithm of Diamond method(RA)are compared through theoretical analysis, computer simulation and experimental verification. The results show that the algorithm of RA is the fastest, the algorithm of LS-LS is followed by BC, and the algorithm of QG is the slowest. The algorithm of BC and The algorithm of RA are not fit to solve the problem of containing strong noise and undersampling wrapped phase diagram. The algorithm of QG is relatively good, but the running time is relatively long, not suitable for real-time processing, So We should choose different algorithms according to the different requirements of the specific practical problems.