Sciweavers

1348 search results - page 187 / 270
» Matching planar maps
Sort
View

Publication
364views
14 years 3 months ago
CV-SLAM: A new ceiling vision-based SLAM technique
We propose a fast and robust CV-SLAM (Ceiling Vision –based Simultaneous Localization and Mapping) technique using a single ceiling vision sensor. The proposed algorithm is suita...
Woo Yeon Jeong (Seoul National University), Kyoung...
SI3D
2010
ACM
14 years 3 months ago
Stochastic transparency
Stochastic transparency provides a unified approach to orderindependent transparency, anti-aliasing, and deep shadow maps. It augments screen-door transparency using a random sub...
Eric Enderton, Erik Sintorn, Peter Shirley, David ...
SASO
2008
IEEE
14 years 3 months ago
Cells Are Plausible Targets for High-Level Spatial Languages
—High level languages greatly increase the power of a programmer at the cost of programs that consume more s than those written at a lower level of abstraction. This inefficienc...
Jacob Beal, Jonathan Bachrach
FGR
2006
IEEE
157views Biometrics» more  FGR 2006»
14 years 2 months ago
Morphable Face Reconstruction with Multiple Images
Efficient 3D face reconstruction is very important for face animation and recognition. The slow speed of the 3D morphable model is due to the texture mapping. To improve the spee...
Ming Zhao 0003, Tat-Seng Chua, Terence Sim
COMPGEOM
2006
ACM
14 years 2 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy