DocumentCode
1081895
Title
Comments on "Efficiently computing and representing aspect graphs of polyhedral objects"
Author
Laurentini, A.
Author_Institution
Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
Volume
18
Issue
1
fYear
1996
Firstpage
57
Lastpage
58
Abstract
This correspondence is originated by the definition of aspect given in the above paper by Gigus-Canny-Seidel (ibid., vol.13, no.6 (1991)) on the computation of aspect graphs of polyhedra. Simple examples are presented which show that the data stored according to this definition can be unsuitable for identifying an object or its attitude through a topological match. A definition is suggested which does not incur the problems pointed out.
Keywords
computational geometry; edge detection; graph theory; image matching; object recognition; aspect graphs; edge detection; image structure graph; object recognition; polyhedral objects; topological match; Data mining; Machine intelligence; Shape;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/34.476011
Filename
476011
Link To Document