scholarly journals Interpolation and Data Compression of Large-scale Volume Data based on the MPU method

2008 ◽  
Vol 28-1 (2) ◽  
pp. 1175-1175
Author(s):  
Shin ITO ◽  
Shinji KATAOKA ◽  
Yusuke TSUKAMOTO ◽  
Kyoko HASEGAWA ◽  
Susumu NAKATA ◽  
...  
Author(s):  
Ivan Mozghovyi ◽  
Anatoliy Sergiyenko ◽  
Roman Yershov

Increasing requirements for data transfer and storage is one of the crucial questions now. There are several ways of high-speed data transmission, but they meet limited requirements applied to their narrowly focused specific target. The data compression approach gives the solution to the problems of high-speed transfer and low-volume data storage. This paper is devoted to the compression of GIF images, using a modified LZW algorithm with a tree-based dictionary. It has led to a decrease in lookup time and an increase in the speed of data compression, and in turn, allows developing the method of constructing a hardware compression accelerator during the future research.


2020 ◽  
Vol 10 (21) ◽  
pp. 7636
Author(s):  
Dandan Jiang ◽  
Zhaofa Zeng ◽  
Shuai Zhou ◽  
Yanwu Guan ◽  
Tao Lin ◽  
...  

Three-dimensional magnetic inversion allows the distribution of magnetic parameters to be obtained, and it is an important tool for geological exploration and interpretation. However, because of the redundancy of the data obtained from large-scale investigations or high-density sampling, it is very computationally intensive to use these data for iterative inversion calculations. In this paper, we propose a method for compressing magnetic data by using an adaptive quadtree decomposition method, which divides the two-dimensional data region into four quadrants and progressively subdivides them by recursion until the data in each quadrant meets the regional consistency criterion. The method allows for dense sampling at the abnormal boundaries with large amplitude changes and sparse sampling at regions with small amplitude changes, and achieves the best approximation to the original data with the least amount of data, thus retaining more anomalous information while achieving the purpose of data compression. In addition, assigning values to the data in the quadrants using the averaging method is essentially equivalent to average filtering, which reduces the noise of the magnetic data. Testing the synthetic model and applying the method to mineral exploration a prove that it can effectively compress the magnetic data and greatly improve the computational efficiency.


Algorithms ◽  
2019 ◽  
Vol 12 (9) ◽  
pp. 197 ◽  
Author(s):  
Sebastian Götschel ◽  
Martin Weiser

Solvers for partial differential equations (PDEs) are one of the cornerstones of computational science. For large problems, they involve huge amounts of data that need to be stored and transmitted on all levels of the memory hierarchy. Often, bandwidth is the limiting factor due to the relatively small arithmetic intensity, and increasingly due to the growing disparity between computing power and bandwidth. Consequently, data compression techniques have been investigated and tailored towards the specific requirements of PDE solvers over the recent decades. This paper surveys data compression challenges and discusses examples of corresponding solution approaches for PDE problems, covering all levels of the memory hierarchy from mass storage up to the main memory. We illustrate concepts for particular methods, with examples, and give references to alternatives.


Author(s):  
Nishihashi Kunihiko ◽  
Higaki Toru ◽  
Okabe Kenji ◽  
Raytchev Bisser ◽  
Tamaki Toru ◽  
...  

2012 ◽  
Author(s):  
Byungil Jeong ◽  
Paul A. Navrátil ◽  
Kelly P. Gaither ◽  
Gregory Abram ◽  
Gregory P. Johnson

Author(s):  
Kenichi TSUBOTA ◽  
Tomonori YAMADA ◽  
Taiji ADACHI ◽  
Akitake MAKINOUCHI

Sign in / Sign up

Export Citation Format

Share Document