Sciweavers

824 search results - page 60 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
ICRA
2008
IEEE
182views Robotics» more  ICRA 2008»
14 years 2 months ago
Hybrid laser and vision based object search and localization
— We describe a method for an autonomous robot to efficiently locate one or more distinct objects in a realistic environment using monocular vision. We demonstrate how to effic...
Dorian Galvez Lopez, Kristoffer Sjöö, Ch...
ISBI
2008
IEEE
14 years 8 months ago
An algorithm to map asymmetries of bilateral objects in point clouds
We present a method to automatically quantify the local asymmetries of bilateral structures in point clouds. The method relies on the robust computation of the approximate symmetr...
Benoît Combès, Robin Hennessy, John W...
CIVR
2008
Springer
279views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Semi-supervised learning of object categories from paired local features
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
Wen Wu, Jie Yang
CN
2006
100views more  CN 2006»
13 years 8 months ago
Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds
We consider how to construct and maintain a structured overlay P2P network based on the small-world paradigm. Two main attractive properties of a small-world network are (1) a low...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
14 years 2 months ago
Coverage Diameters of Polygons
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
Pawin Vongmasa, Attawith Sudsang