162 search results - page 1 / 33 » Structural Matching Via Optimal Basis Graphs |
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
SIROCCO
2010
13 years 10 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...