基于一维快速傅里叶变换的相位去包裹算法  

Phase Unwrapping Algorithm Based on One Dimension FFT

作　　者：韦春龙[1,2] 陈明仪 王之江[1,2] 

机构地区：[1]上海大学嘉定校区 [2]中国科学院上海光机所

出　　处：《中国激光》1998年第9期813-816,共4页Chinese Journal of Lasers

摘　　要：提出了一种新的相位去包裹算法，主要针对那些条纹数少，条纹质量相对较好，仅仅是由于少数低调制度点、散斑点、噪声或灰尘引起的去包裹失败的情形。该算法基于一维ＦＦＴ（快速傅里叶变换），简单且易于实现。A new phase unwrapping algorithm is presented. It is mainly used in the cases in which there are a few fringes and the quality of the fringes is relatively good, however, a failure of unwrapping is encountered only due to low modulation points and speckle points noises, or due to dusts. The algorithm is based on one dimension FFT. It is simple and easy to realize.

关 键 词：干涉术 条纹分析 FFT 去包裹算法 

分 类 号：TH744.3[机械工程—光学工程]