Logo BSU

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/162415
Title: Finding and ranking basic structures on complex line patterns
Authors: Ablameyko, Sergey V.
Arcelli, Carlo
Sanniti di Baja, Gabriella
Issue Date: 1994
Publisher: World Scientific Publishing Company
Citation: Share, structure and pattern recognition: proc., October 4-6, 1994, Nahariya, Israel. – Naharia, 1994. – P. 33-42.
Abstract: The skeleton of a digital shape is a line pattern consisting of two basic structures, the branches and the loops, which are interleaved through the branch points. An iterative parallel algorithm is illustrated to find these basic structures, no matter how complex the skeleton is. In this way, the digital shape can be decomposed into regions, which reflect the topological properties of the corresponding skeleton structures. A key point of the proposed method is the notion of interiority degree, which allows one to order skeleton structures in a hierarchical way
URI: http://elib.bsu.by/handle/123456789/162415
ISBN: 981-02-2239-4
Appears in Collections:Ранние работы

Files in This Item:
File Description SizeFormat 
33-42_1994.pdf4,09 MBAdobe PDFView/Open


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