TY - GEN
T1 - LDI tree
T2 - 26th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1999
AU - Chang, Chun Fa
AU - Bishop, Gary
AU - Lastra, Anselmo
N1 - Funding Information:
We thank David McAllister for generating the reference images used in this paper, Nathan O’Brien for creating the excellent model of Il Redentore and the permission to use it, and the SIG-GRAPH reviewers for their valuable comments. This work is supported by DARPA ITO contract number E278 and NSF MIP-9612643. Generous equipment support was provided by the Intel Corporation.
PY - 1999/7/1
Y1 - 1999/7/1
N2 - Using multiple reference images in 3D image warping has been a challenging problem. Recently, the Layered Depth Image (LDI) was proposed by Shade et al. to merge multiple reference images under a single center of projection, while maintaining the simplicity of warping a single reference image. However it does not consider the issue of sampling rate. We present the LDI tree, which combines a hierarchical space partitioning scheme with the concept of the LDI. It preserves the sampling rates of the reference images by adaptively selecting an LDI in the LDI tree for each pixel. While rendering from the LDI tree, we only have to traverse the LDI tree to the levels that are comparable to the sampling rate of the output image. We also present a progressive refinement feature and a "gap filling" algorithm implemented by pre-filtering the LDI tree. We show that the amount of memory required has the same order of growth as the 2D reference images. This also bounds the complexity of rendering time to be less than directly rendering from all reference images. Copyright ACM 1999.
AB - Using multiple reference images in 3D image warping has been a challenging problem. Recently, the Layered Depth Image (LDI) was proposed by Shade et al. to merge multiple reference images under a single center of projection, while maintaining the simplicity of warping a single reference image. However it does not consider the issue of sampling rate. We present the LDI tree, which combines a hierarchical space partitioning scheme with the concept of the LDI. It preserves the sampling rates of the reference images by adaptively selecting an LDI in the LDI tree for each pixel. While rendering from the LDI tree, we only have to traverse the LDI tree to the levels that are comparable to the sampling rate of the output image. We also present a progressive refinement feature and a "gap filling" algorithm implemented by pre-filtering the LDI tree. We show that the amount of memory required has the same order of growth as the 2D reference images. This also bounds the complexity of rendering time to be less than directly rendering from all reference images. Copyright ACM 1999.
KW - Hierarchical representation
KW - Image-based rendering
UR - http://www.scopus.com/inward/record.url?scp=84886838044&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84886838044&partnerID=8YFLogxK
U2 - 10.1145/311535.311571
DO - 10.1145/311535.311571
M3 - Conference contribution
AN - SCOPUS:84886838044
T3 - Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1999
SP - 291
EP - 298
BT - Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1999
PB - Association for Computing Machinery, Inc
Y2 - 8 August 1999 through 13 August 1999
ER -