首页> 外文期刊>Applied optics >Clustering-based robust three-dimensional phase unwrapping algorithm
【24h】

Clustering-based robust three-dimensional phase unwrapping algorithm

机译:基于聚类的鲁棒三维相位解缠算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Relatively recent techniques that produce phase volumes have motivated the study of three-dimensional (3D) unwrapping algorithms that inherently incorporate the third dimension into the process. We propose a novel 3D unwrapping algorithm that can be considered to be a generalization of the minimum spanning tree (MST) approach. The technique combines characteristics of some of the most robust existing methods: it uses a quality map to guide the unwrapping process, a region growing mechanism to progressively unwrap the signal, and also cut surfaces to avoid error propagation. The approach has been evaluated in the context of noncontact measurement of dynamic objects, suggesting a better performance than MST-based approaches.
机译:产生相体积的相对较新的技术激励了对三维(3D)展开算法的研究,该算法固有地将三维纳入了过程。我们提出了一种新颖的3D解包算法,可以将其视为最小生成树(MST)方法的概括。该技术结合了一些最强大的现有方法的特性:它使用质量图来指导展开过程,使用区域生长机制来逐步展开信号,并切割表面以避免错误传播。该方法已在动态对象的非接触式测量中进行了评估,表明其性能优于基于MST的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号