Shape skeletonization by identifying discrete local symmetries

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

19 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)1895-1905
Journal / PublicationPattern Recognition
Volume34
Issue number10
Publication statusPublished - Oct 2001

Abstract

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 continous 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. © 2001 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

Research Area(s)

  • Binary image processing, Constrained Delaunay triangulation, Skeletonization, Thinning

Citation Format(s)

Shape skeletonization by identifying discrete local symmetries. / Zou, Ju Jia; Chang, Hung-Hsin; Yan, Hong.
In: Pattern Recognition, Vol. 34, No. 10, 10.2001, p. 1895-1905.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review