32 search results - page 3 / 7 » Many-to-Many Graph Matching: a Continuous Relaxation Approac... |
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...