Sciweavers

1801 search results - page 44 / 361
» Pointing without a pointer
Sort
View
CVPR
2007
IEEE
14 years 11 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang
3DOR
2008
13 years 11 months ago
Isometry-invariant Matching of Point Set Surfaces
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic d...
Mauro R. Ruggeri, Dietmar Saupe
3DOR
2009
13 years 7 months ago
SkelTre - Fast Skeletonisation for Imperfect Point Cloud Data of Botanic Trees
Terrestrial laser scanners capture 3D geometry as a point cloud. This paper reports on a new algorithm aiming at the skeletonisation of a laser scanner point cloud, representing a...
Alexander Bucksch, Roderik C. Lindenbergh, Massimo...
HAPTICS
2005
IEEE
14 years 2 months ago
A Closest Point Algorithm for Parametric Surfaces with Global Uniform Asymptotic Stability
— We present an algorithm that determines the point on a convex parametric surface patch that is closest to a given (possibly moving) point. Any initial point belonging to the su...
Volkan Patoglu, R. Brent Gillespie
NCI
2004
141views Neural Networks» more  NCI 2004»
13 years 10 months ago
Estimating the error at given test input points for linear regression
In model selection procedures in supervised learning, a model is usually chosen so that the expected test error over all possible test input points is minimized. On the other hand...
Masashi Sugiyama