Journal
COMPUTER GRAPHICS FORUM
Volume 31, Issue 3, Pages 1315-1324Publisher
WILEY
DOI: 10.1111/j.1467-8659.2012.03124.x
Keywords
Computer Graphics [I.3.3]: Picture/Image Generation; Computer Graphics [I.3.7]: Three-dimensional graphics and realism; Coding and Information Theory [E.4]: Data compaction and compression; Compression (Coding) [I.4.2]: Approximate methods
Categories
Funding
- EU FP7 Program under the DIVA project [290277]
Ask authors/readers for more resources
We present a novel multiresolution compression-domain GPU volume rendering architecture designed for interactive local and networked exploration of rectilinear scalar volumes on commodity platforms. In our approach, the volume is decomposed into a multiresolution hierarchy of bricks. Each brick is further subdivided into smaller blocks, which are compactly described by sparse linear combinations of prototype blocks stored in an overcomplete dictionary. The dictionary is learned, using limited computational and memory resources, by applying the K-SVD algorithm to a re-weighted non-uniformly sampled subset of the input volume, harnessing the recently introduced method of coresets. The result is a scalable high quality coding scheme, which allows very large volumes to be compressed off-line and then decompressed on-demand during real-time GPU-accelerated rendering. Volumetric information can be maintained in compressed format through all the rendering pipeline. In order to efficiently support high quality filtering and shading, a specialized real-time renderer closely coordinates decompression with rendering, combining at each frame images produced by raycasting selectively decompressed portions of the current view- and transfer-function-dependent working set. The quality and performance of our approach is demonstrated on massive static and time-varying datasets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available