2695 search results - page 41 / 539 » Learning Graph Matching |
132
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
109
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
140
click to vote
WADS
1993
Springer
15 years 6 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
133
click to vote
ICCV
2007
IEEE
16 years 3 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...
116
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-fe...