1056 search results - page 31 / 212 » Constraint-Based Graph Matching |
159
click to vote
ECCV
1998
Springer
16 years 8 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
163
click to vote
JACM
2010
15 years 4 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
161
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
184
Voted
CVPR
2010
IEEE
16 years 2 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...
150
click to vote
CEC
2007
IEEE
16 years 22 days 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...