Results 1 - 10 of 5,141

Face recognition: features versus templates

by Roberto Brunelli, Tomaso Poggio - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1993
"... Over the last 20 years, several different techniques have been proposed for computer recognition of human faces. The purpose of this paper is to compare two simple but general strategies on a common database (frontal images of faces of 47 people: 26 males and 21 females, four images per person). We ..."
Abstract - Cited by 749 (25 self) - Add to MetaCart
(about 90 % correct recognition using geometrical features and perfect recognition using template matching) favor our implementation of the template-matching approach.

Robust face recognition via sparse representation

by John Wright, Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, Yi Ma - IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2008
"... We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models, and argue that new theory from sparse signa ..."
Abstract - Cited by 936 (40 self) - Add to MetaCart
We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models, and argue that new theory from sparse

Distinctive Image Features from Scale-Invariant Keypoints

by David G. Lowe , 2003
"... This paper presents a method for extracting distinctive invariant features from images, which can be used to perform reliable matching between different images of an object or scene. The features are invariant to image scale and rotation, and are shown to provide robust matching across a a substa ..."
Abstract - Cited by 8955 (21 self) - Add to MetaCart
substantial range of affine distortion, addition of noise, change in 3D viewpoint, and change in illumination. The features are highly distinctive, in the sense that a single feature can be correctly matched with high probability against a large database of features from many images. This paper also

Shape matching and object recognition using low distortion correspondence

by Alexander C. Berg, Tamara L. Berg, Jitendra Malik - In CVPR , 2005
"... We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of correspond ..."
Abstract - Cited by 419 (15 self) - Add to MetaCart
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity

Hidden Markov models for detecting remote protein homologies

by Kevin Karplus, Christian Barrett, Richard Hughey - Bioinformatics , 1998
"... A new hidden Markov model method (SAM-T98) for nding remote homologs of protein sequences is described and evaluated. The method begins with a single target sequence and iteratively builds a hidden Markov model (hmm) from the sequence and homologs found using the hmm for database search. SAM-T98 is ..."
Abstract - Cited by 462 (15 self) - Add to MetaCart
is also used to construct model libraries automatically from sequences in structural databases. We evaluate the SAM-T98 method with four datasets. Three of the test sets are fold-recognition tests, where the correct answers are determined by structural similarity. The fourth uses a curated database

Correcting Recognition Errors Via Discriminative Utterance Verification

by Anand R. Setlur, Rafid A. Sukkar, John Jacob , 1996
"... Utterance verification (UV) is a process by which the output of a speech recognizer is verified to determine if the input speech actually includes the recognized keyword(s). The output of the speech verifier is a binary decision to accept or reject the recognized utterance based on a UV confidence s ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
score. In this paper, we extend the notion of utterance verification to not only detect errors but also selectively correct them. We perform error correction by flipping the hypotheses produced by an N-best recognizer in cases when the top candidate has a UV confidence score that is lower than

N-grambased text categorization

by William B. Cavnar, John M. Trenkle - In Proc. of SDAIR-94, 3rd Annual Symposium on Document Analysis and Information Retrieval , 1994
"... Text categorization is a fundamental task in document processing, allowing the automated handling of enormous streams of documents in electronic form. One difficulty in handling some classes of documents is the presence of different kinds of textual errors, such as spelling and grammatical errors in ..."
Abstract - Cited by 445 (0 self) - Add to MetaCart
in email, and character recognition errors in documents that come through OCR. Text categorization must work reliably on all input, and thus must tolerate some level of these kinds of problems. We describe here an N-gram-based approach to text categorization that is tolerant of textual errors. The system

What the Relationship Between Correct Recognition Rates and Usability

by Measures Can Tell, Matthias Peissner , 2002
"... This paper addresses the necessity and added information value of considering recognition error rates in interpreting recorded usability measures of a speech-driven application. The proposed integrative perspective allows to estimate the relative contribution of speech recognition accuracy to the us ..."
Abstract - Add to MetaCart
This paper addresses the necessity and added information value of considering recognition error rates in interpreting recorded usability measures of a speech-driven application. The proposed integrative perspective allows to estimate the relative contribution of speech recognition accuracy

Svm-knn: Discriminative nearest neighbor classification for visual category recognition

by Hao Zhang, Alexander C. Berg, Michael Maire, Jitendra Malik - in CVPR , 2006
"... We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is quite flexible, and permits recognition based on color, texture, and particularly shape, in a homogeneous framework. While n ..."
Abstract - Cited by 342 (10 self) - Add to MetaCart
variety of distance functions can be used and our experiments show state-of-the-art performance on a number of benchmark data sets for shape and texture classification (MNIST, USPS, CUReT) and object recognition (Caltech-101). On Caltech-101 we achieved a correct classification rate of 59

Recognition of visual activities and interactions by stochastic parsing

by Yuri A. Ivanov, Aaron F. Bobick - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2000
"... This paper describes a probabilistic syntactic approach to the detection and recognition of temporally extended activities and interactions between multiple agents. The fundamental idea is to divide the recognition problem into two levels. The lower level detections are performed using standard inde ..."
Abstract - Cited by 322 (8 self) - Add to MetaCart
in several experiments on gesture recognition and in video surveillance. In the surveillance application, we show how the system correctly interprets activities of multiple, interacting objects.
Results 1 - 10 of 5,141