136 search results - page 1 / 28 » A Spectral Technique for Correspondence Problems Using Pairw... |
ICCV
2005
IEEE
14 years 6 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
CVPR
2009
IEEE
15 years 3 days 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...
ECCV
2006
Springer
14 years 6 months ago
2006
Springer
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
PR
2006
2006
Correspondence matching using kernel principal components analysis and label consistency constraints
13 years 4 months ago
This paper investigates spectral approaches to the problem of point pattern matching. We make two contributions. First, we consider rigid point-set alignment. Here we show how ker...