The present disclosure relates to the field of cartographic generalization of maps, and in particular to a spatial similarity calculation method considering road network skeleton lines and local hierarchy multi-features and used in a multi-scale road network generalization process.
A spatial similarity relationship belongs to the category of a spatial relationship, which is used for describing and expressing the relationship between a geographical space and a map spatial object transformed from the geographical space. The spatial similarity relationship is widely used in describing and matching spatial objects, querying and updating spatial databases, and spatial cognition and reasoning. As an important geographical element, a road network is related to every aspect of people's daily life, and also affects many fields such as politics, economy and military of the country. Multi-scale spatial similarity research has been widely applied in a cartographic generalization process and the aspects of result evaluation, spatial query, road network matching, etc.
Traditional calculation methods for road network spatial similarity focus on topology, geometry and shape features respectively, but they do not measure the similarity from the whole. The existing similarity calculation methods can't integrate semantic information well. According to the Gestalt psychology principle, when we perform spatial cognition, the approximate structure and hierarchy of things will be formed in advance in our mind. The description of road network skeleton line features is conducive to reflecting the structural features of a road network as a whole. Therefore, in the process of road network similarity determination, firstly, starting from the overall features of the road network, more attention is paid to the skeleton structure of the road network; and secondly, attention is paid to local detail features, and semantic information in the local detail features can also reflect relative importance of road sections. Therefore, it is necessary to extend the existing similarity calculation methods according to the features of the road network in order to realize the reasonable calculation of spatial similarity of the multi-scale road network.
Based on the above reasons, the present disclosure provides a multi-feature road network spatial similarity calculation method considering road network skeleton lines and local levels, which aims at providing a more reasonable and perfect multi-scale road network similarity calculation model.
The present disclosure provides a similarity calculation method considering multiple features for a multi-scale road network, and calculation is performed from two basic units, namely road network skeleton lines and road meshes. Factors considered in the method are more in line with the actual change condition of a spatial relationship in a road network scale transformation process, and a spatial similarity calculation model of the multi-scale road network can be more reasonable and perfect.
Multi-scale road network similarity research plays a very critical role in the related fields. Gestalt psychology research shows that skeleton line features are usually considered first, and then local detail features are considered in the process of spatial similarity calculation. The road hierarchy is important semantic information of the road network, which can reflect the relative importance degree of road sections. Therefore, the present disclosure provides a method for calculating similarity of a multi-scale road network step by step from integral skeleton lines to local details. Firstly, the skeleton lines of the road network are extracted according to a length threshold, then the skeleton lines are converted into a structure tree, and the structural similarity is calculated on the basis of the structure tree. Secondly, local similarity of the multi-scale road network is calculated by combining topological similarity, geometric similarity and semantic features of road meshes.
The similarity calculation method considering multiple features for a multi-scale road network disclosed by the present disclosure is easy to realize, simple and efficient. A similarity calculation model of the multi-scale road network is perfected, moreover, a similarity experiment calculation result accords with the actual ground feature change condition, and relatively high consistency with a human cognition result is achieved.
In order to more clearly describe the technical solutions in the present disclosure or the prior art, a brief introduction to the accompanying drawings required for the description of the examples or the prior art will be provided below. Obviously, the accompanying drawings in the following description are merely some accompanying drawings of the present disclosure. Those of ordinary skill in the art can also derive other accompanying drawings from these accompanying drawings without making creative efforts.
The technical solutions in the examples of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in the examples of the present disclosure. Obviously, the described examples are merely some examples rather than all examples of the present disclosure. All the other examples obtained by those of ordinary skill in the art based on the examples in the present disclosure without creative efforts shall fall within the scope of protection of the present disclosure.
The calculation steps for skeleton line similarity of the multi-scale road network are as follows:
The following steps are part of skeleton line similarity calculation of multi-scale road network:
Step 1: Performing scale transformation on the road network m times. Firstly, connecting road sections with the same name first, and then performing stroke construction on the road network to generate n road strokes. Secondly, determining the number of roads selected in the road network scale transformation by using a root model shown in Formula 1, and then performing selection according to lengths of the roads, where the shorter ones are preferentially deleted:
In the formula, nF represents the total number of elements in a new map, nA represents the total number of elements in an original map, MA represents a scale denominator of the original map, and MF represents a scale denominator of the new map.
Step 2: setting thresholds according to the lengths of the roads and functional network indexes to extract skeleton lines of the roads. A specific process is as follows:
1) Connecting the road sections with the same name according to the road section names, and connecting the remaining road sections according to geometric features to construct strokes.
2) Sorting the successfully constructed strokes of the network according to the length.
3) Performing functional network analysis on the road network by using space syntax, and calculating an importance value of each stroke according to a connection value, a control value, a local integration degree and an overall depth value.
4) Calculating an adjustment coefficient λ as a threshold for skeleton line extraction according to a length mean value and a standard deviation as shown in Formula 2:
In the formula, the adjustment coefficient λ is used for adjusting the number of skeleton roads selected, Mean_length(stroke) represents a length mean value of the stroke, Std_length(stroke) represents a standard deviation of the stroke, and μ represents the proportion of the actual skeleton road as shown in Formula 3:
5) Calculating a mileage proportion a of the skeleton road as shown in Formula 4:
In the formula, L represents the total length value of road network data.
6) Calculating theoretical proportions and theoretical mileage values of a contour skeleton and a functional skeleton in the total mileage respectively, where the proportion of the contour skeleton calculated according to the length is 0.6a, and the proportion of the functional skeleton calculated according to the importance value is 0.4a.
7) Calculating the number of the skeleton lines according to the theoretical proportions and the theoretical mileage values.
Step 3: According to the connection transformation principle in
Step 4: Calculating the similarity of the child nodes of the structure tree by using Formula 5 and Formula 6:
In the formula, S(n1,n2) represents the similarity of nodes n1 and n2, and S_offspring, S_sunnum and S_height represent the similarity of the number of offspring, the similarity of the number of sons, and the similarity of heights of offspring respectively.
In the formula, R1, R2 represent coefficients for adjusting the proportions of the absolute similarity and the relative similarity, which are both set to 0.5, min(n1_sun, n2_sun) represents the one with the smaller number of sons in node n1 and node n2, max(Brother) represents the one with the smaller number of the largest number max(Brother1) of sons in brother node of node n1 and the largest number max(Brother2) of sons in brother node of node n2. The calculation formulas of the similarity S_offspring of the number of offspring and the similarity S_height of heights of offspring are consistent with the above formula in thinking.
The similarity of child nodes in the two trees is calculated by using the above formulas. The greater the similarity, the greater the probability that the two nodes are the same node, that is, the greater the probability that the roads are the same road at two scales. The smaller the similarity, the greater the probability that the two nodes are mismatched nodes, indicating that the road is deleted during scale transformation.
Step 5: Finding out the matched nodes according to the similarity of the nodes mentioned above, and calculating structural similarity of the nodes by using Formula 7 and Formula 8:
In the formulas, Sim_global represents the structural similarity of two structure trees, m represents the total number of the same node, 1/r represents a hierarchical penalty coefficient, layer (ni) represents the number of layers of the node, R1, R2 and R3 represent weights of the number of sons of the node, the height of the node, and the number of offspring of the node respectively, n1_sumnum and n2_sumnum represent the numbers of sons of nodes n1 and n2 respectively, n1_height and n2_height represent the heights of nodes n1 and n2 respectively, and √{square root over (n1_offspring)} and |√{square root over (n2_offspring)}| represent the numbers of offspring of nodes n1 and n2 respectively. The greater Sim_global, the greater the similarity of the two trees, indicating that the more similar the structures of skeleton lines of the road networks at two scales.
The calculation steps for local similarity of the multi-scale road network are as follows:
Step 6: The smallest closed loops naturally formed by several road sections in the road network are called road meshes, as shown in
In the formula, m represents the number of other road meshes that have a topological relationship with the road mesh T, and ni represents the connection dimension of all topological relationships.
Step 7: Acquiring the topology difference of each road mesh before and after scale transformation, as shown in Formula 10:
In the formula, V1 and V2 represent topological quantization values of the road mesh before and after scale transformation respectively, and max(V1, V2) represents the larger one of the two topological quantization values. Finally, acquiring topological similarity of the multi-scale road network by using Formula 11:
In the formula, n represents the number of the road meshes.
Step 8: Matching all the scaled road networks with the original road network, and then, calculating a density of each mesh according to Formula 12.
In the formula, P represents the total length of the road sections on the boundary of the mesh, L represents the total length of the road sections within the mesh, and A represents a mesh area.
Step 9: Calculating geometric similarity of two groups of road network targets, firstly, calculating a density difference of each pair of road meshes before and after scale transformation by using Formula 13, and generating a one-dimensional array.
In the formula, G1 and G2 represent geometric eigenvalues before and after scale transformation, i.e. a density, and max(G1, G2) represents the larger one of the two geometric eigenvalues. The calculated similarity values of all the mesh densities generate an array: S={S1, S2, . . . , Sn}, where Sn represents the density similarity of the nth pair of road meshes in the scale transformation, and n represents the total number of road meshes in the road network target. Finally, calculate the geometric similarity Sim_C of the road network before and after the scale transformation by using Formula 14.
Step 10: Getting the importance hierarchy of each road mesh by using Formula 15:
In the formula, Di represents the hierarchy size of each road mesh, and according to human cognition, the longer the length of the road on a peripheral of the mesh, the greater the degree of influence on the hierarchy of the road mesh, such that the hierarchy of the road mesh is positively correlated with the length of the peripheral road. di represents the hierarchy of each road constituting the periphery of the road mesh, and li represents the length of each road constituting the periphery of the road mesh.
Step 11: Combining the hierarchy of the road mesh with topological and geometric feature similarity, and acquiring a local similarity calculation model considering semantic information of the road network in the form of a matrix, as shown in Formula 16:
In the formula, w1 and w2 represent weights of the topological similarity and the geometric similarity of the road mesh respectively. Existing studies show that topological features can better grasp the essence of spatial distribution, and the weights are set to 0.6 and 0.4 respectively.
Step 12: An example of calculating the spatial similarity of the multi-scale road network is given below. Results before and after the scale transformation of the road network are shown in
The experiments and psychological questionnaire survey show that the results of similarity calculation in this description are consistent with the changes of actual geographical elements, which is consistent with human cognition.
The above description of the disclosed examples enables professionals skilled in the art to achieve or use the present disclosure. Various modifications to these examples are readily apparent to professionals skilled in the art, and the general principles defined herein may be implemented in other examples without departing from the spirit or scope of the present disclosure. Therefore, the present disclosure is not limited to the examples shown herein but falls within the widest scope consistent with the principles and novel features disclosed herein.
| Number | Date | Country | Kind |
|---|---|---|---|
| 202311235494.7 | Sep 2023 | CN | national |