TY - JOUR
T1 - A framework for gpu-accelerated exploration of massive time-varying rectilinear scalar volumes
AU - Marton, Fabio
AU - Agus, Marco
AU - Gobbetti, Enrico
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The authors would like to warmly thank Peter Lindstrom (ZFP), Mar Treib (CC), and Sheng Di, Dingwen Tao, Xin Liang (SZ) for making their ompression odes availableDatasets ISO, HBDT and CHAN are ourtesy of the Johns Hopkins Turbulene Database (JHTDB) initiative. Dataset RT is ourtesy of LLNL. We also aknowledge the ontribution of Sardinian Regional Authorities (projets VIGECLAB and TDM) and of King Abdullah University of Siene and Tehnology (KAUST).
PY - 2019/7/10
Y1 - 2019/7/10
N2 - We introduce a novel flexible approach to spatiotemporal exploration of rectilinear scalar volumes. Our out-of-core representation, based on per-frame levels of hierarchically tiled non-redundant 3D grids, efficiently supports spatiotemporal random access and streaming to the GPU in compressed formats. A novel low-bitrate codec able to store into fixed-size pages a variable-rate approximation based on sparse coding with learned dictionaries is exploited to meet stringent bandwidth constraint during time-critical operations, while a near-lossless representation is employed to support high-quality static frame rendering. A flexible high-speed GPU decoder and raycasting framework mixes and matches GPU kernels performing parallel object-space and image-space operations for seamless support, on fat and thin clients, of different exploration use cases, including animation and temporal browsing, dynamic exploration of single frames, and high-quality snapshots generated from near-lossless data. The quality and performance of our approach are demonstrated on large data sets with thousands of multi-billion-voxel frames.
AB - We introduce a novel flexible approach to spatiotemporal exploration of rectilinear scalar volumes. Our out-of-core representation, based on per-frame levels of hierarchically tiled non-redundant 3D grids, efficiently supports spatiotemporal random access and streaming to the GPU in compressed formats. A novel low-bitrate codec able to store into fixed-size pages a variable-rate approximation based on sparse coding with learned dictionaries is exploited to meet stringent bandwidth constraint during time-critical operations, while a near-lossless representation is employed to support high-quality static frame rendering. A flexible high-speed GPU decoder and raycasting framework mixes and matches GPU kernels performing parallel object-space and image-space operations for seamless support, on fat and thin clients, of different exploration use cases, including animation and temporal browsing, dynamic exploration of single frames, and high-quality snapshots generated from near-lossless data. The quality and performance of our approach are demonstrated on large data sets with thousands of multi-billion-voxel frames.
UR - http://hdl.handle.net/10754/656776
UR - https://onlinelibrary.wiley.com/doi/abs/10.1111/cgf.13671
UR - http://www.scopus.com/inward/record.url?scp=85070098833&partnerID=8YFLogxK
U2 - 10.1111/cgf.13671
DO - 10.1111/cgf.13671
M3 - Article
SN - 0167-7055
VL - 38
SP - 53
EP - 66
JO - Computer Graphics Forum
JF - Computer Graphics Forum
IS - 3
ER -