Compression-based integral curve data reuse framework for flow visualization

  • Fan Hong
  • Chongke Bi
  • Hanqi Guo
  • Kenji Ono
  • Xiaoru Yuan
Regular Paper
  • 137 Downloads

Abstract

Currently, by default, integral curves are repeatedly re-computed in different flow visualization applications, such as FTLE field computation, source-destination queries, etc., leading to unnecessary resource cost. We present a compression-based data reuse framework for integral curves, to greatly reduce their retrieval cost, especially in a resource-limited environment. In our design, a hierarchical and hybrid compression scheme is proposed to balance three objectives, including high compression ratio, controllable error, and low decompression cost. Specifically, we use and combine digitized curve sparse representation, floating-point data compression, and octree space partitioning to adaptively achieve the objectives. Results have shown that our data reuse framework could acquire tens of times acceleration in the resource-limited environment compared to on-the-fly particle tracing, and keep controllable information loss. Moreover, our method could provide fast integral curve retrieval for more complex data, such as unstructured mesh data.

Graphical Abstract

Keywords

Flow visualization Integral curves Flow lines High performance visualization Data compression Information retrieval 

References

  1. Agranovsky A, Camp D, Garth C, Bethel EW, Joy KI, Childs H (2014) Improved post hoc flow analysis via Lagrangian representations. In: Proc. of IEEE LDAV symposium, pp 67–75Google Scholar
  2. Barakat SS, Tricoche X (2013) Adaptive refinement of the flow map using sparse samples. IEEE Trans Vis Comput Graph 19(12):2753–2762CrossRefGoogle Scholar
  3. Bi C, Ono K (2014) 2-3-4 combination for parallel compression on the K computer. In: Proc. of IEEE pacific visualization symposium, pp 281–285Google Scholar
  4. Cabral B., Leedom LC (1993) Imaging vector fields using line integral convolution. In: Proc. of the 20th annual conference on computer graphics and interactive techniques (SIGGRAPH), pp 263–270Google Scholar
  5. Camp D, Garth C, Childs H, Pugmire D, Joy KI (2012) Parallel stream surface computation for large data sets. In: Proc. of IEEE LDAV symposium, pp 39–47Google Scholar
  6. Chandler J, Obermaier H, Joy KI (2015) Interpolation-based pathline tracing in particle-based flow visualization. IEEE Trans Vis Comput Graph 21(1):68–80CrossRefGoogle Scholar
  7. Chen C, Xu L, Lee T, Shen H (2012) A flow-guided file layout for out-of-core streamline computation. In: Proc. of IEEE Pacific visualization symposium, pp 145–152Google Scholar
  8. Chen L, Fujishiro I (2008) Optimizing parallel performance of streamline visualization for large distributed flow datasets. In: Proc. of IEEE Pacific visualization symposium, pp 87–94Google Scholar
  9. Ellsworth D, Green B, Moran PJ (2004) Interactive terascale particle visualization. In: 15th IEEE visualization 2004 conference (VIS 2004), pp 353–360Google Scholar
  10. Fout N, Ma K-L (2012) An adaptive prediction-based approach to lossless compression of floating-point volume data. IEEE Trans Vis Comput Graph 18(12):2295–2304CrossRefGoogle Scholar
  11. Garth C, Gerhardt F, Tricoche X, Hagen H (2007) Efficient computation and visualization of coherent structures in fluid flow applications. IEEE Trans Vis Comput Graph 13(6):1464–1471CrossRefGoogle Scholar
  12. Garth C, Krishnan H, Tricoche X, Tricoche T, Joy KI (2008) Generation of accurate integral surfaces in time-dependent vector fields. IEEE Trans Vis Comput Graph 14(6):1404–1411CrossRefGoogle Scholar
  13. Garth C, Tricoche X, Salzbrunn T, Bobach T, Scheuermann G (2004) Surface techniques for vortex visualization. In: Proc. of symposium on visualization, pp 155–164, 346Google Scholar
  14. Guo H, Hong F, Shu Q, Zhang J, Huang J, Yuan X (2014) Scalable Lagrangian-based attribute space projection for multivariate unsteady flow data. In: Proc. of IEEE Pacific visualization symposium, pp 33–40Google Scholar
  15. Guo H, Yuan X, Huang J, Zhu X (2013) Coupled ensemble flow line advection and analysis. IEEE Trans Vis Comput Graph 19(12):2733–2742CrossRefGoogle Scholar
  16. Guo H, Zhang J, Liu R, Liu L, Yuan X, Huang J, Meng X, Pan J (2014) Advection-based sparse data management for visualizing unsteady flow. IEEE Trans Vis Comput Graph 20(12):2555–2564CrossRefGoogle Scholar
  17. Haller G (2001) Distinguished material surfaces and coherent structures in three-dimensional fluid flows. Phys D Nonlinear Phenom 149(4):248–277MathSciNetCrossRefMATHGoogle Scholar
  18. Hlawatsch M, Sadlo F, Weiskopf D (2011) Hierarchical line integration. IEEE Trans Vis Comput Graph 17(8):1148–1163CrossRefGoogle Scholar
  19. Hong F, Lai C, Guo H, Shen E, Yuan X, Li S (2014) FLDA: latent dirichlet allocation based unsteady flow analysis. IEEE Trans Vis Comput Graph 20(12):2545–2554CrossRefGoogle Scholar
  20. Hummel M, Obermaier H, Garth C, Joy KI (2013) Comparative visual analysis of lagrangian transport in CFD ensembles. IEEE Trans Vis Comput Graph 19(12):2743–2752CrossRefGoogle Scholar
  21. Isenburg M, Lindstrom P, Snoeyink J (2005) Lossless compression of predicted floating-point geometry. Comput Aided Design 37(8):869–877CrossRefMATHGoogle Scholar
  22. Kendall W, Wang J, Allen M, Peterka T, Huang J, Erickson D (2011) Simplified parallel domain traversal. In: Proc. of international conference on high performance computing networking, storage and analysis, pp 10:1–10:11Google Scholar
  23. Krishnan H, Garth C, Joy KI (2009) Time and streak surfaces for flow visualization in large time-varying data sets. IEEE Trans Vis Comput Graph 15(6):1267–1274CrossRefGoogle Scholar
  24. Lindstrom P (2014) Fixed-rate compressed floating-point arrays. IEEE Trans Vis Comput Graph 20(12):2674–2683CrossRefGoogle Scholar
  25. Lu K, Shen H, Peterka T (2014) Scalable computation of stream surfaces on large scale vector fields. In: Proc. of international conference on high performance computing networking, storage and analysis, pp 1008–1019Google Scholar
  26. Müller C, Camp D, Hentschel B, Garth C (2013) Distributed parallel particle advection using work requesting. In: Proc. of IEEE LDAV symposium, pp 1–6Google Scholar
  27. Nouanesengsy B, Lee T, Lu K, Shen H, Peterka T (2012) Parallel particle advection and FTLE computation for time-varying flow fields. In: Proc. of international conference on high performance computing networking, storage and analysis, pp 61:1–61:11Google Scholar
  28. Nouanesengsy B, Lee T, Shen H (2011) Load-balanced parallel streamline generation on large scale vector fields. IEEE Trans Vis Comput Graph 17(12):1785–1794CrossRefGoogle Scholar
  29. Pugmire D, Childs H, Garth C, Ahern S, Weber GH (2009) Scalable computation of streamlines on very large datasets. In: Proc. of the ACM/IEEE conference on high performance computingGoogle Scholar
  30. Ratanaworabhan P, Ke J, Burtscher M (2006) Fast lossless compression of scientific floating-point data. In: Proc. of data compression conference, pp 133–142Google Scholar
  31. Schneider PJ (1990) An algorithm for automatically fitting digitized curves. In: Graphics gems. Academic Press Professional, Inc., pp 612–626Google Scholar
  32. Tao H, Moorhead RJ (1994) Progressive transmission of scientific data using biorthogonal wavelet transform. In: Proc. of IEEE conference on visualization, pp 93–99Google Scholar
  33. Usevitch BE (2005) JPEG2000 compliant lossless coding of floating point data. In: Proc. of data compression conference, pp 484–484Google Scholar

Copyright information

© The Visualization Society of Japan 2017

Authors and Affiliations

  1. 1.Key Laboratory of Machine Perception (Ministry of Education), and School of EECSPeking UniversityBeijingChina
  2. 2.School of SoftwareTianjin UniversityTianjinChina
  3. 3.Mathematics and Computer Science DivisionArgonne National LaboratoryDuPage CountyUSA
  4. 4.Research Institute for Information TechnologyKyushu UniversityFukuokaJapan
  5. 5.Advanced Institute for Computational ScienceRIKENKobeJapan

Personalised recommendations