Shape skeletonization by identifying discrete local symmetries

作者:

Highlights:

摘要

This paper presents a new skeletonization method based on a novel concept — discrete local symmetry. A skeleton obtained from discrete local symmetries approaches the skeleton of the underlying continuous shape if the sampling is dense enough. Discrete local symmetries can be obtained by computing the constrained Delaunay triangulation of the underlying image. Internal triangles of a triangulation are divided into isolated triangles, end triangles, normal triangles and junction triangles. A discrete local symmetry corresponds to an isolated triangle, or an end triangle, or a normal triangle. Several measures are taken to remove skeletonization artifacts and suppress image noise. The proposed method can produce correct centre lines and junctions. It is efficient and robust against noise. The method is suitable for skeletonizing high-resolution images.

论文关键词:Skeletonization,Thinning,Constrained Delaunay triangulation,Binary image processing

论文评审过程:Received 4 January 1999, Accepted 28 August 2000, Available online 6 July 2001.

论文官网地址:https://doi.org/10.1016/S0031-3203(00)00131-X