Sciweavers

38 search results - page 3 / 8
» Noisy colored point set matching
Sort
View
SGP
2007
13 years 10 months ago
Reconstruction of deforming geometry from time-varying point clouds
In this paper, we describe a system for the reconstruction of deforming geometry from a time sequence of unstructured, noisy point clouds, as produced by recent real-time range sc...
Michael Wand, Philipp Jenke, Qi-Xing Huang, Martin...
ICPR
2008
IEEE
14 years 2 months ago
Registration by using a pseudo color attribute
This paper presents a new variant of the classical Iterative Closest Point (ICP) algorithm. The ICP result depends heavily on the matching between 3D points of the two cloud of po...
Felipe Trujillo-Romero, Michel Devy
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 2 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
ICCV
1999
IEEE
14 years 3 days ago
Epipolar Geometry Estimation by Tensor Voting in 8D
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
Chi-Keung Tang, Gérard G. Medioni, Mi-Suen ...
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 7 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin