Sciweavers

1375 search results - page 74 / 275
» Matching Points with Things
Sort
View
AIPS
2006
15 years 4 months ago
Bounded Branching and Modalities in Non-Deterministic Planning
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
Blai Bonet
155
Voted
PAMI
2006
227views more  PAMI 2006»
15 years 3 months ago
Matching 2.5D Face Scans to 3D Models
The performance of face recognition systems that use two-dimensional images depends on factors such as lighting and subject's pose. We are developing a face recognition system...
Xiaoguang Lu, Anil K. Jain, Dirk Colbry
SMILE
2000
Springer
15 years 7 months ago
A Progressive Scheme for Stereo Matching
Brute-forcedensematchingisusuallynotsatisfactorybecausethesame search range is used for the entire image, yielding potentially many false matches. In this paper, we propose a progr...
Zhengyou Zhang, Ying Shan
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 7 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
MVA
1998
162views Computer Vision» more  MVA 1998»
15 years 3 months ago
Multipass hierarchical stereo matching for generation of digital terrain models from aerial images
Abstract. This paper presents a new multi-pass hierarchical stereo-matching approach for generation of digital terrain models (DTMs) from two overlapping aerial images. Our method ...
Yi-Ping Hung, Chu-Song Chen, Kuan-Chung Hung, Yong...