Logo BSU

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/162276
Title: Hierarchical decomposition of distance labeled skeletons
Authors: Ablameyko, Sergey V.
Arcelli, Carlo
Sanniti di Baja, Gabriella
Keywords: ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетика
Issue Date: 1996
Publisher: World Scientific Publishing Company
Citation: International Journal of Pattern Recognition and Artificial Intelligence. - Vol. 10. - No. 8 (1996). - Pp. 957-970.
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 matching
URI: http://elib.bsu.by/handle/123456789/162276
Appears in Collections:Ранние работы

Files in This Item:
File Description SizeFormat 
957-970_1996.pdf5,88 MBAdobe PDFView/Open


PlumX

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.