1521 search results - page 103 / 305 » Kernelized map matching |
ICAPR
2005
Springer
14 years 1 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
ESWS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We think of Match as an operator which takes two graph-like structures and produces a mapping between those nodes of the two graphs that correspond semantically to each o...
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 ...
PR
2007
13 years 7 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Spatiotemporal stereo is concerned with recovery of the 3D structure of a
dynamically changing scene from a sequence of stereo images. This paper
aims at computing temporally coh...