Parallel computing solutions for Markov chain spatial sequential simulation of categorical fields

Weixing Zhang

doi:10.1080/17538947.2018.1464073

2018-04-16

PRE

DOI：10.1080/17538947.2018.1464073

原文链接

原文求助

摘要

En 中文

The Markov chain random field (MCRF) model is a spatial statistical approach for modeling categorical spatial variables in multiple dimensions. However, this approach tends to be computationally costly when dealing with large data sets because of its sequential simulation processes. Therefore, improving its computational efficiency is necessary in order to run this model on larger sizes of spatial data. In this study, we suggested four parallel computing solutions by using both central processing unit (CPU) and graphics processing unit (GPU) for executing the sequential simulation algorithm of the MCRF model, and compared them with the nonparallel computing solution on computation time spent for a land cover post-classification. The four parallel computing solutions are: (1) multicore processor parallel computing (MP), (2) parallel computing by GPU-accelerated nearest neighbor searching (GNNS), (3) MP with GPU-accelerated nearest neighbor searching (MP-GNNS), and (4) parallel computing by GPU-accelerated approximation and GPU-accelerated nearest neighbor searching (GA-GNNS). Experimental results indicated that all of the four parallel computing solutions are at least 1.8x faster than the nonparallel solution. Particularly, the GA-GNNS solution with 512 threads per block is around 83x faster than the nonparallel solution when conducting a land cover post-classification with a remotely sensed image of 1000 x 1000 pixels.

Keyword:

Markov chain random field

parallel computing

nearest neighbor searching

approximation

graphics processing unit