用于可靠性导向相位展开的快速算法

Fast algorithm for reliability-guided phase unwrapping

在目前的可靠度导向相位展开算法中,排序操作非常费时。为此提出了一种采用查找表的可靠度导向相位展开快速算法。将可靠度值以一定等级量化从而建立一张查找表。在相位展开过程中,通过查表将相位待展开的点放到一个虚拟队列(等同于洪水算法中的有序队列)中,再进行相位展开。由于采用查表代替了排序操作,相位展开速度获得了极大的提高。实验表明:查表法的速度通常比洪水算法(典型的可靠度导向相位展开算法)快20多倍,而相位展开成功率与洪水算法相差无几。尤其在可靠度分布比较分散情况下,查表法比洪水算法快100多倍。

Since the sorting operation is time-consuming in current reliability-guided phase unwrapping algorithm, a fast algorithm looking up table is proposed. The look-up table was created by quantizing the values of reliability to specify grades before phase unwrapping. By looking up this table, the points whose phase needs to be unwrapped were put into a virtual queue, which is equal to the ordered queue in Flood Fill algorithm. The speed of phase unwrapping is increased greatly because the ordered queue in this algorithm is developed by using look-up operation instead of sorting operation. Experimental results show that speed of the proposed algorithm is over 20 times faster than that of Flood Fill algorithm. On the other hand, the success rates of them are almost same. Especially, if reliability value is dispersive, the former is more than 100 times faster than the latter.