2219 search results - page 45 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
AUTOMATICA
2008
13 years 9 months ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
AIPS
2000
13 years 10 months ago
2000
Planning for real robots to act in dynamic and uncertain environments is a challenging problem. A complete model of the world is not viable and an integration of deliberation and ...
WACV
2005
IEEE
14 years 2 months ago
2005
IEEE
A method for the simultaneous localization and recognition of dynamic hand gestures is proposed. At the core of this method is a dynamic space-time warping (DSTW) algorithm, that ...
DAM
2007
13 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...