Shape skeletonization by identifying discrete local symmetries
From MaRDI portal
Publication:5948540
DOI10.1016/S0031-3203(00)00131-XzbMath0998.68139MaRDI QIDQ5948540
Hung-Hsin Chang, Ju Jia Zou, Hong Yan
Publication date: 8 November 2001
Published in: Pattern Recognition (Search for Journal in Brave)
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Triangle refinement in a constrained Delaunay triangulation skeleton ⋮ A fast algorithm for the computation of axial moments and its application to the orthogonal fitting of curves. ⋮ Clothing segmentation using foreground and background estimation based on the constrained Delaunay triangulation ⋮ Skeletonization based on error reduction
Cites Work
- Unnamed Item
- An efficient algorithm for smoothing, linearization and detection of structural feature points of binary image contours
- Constrained Delaunay triangulations
- Shape description using weighted symmetric axis features
- Axial representations of shape
- Symmetry-curvature duality
- Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
This page was built for publication: Shape skeletonization by identifying discrete local symmetries