<p>The problem of matching multi-scale linear spatial objects is considered in the paper. The solution of this problem is important when integrating information from different cartographic sources for the same area. A novel approach to river network matching is proposed, based on geometric simplification and the computation of key natural features of spatial objects. The simplification procedure identifies the most common features on different scale maps. This is essential to achieve a comparable level of detail in maps at varying scales. The parameter for the geometric simplification algorithm is selected on the basis of the morphometric characteristics of the linear feature in order to ensure optimal results. Then each river is treated as a sequence of bends. The degree of similarity between two objects from different maps is determined by comparing the percentage of bends matching in terms of their sign and distance. The objective of the study was to compare river network objects on 1:1000000 and 1:500000 scale maps. The results demonstrated that the optimal accuracy of matching, as determined by the <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12145_2025_1823_Article_IEq1.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="31" /> </InlineMediaObject> <EquationSource Format="TEX">\(F-\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>F</mi> <mo>-</mo> </mrow> </math></EquationSource> </InlineEquation>score, exceeded 93% and was achieved through the utilisation of the Douglas-Peucker algorithm. The Rubbersheet algorithm from ArcGIS Pro was selected as a reference point and exhibited a result of 90.4%, which substantiates the efficacy of the proposed approach.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A nature-based approach to matching multi-scale river networks

  • Olga Yakimova,
  • Sergey Eremeev

摘要

The problem of matching multi-scale linear spatial objects is considered in the paper. The solution of this problem is important when integrating information from different cartographic sources for the same area. A novel approach to river network matching is proposed, based on geometric simplification and the computation of key natural features of spatial objects. The simplification procedure identifies the most common features on different scale maps. This is essential to achieve a comparable level of detail in maps at varying scales. The parameter for the geometric simplification algorithm is selected on the basis of the morphometric characteristics of the linear feature in order to ensure optimal results. Then each river is treated as a sequence of bends. The degree of similarity between two objects from different maps is determined by comparing the percentage of bends matching in terms of their sign and distance. The objective of the study was to compare river network objects on 1:1000000 and 1:500000 scale maps. The results demonstrated that the optimal accuracy of matching, as determined by the \(F-\) F - score, exceeded 93% and was achieved through the utilisation of the Douglas-Peucker algorithm. The Rubbersheet algorithm from ArcGIS Pro was selected as a reference point and exhibited a result of 90.4%, which substantiates the efficacy of the proposed approach.