CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1982 vol.4 Issue No.04 - April
Issue No.04 - April (1982 vol.4)
C. Guerra , Dipartimento di Matematica, Università della Calabria Arcavacata, Italy; Istituto di Automatica, Università di Roma, Roma, Italy.
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 . 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.
C. Guerra, "A Graph-Theoretic Method for Decomposing Two-Dimensional Polygonal Shapes into Meaningful Parts", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.4, no. 4, pp. 405-408, April 1982, doi:10.1109/TPAMI.1982.4767272