Sciweavers

1375 search results - page 59 / 275
» Matching Points with Things
Sort
View
ICBA
2004
Springer
224views Biometrics» more  ICBA 2004»
14 years 2 months ago
Matching 2.5D Scans for Face Recognition
Abstract. The performance of face recognition systems that use twodimensional images is dependent on consistent conditions such as lighting, pose, and facial appearance. We are dev...
Xiaoguang Lu, Dirk Colbry, Anil K. Jain
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 10 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
11 years 11 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 8 months ago
Succinct Geometric Indexes Supporting Point Location Queries
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...
CVPR
2008
IEEE
14 years 10 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl