Sciweavers

478 search results - page 17 / 96
» Local Search for Computing Normal Circumstances Models
Sort
View
FOGA
2011
13 years 1 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
SGP
2004
14 years 23 days ago
Shape Segmentation Using Local Slippage Analysis
We propose a method for segmentation of 3D scanned shapes into simple geometric parts. Given an input point cloud, our method computes a set of components which possess one or mor...
Natasha Gelfand, Leonidas J. Guibas
ECCV
2004
Springer
15 years 7 days ago
Line Geometry for 3D Shape Understanding and Reconstruction
We understand and reconstruct special surfaces from 3D data with line geometry methods. Based on estimated surface normals we use approximation techniques in line space to recogniz...
Helmut Pottmann, Michael Hofer, Boris Odehnal, Joh...
ICRA
2009
IEEE
122views Robotics» more  ICRA 2009»
13 years 8 months ago
Utilizing reflection properties of surfaces to improve mobile robot localization
Abstract-- A main difficulty that arises in the context of probabilistic localization is the design of an appropriate observation model, i.e., determining the likelihood of a senso...
Maren Bennewitz, Cyrill Stachniss, Sven Behnke, Wo...
CVPR
2010
IEEE
14 years 2 months ago
Model Globally, Match Locally: Efficient and Robust 3D Object Recognition
This paper addresses the problem of recognizing freeform 3D objects in point clouds. Compared to traditional approaches based on point descriptors, which depend on local informati...
Bertram Drost, Markus Ulrich, Nassir Navab, Slobod...