Sciweavers

144 search results - page 4 / 29
» Landmark matching on the sphere using distance functions
Sort
View
ICRA
2008
IEEE
104views Robotics» more  ICRA 2008»
14 years 6 days ago
Towards locally computable polynomial navigation functions for convex obstacle workspaces
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
Grigoris Lionis, Xanthi Papageorgiou, Kostas J. Ky...
CVPR
2005
IEEE
14 years 7 months ago
Dense Photometric Stereo Using a Mirror Sphere and Graph Cut
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
Tai-Pang Wu, Chi-Keung Tang
PAMI
2012
11 years 8 months ago
Medial Spheres for Shape Approximation
—We study the problem of approximating a 3D solid with a union of overlapping spheres. In comparison with a stateof-the-art approach, our method offers more than an order of magn...
Svetlana Stolpner, Paul G. Kry, Kaleem Siddiqi
CGI
2004
IEEE
13 years 9 months ago
Feature-Sensitive 3D Shape Matching
Three dimensional shape matching plays an important role in many of today's applications. Nevertheless, shape matching is a difficult problem since there is no unique measure...
Andrei Sharf, Ariel Shamir
ICCV
2007
IEEE
14 years 7 months ago
Discrete camera calibration from the information distance between pixel streams
We consider the problem of estimating the relative orientation of a number of individual photocells -or pixels- that hold fixed relative positions. The photocells measure the inte...
Etienne Grossmann, Francesco Orabona, José ...