Access Restriction

Author Dally, William ♦ Mcmillan, Leonard ♦ Fuchs, Henry
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Delta Tree Store ♦ Delta Tree ♦ Final Image ♦ Frequency Domain ♦ Efficient Representation ♦ Sampling Sphere ♦ Image-based Rendering ♦ Pix El ♦ Partial Image ♦ Object-centered Approach ♦ Data Structure ♦ Reference Image ♦ Arbitrary Viewpoint ♦ Required Block ♦ Subdivision Algorithm ♦ Root Node ♦ Arbitrary Re-projections ♦ Frequency Component
Description This paper introduces the delta tree, a data structure that represents an object using a set of reference images. It also describes an algorithm for generating arbitrary re-projections of an object by traversing its delta tree. Delta trees are an efficient representation in terms of both storage and rendering performance. Each node of a delta tree stores an image taken from a point on a sampling sphere that encloses the object. Each image is compressed by discarding pix- els that can be reconstructed by warping its ancestor's images to the node's viewpoint. The partial image stored at each node is divided into blocks and represented in the frequency domain. The rendering process generates an image at an arbitrary viewpoint by traversing the delta tree from a root node to one or more of its leaves. A subdivision algorithm selects only the required blocks from the nodes along the path. For each block, only the frequency components necessary to reconstruct the final image at an appropria...
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1996-01-01
Publisher Institution MIT AI Lab Technical Memo 1604, MIT