Show simple item record

Computing aspect graphs of curved objects for object recognition.

dc.contributor.authorSripradisvarakul, Thawachen_US
dc.contributor.advisorJain, Ramesh C.en_US
dc.date.accessioned2014-02-24T16:17:41Z
dc.date.available2014-02-24T16:17:41Z
dc.date.issued1993en_US
dc.identifier.other(UMI)AAI9409812en_US
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9409812en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/103852
dc.description.abstractThe aspect graph is a viewer-centered object representation that describes the shape of the object by its qualitatively distinct views as seen from various viewpoints. The aspect graph is very useful for generating effective object recognition strategies, since it provides the information about all possible image feature configurations. Several researchers have proposed different algorithms for computing the aspect graphs of polyhedral objects, solids of revolution, and objects bounded by quadric surfaces. In this thesis, we present an algorithm to compute the exact aspect graph of a piecewise smooth curved object bounded by rational algebraic surfaces under orthographic projection. Each view is qualitatively characterized by the topological structure of image contours corresponding to depth and surface normal discontinuities. Computing the aspect graph requires partitioning the viewpoint space into regions, in each of which the structure of the image contours is stable. Region boundaries represent visual events, which are sudden changes in the structure of the image contours. Partitioning the viewpoint space is based on the understanding of all visual events and the viewpoints where they occur. For piecewise smooth objects, a catalogue of visual events was prepared using tools from singularity theory. However, the catalogue is incomplete. In this thesis, we present a complete analysis of events that are not previously studied, and formulate a mathematical framework for computing viewpoints where the visual events occur. Based on the visual event analysis, we also show that the size of the aspect graph is $O(d\sp{24}n\sp6$) under orthographic projection and $O(d\sp{36}n\sp9$) under perspective projection, where n is the number of object surfaces and d is the maximum parametric degree of the surfaces.en_US
dc.format.extent151 p.en_US
dc.subjectComputer Scienceen_US
dc.titleComputing aspect graphs of curved objects for object recognition.en_US
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineComputer Science and Engineeringen_US
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studiesen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/103852/1/9409812.pdf
dc.description.filedescriptionDescription of 9409812.pdf : Restricted to UM users only.en_US
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.