基于围线追踪的完全欧氏距离变换算法

AN ALGORITHM FOR COMPLETE EUCLIDEAN DISTANCE TRANFORMATION BASED ON CONTOUR TRACING

本文以吴立德等1996年文中提出的基于边过程的围线追踪算法为出发点，设计并实现了一个在二值图像中进行完全欧氏距离变换的算法．算法首先求出二值图像的围线，然后沿围线从近向远扩展地计算欧氏距离．算法能够计算精确的欧氏距离．对算法的时间和空间需求进行了简要的分析，讨论了算法的一些有关性质，并给出了实现程序运行中得到的一些实验数据．结果表明算法在多数情况下能够运行快，占用内存少，有较好的自适应性，因此有较好的实际应用前景．

On the basis of the crack based contour tracing algorithm, this paper gives an algorithm for complete Euclidean distance transformation on the binary im-ages. In the suggested algorithm the contours are solved, and Euclidean distances are computed according to an expanded mode. The exact distances are obtained.The requirements of time and space are analysed briefly, several properties are dis-cussed, and some test data in running of the implementation procedure are illustrat-ed. The results show that the algorithm is self-adaptive, runs fast, takes few mem-ory spaces, and applies to the practice conveniently.