Abstract
This paper focuses on developing effective and efficient algorithms for compressing scientific simulation data computed on structured and unstructured grids. A paradigm for lossy compression of this data is proposed in which the data computed on the grid is modeled as a graph, which gets decomposed into sets of vertices which satisfy a user defined error constraint ε. Each set of vertices is replaced by a constant value with reconstruction error bounded by ε. A comprehensive set of experiments is conducted by comparing these algorithms and other state-of-the-art scientific data compression methods. Over our benchmark suite, our methods obtained compression of 1% of the original size with average PSNR of 43.00 and 3% of the original size with average PSNR of 63.30. In addition, our schemes outperform other state-of-the-art lossy compression approaches and require on the average 25% of the space required by them for similar or better PSNR levels.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Baldwin, C., Abdulla, G., Critchlow, T.: Multi-resolution Modeling of Large Scale Scientific Simulation Data. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management - CIKM 2003, p. 40 (2003)
Belfor, R.A.F., Hesp, M.P.A., Lagendijk, R.L., Biemond, J.: Spatially Adaptive Subsampling of Image Sequences. IEEE Transactions on Image Processing 3(5), 492–500 (1994)
Coifman, R., Maggioni, M.: Diffusion wavelets. Applied and Computational Harmonic Analysis 21(1), 53–94 (2006)
Engelson, V., Fritzson, D., Fritzson, P.: Lossless Compression of High-volume Numerical Data from Simulations. In: Data Compression Conference, pp. 574–586 (2000)
Karni, Z., Gotsman, C.: Spectral Compression of Mesh Geometry. In: Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH 2000, pp. 279–286 (2000)
Karypis, G.: METIS~5.0: Unstructured graph partitioning and sparse matrix ordering system. Tech. rep., Department of Computer Science, University of Minnesota (2011)
Mallat, S.: A Theory for Multiresolution Signal Decomposition: The Wavelet Representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 11(7), 674–693 (1989)
Muraki, S.: Approximation and Rendering of Volume Data Using Wavelet Transforms. In: Proceedings Visualization 1992, pp. 21–28 (1992)
Muraki, S.: Volume Data and Wavelet Transforms. IEEE Computer Graphics and Applications 13(4), 50–56 (1993)
Ratanaworabhan, P., Ke, J., Burtscher, M.: Fast Lossless Compression of Scientific Floating-Point Data. In: Data Compression Conference (DCC 2006), pp. 133–142 (2006)
Shafaat, T.M., Baden, S.B.: A Method of Adaptive Coarsening for Compressing Scientific Datasets. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds.) PARA 2006. LNCS, vol. 4699, pp. 774–780. Springer, Heidelberg (2007)
Unat, D., Hromadka III, T., Baden, S.B.: An Adaptive Sub-sampling Method for In-memory Compression of Scientific Data. In: 2009 Data Compression Conference, pp. 262–271 (March 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iverson, J., Kamath, C., Karypis, G. (2012). Fast and Effective Lossy Compression Algorithms for Scientific Datasets. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds) Euro-Par 2012 Parallel Processing. Euro-Par 2012. Lecture Notes in Computer Science, vol 7484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32820-6_83
Download citation
DOI: https://doi.org/10.1007/978-3-642-32820-6_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32819-0
Online ISBN: 978-3-642-32820-6
eBook Packages: Computer ScienceComputer Science (R0)