55 search results - page 8 / 11 » Consistent and efficient sampler for geometric computation |
111
click to vote
CVPR
2011
IEEE
14 years 3 months ago
2011
IEEE
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
110
click to vote
Publication
We present a novel and robust method for localizing and segmenting bilaterally symmetric patterns from real-world images. On the basis of symmetrically matched pairs of local featu...
CSR
2006
Springer
15 years 1 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
JDA
2008
14 years 9 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
ISVC
2010
Springer
14 years 11 months ago
2010
Springer
We present a method for nonrigid registration of 2-D geometric shapes. Our contribution is twofold. First, we extend the classic chamfer-matching energy to a variational functional...