Show simple item record

dc.contributor.authorBreuel, Thomas M.en_US
dc.date.accessioned2004-10-04T14:36:19Z
dc.date.available2004-10-04T14:36:19Z
dc.date.issued1990-08-01en_US
dc.identifier.otherAIM-1108en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6029
dc.description.abstractThis paper describes a new approach to the model base indexing stage of visual object recognition. Fast model base indexing of 3D objects is achieved by accessing a database of encoded 2D views of the objects using a fast 2D matching algorithm. The algorithm is specifically intended as a plausible solution for the problem of indexing into very large model bases that general purpose vision systems and robots will have to deal with in the future. Other properties that make the indexing algorithm attractive are that it can take advantage of most geometric and non-geometric properties of features without modification, and that it addresses the incremental model acquisition problem for 3D objects.en_US
dc.format.extent33 p.en_US
dc.format.extent4945509 bytes
dc.format.extent1961631 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-1108en_US
dc.subjectindexingen_US
dc.subjectvisual recognitionen_US
dc.subject3Den_US
dc.subjectobject recognitionen_US
dc.subjectscomputational complexityen_US
dc.titleIndexing for Visual Recognition from a Large Model Baseen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record