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

作　　者：Weixing Zhang Weidong Li Chuanrong Zhang Tian Zhao 

机构地区：[1]Department of Geography,University of Connecticut,Storrs,USA [2]Center for Environmental Science and Engineering,University of Connecticut,Storrs,USA [3]Connecticut State Data Center,University of Connecticut,Storrs,USA [4]Department of Computer Science,University of Wisconsin-Milwaukee,Milwaukee,USA

出　　处：《International Journal of Digital Earth》2019年第5期566-582,共17页国际数字地球学报（英文）

基　　金：supported in part by the U.S.National Science Foundation[grant number 1414108];Division of Behavioral and Cognitive Sciences.

摘　　要：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(MPGNNS),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.8×faster than the nonparallel solution.Particularly,the GA-GNNS solution with 512 threads per block is around 83×faster than the nonparallel solution when conducting a land cover post-classification with a remotely sensed image of 1000×1000 pixels.

关 键 词：Markov chain random field parallel computing nearest neighbor searching APPROXIMATION graphics processing unit 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]