CAJ | 학술논문

为了快速准确的对含有噪声和欠采样问题包裹位相图进行位相展开，本文采用理论分析与计算机模拟及实验验证相结合的方法，对基于路径跟踪算法的枝切法(BC)、质量导向的路径跟踪算法(QG)和菱形算法(RA)三种位相解包裹算法作了对比研究。结果表明：RA算法运行速度最快，BC算法次之，QG算法速度最慢；其中BC和RA算法对含有强噪声和欠采样的包裹位相图处理效果较差，QG算法效果相对较好，但这种算法运行的时间较长，不太适合处理实时性要求较高的问题。所以要根据具体实际问题对噪声、欠采样和实时性的不同要求来选取合适的算法。
위료쾌속준학적대함유조성화흠채양문제포과위상도진행위상전개，본문채용이론분석여계산궤모의급실험험증상결합적방법，대기우로경근종산법적지절법(BC)、질량도향적로경근종산법(QG)화릉형산법(RA)삼충위상해포과산법작료대비연구。결과표명：RA산법운행속도최쾌，BC산법차지，QG산법속도최만；기중BC화RA산법대함유강조성화흠채양적포과위상도처리효과교차，QG산법효과상대교호，단저충산법운행적시간교장，불태괄합처리실시성요구교고적문제。소이요근거구체실제문제대조성、흠채양화실시성적불동요구래선취합괄적산법。
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 relative-ly long, not suitable for real-time processing, So We should choose different algorithms according to the different re-quirements of the specific practical problems.