1390 search results - page 99 / 278 » Computing the depth of a flat |
IJAMCIGI
2010
14 years 4 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
—A common computer vision task is navigation and mapping. Many indoor navigation tasks require depth knowledge of flat, unstructured surfaces (walls, floor, ceiling). With pass...
EGH
2005
Springer
15 years 3 months ago
2005
Springer
We present a novel method for rendering shadow volumes. The core idea of the method is to locally choose between Z-pass and Z-fail algorithms on a per-tile basis. The choice is ma...
114
click to vote
CVPR
1997
IEEE
15 years 2 months ago
1997
IEEE
ÐWe describe a new direct method for estimating structure and motion from image intensities of multiple views. We extend the direct methods of Horn and Weldon [18] to three views....
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been c...