Fast and robust three-dimensional best path phase unwrapping algorithm
Fast and robust three-dimensional best path phase unwrapping algorithm
复制标题
DOI：
10.1364/ao.46.006623
复制
发表时间：
2007-09-10
期刊：
影响因子：
1.9
通讯作者：
Moore, Christopher J.
中科院分区：
文献类型：
--
作者：
Abdul-Rahman, Hussein S.;Gdeisat, Munther A.;Moore, Christopher J.
提出了一种新的三维(31)位相展开算法，用于三维位相体的展开。它依赖于质量贴图来首先展开最可靠的体素，最后展开最不可靠的体素。该技术遵循离散的展开路径来执行展开过程。该技术的性能在模拟和真实包裹相位图上进行了测试。与其他三维相位展开算法相比，该算法具有较好的鲁棒性和快速性。(C)2007年美国光学学会。
What we believe to be a novel three-dimensional (31)) phase unwrapping algorithm is proposed to unwrap 3D wrapped-phase volumes. It depends on a quality map to unwrap the most reliable voxels first and the least reliable voxels last. The technique follows a discrete unwrapping path to perform the unwrapping process. The performance of this technique was tested on both simulated and real wrapped-phase maps. And it is found to be robust and fast compared with other 3D phase unwrapping algorithms. (c) 2007 Optical Society of America.