Sciweavers

136 search results - page 1 / 28
» A Spectral Technique for Correspondence Problems Using Pairw...
Sort
View
ICCV
2005
IEEE
15 years 20 days ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
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...
Marius Leordeanu, Martial Hebert
ICCV
2009
IEEE
15 years 3 months ago
Optimal Correspondences from Pairwise Constraints
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...
Olof Enqvist, Klas Josephson, Fredrik Kahl
CVPR
2009
IEEE
15 years 6 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
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...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
ECCV
2006
Springer
15 years 19 days ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
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...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...
PR
2006
116views more  PR 2006»
13 years 10 months ago
Correspondence matching using kernel principal components analysis and label consistency constraints
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...
Hongfang Wang, Edwin R. Hancock