398 search results - page 11 / 80 » Ant Algorithm for the Graph Matching Problem |
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...
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...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...