Computing aspect graphs of curved objects for object recognition.
dc.contributor.author | Sripradisvarakul, Thawach | en_US |
dc.contributor.advisor | Jain, Ramesh C. | en_US |
dc.date.accessioned | 2014-02-24T16:17:41Z | |
dc.date.available | 2014-02-24T16:17:41Z | |
dc.date.issued | 1993 | en_US |
dc.identifier.other | (UMI)AAI9409812 | en_US |
dc.identifier.uri | http://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:9409812 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/103852 | |
dc.description.abstract | The 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.extent | 151 p. | en_US |
dc.subject | Computer Science | en_US |
dc.title | Computing aspect graphs of curved objects for object recognition. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Computer Science and Engineering | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/103852/1/9409812.pdf | |
dc.description.filedescription | Description of 9409812.pdf : Restricted to UM users only. | en_US |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
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.