Design and implementation of a parallel geographically weighted k-nearest neighbor classifier. (June 2019)

• Record Type: Journal Article
• Authors: Pu, Yingxia; Zhao, Xinyi; Chi, Guangqing; Zhao, Shuhe; Wang, Jiechen; Jin, Zhibin; Yin, Junjun
• Is Part Of: Computers & geosciences. Volume 127(2019)
• Page Start: 111
• Page End: 122
• Publication Date: 2019-06
• Subjects: Remotely sensed image classification -- Parallel computing -- Geostatistical models -- Parallel gwk-NN classifier; Environmental policy -- Periodicals; 550.5
• DOI: 10.1016/j.cageo.2019.02.009
• Languages: English
• ISSNs: 0098-3004

Abstract

Abstract: The development of high-performance classifiers represents an important step in improving the timeliness of remote sensing classification in the era of high spatial resolution. The geographically weighted k -nearest neighbors (gw k -NN) classifier, which incorporates spatial information into the traditional k -NN classifier, has demonstrated better performance in mitigating salt-and-pepper noise and misclassification. However, the integration of spatial dependence into spectral information is computationally intensive. To improve the computing performance of the gw k -NN classifier, this study first considered two commonly used parallel strategies—data parallelism and task parallelism—in the model training and image classification stages. Then, our implementation of the corresponding parallel algorithms was carried out by calling message passing interface (MPI) and the geospatial data abstraction library (GDAL) in the C++ development environment on a standalone eight-core computer. Based on the performance of these two strategies, the potentiality of dual parallelism (the simultaneous exploitation of data and task parallelism) in image classification was further investigated. Our experimental results indicate that the parallel gw k -NN classifier can improve the classification efficiency of high-resolution remote sensing images with multiple land cover types. Specifically, the data parallelism method is more effective than the task parallelism method in both the model training and classification stages because of the minor effect of parallel overhead on the total execution time. In addition, dual parallelism can take advantage of data and task parallel strategies, as evidenced by the two largest speedups being attained under dual parallelism I (5.28 × ), which is based on the premise of task parallelism, and dual parallelism II (5.73 × ), in which the priority is given to data decomposition. Comparatively, dual parallelism II provides the best performance by overlapping computation and data transmission, which is compatible with the current trend toward multicore architectures. Highlights: A gw k -NN classifier is parallelized to improve the computing performance. Data parallelism is more capable than task parallelism for gwk-NN classifier. Dual parallelism makes better use of computing resources. The proposed classifier greatly decreases the classification time.