关键词: 近似最小距离场, 2D二值图像, 像素编码, 聚类, 最短路径

Abstract: This paper proposes an algorithm for extracting 8-connected skeletons of 2D binary images. Each interior pixel in the 2D image is encoded with an integer code according to its relative distance from the object border to form an approximate minimum distance field. Cluster is defined as a set of geometrically connected local maximum pixels with the same distance value. And all the clusters are thinned, and connected with the shortest paths. The proposed algorithm is simple, and the results acquired by the algorithm on an experimental data demonstrate its efficiency.

Key words: approximate minimum distance field, 2D binary image, pixel encoding, cluster, shortest path