Sciweavers

2695 search results - page 43 / 539
» Learning Graph Matching
Sort
View
ICIP
2005
IEEE
16 years 3 months ago
Object tracking based on morphological elastic graph matching
This paper presents a novel method for real-time tracking of objects in video sequences. Tracking is performed using the so-called Morphological Elastic Graph Matching algorithm. ...
Georgios N. Stamou, Nikos Nikolaidis, Ioannis Pita...
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 2 months ago
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
Ashish Goel, Michael Kapralov, Sanjeev Khanna
DM
2006
54views more  DM 2006»
15 years 1 months ago
A note on interconnecting matchings in graphs
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
Tomás Kaiser
COMBINATORICS
2007
88views more  COMBINATORICS 2007»
15 years 1 months ago
Maximum Matchings in Regular Graphs of High Girth
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
Abraham D. Flaxman, Shlomo Hoory
PRL
2007
164views more  PRL 2007»
15 years 1 months ago
Retrieval of objects in video by similarity based on graph matching
In this paper, we tackle the problem of matching of objects in video in the context of the rough indexing paradigm. The approach developed is based on matching of region adjacency...
F. Chevalier, Jean-Philippe Domenger, Jenny Benois...