Sciweavers

591 search results - page 41 / 119
» Computing fundamental groups from point clouds
Sort
View
143
Voted
IJCV
2011
152views more  IJCV 2011»
14 years 10 months ago
Recovering Occlusion Boundaries from an Image
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
Derek Hoiem, Alexei A. Efros, Martial Hebert
122
Voted
LOCA
2005
Springer
15 years 9 months ago
Classifying the Mobility of Users and the Popularity of Access Points
Abstract. There is increasing interest in location-aware systems and applications. It is important for any designer of such systems and applications to understand the nature of use...
Minkyong Kim, David Kotz
INFOCOM
2008
IEEE
15 years 10 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
SGP
2004
15 years 6 months 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
BMVC
2010
15 years 1 months ago
Back to the Future: Learning Shape Models from 3D CAD Data
Recognizing 3D objects from arbitrary view points is one of the most fundamental problems in computer vision. A major challenge lies in the transition between the 3D geometry of o...
Michael Stark, Michael Goesele, Bernt Schiele