Sciweavers

1715 search results - page 60 / 343
» Point Sample Rendering
Sort
View
ICIP
2004
IEEE
14 years 9 months ago
Optimized space sampling for circular image cube trajectory analysis
Image Cube Trajectory (ICT) analysis is a new and robust method to estimate the 3D structure of a scene from a set of 2D images. The motion of points in 3D space is represented by...
Ingo Feldmann, Peter Kauff, Peter Eisert
CGF
2010
153views more  CGF 2010»
13 years 7 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 7 days ago
BBOB-benchmarking the DIRECT global optimization algorithm
The DIRECT global optimization algorithm is tested on the BBOB 2009 testbed. The algorithm is rather time and space consuming since it does not forget any point it samples during ...
Petr Posik
COLT
2004
Springer
14 years 1 months ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
CVPR
2004
IEEE
14 years 9 months ago
Invariant Operators, Small Samples, and the Bias-Variance Dilemma
Invariant features or operators are often used to shield the recognition process from the effect of "nuisance" parameters, such as rotations, foreshortening, or illumina...
Xiaojin Shi, Roberto Manduchi