Layered depth images (1997)
Cached
Download Links
- [artis.imag.fr]
- [ftp.cs.washington.edu]
- [www.cs.unc.edu]
- [www.cs.washington.edu]
- [www.cs.princeton.edu]
- [grail.cs.washington.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu:80]
- [www.cs.princeton.edu]
- [grail.cs.washington.edu]
- [www.cs.washington.edu]
- [www.cs.washington.edu]
- [www.cs.washington.edu]
- [www.cs.washington.edu]
- [www.cs.washington.edu]
- [faculty.cs.tamu.edu]
- [ftp.research.microsoft.com]
- [hillbilly.deas.harvard.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 319 - 21 self |
BibTeX
@MISC{Gortler97layereddepth,
author = {Steven J. Gortler and Li-wei He and Michael F. Cohen},
title = {Layered depth images},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present an efficient image based rendering system that renders multiple frames per second on a PC. Our method performs warping from an intermediate representation called a layered depth image (LDI). An LDI is a view of the scene from a single input camera view, but with multiple pixels along each line of sight. When n input images are preprocessed to create a single LDI, the size of the representation grows linearly only with the observed depth complexity in the n images, instead of linearly with n. Moreover, because the LDI data are represented in a single image coordinate system, McMillan's warp ordering algorithm can be successfully adapted. As a result, pixels are drawn in the output image in back to front order. No z-buffer is required, so alpha-compositing can be done efficiently without depth sorting. This makes splatting an efficient solution to the resampling problem.
