Sciweavers

653 search results - page 42 / 131
» Efficient reconstruction from non-uniform point sets
Sort
View
ADCM
2007
100views more  ADCM 2007»
15 years 1 days ago
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphi
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
Evgeny Lipovetsky, Nira Dyn
PAMI
2006
173views more  PAMI 2006»
14 years 11 months ago
Structure from Motion with Wide Circular Field of View Cameras
This paper presents a method for fully automatic and robust estimation of two-view geometry, autocalibration, and 3D metric reconstruction from point correspondences in images take...
Branislav Micusík, Tomás Pajdla
JSCIC
2010
231views more  JSCIC 2010»
14 years 6 months ago
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
Variational models for image segmentation have many applications, but can be slow to compute. Recently, globally convex segmentation models have been introduced which are very rel...
Tom Goldstein, Xavier Bresson, Stanley Osher
IJON
1998
44views more  IJON 1998»
14 years 11 months ago
Hierarchical RBF networks and local parameters estimate
The method presented here is aimed to a direct fast setting of the parameters of a RBF network for function approximation. It is based on a hierarchical gridding of the input spac...
N. Alberto Borghese, Stefano Ferrari
ECCV
2010
Springer
15 years 5 months ago
3D Point Correspondence by Minimum Description Length in Feature Space
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...