32 search results - page 4 / 7 » Many-to-Many Graph Matching: a Continuous Relaxation Approac... |
ECCV
1998
Springer
14 years 9 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...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
PAMI
2006
13 years 7 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
AVSS
2009
IEEE
13 years 5 months ago
2009
IEEE
A comparison of several approaches that use graph matching and cascade filtering for landmark localisation in 3D face data is presented. For the first method, we apply the structur...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...