Zugl.: Stuttgart, Univ., Diss., 2008

Zugl.: Bremen, Univ., Diss., 2009 / Hergestellt on demand

Zugl.: Aachen, Techn. Hochsch., Diss., 2007.

Thesis (Ph. D.)--Florida State University, 2005. / Advisors : Dr. Karen L. Laughlin and Dr. Mark Garrett Cooper, Florida State University, College of Arts and Sciences, Dept. of English. Title and description from dissertation home page (June 14, 2005). Document formatted into pages; contains vi, 193 pages. Includes bibliographical references.

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: modular verification; feature-oriented software development; model checking; assume-guarantee reasoning. Includes bibliographical references (p. 72-73).

Thesis (M.A.)--University of Toledo, 2010. / Typescript. "Submitted to the Graduate Faculty as partial fulfillment of the requirements for the Master of Arts Degree in Geography." "A thesis entitled"--at head of title. Title from title page of PDF document. Bibliography: p. 76-82.

We consider the problem of detecting a large number of different classes of objects in cluttered scenes. Traditional approaches require applying a battery of different classifiers to the image, at multiple locations and scales. This can be slow and can require a lot of training data, since each classifier requires the computation of many different image features. In particular, for independently trained detectors, the (run-time) computational complexity, and the (training-time) sample complexity, scales linearly with the number of classes to be detected. It seems unlikely that such an approach will scale up to allow recognition of hundreds or thousands of objects.We present a multi-class boosting procedure (joint boosting) that reduces the computational and sample complexity, by finding common features that can be shared across the classes (and/or views). The detectors for each class are trained jointly, rather than independently. For a given performance level, the total number of features required, and therefore the computational cost, is observed to scale approximately logarithmically with the number of classes. The features selected jointly are closer to edges and generic features typical of many natural structures instead of finding specific object parts. Those generic features generalize better and reduce considerably the computational cost of an algorithm for multi-class object detection.

In this paper, we introduce a novel set of features for robust object recognition, which exhibits outstanding performances on a variety ofobject categories while being capable of learning from only a fewtraining examples. Each element of this set is a complex featureobtained by combining position- and scale-tolerant edge-detectors overneighboring positions and multiple orientations.Our system - motivated by a quantitative model of visual cortex -outperforms state-of-the-art systems on a variety of object imagedatasets from different groups. We also show that our system is ableto learn from very few examples with no prior category knowledge. Thesuccess of the approach is also a suggestive plausibility proof for aclass of feed-forward models of object recognition in cortex. Finally,we conjecture the existence of a universal overcompletedictionary of features that could handle the recognition of all objectcategories.

Made available in DSpace on 2014-06-11T19:30:31Z (GMT). No. of bitstreams: 0 Previous issue date: 2012-05-17Bitstream added on 2014-06-13T18:40:48Z : No. of bitstreams: 1 statella_t_dr_prud.pdf: 3750237 bytes, checksum: 5e7d05a021f74eef1040300825e464e5 (MD5) / Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Dust Devils são vórtices convectivos formados por correntes de ar quente instáveis, próximas à superfície planetária. Inúmeros pesquisadores têm estudado dust devils marcianos na tentativa de melhor entender o fenômeno. Em geral, as áreas de pesquisa compreendem a simulação numérica e mecânica de dust devils em laboratório, metodologias para reconhecimento de vórtices por robôs pousados na superfície de Marte e a detecção de vórtices e rastros em imagens orbitais. A despeito do grande número de artigos relacionados ao assunto, nenhum deles aborda a detecção automática de rastros de dust devils, tarefa que ganha especial importância quando a quantidade de imagens da superfície de Marte cresce a uma taxa maior que a capacidade humana de analisá-las em um curto período de tempo. Esta Tese descreve um método inédito para detecção automática de rastros de dust devils. O banco de imagens utilizado contém 200 imagens (90 MOC e 110 HiRISE), distribuídas pelas regiões Aeolis, Noachis, Argyre, Eridania e Hellas. O método é fortemente baseado na Morfologia Matemática e usa transformações como abertura e fechamento por área morfológicos, fechamento por caminho morfológico, método de Otsu... / Dust devils are vortices caused by unstable wind convection processes near the planetary surfaces, due to solar heat. Many researchers have being studying Martian dust devils in an attempt to better understand the phenomena. Generally, the research fields comprise mechanic and numerical simulation of dust devils in laboratories, methodologies for recognition of dust devils plumes from rovers on Mars surface, detection of plumes and tracks from orbital images. Despite the number of papers regarding the subject, none of them addresses the automatic detection of dust devil tracks which is an important issue as the amount of images taken grows at a rate greater than the human capability to analyze them. This Thesis describes a novel method to detect Martian dust devil tracks automatically. The dataset comprises 200 images (90 MOC and 110 HiRISE), distributed over the regions of Aeolis, Noachis, Argyre, Eridania and Hellas. The method is strongly based on Mathematical Morphology and uses transformations such as morphological surface area closing and opening, morphological path closing and Otsu's method for automatic image binarization, among others. The method was applied to the dataset and results were compared... (Complete abstract click electronic access below)

abstract: Query Expansion is a functionality of search engines that suggest a set of related queries for a user issued keyword query. In case of exploratory or ambiguous keyword queries, the main goal of the user would be to identify and select a specific category of query results among different categorical options, in order to narrow down the search and reach the desired result. Typical corpus-driven keyword query expansion approaches return popular words in the results as expanded queries. These empirical methods fail to cover all semantics of categories present in the query results. More importantly these methods do not consider the semantic relationship between the keywords featured in an expanded query. Contrary to a normal keyword search setting, these factors are non-trivial in an exploratory and ambiguous query setting where the user's precise discernment of different categories present in the query results is more important for making subsequent search decisions. In this thesis, I propose a new framework for keyword query expansion: generating a set of queries that correspond to the categorization of original query results, which is referred as Categorizing query expansion. Two approaches of algorithms are proposed, one that performs clustering as pre-processing step and then generates categorizing expanded queries based on the clusters. The other category of algorithms handle the case of generating quality expanded queries in the presence of imperfect clusters. / Dissertation/Thesis / M.S. Computer Science 2011