6 search results - page 1 / 2 » Graph Matching with Hierarchical Discrete Relaxation |
NIPS
1997
13 years 6 months ago
1997
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt fo...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
ECCV
1998
Springer
14 years 6 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...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...