Advertisement

Journal of Visualization

, Volume 18, Issue 2, pp 147–157 | Cite as

A near lossless compression domain volume rendering algorithm for floating-point time-varying volume data

  • Zhi-yu Ding
  • Jian-gang Tan
  • Xiang-yang Wu
  • Wei-feng Chen
  • Fei-ran Wu
  • Xin Li
  • Wei Chen
Regular Paper
  • 251 Downloads

Abstract

Compressing floating-point time-varying volume data and achieving both high compression rate and near lossless are challenging. This paper proposes a compression domain volume rendering (CDVR) approach based on hierarchical vector quantization (HVQ) and perfect spatial hashing (PSH) techniques. First, a HVQ process is applied to the first frame to obtain codebooks and index volumes. Then, a sparse residual volume (SRV) is computed by differencing the first frame and the recovery volume, which is reconstructed by utilizing the codebooks and the index volumes. Difference volumes are calculated by differencing the adjacent frame pairs of the time-series. Thereafter, both the SRV and the difference volumes are compressed by means of PSH technique. To render the time-series, the codebooks, the index volumes and the results of PSH are decompressed on-the-fly in constant time in GPU. In addition, a high compression rate is achieved by HVQ and PSH, and the compression is near lossless. The results on varied datasets verify that the proposed method can achieve the high compression rate and near lossless compression quality for floating-point time-varying volume data, as well as high efficient CDVR.

Graphical Abstract

Keywords

Near lossless compression Compression domain volume rendering Vector quantization Perfect spatial hashing  Time-varying 

Notes

Acknowledgments

Supported by National High Technology Research and Development Program of China (2012AA12090), Major Program of National Natural Science Foundation of China (61232012), National Natural Science Foundation of China (81172124), National Natural Science Foundation of China (No. 61003193), National Natural Science Foundation of China (61303134), Zhejiang Provincial Natural Science Foundation of China(LY13F020048).

References

  1. Balsa Rodréguez M, Gobbetti E, Iglesias Guitián J, Makhinya M, Marton F, Pajarola R, Suter S (2014) State-of-the-art in compressed gpu-based direct volume rendering. In: Computer Graphics Forum. Wiley Online LibraryGoogle Scholar
  2. Fout N, Akiba H, Ma K-L, Lefohn AE, Kniss J (2005) High quality rendering of compressed volume data formats. In: Proceedings of the Seventh Joint Eurographics/IEEE VGTC conference on Visualization. Eurographics Association pp 77–84Google Scholar
  3. Fout N, Ma K-L (2007) Transform coding for hardware-accelerated volume rendering. Vis Comput Graph, IEEE Trans 13(6):1600–1607CrossRefGoogle Scholar
  4. Fout N, Ma K-L (2012) An adaptive prediction-based approach to lossless compression of floating-point volume data. Vis Comput Graph, IEEE Trans 18(12):2295–2304CrossRefGoogle Scholar
  5. Gobbetti E, Iglesias Guitián JA, Marton F (2012) Covra: a compression-domain output-sensitive volume rendering architecture based on a sparse representation of voxel blocks. In: Computer Graphics Forum. Wiley Online Library, vol 31, pp 1315–1324Google Scholar
  6. Jang Y, Ebert DS, Gaither K (2012) Time-varying data visualization using functional representations. Vis Comput Graph, IEEE Trans 18(3):421–433CrossRefGoogle Scholar
  7. Kraus M, Ertl T (2002) Adaptive texture maps. In: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware. Eurographics Association, pp 7–15Google Scholar
  8. Lefebvre S, Hoppe H (2006) Perfect spatial hashing. In: ACM Transactions on Graphics (TOG), vol 25. ACM pp 579–588Google Scholar
  9. Linde Y, Buzo A, Gray RM (1980) An algorithm for vector quantizer design. Commun, IEEE Trans 28(1):84–95CrossRefGoogle Scholar
  10. Lindstrom P, Isenburg M (2006) Fast and efficient compression of floating-point data. Vis Comput Graph, IEEE Trans 12(5):1245–1250CrossRefGoogle Scholar
  11. Lu Z, Zheng W, Sun S (2011) Applications of vector quantization in multimedia signal processing. Science PressGoogle Scholar
  12. Lum EB, Ma KL, Clyne J (2001) Texture hardware assisted rendering of time-varying volume data. In: Proceedings of the conference on Visualization’01. IEEE Computer Society, pp 263–270Google Scholar
  13. Ma K-L (2003) Visualizing time-varying volume data. Comput Sci Eng 5(2):34–42CrossRefGoogle Scholar
  14. Ma K-L, Shen H-W (2000) Compression and accelerated rendering of time-varying volume data. In: Proceedings of the 2000 International Computer Symposium-Workshop on Computer graphics and virtual reality, pp 82–89Google Scholar
  15. Ning P, Hesselink L (1992) Vector quantization for volume rendering. In Proceedings of the 1992 workshop on Volume visualization. ACM, pp 69–74Google Scholar
  16. Ning P, Hesselink L (1993) Fast volume rendering of compressed data. In: Visualization, 1993. Visualization’93, Proceedings., IEEE Conference on. IEEE, pp 11–18Google Scholar
  17. Parys R, Knittel G (2009) Giga-voxel rendering from compressed data on a display wallGoogle Scholar
  18. Schneider J, Westermann R (2003) Compression domain volume rendering. In: Visualization, 2003. VIS 2003. IEEE. IEEE, pp 293–300Google Scholar
  19. Shen H-W, Chiang L-J, Ma K-L (1999) A fast volume rendering algorithm for time-varying fields using a time-space partitioning (tsp) tree. In: Proceedings of the conference on Visualization’99: celebrating ten years. IEEE Computer Society Press pp 371–377Google Scholar
  20. Shen H-W, Johnson CR (1994) Differential volume rendering: a fast volume visualization technique for flow animation. In: Proceedings of the conference on Visualization’94. IEEE Computer Society Press pp 180–187Google Scholar
  21. Wang C, Yu H, Ma K-L (2010) Application-driven compression for visualizing large-scale time-varying data. Comput Graph Appl, IEEE 30(1):59–69CrossRefMathSciNetGoogle Scholar
  22. Ye S, Wang G, Chen H, Zhou M, Chen G, Chen W (2011) Gpu-friendly regularization and volume rendering of tetrahedral volumetric datasets. J Comput-Aided Design Comput Graph 23(6):933–940Google Scholar
  23. Zhao L, Xiao D, Li K, Yue G, Peng C (2009) An efficient algorithm for large-scale volume data compression and its application in seismic data processing. J Comput-Aided Design Comput Graph 11:1606–1611Google Scholar
  24. Zhou K, Ren Z, Lin S, Bao H, Guo B, Shum H-Y (2008) Real-time smoke rendering using compensated ray marching. In: ACM Transactions on Graphics (TOG), ACM vol 27, p 36Google Scholar

Copyright information

© The Visualization Society of Japan 2015

Authors and Affiliations

  • Zhi-yu Ding
    • 1
  • Jian-gang Tan
    • 1
  • Xiang-yang Wu
    • 2
  • Wei-feng Chen
    • 3
  • Fei-ran Wu
    • 1
  • Xin Li
    • 4
  • Wei Chen
    • 1
  1. 1.State Key Lab of CAD&CGZhejiang UniversityHangzhouChina
  2. 2.School of Computer Science and TechnologyHangzhou Dianzi UniversityHangzhouChina
  3. 3.Zhejiang University of Finance and EconomicsHangzhouChina
  4. 4.China University of PetroleumBeijingChina

Personalised recommendations