5 search results - page 1 / 1 » Hyper-graph Matching via Reweighted Random Walks |
209
click to vote
CVPR
2011
IEEE
14 years 7 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...
192
Voted
ECCV
2010
Springer
15 years 4 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...
85
Voted
JMLR
2010
14 years 5 months ago
2010
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
115
Voted
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
ISQED
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper proposes a novel method for analyzing large onchip power delivery networks via a stochastic moment matching (SMM) method. The proposed method extends the existing direc...