Progressive Collapse of Dual-Line Rivers Based on River Segmentation Considering Cartographic Generalization Rules
Abstract
:1. Introduction
2. Related Work
2.1. Skeleton Line Extraction Method
2.2. Progressive Collapse Method of Dual-line Rivers
3. Methodology
3.1. Framework
3.2. Structural Expression of Dual-Line Rivers
3.3. Progressive Pre-Segmentation of the River Segment
- The is traversed, and the , which is the width of triangle corresponding to node in the graph, is calculated in turn. According to the different types of triangles, the widths of type I, II, and III triangles are calculated as the length of the unconstrained edge, shortest distance from the constrained edge to the relative vertex, and the average of the lengths of three edges, respectively.
- According to the width calculation result, the attribute issmall of the node corresponding to the triangle meeting is labelled as True; otherwise, the attribute issmall of the node is labelled as False (as shown in Figure 3b). The attribute issmall of the node is used to distinguish whether it meets .
- All links in the are traversed in turn, and the can be divided into different subgraphs by judging whether the nodes at both ends of the link are associated with different issmall attributes (as shown in Figure 3c). These subgraphs can be subdivided into two types: the issmall attribute of the included nodes is True, which is defined as narrow subgraphs; and the issmall attribute of the included node is False, which is defined as a normal subgraph.
- The subgraphs are abstracted as new nodes, and the connection relationship between subgraphs is abstracted as links to obtain a more abstract skeleton graph (as shown in Figure 3d). By traversing different subgraphs, the triangle sets corresponding to the nodes of subgraphs are obtained, and the pre-segmented river segments are obtained by merging them respectively. Among them, the merging result of triangles in a narrow subgraph corresponds to a narrow river segment, whereas the merging result of a normal subgraph corresponds to a normal river segment.
3.4. Determination of River Segment Handling Mode
3.5. Progressive Collapse of the Dual-Line River
4. Experimental Results and Evaluations
4.1. Experimental Design and Setting
4.2. Results and Evaluations
4.2.1. Qualitative Evaluation
4.2.2. Quantitative Evaluation
- As shown in 1, 2, 3, and 4 in Figure 15, the short skeleton line branches generated by the proposed method through topological maintenance coincide more with the standard centerline, increasing the coincidence length, whereas the SURC method does not take topological maintenance into account.
- The process of vector-to-raster and raster-to-vector conversion inevitably results in loss of accuracy and reduces the length of coincidence.
5. Conclusions
- The proposed method can realize scale-driven progressive collapse handling of dual-line rivers. The progressive collapse results are regular and not fragmented, which is more consistent with the application requirements of cartographic generalization.
- The proposed method has no burr in the collapsed part of the dual-line rivers, maintaining the topological consistency with the linear river and avoiding topology maintenance operations.
- By comparing the standard centerline with the SURC method, the geometric accuracy of the proposed method is higher.
Author Contributions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
References
- Guo, R.Z.; Ying, S. The rejuvenation of cartography in ICT era. Acta Geod. Cartogr. Sin. 2017, 46, 1274–1283. [Google Scholar] [CrossRef]
- Guo, R.Z.; Chen, Y.B.; Ma, D.; Zhao, Z.G.; Ying, S. Pan-map representation in ICT era. Acta Geod. Cartogr. Sin. 2022, 51, 1108–1113. [Google Scholar] [CrossRef]
- Wu, F.; Gong, X.Y.; Du, J.W. Overview of the research progress in automated map generalization. Acta Geod. Cartogr. Sin. 2017, 46, 1645–1664. [Google Scholar] [CrossRef]
- Wang, J.Y.; Qian, H.Z. Cartographic generalization knowledge and its application. Geomat. Inf. Sci. Wuhan Univ. 2006, 31, 382–386. [Google Scholar]
- Li, Z.L. Algorithmic Foundation of Multi-Scale Spatial Representation; CRC Press: Boca Raton, FL, USA, 2006. [Google Scholar]
- Shen, Y.L.; Ai, T.H.; Li, J.Z.; Huang, L.N.; Li, W.D. A progressive method for the collapse of river representation considering geographical characteristics. Int. J. Digit. Earth 2020, 13, 1366–1390. [Google Scholar] [CrossRef]
- Zhang, F.B.; Sun, Q.; Wen, B.W.; Ma, J.Z.; Lv, Z. Skeleton line extraction for areal hydrographic elements considering spatial and hierarchical relationships. Geocarto Int. 2022. [Google Scholar] [CrossRef]
- Mandelbrot, B. The Fractal Geometry of Nature; WH Freeman: New York, NY, USA, 1982. [Google Scholar]
- Paiva, J. Spatial reasoning about flow directins: Towards an ontology for river networks. Int. Arch. Photogram Remote Sens. 1993, 29, 318. [Google Scholar]
- Liu, P.; Guo, Q.S.; Weng, J.; Long, Y. An improved algorithm of double line river generalization. Geomat. Inf. Sci. Wuhan Univ. 2013, 38, 362–364. [Google Scholar] [CrossRef]
- DeLucia, A.; Black, T. A comprehensive approach to automatic feature generalization. In Proceedings of the 13th International Cartographic Conference, Morelia, Mexico, 4 October 1987; pp. 168–191. [Google Scholar]
- Regnauld, N.; Mackaness, W.A. Creating a hydrographic network from its cartographic representation: A case study using Ordnance Survey MasterMap data. Int. J. Geogr. Inf. Sci. 2006, 20, 611–631. [Google Scholar] [CrossRef]
- Meijers, M.; Savino, S.; Van Oosterom, P. SPLITAREA: An algorithm for weighted splitting of faces in the context of a planar partition. Int. J. Geogr. Inf. Sci. 2016, 30, 1522–1551. [Google Scholar] [CrossRef] [Green Version]
- Li, C.M.; Yin, Y.; Wu, P.D.; Liu, X.L.; Guo, P.P. Improved jitter elimination and topology correction method for the split line of narrow and long patches. ISPRS Int. J. Geo-Inf. 2018, 7, 402. [Google Scholar] [CrossRef] [Green Version]
- Lewandowicz, E.; Flisek, P. A method for generating the centerline of an elongated polygon on the example of a watercourse. ISPRS Int. J. Geo-Inf. 2020, 9, 304. [Google Scholar] [CrossRef]
- Lewandowicz, E.; Flisek, P. Base point split algorithm for generating polygon skeleton lines on the example of lakes. ISPRS Int. J. Geo-Inf. 2020, 9, 680. [Google Scholar] [CrossRef]
- Mcallister, M.; Snoeyink, J. Medial axis generalization of river networks. Cartogr. Geo. Inf. Sci. 2000, 27, 129–138. [Google Scholar] [CrossRef] [Green Version]
- Roberts, S.A.; Hall, G.B.; Boots, B. Street centreline generation with an approximated area Voronoi diagram. In Proceedings of the 11th International Symposium on Spatial Data Handling, Leicester, UK, 23–25 August 2004; pp. 435–446. [Google Scholar] [CrossRef]
- Smogavec, G.; Zalik, B. A fast algorithm for constructing approximate medial axis of polygons, using Steiner points. Adv. Eng. Softw. 2012, 52, 1–9. [Google Scholar] [CrossRef]
- Wang, X.S.; Xie, K.; Jiang, Y.H.; Guo, G.Y. Methods for constructing approximate medialaxis for planar free-form shapes. Geomat. Inf. Sci. Wuhan Univ. 2014, 39, 181–185. [Google Scholar] [CrossRef]
- Aichholzer, O.; Aurenhammer, F.; Alberts, D.; Gärtner, B. A novel type of skeleton for polygons. In J.UCS the Journal of Universal Computer Science; Annual Print and CD-ROM Archive Edition; Maurer, H., Calude, C., Salomaa, A., Eds.; Springer: Berlin/Heidelberg, Germnay, 1996; Volume 1, pp. 752–761. [Google Scholar]
- Eppstein, D.; Erickson, J. Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions. Discrete Comput. Geomet. 1999, 22, 569–592. [Google Scholar] [CrossRef] [Green Version]
- Haunert, J.H.; Sester, M. Area collapse and road centerlines based on straight skeletons. Geoinformatica 2008, 12, 169–191. [Google Scholar] [CrossRef]
- Das, G.K.; Mukhopadhyay, A.; Nandy, S.C.; Patil, S.; Rao, S. Computing the straight skeleton of a monotone polygon in O (n log n) time. In Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, MB, Canada, 9–11 August 2010; pp. 207–210. [Google Scholar]
- Pavlidis, T. Algorithms for Graphics and Image Processing, 1st ed.; Springer: Berlin/Heidelberg, Germany; New York, NY, USA, 1982; p. 438. [Google Scholar]
- Rosefeld, A.; Kak, A. Digital Picture Processing; Academic Press: New York, NY, USA, 1982. [Google Scholar]
- Zhang, T.Y.; Suen, C.Y. A fast parallel algorithm for thinning digital patterns. Commun. ACM 1984, 27, 236–239. [Google Scholar] [CrossRef]
- Chen, W.; Sui, L.; Xu, Z.; Lang, Y. Improved Zhang-Suen thinning algorithm in binary line drawing applications. In Proceedings of the 2012 International Conference on Systems and Informatics (ICSAI2012), Yantai, China, 19–20 May 2012; pp. 1947–1950. [Google Scholar] [CrossRef]
- Boudaoud, L.B.; Sider, A.; Tari, A. A new thinning algorithm for binary images. In Proceedings of the International Conference on Control Engineering & Information Technology (CEIT), Tlemcen, Algeria, 25–27 May 2015. [Google Scholar] [CrossRef]
- Shih, F.Y.; Pu, C.C. A skeletonization algorithm by maxima tracking on Euclidean distance transform. Pattern Recognit. 1995, 28, 331–341. [Google Scholar] [CrossRef]
- Bai, X.; Latecki, L.J.; Liu, W.Y. Skeleton pruning by contour partitioning with discrete curve evolution. IEEE Trans. Pattern Anal. Mach. Intell. 2007, 29, 449–462. [Google Scholar] [CrossRef]
- Pan, P.; He, S.W.; Wu, Y.L.; Hu, P. A new method for extracting curved-polygon medial axis. Acta Geod. Cartogr. Sin. 2012, 41, 278–283. [Google Scholar]
- Shen, Y.L.; Ai, T.H.; Yang, M. Extracting centerlines from dual-line roads using superpixel segmentation. IEEE Access 2019, 7, 15967–15979. [Google Scholar] [CrossRef]
- Jiang, N.; Zhang, Y.; Luo, D.; Liu, C.; Zhou, Y.; Han, Z. Feature hourglass network for skeleton detection. In Proceedings of the 32nd IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, CA, USA, 16–20 January 2019; pp. 1172–1176. [Google Scholar] [CrossRef]
- Wang, Y.K.; Xu, Y.C.; Tsogkas, S.; Bai, X.; Dickinson, S.; Siddiqi, K.; Soc, I.C. DeepFlux for skeletons in the wild. In Proceedings of the 32nd IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, CA, USA, 16–20 January 2019; pp. 5282–5291. [Google Scholar]
- Liu, C.; Tian, Y.J.; Chen, Z.W.; Jiao, J.B.; Ye, Q.X. Adaptive linear span network for object skeleton detection. IEEE Trans. Image Process 2021, 30, 5096–5108. [Google Scholar] [CrossRef]
- Nathan, S.; Kansal, P.; Soc, I.C. SkeletonNetV2: A dense channel attention blocks for skeleton extraction. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCVW), Electr Network, Seoul, Republic of Korea, 11–17 October 2021; pp. 2142–2149. [Google Scholar]
- Ai, T.H.; Guo, R.Z. A constrained Delaunay partitioning of areal objects to support map generalization. Geomat. Inf. Sci. Wuhan Univ. 2000, 25, 35–41. [Google Scholar]
- Goodchild, M.F.; Hunter, G.J. A simple positional accuracy measure for linear features. Int. J. Geogr. Inf. Sci. 1997, 11, 299–306. [Google Scholar] [CrossRef]
Dividing Cases | Handling Modes | |
---|---|---|
Case 1 | ||
Case 2 | ||
Case 3 | ||
Case 4 | ||
Case 5 | ||
Case 6 | ||
Case 7 | ||
Case 8 |
Dividing Cases | Handling Modes | |
---|---|---|
Case 1 | ||
Case 2 | ||
Case 3 | ||
Case 4 | ||
Case 5 | ||
Case 6 | ||
Case 7 | ||
Case 8 |
Index | The SURC Method | The Proposed Method |
---|---|---|
Redundant intersections | No | No |
Fractured intersections | No | No |
Burrs | No | No |
Noise | No | No |
Progressive | Yes | Yes |
Topological consistency | No | Yes |
Fragmentation | Yes | No |
Scale accuracy | No | Yes |
Standard Centerline (m) | The SURC Method (m) | The Proposed Method (m) | |
---|---|---|---|
length | 235,747.2 | 224,008.5 | 235,518.6 |
Buffer Width (m) | The SURC Method (%) | The Proposed Method (%) |
---|---|---|
10 | 33.0 | 47.44 |
20 | 59.73 | 71.67 |
30 | 74.54 | 83.0 |
40 | 81.33 | 88.68 |
50 | 85.19 | 91.93 |
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Zhang, F.; Sun, Q.; Ma, J.; Lyu, Z.; Wen, B. Progressive Collapse of Dual-Line Rivers Based on River Segmentation Considering Cartographic Generalization Rules. ISPRS Int. J. Geo-Inf. 2022, 11, 609. https://doi.org/10.3390/ijgi11120609
Zhang F, Sun Q, Ma J, Lyu Z, Wen B. Progressive Collapse of Dual-Line Rivers Based on River Segmentation Considering Cartographic Generalization Rules. ISPRS International Journal of Geo-Information. 2022; 11(12):609. https://doi.org/10.3390/ijgi11120609
Chicago/Turabian StyleZhang, Fubing, Qun Sun, Jingzhen Ma, Zheng Lyu, and Bowei Wen. 2022. "Progressive Collapse of Dual-Line Rivers Based on River Segmentation Considering Cartographic Generalization Rules" ISPRS International Journal of Geo-Information 11, no. 12: 609. https://doi.org/10.3390/ijgi11120609
APA StyleZhang, F., Sun, Q., Ma, J., Lyu, Z., & Wen, B. (2022). Progressive Collapse of Dual-Line Rivers Based on River Segmentation Considering Cartographic Generalization Rules. ISPRS International Journal of Geo-Information, 11(12), 609. https://doi.org/10.3390/ijgi11120609