一种时间相位展开算法

An algorithm of temporal phase unwrapping

时间相位展开是使光栅条纹的频率随着时间而变化,每一像素点的相位沿着时间轴进行相位展开.现有的时间相位展开算法主要有线性、拟合线性、拟合指数、拟合负指数、拟合简约等时间相位展开算法;提出了一种减少投影帧数的方法.该方法只需投影三套不同频率的条纹,极大降低了数据的获取量和数据的处理时间;同时,在一定条件下不会降低测量精度.还对其高精度测量范围从理论和模拟两个方面进行了讨论,并将相同情况下该算法与其它算法恢复结果进行比较.

The idea of temporal phase unwrapping is that the grating fringe pitch is changed over time. Phase unwrapping is then carried out along the time axis for each pixel independently. The existing algorithms of temporal phase unwrapping mainly have liner, fitting liner, fitting exponential, fitting negative exponential, fitting contracted and so on; A method of reducing projected frames has been proposed here. Only three wrapped phase values of different frequencies are required to do the phase unwrapping, reducing needed datas and operation time; on the other hand, the accuracy is not reduced. We investigate the range of its high accurate measurement by theoretical analysis and simulative experiment, and compare the unwrapped results of this algorithm with that of some other algorithms.