City Research Online

Generalized Voxel Coloring

Culbertson, W. B., Malzbender, T. & Slabaugh, G. G. (2000). Generalized Voxel Coloring. In: Triggs, B., Zisserman, A. & Szeliski, R. (Eds.), Vision Algorithms: Theory and Practice. (pp. 100-115). Springer. doi: 10.1007/3-540-44480-7_7


Image-based reconstruction from randomly scattered views is a challenging problem. We present a new algorithm that extends Seitz and Dyer’s Voxel Coloring algorithm. Unlike their algorithm, ours can use images from arbitrary camera locations. The key problem in this class of algorithms is that of identifying the images from which a voxel is visible. Unlike Kutulakos and Seitz’s Space Carving technique, our algorithm solves this problem exactly and the resulting reconstructions yield better results in our application, which is synthesizing new views. One variation of our algorithm minimizes color consistency comparisons; another uses less memory and can be accelerated with graphics hardware. We present efficiency measurements and, for comparison, we present images synthesized using our algorithm and Space Carving.

Publication Type: Book Section
Additional Information: The final publication is available at Springer via
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: School of Science & Technology > Computer Science
[thumbnail of Generalized Voxel Coloring.pdf]
PDF - Accepted Version
Download (2MB) | Preview


Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email


Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login