Davis, Larry S.
A Probabilistic Framework for Multimodal Retrieval using Integrative Indian Buffet Process
Ozdemir, Bahadir, Davis, Larry S.
We propose a multimodal retrieval procedure based on latent feature models. The procedure consists of a nonparametric Bayesian framework for learning underlying semantically meaningful abstract features in a multimodal dataset, a probabilistic retrieval model that allows cross-modal queries and an extension model for relevance feedback. Experiments on two multimodal datasets, PASCAL-Sentence and SUN-Attribute, demonstrate the effectiveness of the proposed retrieval procedure in comparison to the state-of-the-art algorithms for learning binary codes.
Automatic online tuning for fast Gaussian summation
Morariu, Vlad I., Srinivasan, Balaji V., Raykar, Vikas C., Duraiswami, Ramani, Davis, Larry S.
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to reduce the computational complexity of evaluating such sums, including tree and analysis based methods. These achieve varying speedups depending on the bandwidth, dimension, and prescribed error, making the choice between methods difficult for machine learning tasks. We provide an algorithm that combines tree methods with the Improved Fast Gauss Transform (IFGT). As originally proposed the IFGT suffers from two problems: (1) the Taylor series expansion does not perform well for very low bandwidths, and (2) parameter selection is not trivial and can drastically affect performance and ease of use. We address the first problem by employing a tree data structure, resulting in four evaluation methods whose performance varies based on the distribution of sources and targets and input parameters such as desired accuracy and bandwidth. To solve the second problem, we present an online tuning approach that results in a black box method that automatically chooses the evaluation method and its parameters to yield the best performance for the input data, desired accuracy, and bandwidth. In addition, the new IFGT parameter selection approach allows for tighter error bounds. Our approach chooses the fastest method at negligible additional cost, and has superior performance in comparisons with previous approaches.
A ``Shape Aware'' Model for semi-supervised Learning of Objects and its Context
Gupta, Abhinav, Shi, Jianbo, Davis, Larry S.
Integrating semantic and syntactic analysis is essential for document analysis. Using an analogous reasoning, we present an approach that combines bag-of-words and spatial models to perform semantic and syntactic analysis for recognition of an object based on its internal appearance and its context. We argue that while object recognition requires modeling relative spatial locations of image features within the object, a bag-of-word is sufficient for representing context. Learning such a model from weakly labeled data involves labeling of features into two classes: foreground(object) or ''informative'' background(context). labeling. We present a ''shape-aware'' model which utilizes contour information for efficient and accurate labeling of features in the image. Our approach iterates between an MCMC-based labeling and contour based labeling of features to integrate co-occurrence of features and shape similarity.
Efficient Kernel Machines Using the Improved Fast Gauss Transform
Yang, Changjiang, Duraiswami, Ramani, Davis, Larry S.
Such a complexity is significant even for moderate size problems and is prohibitive for large datasets. We present an approximation technique based on the improved fast Gauss transform to reduce the computation to O(N). We also give an error bound for the approximation, and provide experimental results on the UCI datasets.
Artificial Intelligence Research at the University of Maryland
Minker, Jack, Davis, Larry S.
The University of Maryland's Computer Science Department conducts a broad research program in both theoretical and applied artificial intelligence. Nine faculty and more than fifty research associates and graduate students are involved in AI research. Projects are funded by a large number of government agencies, as well as by several major corporations. The computing environment will improve dramatically over the next several years, due in large part to Coordinated Experimental Research Department by the National Science Foundation in 1982. In addition to the research program in AI, the Department offers a large number of courses at both the graduate and undergraduate levels on all facets of AI. The principal AI laboratories also sponsor numerous colloquia by visiting scientists and permanent laboratory personnel. The principal research areas are computer vision, search and decision making, parallel problems solving, and database research.