In this paper, we establish a unique correspondence between skeleton branches and subarcs of object contours. Based on this correspondence, a skeleton is pruned by removing skeleton branches whose generating points are on the same contour subarc. This has an effect of removing redundant skeleton branches and retaining all the necessary visual branches. We show that this approach preserves skele...

-Binary image representation by its morphological skeleton transform has been proposed in the past as an information preserving representation. In this paper this skeleton representation is adopted as the start point for the development of a binary shape recognition scheme. A skeleton matching algorithm is presented that efficiently characterizes the similarity between two skeletons as a distan...

We present an algorithm that, starting from the surface skeleton of a 3D solid object, computes the curve skeleton. The algorithm is based on the detection of curves and junctions in the surface skeleton. It can be applied to any surface skeleton, including the case in which the surface skeleton is two-voxel thick.

In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchanged throughout the skeleton computation, which greatly reduces sensitivity of the skeleton to noise in the shape outline. Furthermore, this representation naturally defines an ordering of the points along the skeleton. ...

We present a new curve skeleton model designed for surface modeling and processing. This skeleton is defined as the geometrical integration of a piecewise harmonic parameterization defined over a disk-cylinder surface decomposition. This decomposition is computed using a progressive Region Graph reduction based on both geometric and topological criteria which can be iteratively optimized to imp...

Skeleton is an important 1-D descriptor of polygon and a useful tool for advanced geometric algorithms. However the skeleton that most existing algorithms investigated is the longest one, which is not intended in all circumstances. This paper proposes an algorithm for extracting hierarchically optimal skeleton network of polygons. The algorithm incorporates length, angularity and area of associ...