Article thumbnail
Location of Repository

Hierarchical decomposition of distance labeled skeletons

By Sergey V. Ablameyko, Carlo Arcelli and Gabriella Sanniti di Baja

Abstract

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

Topics: ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетика
Publisher: World Scientific Publishing Company
Year: 1996
OAI identifier: oai:elib.bsu.by:123456789/162276
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://elib.bsu.by/handle/1234... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.