Title :
A Graph-Theoretic Method for Decomposing Two-Dimensional Polygonal Shapes into Meaningful Parts
Author :
Guerra, Concettina ; Pieroni, G. G.
Author_Institution :
Dipartimento di Matematica, UniversitÃ\xa0 della Calabria Arcavacata, Italy; Istituto di Automatica, UniversitÃ\xa0 di Roma, Roma, Italy.
fDate :
7/1/1982 12:00:00 AM
Abstract :
This note gives a new graph-theoretic shape decomposition procedure, extending the idea in the paper ``Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering´´ by Shapiro and Haralick [1]. A binary matrix is used in order to express the LI relation. A solution for the problems connected with artificial separation of two CS cliques and the presence of a regular concavity is proposed. Our algorithm produces nonoverlapping shape parts in much reduced execution time.
Keywords :
Clustering algorithms; Matrix decomposition; Noise generators; Noise shaping; Shape; Clustering; relation clustering; shape; shape decomposition; shape matching;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
DOI :
10.1109/TPAMI.1982.4767272
