分段非均匀条纹生成方法及其在双频解相位中的应用

提出了一种描述图像像素和相位关系的分段函数,可以生成分段非均匀条纹,解决光栅测量系统倾斜投影时参考平面上条纹周期不均匀的问题。在利用双频解相位方法进行相位展开时,提出了一种条纹移动法,即将一种频率的条纹向右或向左移动 的整数倍,消除了投影双频分段非均匀条纹时得到相位展开结果的不连续性。对比其他非均匀条纹生成方法,分段非均匀条纹生成方法简单易行;双频分段非均匀条纹经过条纹移动后能够适用于双频解相位。对拱桥投影均匀条纹和分段非均匀条纹进行对比实验证明,投影分段非均匀条纹时测量精度得到了明显提高。     

正弦脉冲宽度调制条纹结合相位编码条纹的三维测量方法

提出了正弦脉宽调制和相位编码结合的一种三维形貌测量方法。这种方法离焦投影编码的两种条纹到被测对象上,使用相移算法,由正弦脉冲宽度调制条纹得到截断相位,由相位编码条纹解码得到条纹级次,从而恢复测量对象的三维形貌。实验结果证明了该方法有两个优点:(1)轻度离焦滤除了谐波从而能降低测量误差;(2)基于相位的编码方式能测量表面反射率不一物体。     

时空二值编码结构光三维成像中的亚像素匹配方法

在时空二值编码结构光三维成像系统中,一个投影仪像素通常与摄像机图像坐标系的多个像素对应。为提高系统的测量精度及数据密度,提出了一种适用于时空二值编码结构光三维成像系统的摄像机与投影仪图像亚像素匹配方法。根据测量系统的二维传递函数的低通滤波特性和时空二值编码方案,对摄像机采集的图像采用时间正弦拟合的方法求解每个像素处的相位。由于该相位与投影仪图像坐标成正比关系,所以可以实现摄像机与投影仪图像的亚像素匹配。实验结果表明该方法可将系统的测量精度提高1个数量级。在相同实验条件下的测量精度与相位测量轮廓术的相当。     

基于互补型格雷编码的离焦二元光栅相位展开方法

离焦投影使编码光图像黑白灰级跳变产生模糊而 造成二值化错误,导致相位级次解码 出错,影响相位展开。本文提出利用互补型格雷编码光计算相位级次,完成离焦二元光栅相 位展开。生成两种编码光序列,出现误码的位置相互交错,具有互补性。结合 两种互补性编码光图像进行相位展开,可有效避免编码光图像二值化错误所引起的误码影响 。对陡 变物体测量的结果表明,相位相对误差(RE)为1． 03％,误差峰谷值(PV)为0.24rad,均方差(RMS )为0.14rad。本文方法提高了离焦二元光栅测量精度 ,扩大了测量范围,尤其适用于陡变或不连续物体的三维面形测量。     

面向结构光三维测量的相位展开技术综述(特邀)

结构光三维形貌测量方法越来越多地应用于逆向工程、航空航天、生物医学、文物保护等领域。相位展开作为结构光三维测量中的一个关键环节对测量精度、速度和可靠性起着决定性作用。文中综述了相位展开技术的基本原理、国内外研究现状、各类方法的优缺点和未来发展方向。首先根据相位展开计算方法不同,将现有的用于结构光三维形貌测量技术的相位展开技术分为以下四类进行详细的介绍：时间相位展开技术、空间相位展开技术、基于深度学习的相位展开技术和其他相位展开技术;然后详细比较了各种技术的优缺点;最后总结了相位展开技术的特点并展望了该技术的未来研究方向。基于文中综述的内容,研究者们可用于了解各类相位展开技术的原理与进展,进而根据不同方法的特点对比结合应用需求和测量条件选择最有效的相位展开技术,实现三维形貌的精确测量。     

基于规则化条形图的相位展开方法

为了便捷和可靠的展开光栅投影相位轮廓术中的相位主值,提出一种基于规则化条形 图的相位展开方法。该方法将周期次数信息赋予规则化的辅助图像中,并投影到物体表面由 数字相机同步采集,再经过分析处理即可辅助相位主值展开。通过分析相位主值的跳变规则 来确定辅助图像的灰度分布,形成规则的条形辅助图,将其投影到物体表面,受到与相位场 相同的调制作用,再根据其灰度分布即可解出周期次数信息来引导相位主值展开,同时给出 了相位主值跳变位置附近周期次数的调整方法,整个测量过程仅需额外投影一幅预先编制的 条形辅助图像即可。仿真和真实实验证明了本方法的可行性和可靠性。与传统方法相比,本 文方法兼顾了相位展开的速度和可靠性。     

微分约束法红外条纹非均匀校正

红外成像过程中常出现条纹非均匀性噪声,基于场景的校正方法可以有效地减少条纹噪声的影响。本文提出了一种基于微分约束条纹非均匀噪声校正方法。首先分析了红外图像条纹非均匀噪声的灰度分布特性,根据图像在水平及竖直方向梯度的差异建模并构造惩罚函数;通过引入权重函数,对惩罚函数进行最优化推导求解得到校正图像。通过真实场景的实验,对校正结果的主客观分析表明本文方法较对比方法有所提升,对于图像的细节和边缘的破坏程度较小,同时本文方法运行更快并实现了硬件化测试。     

基于相位编码的三维测量技术研究进展

结构光作为一种非接触式主动三维测量方法得到了快速发展。基于结构光原理的相位编码方法将码字以相位的形式嵌入到条纹的强度中,由于使用相位而不是强度来确定码字,对表面对比度、环境光和相机噪声不敏感,具有较强的鲁棒性。文中回顾了基于相位编码的三维测量技术研究进展,综述了基于相位编码的三维测量原理,包括初始相位的设计方法、编码条纹的产生方法、相位计算方法、条纹级次的获取与校正以及最终绝对相位的获取,给出了相关的实验结果,并指出了相位编码方法中的优缺点。最后,讨论了该技术面临的挑战,并指出了该领域今后的发展方向。     

改进格雷码条纹投影三维测量方法

传统的格雷码加相移法已经广泛应用于三维测量,但是相位解包裹一般需要投影多幅格雷码条纹,如何实现快速、准确的三维测量仍具有一定挑战性。提出了一种基于几何约束的改进格雷码条纹投影三维测量方法,可以有效减少格雷码条纹的数量。为了实现高速条纹投影,使用二值抖动技术将8位正弦相移条纹转换为1位二值图像。总共使用六幅条纹图像,其中三幅相移条纹用于计算截断相位,三幅格雷码条纹用于对截断相位进行初步展开获得伪展开相位,最后利用几何约束对伪展开相位进行解包裹获得绝对相位。实验结果表明,所提方法可以有效地重建被测物体的三维形貌。     

采用二值化相位光瞳的光学扫描全息方法

为了降低对随机相位板的精度要求,提出在光学扫描全息系统中采用二值化相位光瞳对多层3维物体进行全息成像的方法,进行了相关的理论分析和数值模拟。结果表明,与采用连续随机相位光瞳函数的情况类似,采用二值化相位光瞳也能在图像重构时有效地消除模糊的离焦层图像;同时,重构图像的质量与采用的二值随机相位光瞳的随机度有关,当随机度不太低时,可得到质量能接受的重构图像。这一结果对于降低实验条件的要求是有帮助的。     

A model-based method for phase unwrapping

Presents a model-based phase unwrapping method which represents the unwrapped phase function by a truncated Taylor series and a residual function. An efficient, noniterative computational algorithm is also proposed for calculating the model parameters from the phase derivatives. Sample experimental results are shown to demonstrate the effectiveness of the algorithm for extracting unwrapped phase images from two-dimensional (2-D) magnetic resonance imaging (MRI) data.     

改进的阶梯相位去包裹算法研究

为减少投影条纹数量,提高测量速度,提出了一种 改进的阶梯相位去包裹算法。算法 采用彩色条纹投影测量物体三维形貌,将正弦和阶梯相位条纹分别输入彩色图像的红 色和蓝色通道构成彩色条纹,由DLP投影仪将四步相移彩色条纹投影到待测物体上,由彩色 CCD相机采集。利用颜色分离技术得到2组四步相移条纹图,其中一组为4幅正弦条纹,由四 步相移法求得正弦条纹包裹相位,另一组4幅阶梯相位编码条纹图,由与正弦条纹周期一致 的阶梯相位构成,经阶梯相位解码确定条纹级次,利用自校正算法去除条纹级次噪点后,实 现相位去包裹。进行了实际测量,结果表明,本方法 测量精度与采用四步相移法相当,但只需4幅条纹图,有效减少了投影和采集的条纹数量, 提高了测量速度。     

一种应用于动态数字全息的快速相位解包裹算法

为满足动态数字全息的实时、在线检测分析的需求,提出了一种应用于动态数字全息的快速相位解包裹算法。在充分考虑相位解包裹的精确性和运行时间的基础上,首先找出影响解包裹精确性的坏点,并进行标记;采用运行速度较快的中心点辐射解包裹算法,使解包裹路径避开这些坏点,并利用动态全息相位图在时域上的关联;在时域上设置解包裹路径,以解决不同帧的相位值在时域上的关联问题和坏点封闭区域的相位解包裹问题。实验结果表明,本文算法是合理和有效的,运行速度较快,解包裹的精确性较高。     

Residues cluster-based segmentation and outlier-detection method for large-scale phase unwrapping

2-D phase unwrapping is an important technique in many applications. However, with the growth of image scale, how to tile and splice the image effectively has become a new challenge. In this paper, the phase unwrapping problem is abstracted as solving a large-scale system of inconsistent linear equations. With the difficulties of large-scale phase unwrapping analyzed, L(0)-norm criterion is found to have potentials in efficient image tiling and splicing. Making use of the clustering characteristic of residue distribution, a tiling strategy is proposed for L(0)-norm criterion. Unfortunately, L(0)-norm is an NP-hard problem, which is very difficult to find an exact solution in a polynomial time. In order to effectively solve this problem, equations corresponding to branch cuts of L(0)-norm in the inconsistent equation system mentioned earlier are considered as outliers, and then an outlier-detection-based phase unwrapping method is proposed. Through this method, a highly accurate approximate solution to this NP-hard problem is achieved. A set of experimental results shows that the proposed approach can avoid the inconsistency between local and global phase unwrapping solutions caused by image tiling.     

Two-dimensional phase unwrapping using a block least-squares method

We present a block least-squares (BLS) method for two-dimensional (2-D) phase unwrapping. The method works by tessellating the input image into small square blocks with only one phase wrap. These blocks are unwrapped using a simple procedure, and the unwrapped blocks are merged together using one of two proposed block merging algorithms. By specifying a suitable mask, the method can easily handle objects of any shape. This approach is compared with the Ghiglia-Romero (1994) method and the Marroquin-Rivera (1995) method. On synthetic images with different noise levels, the BLS method is shown to be superior, both with respect to the resulting gray values in the unwrapped image as well as visual inspection. The method is also shown to successfully unwrap synthetic and real images with shears, fiber-optic interferometry images, and medical magnetic resonance images. We believe the new method has the potential to improve the present quality of phase unwrapped images of several different image modalities.     

使用区域重构技术的路径无关相位解包方法

相位解包在光学测量领域有着广泛的应用,其中路径相关类解包方法通常计算速度较快,但抗噪声能力较弱;而路径无关类方法的鲁棒性好,但大多存在迭代收敛慢、计算量大的问题。因此,将区域重构技术引入解包运算中,得到一种新的路径无关类解包方法。该方法对于矩形区域数据能够直接求解解包相位,无需迭代过程;设计了采样-重组加速方法使运算量大幅减小,计算速度优于同类解包方法;使用Gerchberg式迭代过程能够解决不规则孔径内的数据解包问题,可在少量迭代后收敛。通过仿真验证了该方法在矩形区域内的直接求解精度和加速法的效能,通过对实验数据的解包验证了算法处理不规则孔径数据的能力。     

A complementary binary code based phase unwrapping method

Phase unwrapping is used to establish the mapping relationship between camera and projector, which is one of the key technologies in fringe projection profilometry(FPP) based three-dimensional(3D) measurement. Although complementary Gray code assisted phase unwrapping technology can get a good result on the periodic boundary, it needs more coded images to obtain a high frequency fringe. Aiming at this problem, a complementary binary code assisted phase unwrapping method is proposed in this paper...     

Tracking myocardial motion from cine DENSE images using spatiotemporal phase unwrapping and temporal fitting

Displacement encoding with stimulated echoes (DENSE) encodes myocardial tissue displacement into the phase of the MR image. Cine DENSE allows for rapid quantification of myocardial displacement at multiple cardiac phases through the majority of the cardiac cycle. For practical sensitivities to motion, relatively high displacement encoding frequencies are used and phase wrapping typically occurs. In order to obtain absolute measures of displacement, a two-dimensional (2-D) quality-guided phase unwrapping algorithm was adapted to unwrap both spatially and temporally. Both a fully automated algorithm and a faster semi-automated algorithm are proposed. A method for computing the 2-D trajectories of discrete points in the myocardium as they move through the cardiac cycle is introduced. The error in individual displacement measurements is reduced by fitting a time series to sequential displacement measurements along each trajectory. This improvement is in turn reflected in strain maps, which are derived directly from the trajectories. These methods were validated both in vivo and on a rotating phantom. Further measurements were made to optimize the displacement encoding frequency and to estimate the baseline strain noise both on the phantom and in vivo. The fully automated phase unwrapping algorithm was successful for 767 out of 800 images (95.9%), and the semi-automated algorithm was successful for 786 out of 800 images (98.3%). The accuracy of the tracking algorithm for typical cardiac displacements on a rotating phantom is 0.24 +/- 0.15 mm. The optimal displacement encoding frequency is in the region of 0.1 cycles/mm, and, for 2 scans of 17-s duration, the strain noise after temporal fitting was estimated to be 2.5 +/- 3.0% at end-diastole, 3.1 +/- 3.1% at end-systole, and 5.3 +/- 5.0% in mid-diastole. The improvement in intra-myocardial strain measurements due to temporal fitting is apparent in strain histograms, and also in identifying regions of dysfunctional myocardium in studies of patients with infarcts.     

A novel phase unwrapping method based on network programming

Phase unwrapping is the reconstruction of a function on a grid given its values mod 2π. Phase unwrapping is a key problem in all quantitative applications of synthetic aperture radar (SAR) interferometry, but also in other fields. A new phase unwrapping method, which is a different approach from existing techniques, is described and tested. The method starts from the fact that the phase differences of neighboring pixels can be estimated with a potential error that is an integer multiple of 2π. This suggests the formulation of the phase unwrapping problem as a global minimization problem with integer variables. Recognizing the network structure underlying the problem makes for an efficient solution. In fact, it is possible to equate the phase unwrapping problem to the problem of finding the minimum cost flow on a network, for the solution of which there exist very efficient techniques. The tests performed on real and simulated interferometric SAR data confirm the validity of the approach