1375 search results - page 44 / 275 » Matching Points with Things |
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
VMV
2000
13 years 10 months ago
2000
In this paper the problem of matching freeform surface features against measured point data is studied. The motivation for this investigation is the recent demand for fast and rob...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
In this paper, we present a novel method for efficient 3D model comparison. The method matches highly deformed models by comparing topological and geometric features. First, we pr...
ICCV
2007
IEEE
14 years 3 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
ACCV
2010
Springer
13 years 9 months ago
2010
Springer
ACCV
In this paper we propose a novel approach to binocular stereo for fast matching of high-resolution images. Our approach builds a prior on the disparities by forming a ...