Sciweavers

1390 search results - page 202 / 278
» Computing the depth of a flat
Sort
View
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
15 years 4 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
ICCV
2007
IEEE
15 years 4 months ago
Reconstructing the Surface of Inhomogeneous Transparent Scenes by Scatter-Trace Photography
We present a new method for reconstructing the exterior surface of a complex transparent scene with inhomogeneous interior (e.g., multiple interfaces, reflective or painted inter...
Nigel J. W. Morris, Kiriakos N. Kutulakos
PG
2007
IEEE
15 years 4 months ago
The Soft Shadow Occlusion Camera
A fundamental challenge for existing shadow map based algorithms is dealing with partially illuminated surfaces. A conventional shadow map built with a pinhole camera only determi...
Qi Mo, Voicu Popescu, Chris Wyman
ACCV
2007
Springer
15 years 4 months ago
Fast 3-D Interpretation from Monocular Image Sequences on Large Motion Fields
Abstract. This paper proposes a fast method for dense 3-D interpretation to directly estimate a dense map of relative depth and motion from a monocular sequence of images on large ...
Jong-Sung Kim, Ki-Sang Hong
SIGCSE
2006
ACM
179views Education» more  SIGCSE 2006»
15 years 3 months ago
Fifteen compilers in fifteen days
Traditional approaches to semester-long projects in compiler courses force students to implement the early stages of a compiler in depth; since many students fall behind, they hav...
Jeremy D. Frens, Andrew Meneely