2023
DOI: 10.1016/j.eswa.2022.118639
|View full text |Cite
|
Sign up to set email alerts
|

Automatic segmentation of parallel drainage patterns supported by a graph convolution neural network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…To determine the optimal set of features and prevent information redundancy, we conducted a sensitivity analysis experiment of river network knowledge using GraphSAGE (see Hamilton et al (2017) and Yu, Ai, Yang, Huang, and Gao (2023) for details). An experiment testing each feature individually is to remove features that provide insufficient information.…”
Section: Experiments and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…To determine the optimal set of features and prevent information redundancy, we conducted a sensitivity analysis experiment of river network knowledge using GraphSAGE (see Hamilton et al (2017) and Yu, Ai, Yang, Huang, and Gao (2023) for details). An experiment testing each feature individually is to remove features that provide insufficient information.…”
Section: Experiments and Discussionmentioning
confidence: 99%
“…The first step is to reconstruct vector data (e.g., points, polylines, or polygons) commonly used in map generalization to align with the deep learning data paradigm. Current reconstruction methods for specific problems include using a triangulation network structure for point cloud data classification and semantic segmentation (Bazazian & Nahata, 2020; Jiang et al, 2021), a coordinate sequence structure for line simplification (Yu & Chen, 2022), and a dual graph of drainage and a minimum binary tree (Yu, Ai, Yang, Huang, & Gao, 2023; Yu et al, 2022) of building for pattern recognition (Yan et al, 2019). However, map generalization involves multiple operators, such as selection, simplification, and aggregation, and different objects like bends or nodes of rivers, roads, and boundary lines for simplification; arcs or strokes of river and road networks for selection; and polygons of buildings and lakes for aggregation.…”
Section: Introductionmentioning
confidence: 99%
“…As an inductive representation learning for node embedding, the GraphSAGE algorithm is especially advantageous and useful for large graphs with rich node attribute information [25][26][27]. The main idea of GraphSAGE is to adhere to GNN and aggregate the neighbours' information by embedding them into each node.…”
Section: B Link Predictionmentioning
confidence: 99%