首页> 外文会议>International symposium on optoelectronic technology and application >Three-dimensional surface reconstruction based on a novel phase-unwrapping algorithm
【24h】

Three-dimensional surface reconstruction based on a novel phase-unwrapping algorithm

机译:基于新型相位展开算法的三维表面重构

获取原文

摘要

The phase unwrapping procedure is the most important step to achieve high accuracy, high resolution three-dimensional (3-D) shape data of objects. Among numerous techniques of phase unwrapping, the region-based algorithms are outstanding, which provide a trade-off between robustness and the computational complexity. However, there is indeed a weakness in the region-based algorithms that the unwrapped data may be incorrect due to the wrapped process generating the same wrapped data of two different areas. To overcome these problems, we propose a novel phase-unwrapping method which depended on region-based methods and quality guided techniques. First, in principle the whole procedure of generating, capturing images and three-step phase-shifting algorithm are introduced and analyzed in detail. Then, the size of the region can be calculated automatically to divide the wrapped image into homogenous areas. Afterwards, based on the method described here, a non-continuous region joining method is applied to reconstruct the continuous unwrapped phase map. In addition, Itoh and Iso phase-unwrapping methods are implemented to unwrap the phase data for the comparison and the results indicate that the proposed method can unwrap phase data accurately. At last, some reconstruction images are presented and the results are analyzed. Experimental results have demonstrated that the proposed algorithm can resolve the problems the Iso phase-unwrapping method encounter in complex wrapped phase cases.
机译:相位展开过程是获得对象的高精度,高分辨率三维(3-D)形状数据的最重要步骤。在众多的相位展开技术中,基于区域的算法非常出色,可以在鲁棒性和计算复杂性之间进行权衡。但是,基于区域的算法确实存在一个缺点,即由于包装过程生成了两个不同区域的相同包装数据,因此未包装的数据可能不正确。为了克服这些问题,我们提出了一种新颖的相位展开方法,该方法依赖于基于区域的方法和质量指导技术。首先,原则上详细介绍了生成,捕获图像和三步相移算法的整个过程。然后,可以自动计算区域的大小,以将包裹的图像划分为均匀的区域。然后,基于此处描述的方法,将非连续区域合并方法应用于重构连续展开的相位图。另外,采用Itoh和Iso相位解缠方法对相位数据进行解缠,进行比较,结果表明所提出的方法可以准确解缠相位数据。最后,给出了一些重建图像,并对结果进行了分析。实验结果表明,所提算法可以解决Iso相展开方法在复杂包裹相情况下遇到的问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号