一种并行加速改进的快速相位解包裹算法

针对Miguel等人提出的质量图引导相位解包裹算法中串行运算效率较低的缺点，构造了一种多个低可靠度区块并行合并的改进算法。在满足原始算法设计思想的前提下，对解包裹路径进行重新定义，并根据原始算法的解包裹路径非连续的特性，构建了一种低可靠度区块乱序合并的策略，使得多个低可靠度区块的合并任务可以同时进行。改进算法采用多线程软件架构，主线程负责循环遍历未处理的区块，子线程接收待处理的区块执行合并任务。实验结果表明，改进方法与原始算法的处理结果完全一致，而并行改进策略可有效利用计算机多核资源，使得相位解包裹算法的运行效率提高了50%以上。

Improved fast phase unwrapping algorithm based on parallel acceleration

Aiming at the shortcoming of low serial operational efficiency in the quality-map-guided phase-unwrapping algorithm proposed by Miguel, an improved algorithm for parallel merging of multiple low-reliability blocks is proposed. Under the condition that the original algorithm design idea is satisfied, the unwrapping path is redefined as the largest reliable edge of the block. In addition, based on the non-continuous characteristic of the unwrapping path of the original algorithm, a low-reliability block out-of-order merging strategy is proposed to make multiple merging tasks can be performed simultaneously. The improved algorithm uses a multi-threaded software architecture. The main thread is responsible for looping through the unprocessed blocks to check whether they meet the requirements of merging, and the child threads receive and perform the merge tasks. The experimental results show that the improved method is completely consistent with the processing results of the original algorithm, and the parallel improvement strategy can effectively use the computer's multi-core resources, so that the operational efficiency of the phase unwrapping algorithm is improved by more than 50%.