Sciweavers

605 search results - page 49 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
PAMI
2008
175views more  PAMI 2008»
13 years 7 months ago
Discriminative Feature Co-Occurrence Selection for Object Detection
This paper describes an object detection framework that learns the discriminative co-occurrence of multiple features. Feature co-occurrences are automatically found by Sequential F...
Takeshi Mita, Toshimitsu Kaneko, Björn Stenge...
3DIM
2007
IEEE
14 years 2 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
CVPR
2012
IEEE
11 years 10 months ago
Probabilistic tensor voting for robust perceptual grouping
We address the problem of unsupervised segmentation and grouping in 2D and 3D space, where samples are corrupted by noise, and in the presence of outliers. The problem has attract...
Dian Gong, Gérard G. Medioni
COMGEO
1998
ACM
13 years 7 months ago
Variable resolution triangulations
In this paper we introduce variable resolution 4– meshes, a powerful structure for the representation of geometric objects at multiple levels of detail. It combines most propert...
Enrico Puppo
ISVD
2007
IEEE
14 years 2 months ago
Computing the 3D Voronoi Diagram Robustly: An Easy Explanation
Many algorithms exist for computing the 3D Voronoi diagram, but in most cases they assume that the input is in general position. Because of the many degeneracies that arise in 3D ...
Hugo Ledoux