244 search results - page 4 / 49 » Generalized RANSAC Framework for Relaxed Correspondence Prob... |
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
EMMCVPR
2009
Springer
14 years 2 months ago
2009
Springer
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...