首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 156 毫秒
1.
提出了一种基于二维连续小波变换的电子散斑干涉(ESPI)条纹图相位提取方法。通过检测二维小波脊确定条纹相位,并引入条纹频率作为向导,有效地避免了相位解调过程中的符号奇异性问题,从而使该算法既能处理开条纹图也能处理闭条纹图,且对散斑噪声具有较强的抑制能力。数值模拟和实验结果表明,该方法在抑制散斑噪声的同时能够有效地提取出条纹相位,对开条纹图和闭条纹图都能处理。  相似文献   

2.
时间维相位重建的改进算法   总被引:5,自引:2,他引:3  
彭翔  杨昭亮  牛憨笨 《光子学报》2004,33(7):880-883
提出了一种时间维-相位重建的改进算法:利用折叠位相图进行时间相位展开以提高算法效率;推导并调整了基于时间相位展开算法初始条件从而减少所需的二维编码条纹图,增加了算法的实时性.从而可以更加有效地解决深度表面不连续和存在隔离物表面拓扑结构的景物相位重建问题.实验结果证明了本文所提出算法的可行性及有效性.  相似文献   

3.
提出了一种时空结合的三频时间相位展开方法,提高了三频时间相位展开方法的抑噪能力和相位展开的可靠度。在所提方法中,用灵敏度大于1的条纹代替传统三频时间相位展开法中灵敏度为1的条纹。通过计算这些条纹的截断相位,对其进行空间相位展开,并利用这些展开相位来指导其他两帧高灵敏度截断相位图的展开。与传统三频时间相位展开方法相比,在最高灵敏度条纹空间频率相同的情况下,所提方法缩小了三套条纹之间的频率倍数差,进而减小了噪声对相位展开的影响,提高了三频时间相位展开的可靠度和精度。  相似文献   

4.
在所有基于条纹分析的光学测量中,相位展开问题是难以避免的问题。所有传统的相位展开方法的共同点都是在相主值图中通过邻域内相主值差和寻找无噪声的相位展开路径来完成的。如果不利用整幅图像像素间的联系,则误差会沿展开路径传播。根据人眼识别栅线图周期的过程提出了一种与以往完全不同的相位展开方法。经过初步提取周期分界线、修补分界线和根据分界线确定周期三个步骤即可完成相位展开过程。该算法的原理简单明了,实现起来相对简单,只需单幅条纹图像即可得到周期,因而可用于动态测量。实验结果验证了该算法的可行性。  相似文献   

5.
为快速获取空间不连续三维物体表面的绝对相位,提出了一种基于编码光栅的相位展开方法。该方法只需投射一幅带有编码信息的光栅条纹图像,即可获取相位展开所必需的条纹级数信息,从而得到整个被测表面的绝对相位信息。根据相位-深度关系,可获得整个被测表面的三维信息。与基于格雷码的相位展开方法相比,该方法不依赖被测物体的灰度信息,抗噪声性能更好。该方法只需额外投射一幅编码条纹图像,更适用于对实时性要求比较高的三维测量。通过实验证明了该方法的有效性和可行性。  相似文献   

6.
张芳  刘文耀  李磊  任丽  袁理 《光学学报》2008,28(8):1475-1479
去除电子散斑十涉条纹图中的噪声是提取条纹图相位的关键问题.利用热传导方程去除条纹图中的噪声,定性和定量分析了该方法的滤波性能.在此基础上,进一步将MBO算法和热传导方程应用于条纹二值化和相位图平滑过程中,并成功地从单幅模拟条纹图中提取了条纹图的相位.研究结果表明,热传导方程能有效减少散斑条纹图中的噪声,改善二值条纹图的边界.进而获得准确的相位分布.  相似文献   

7.
相位去包裹问题广泛存在于条纹投影形貌测量中。提出了一种相移编码去包裹方法,该方法在求解相位时使用多步相移法,并在额外的一幅编码图像中,将标记条纹级数的编码嵌入到相移量中。解码时,通过分析各像素点处不同相移的光强信息序列,可以求解该点处的编码相移量,从而获得绝对相位。该方法只需要少量图像,且可以逐点去包裹,适用于不连续物体的形貌测量,但是容易受到投影仪和相机的噪声影响。通过增加互补的编码条纹图像,提出了一种改进的相移编码去包裹方法,在实现不连续物体形貌测量的同时,显著增强了噪声鲁棒性。经过仿真分析和实验,验证了所提的相移编码去包裹方法的有效性。  相似文献   

8.
一种新的快速解相位方法   总被引:8,自引:5,他引:3  
盖绍彦  达飞鹏 《光学学报》2008,28(2):259-267
提出了一种快速可靠的4步相移编码-解相位算法。通过对中心条纹的光强进行摄动,将编码信息加入到基本相移光栅中,使4幅基本相移图不但包含了相位场主值信息,还包含了解相位所需的编码信息。建立了摄动度函数描述相移图的摄动信息进而得到编码信息,解出完整的相位值。对摄动度函数的误差和噪声进行分析,提出方向滤波方法来消除噪声,极大地减少了编码信息的误判情况。仿真和实验证实了本算法的可行性。与传统相移法相比,解相位的速度和可靠性得到明显的提高。  相似文献   

9.
减少条纹投影轮廓术的条纹图数量一直是本领域的研究热点。传统的时间相位解包裹算法,一般需要额外的条纹信息来确定条纹级次,导致条纹图数量过多。提出一种用于三维测量的快速相位解包裹算法,只需要N步标准相移正弦条纹图,就可以完成绝对相位的计算。首先,利用标准相移算法计算包裹相位和消除背景的掩膜;然后,直接利用包裹相位和掩膜,根据连通域标记算法计算条纹级次,进而求得绝对相位。该方法最少只需3幅条纹图,就可以完成三维测量,数据处理速度快。计算机仿真和实验结果验证了该方法的有效性和鲁棒性。  相似文献   

10.
为了解决在数字散斑干涉技术测量时,散斑干涉相位条纹图像中大量噪声对相位解包裹结果和精度产生严重影响的问题,介绍了一种条纹正余弦分解和频域低通滤波结合的方法,实现了散斑干涉相位条纹图的高精度滤波。该方法的基本思路是在对相位图像进行滤波处理前,先将相位图通过正余弦函数进行映射转换成两幅图,分别经过频域滤波,然后再合成为相位图。这种分解频域滤波方法可以在滤波的同时,有效保留相位跳变信息。实验结果表明:与传统的图像降噪方法相比,该方法能够在保留图像“尖峰”信息的基础上,较好地滤除图像中的散斑噪声,方法简单有效,有效解决了传统滤波方法应用在相位条纹图中,相图灰度信息丢失10%~40%的问题。  相似文献   

11.
A generalized temporal phase unwrapping algorithm is proposed for absolute phase measurement of object surfaces with complex topography. We first make comments on error analysis of various temporal phase unwrapping (TPU) algorithms and point out problems existing in these techniques. We present a generalized TPU algorithm (GTPU), which eliminates some limitations imposed on the fringe sequence for the classical TPU algorithms. So the desired number of fringes can be determined according to practical situation, leading to a flexible method for phase reconstruction. In addition, compared with the classical TPU algorithms, GTPU has better noise immunity and less computational complexity. Theoretical analysis and experiment results are presented to show the validity of the proposed algorithm.  相似文献   

12.
相位解码的时-空重建算法   总被引:1,自引:1,他引:0  
基于相位映射的三维传感技术对几何形状和拓扑结构复杂或表面梯度很大的物体进行绝对相位测量及相位重建仍然是一个困难的问题。近年来国际上提出了一种时间维度相位重建算法可以对此提供一种解决方案。然而,该算法对结构光照明系统提出了很高的要求,当系统无法满足算法要求时,重建结果存在严重的噪声。针对这一问题,提出了一种利用分段函数构造的相位解码的时空重建算法。该算法在相位重建过程中同时考虑时间维度和空间维度相位的相对关系,使得空间频率非严格按指数增长的条纹序列可以得到正确的重建,消除了跳变边界的相位模糊问题,从而可以更加有效地解决深度表面不连续和存在相互孤立物表面拓扑结构的景物相位重建问题。实验结果证明了此算法的可行性和有效性。  相似文献   

13.
Feng Chen  Xianyu Su 《Optik》2012,123(24):2272-2275
The phase unwrapping is a significant and difficult procedure for profilometry based on fringe. A new algorithm based on coded phase is proposed in this paper. It identifies the order of the fringe by projecting fringes with coded phase onto the object and performs fast phase unwrapping. The computer simulation and the experiment are presented to prove the feasibility and validity of the new algorithm.  相似文献   

14.
Yongguo Li  Jianqiang Zhu  Weixing Shen 《Optik》2008,119(11):545-547
This paper describes a path-following phase unwrapping algorithm and a phase unwrapping algorithm based on discrete cosine transform (DCT) which accelerates the computation and suppresses the propagation of noise. Through analysis of fringe pattern with serious noises simulated in mathematic model, we make a contrast between path-following algorithm and DCT algorithm. The advantages and disadvantages of analytical fringe pattern are also given through comparison of two algorithms. Three-dimensional experimental results have been given to prove the validity of these algorithms. Despite DCT phase unwrapping technique robustness and speed in some cases, it cannot be unwrapping inconsistencies phase. The path-following algorithm can be used in automation analysis of fringe patterns with little influence of noise.  相似文献   

15.
An improved phase unwrapping method is proposed to reduce the projection fringes in three-dimensional (3D) surface measurement. Color fringe patterns are generated by encoding with sinusoidal fringe and stair phase fringe patterns in red and blue channels. These color fringe patterns are projected onto the tested objects and then captured by a color CCD camera. The recorded fringe patterns are separated into their RGB components. Two groups of four-step phase-shifting fringe patterns are obtained. One group of the stripes are four sinusoidal patterns, which are used to determine the wrapped phase. The other group of stripes are four sinusoidal patterns with the codeword embedded into stair phase, whose stair changes are perfectly aligned with the 2π discontinuities of sinusoidal fringe phase, which are used to determine the fringe order for the phase unwrapping. The experimental results are analyzed and compared with those of the method in Zheng and Da (2012. Opt Express 20(22):24139–24150). The results show that the proposed method needs only four fringe patterns while having less error. It can effectively reduce the number of projection fringes and improve the measuring speed.  相似文献   

16.
This paper presents a novel optical method without phase unwrapping for subsurface flaw detection, based on the computer-vision reflection grating technique. In the setup, a computer-generated fringe pattern displayed on a computer-monitor is placed in front of the test object surface and forms a mirror image behind the reflective surface. The fringe pattern is perturbed according to the surface slope distribution. Unlike the current fringe pattern analysis techniques, which require one/several images, the analysis algorithm of the present method involves a sequence of fringe patterns having multiple frequencies to deduce the ‘pixel-slope’ information which is directly related to the surface slope of the test object. The novel method offers independent analysis for each pixel of the data array, and thus the problem of phase discontinuity in phase unwrapping can be eliminated. In this paper, experimental demonstration of the novel optical method to subsurface flaw detection is presented.  相似文献   

17.
There has been an increasing interest in the automation of fringe analysis over the last decade. In recent years a number of researchers have addressed the problem of automatic phase unwrapping in fringe analysis. The advent of phase stepping and the development of FFT techniques has moved the emphasis in automated techniques away from fringe tracking and towards fringe counting or scanning approaches, but a major difficulty with such scanning techniques has been their susceptibility to noise. However, several alternative noise-immune phase unwrapping strategies have been proposed, but these approaches have not addressed the problems caused by large scale discontinuities such as those produced by aliasing. Other methods have been developed which confront this last difficulty. This paper gives an overview of the phase unwrapping problem and describes fringe tracking, fringe scanning, noise-immune and region processing techniques that have been developed in the search for the fully automated solution.  相似文献   

18.
Phase unwrapping is one of the most challenging processes in many profilometry techniques. To sidestep the phase unwrapping process, Perciante et al. (2015) proposed a wrapping-free method to retrieve the phase based on the direct integration of the spatial derivatives of the fringe patterns. However, this method is only applicable to objects with phase continuity, so it may fail to handle fringe patterns containing complicated singularities such as noise, shadows, shears and surface discontinuities. In the light of this problems, a robust wrapping-free phase retrieval method is proposed that is based on the combined use of Perciante's method and the weighted least squares method. Two partial derivatives of the desired phase are obtained from the fringe patterns, while the carrier is eliminated using the direct phase difference method. The phase singularities are determined using a derivative variance correlation map (DVCM), and the weighting coefficient is obtained from the binary mask of the reverse DVCM. Simulations and experiments are conducted to prove the validity of the proposed method. The results are analyzed and compared with those of Perciante's method demonstrating that in addition to maintaining the advantage of sidestepping the phase unwrapping process, the proposed method is available for measuring objects with some types of singularities sources.  相似文献   

19.
基于图切割的相位展开   总被引:1,自引:1,他引:0  
王晋疆  吴明云  刘阳  常天宇  陈阳 《光子学报》2012,41(9):1130-1134
剪切散斑干涉术中,普遍采取相移法提取相位,只可得到被包裹的相位信息,进一步量化计算之前,必须展开相位,但是大量的散斑噪音使相位展开变得非常困难.本文提出基于图切割理论的相位展开算法,将相位展开等价于整数的最优估计问题,通过最小化能量函数展开相位,无需对散斑包裹相位图进行滤波,就可以从包含大量散斑噪音的包裹相位图中准确地提取出真实相位,极大程度地保留了相位包裹图中的细节信息.对于同一幅模拟的散斑包裹相位图,传统的质量导向枝切法和最小二乘法的均方根误差分别为11.7076和4.9775,新算法的均方根误差则为0.9459,数值模拟与实验结果均验证了新算法优良的抗噪性能.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号