2021
DOI: 10.3390/s21020365
|View full text |Cite
|
Sign up to set email alerts
|

A Parallel Computing Approach to Spatial Neighboring Analysis of Large Amounts of Terrain Data Using Spark

Abstract: Spatial neighboring analysis is an indispensable part of geo-raster spatial analysis. In the big data era, high-resolution raster data offer us abundant and valuable information, and also bring enormous computational challenges to the existing focal statistics algorithms. Simply employing the in-memory computing framework Spark to serve such applications might incur performance issues due to its lack of native support for spatial data. In this article, we present a Spark-based parallel computing approach for t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 26 publications
(26 reference statements)
0
7
0
Order By: Relevance
“…For example, MultiscaleDTM could be used to calculate terrain attributes using a 3 × 3 cell focal window, followed by the application of spectral analysis methods to vary the spatial scale by modifying the DTM prior to calculation of terrain attributes or modifying the attributes after calculation (Misiuk et al, 2021; Newman et al, 2022). Moreover, while computationally expensive, the computation time of focal operations can be improved via parallel computing (Zhang et al, 2021).…”
Section: Discussionmentioning
confidence: 99%
“…For example, MultiscaleDTM could be used to calculate terrain attributes using a 3 × 3 cell focal window, followed by the application of spectral analysis methods to vary the spatial scale by modifying the DTM prior to calculation of terrain attributes or modifying the attributes after calculation (Misiuk et al, 2021; Newman et al, 2022). Moreover, while computationally expensive, the computation time of focal operations can be improved via parallel computing (Zhang et al, 2021).…”
Section: Discussionmentioning
confidence: 99%
“…Examples include transformation of map symbols from geographic coordinates to OpenGL Render Object [39] in a multi-threaded manner using multiple CPUs and transformation from a OpenGL Render Object to screen coordinates by using multiple GPUs (multiple cores) to perform sub-processes and thus reduce computing time. Although parallel computing has been widely used in GIS software [40][41][42], this paper proposes a combined parallel computing method of multi CPU and GPU multi-core to accelerate the conversion of geographic coordinate data.…”
Section: Ar-gis Map Symbol Parallel Processing Frameworkmentioning
confidence: 99%
“…Compared with a single computer, distributed storage (e.g., Hadoop distributed file system (HDFS), HBase) and computational technologies (e.g., MapReduce, Spark) use the storage and computational resources of clusters and show tremendous advantages when data increases dramatically. Therefore, they are extensively used in the storage [19][20][21], calculation [22,23], segmentation [24], and path planning of massive remote sensing data. Wang et al used the MapReduce-based distributed parallel Dijkstra algorithm to solve the shortest path problem.…”
Section: Introductionmentioning
confidence: 99%