Sciweavers

1056 search results - page 32 / 212
» Constraint-Based Graph Matching
Sort
View
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
14 years 1 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
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...
Andy Mirzaian
ICCV
2007
IEEE
14 years 11 months ago
Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching
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...
Faguo Yang, Frithjof Kruggel
ICPR
2010
IEEE
13 years 9 months ago
A Discrete Labelling Approach to Attributed Graph Matching Using SIFT Features
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...
Gerard Sanromà, René Alquézar...
PAMI
1998
107views more  PAMI 1998»
13 years 8 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
ICMCS
2006
IEEE
143views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Object Recognition and Recovery by Skeleton Graph Matching
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...
Lei He, Chia Y. Han, William G. Wee