Sciweavers

191 search results - page 9 / 39
» Multi-Object Tracking Using Dynamical Graph Matching
Sort
View
NIPS
2001
13 years 8 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
EMMCVPR
2001
Springer
14 years 30 min ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
14 years 2 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
CVPR
2007
IEEE
14 years 1 months ago
Single View Human Action Recognition using Key Pose Matching and Viterbi Path Searching
3D human pose recovery is considered as a fundamental step in view-invariant human action recognition. However, inferring 3D poses from a single view usually is slow due to the la...
Fengjun Lv, Ramakant Nevatia
ECCV
2008
Springer
13 years 9 months ago
Active Matching
Abstract. In the matching tasks which form an integral part of all types of tracking and geometrical vision, there are invariably priors available on the absolute and/or relative i...
Margarita Chli, Andrew J. Davison