Sciweavers

19 search results - page 1 / 4
» Graph kernels between point clouds
Sort
View
ICML
2008
IEEE
14 years 5 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
CG
2004
Springer
13 years 4 months ago
Point cloud surfaces using geometric proximity graphs
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
Jan Klein, Gabriel Zachmann
3DPVT
2006
IEEE
189views Visualization» more  3DPVT 2006»
13 years 10 months ago
Fast Safe Spline Surrogates for Large Point Clouds
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
Ashish Myles, Jörg Peters
JAT
2010
109views more  JAT 2010»
13 years 3 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi
3DIM
2005
IEEE
13 years 10 months ago
Globally Convergent Range Image Registration by Graph Kernel Algorithm
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
Radim Sára, Ikuko Shimizu Okatani, Akihiro ...