Sciweavers

6266 search results - page 32 / 1254
» New results on the computability and complexity of points - ...
Sort
View
APVIS
2010
13 years 3 months ago
Visual analysis of high dimensional point clouds using topological landscapes
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
Patrick Oesterling, Christian Heine, Heike Jä...
SCIA
2005
Springer
182views Image Analysis» more  SCIA 2005»
14 years 2 months ago
Complex Correlation Statistic for Dense Stereoscopic Matching
A traditional solution of area-based stereo uses some kind of windowed pixel intensity correlation. This approach suffers from discretization artifacts which corrupt the correlat...
Jan Cech, Radim Sára
APIN
1998
132views more  APIN 1998»
13 years 8 months ago
Evolution-Based Methods for Selecting Point Data for Object Localization: Applications to Computer-Assisted Surgery
Object localization has applications in many areas of engineering and science. The goal is to spatially locate an arbitrarily-shaped object. In many applications, it is desirable ...
Shumeet Baluja, David Simon
ECCV
2006
Springer
14 years 10 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
COLT
2000
Springer
14 years 1 months ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon