Sciweavers

839 search results - page 129 / 168
» Three-Clustering of Points in the Plane
Sort
View
FOCS
2002
IEEE
14 years 3 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
3DPVT
2006
IEEE
231views Visualization» more  3DPVT 2006»
14 years 1 months ago
Simplified Belief Propagation for Multiple View Reconstruction
We address multiple-view reconstruction under an optimization approach based on belief propagation. A novel formulation of belief propagation that operates in 3-D is proposed to f...
E. Scott Larsen, Philippos Mordohai, Marc Pollefey...
ACIVS
2006
Springer
14 years 1 months ago
Affine Epipolar Direction from Two Views of a Planar Contour
Most approaches to camera motion estimation from image sequences require matching the projections of at least 4 non-coplanar points in the scene. The case of points lying on a plan...
Maria Alberich-Carramiñana, Guillem Aleny&a...
AAAI
2010
13 years 11 months ago
Error Aware Monocular Visual Odometry using Vertical Line Pairs for Small Robots in Urban Areas
We report a new error-aware monocular visual odometry method that only uses vertical lines, such as vertical edges of buildings and poles in urban areas as landmarks. Since vertic...
Ji Zhang, Dezhen Song
CCCG
2010
13 years 11 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette