Search
Now showing items 31-40 of 51
Statistical Object Recognition
(1993-01-01)
Two formulations of model-based object recognition are described. MAP Model Matching evaluates joint hypotheses of match and pose, while Posterior Marginal Pose Estimation evaluates the pose only. Local search in pose ...
Implementing Distributed Systems Using Linear Naming
(1993-03-01)
Linear graph reduction is a simple computational model in which the cost of naming things is explicitly represented. The key idea is the notion of "linearity". A name is linear if it is only used once, so with linear ...
Observations on Cortical Mechanisms for Object Recognition andsLearning
(1993-12-01)
This paper sketches a hypothetical cortical architecture for visual 3D object recognition based on a recent computational model. The view-centered scheme relies on modules for learning from examples, such as Hyperbf-like ...
Optical Flow From 1D Correlation: Application to a Simple Time-To-Crash Detector
(1993-10-01)
In the first part of this paper we show that a new technique exploiting 1D correlation of 2D or even 1D patches between successive frames may be sufficient to compute a satisfactory estimation of the optical flow field. ...
Some Extensions of the K-Means Algorithm for Image Segmentation and Pattern Classification
(1993-01-01)
In this paper we present some extensions to the k-means algorithm for vector quantization that permit its efficient use in image segmentation and pattern classification tasks. It is shown that by introducing state ...
Convergence Results for the EM Approach to Mixtures of Experts Architectures
(1993-11-01)
The Expectation-Maximization (EM) algorithm is an iterative approach to maximum likelihood parameter estimation. Jordan and Jacobs (1993) recently proposed an EM algorithm for the mixture of experts architecture of ...
Formalizing Triggers: A Learning Model for Finite Spaces
(1993-11-01)
In a recent seminal paper, Gibson and Wexler (1993) take important steps to formalizing the notion of language learning in a (finite) space whose grammars are characterized by a finite number of parameters. They introduce ...
Exploiting the Parallelism Exposed by Partial Evaluation
(1993-04-01)
We describe an approach to parallel compilation that seeks to harness the vast amount of fine-grain parallelism that is exposed through partial evaluation of numerically-intensive scientific programs. We have constructed ...
Face Recognition Under Varying Pose
(1993-12-01)
While researchers in computer vision and pattern recognition have worked on automatic techniques for recognizing faces for the last 20 years, most systems specialize on frontal views of the face. We present a face recognizer ...
MIT SchMUSE: Class-Based Remote Delegation in a Capricious Distributed Environment
(1993-02-01)
MIT SchMUSE (pronounced "shmooz") is a concurrent, distributed, delegation-based object-oriented interactive environment with persistent storage. It is designed to run in a "capricious" network environment, where servers ...