Sciweavers

1728 search results - page 194 / 346
» Surface distance maps
Sort
View
COMPGEOM
2006
ACM
16 years 18 days 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
ICIP
2004
IEEE
16 years 8 months ago
Robust ego-motion estimation and 3d model refinement using depth based parallax model
We present an iterative algorithm for robustly estimating the egomotion and refining and updating a coarse, noisy and partial depth map using a depth based parallax model and brig...
Amit K. Agrawal, Rama Chellappa
PAMI
2008
174views more  PAMI 2008»
15 years 6 months ago
Multiflash Stereopsis: Depth-Edge-Preserving Stereo with Small Baseline Illumination
Traditional stereo matching algorithms are limited in their ability to produce accurate results near depth discontinuities, due to partial occlusions and violation of smoothness co...
Rogerio Feris, Ramesh Raskar, Longbin Chen, Kar-Ha...
ICIP
2009
IEEE
15 years 4 months ago
Rapid stereo-vision enhanced face detection
This paper presents a real-time face detection algorithm. It improves state-of-the-art 2D object detection techniques by additionally evaluating a disparity map, which is estimate...
Sergey Kosov, Kristina Scherbaum, Kamil Faber, Tho...
170
Voted
ICALP
2001
Springer
15 years 11 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...