Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Document formatted into pages; contains xi, 68 p.; also contains graphics. Includes vita. Includes bibliographical references.

Thesis (Ed. D.)--University of Missouri-Columbia, 2005. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (May 24, 2006) Vita. Includes bibliographical references.

Thesis (Ph. D.)--Oregon State University, 2007. / Printout. Includes bibliographical references (leaves 180-185). Also available on the World Wide Web.

Thesis (PhD(Kurrikulumstudies))--Universiteit van Pretoria, 2006. / Abstract in English and Afrikaans. Includes bibliographical references. Available on the Internet via the World Wide Web.

Thesis (Ph. D.) University of Missouri-Columbia, 2006. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on August 1, 2007) Includes bibliographical references.

Thesis PlanA (M.S.)--University of Wisconsin--Stout, 2006. / Includes bibliographical references.

Thesis PlanB (M.S.)--University of Wisconsin--Stout, 2006. / Includes bibliographical references.

No Abstract Provided

This thesis presents a method of object classification using the idea of deformable shape matching. Three types of visual features, geometric blur, C1 and SIFT, are used to generate feature descriptors. These feature descriptors are then used to find point correspondences between pairs of images. Various morphable models are created by small subsets of these correspondences using thin-plate spline. Given these morphs, a simple algorithm, least median of squares (LMEDS), is used to find the best morph. A scoring metric, using both LMEDS and distance transform, is used to classify test images based on a nearest neighbor algorithm. We perform the experiments on the Caltech 101 dataset [5]. To ease computation, for each test image, a shortlist is created containing 10 of the most likely candidates. We were unable to duplicate the performance of [1] in the shortlist stage because we did not use hand-segmentation to extract objects for our training images. However, our gain from the shortlist to correspondence stage is comparable to theirs. In our experiments, we improved from 21% to 28% (gain of 33%), while [1] improved from 41% to 48% (gain of 17%). We find that using a non-shape based approach, C2 [14], the overall classification rate of 33.61% is higher than all of the shaped based methods tested in our experiments.

Automated driving can help solve the current and future problems of individualtransportation. Automated valet parking is a possible approach to help with overcrowded parking areas in cities and make electric vehicles more appealing. In an automated valet system, drivers are able to drop off their vehicle close to a parking area. The vehicle drives to a free parking spot on its own, while the driver is free to perform other tasks — such as switching the mode of transportation. Such a system requires the automated car to navigate unstructured, possibly three dimensional areas. This goes beyond the scope ofthe tasks performed in the state of the art for automated driving. This thesis describes a visual localization system that provides accuratemetric pose estimates. As sensors, the described system uses multiple monocular cameras and wheel-tick odometry. This is a sensor set-up that is close to what can be found in current production cars. Metric pose estimates with errors in the order of tens of centimeters enable maneuvers such as parking into tight parking spots. This system forms the basis for automated navigationin the EU-funded V-Charge project. Furthermore, we present an approach to the challenging problem of life-long mapping and localization. Over long time spans, the visual appearance ofthe world is subject to change due to natural and man-made phenomena. The effective long-term usage of visual maps requires the ability to adapt to these changes. We describe a multi-session mapping system, that fuses datasets intoiiia single, unambiguous, metric representation. This enables automated navigation in the presence of environmental change. To handle the growing complexityof such a system we propose the concept of Summary Maps, which contain a reduced set of landmarks that has been selected through a combination of scoring and sampling criteria. We show that a Summary Map with bounded complexity can achieve accurate localization under a wide variety of conditions. Finally, as a foundation for lifelong mapping, we propose a relational database system. This system is based on use-cases that are not only concerned with solving the basic mapping problem, but also with providing users with a better understanding of the long-term processes that comprise a map. We demonstrate that we can pose interesting queries to the database, that help us gain a better intuition about the correctness and robustness of the created maps. This is accomplished by answering questions about the appearance and distribution of visual landmarks that were used during mapping. This thesis takes on one of the major unsolved challenges in vision-based localization and mapping: long-term operation in a changing environment. We approach this problem through extensive real world experimentation, as well as in-depth evaluation and analysis of recorded data. We demonstrate that accurate metric localization is feasible both during short term changes, as exemplified by the transition between day and night, as well as longer term changes, such as due to seasonal variation.