GPU-accelerated 3D reconstruction of porous media using multiple-point statistics

被引:27
|
作者
Zhang, Ting [1 ]
Du, Yi [2 ,3 ]
Huang, Tao [3 ]
Li, Xue [3 ]
机构
[1] Shanghai Univ Elect Power, Coll Comp Sci & Technol, Shanghai 200090, Peoples R China
[2] Shanghai Second Polytech Univ, Sch Comp & Informat, Shanghai 201209, Peoples R China
[3] Univ Sci & Technol China, Dept Modern Mech, Hefei 230027, Peoples R China
关键词
Porous media; Graphic processing unit; Parallel; Multiple-point statistics; Soft data; Representative elementary volume; REPRESENTATIVE ELEMENTARY VOLUME; PORE-SPACE RECONSTRUCTION; NETWORK MODEL; SIMULATION; PERMEABILITY; FLOW; TRANSPORT;
D O I
10.1007/s10596-014-9452-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
It is very important for the study of predicting fluid transport properties or mechanisms of fluid flow in porous media that the characteristics of porous media can be extracted in relatively smaller scales and then are copied in a larger or even arbitrary region to reconstruct virtual 3D porous media that have similar structures with the real porous media. One of multiple-point statistics (MPS) method, the single normal equation simulation algorithm (SNESIM), has been widely used in reconstructing 3D porous media recently. However, owing to its large CPU cost and rigid memory demand, the application of SNESIM has been limited in some cases. To overcome this disadvantage, parallelization of SNESIM is performed on the compute unified device architecture (CUDA) kernels in the graphic processing unit (GPU) to reconstruct each node on simulation grids, combined with choosing the optimal size of data templates based on the entropy calculation towards the training image (TI) to acquire high-quality reconstruction with a low CPU cost; meanwhile, the integration of hard data and soft data is also included in the processing of CUDA kernels to improve the accuracy. Representative elementary volumes (REVs) for porosity, variogram, and entropy are analyzed to guarantee that the scale of observation is large enough and parameters of concern are constant. This parallel GPU-version 3D porous media reconstruction only requires relatively small size memory and benefits from the tremendous calculating power given by CUDA kernels to shorten the CPU time, showing its high efficiency for the reconstruction of porous media.
引用
收藏
页码:79 / 98
页数:20
相关论文
共 50 条
  • [31] GPU-Accelerated Nearest Neighbor Search for 3D Registration
    Qiu, Deyuan
    May, Stefan
    Nuechter, Andreas
    COMPUTER VISION SYSTEMS, PROCEEDINGS, 2009, 5815 : 194 - +
  • [32] GPU accelerated 3D object reconstruction
    Denkowski, Marcin
    2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2013, 18 : 290 - 298
  • [33] GPU-accelerated denoising of 3D magnetic resonance images
    Howison, Mark
    Bethel, E. Wes
    JOURNAL OF REAL-TIME IMAGE PROCESSING, 2017, 13 (04) : 713 - 724
  • [34] GPU-accelerated denoising of 3D magnetic resonance images
    Mark Howison
    E. Wes Bethel
    Journal of Real-Time Image Processing, 2017, 13 : 713 - 724
  • [35] GPU-Accelerated Tracking of the Motion of 3D Articulated Figure
    Krzeszowski, Tomasz
    Kwolek, Bogdan
    Wojciechowski, Konrad
    COMPUTER VISION AND GRAPHICS, PT I, 2010, 6374 : 155 - 162
  • [37] Reconstruction of spatial data using isometric mapping and multiple-point statistics
    Zhang, Ting
    Du, Yi
    Huang, Tao
    Peng, Yuan
    COMPUTATIONAL GEOSCIENCES, 2015, 19 (05) : 1047 - 1062
  • [38] Estimation using multiple-point statistics
    Johannsson, Oli D.
    Hansen, Thomas Mejer
    COMPUTERS & GEOSCIENCES, 2021, 156
  • [39] Reconstruction of spatial data using isometric mapping and multiple-point statistics
    Ting Zhang
    Yi Du
    Tao Huang
    Yuan Peng
    Computational Geosciences, 2015, 19 : 1047 - 1062
  • [40] 3D model reconstruction using neural gas accelerated on GPU
    Orts-Escolano, Sergio
    Garcia-Rodriguez, Jose
    Antonio Serra-Perez, Jose
    Jimeno-Morenilla, Antonio
    Garcia-Garcia, Alberto
    Morell, Vicente
    Cazorla, Miguel
    APPLIED SOFT COMPUTING, 2015, 32 : 87 - 100