Sciweavers

473 search results - page 15 / 95
» Volume scene graphs
Sort
View
CVPR
2006
IEEE
15 years 11 months ago
The Panum Proxy Algorithm for Dense Stereo Matching over a Volume of Interest
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
Ankur Agarwal, Andrew Blake
ICCV
1999
IEEE
15 years 11 months ago
Roxels: Responsibility Weighted 3D Volume Reconstruction
This paper examines the problem of reconstructing a voxelized representation of 3D space from a series of images. An iterative algorithm is used to find the scene model which join...
Jeremy S. De Bonet, Paul A. Viola
CGF
2006
107views more  CGF 2006»
14 years 9 months ago
Volume-Surface Trees
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier,...
HLK
2003
IEEE
15 years 2 months ago
Bayesian Reconstruction of 3D Shapes and Scenes From A Single Image
It’s common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts “filled-in” by prior visual knowledge. In this pa...
Feng Han, Song Chun Zhu
RT
1998
Springer
15 years 1 months ago
Image-Based Rendering for Non-Diffuse Synthetic Scenes
Most current image-based rendering methods operate under the assumption that all of the visible surfaces in the scene are opaque ideal diffuse (Lambertian) reflectors. This paper i...
Dani Lischinski, Ari Rappoport