Browsing AI Memos (1959  2004) by Title
Now showing items 360379 of 1217

Face Detection in Still Gray Images
(20000501)We present a trainable system for detecting frontal and nearfrontal views of faces in still gray images using Support Vector Machines (SVMs). We first consider the problem of detecting the whole face pattern by a single ... 
Face processing in humans is compatible with a simple shapebased model of vision
(20040305)Understanding how the human visual system recognizes objects is one of the key challenges in neuroscience. Inspired by a large body of physiological evidence (Felleman and Van Essen, 1991; Hubel and Wiesel, 1962; Livingstone ... 
Face Recognition from One Example View
(19950901)If we are provided a face database with only one example view per person, is it possible to recognize new views of them under a variety of different poses, especially views rotated in depth from the original example ... 
Face Recognition Under Varying Pose
(19931201)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 ... 
Factorial Hidden Markov Models
(19960209)We present a framework for learning in hidden Markov models with distributed state representations. Within this framework, we derive a learning algorithm based on the ExpectationMaximization (EM) procedure for maximum ... 
Fanbeam Reconstruction Methods
(19771101)In a previous paper a technique was developed for finding reconstruction algorithms for arbitrary raysampling schemes. The resulting algorithms use a general linear operator, the kernel of which depends on the details ... 
Fast Arithmetic in MACLISP
(19770901)MacLISP provides a compiler which produces numerical code competitive in speed with some FORTRAN implementations and yet compatible with the rest of the MacLISP system. All numerical programs can be run under MacLISP ... 
Fast Contour Matching Using Approximate Earth Mover's Distance
(20031205)Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost of matching features from one shape to the features ... 
Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks
(19960209)Sigmoid type belief networks, a class of probabilistic neural networks, provide a natural framework for compactly representing probabilistic information in a variety of unsupervised and supervised learning problems. ... 
Fast Object Recognition in Noisy Images Using Simulated Annealing
(19950125)A fast simulated annealing algorithm is developed for automatic object recognition. The normalized correlation coefficient is used as a measure of the match between a hypothesized object and an image. Templates are ... 
A Fast Parsing Scheme for HandPrinted Mathematical Expressions
(19671019)A set of oneline textbookstyle mathematical expressions is defined by a context free grammar. This grammar generates strings which describe the expressions in terms of mathematical symbols and some simple positional ... 
Fast Perceptual Learning in Visual Hyperacuity
(19911201)In many different spatial discrimination tasks, such as in determining the sign of the offset in a vernier stimulus, the human visual system exhibits hyperacuitylevel performance by evaluating spatial relations with the ... 
Fast Pose Estimation with Parameter Sensitive Hashing
(20030418)Examplebased methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and highdimensional problems such as pose estimation, ... 
Fast, Cheap and Out of Control
(19891201)Spurofthemoment planetary exploration missions are within our reach. Complex systems and complex missions usually take years of planning and force launches to become incredibly expensive. We argue here for cheap, ... 
FaultTolerant Design for Multistage Routing Networks
(19900401)As the size of digital systems increases, the mean time between single component failures diminishes. To avoid component related failures, large computers must be faulttolerant. In this paper, we focus on methods for ... 
Feature Matching for Object Localization in the Presence of Uncertainty
(19900501)We consider the problem of matching model and sensory data features in the presence of geometric uncertainty, for the purpose of object localization and identification. The problem is to construct sets of model feature and ... 
Feature Selection for Face Detection
(20000901)We present a new method to select features for a face detection system using Support Vector Machines (SVMs). In the first step we reduce the dimensionality of the input space by projecting the data into a subset of ... 
Figure Boundary Description Routings for the PDP6sVision Project
(19660901)As a step in the direction of "computer vision," several programs have been written which transform the output of a vidisector into some mathematical descriptions of the boundaries enclosing the objects in the field of ... 
Filling in the Gaps: The Shape of Subjective Contours and a Model for Their Generation
(19761001)The properties of isotropy, smoothness, minimum curvature and locality suggest the shape of filledin contours between two boundary edges. The contours are composed of the arcs of two circles tangent to the given ... 
Final Report of the Brookline LOGO Project. Part II: Project Summary and Data
(19790901)During the school year 1977/78 four computers equipped with LOGO and Turtle Graphics were installed in an elementary school in Brookline, Mass. All sixth grade students in the school had between 20 and 40 hours of ...