Hierarchical decomposition of distance labeled skeletons

The distance labeled skeleton of a two-dimensional digital object is hierarchically decomposed into loops, branches and concatenations of branches. Decomposition is obtained by using an iterated tracing-and-deleting process alternately applied to more and more internal skeleton subsets. Every skeleton subset is associated a feature, called the relevance, which is related to the spatial extension of the object region represented by that subset. The relevance is used to decide on how to perform concatenations, as well as to rank skeleton decomposition components ascribed to the same hierarchy level. The decomposition is stable under object rotation and can be used in a recognition process accomplished via graph matchin