16 search results - page 1 / 4 » Reweighted Random Walks for Graph Matching |
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
DRW
2003
13 years 6 months ago
2003
ACCV
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...