Geometric matching method for geographic information line element data updating
By establishing a reference data buffer in the electronic map and removing small line features, the problem of inefficient matching of line features is solved, automatic matching with high accuracy is achieved, and manual operation costs are reduced.
Patent Information
- Application Number
- CN202411883946.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-20
- Publication Date
- 2025-04-25
AI Technical Summary
The prior art is inefficient in the matching process of line elements in electronic maps and requires high hardware equipment, so it is impossible to achieve completely correct matching, resulting in manual inspection and correction.
By confirming the reference data offset, a reference data buffer is established, and intersecting with the target data. After extracting the target data, the small line elements are removed, and the reference data is finally assigned to the target data, so that the attributes of the line elements are automatically matched.
It improves the accuracy of line element matching, reduces the cost of manual assignment, and the matching accuracy rate reaches more than 90%, while reducing the requirements for hardware equipment.
Smart Images
Figure CN119888278A_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the technical field of digital line drawing, and in particular relates to a geometric matching method for updating geographic information line element data. Background Art
[0002] Digital line maps refer to maps that are stored and accessed digitally using computer technology. They contain natural economic elements and social economic elements, and are used for data display, auxiliary positioning, and auxiliary navigation.
[0003] In digital line drawings, updated data can be fused using better reference data sources. The general process of data fusion includes several steps: data source preprocessing, geometric fusion, and attribute fusion. Among them, the key step in attribute fusion is feature matching. The key is to complete the association and matching of the same feature from multiple sources, that is, to establish the correspondence between source features and target features based on geometric similarity and attribute similarity. Matching based on geometric similarity is the first step in matching. The existing feature matching algorithm cannot achieve completely correct matching of features. Therefore, feature matching is currently often performed in a semi-automatic way, that is, manual visual matching inspection is performed on the basis of algorithm matching to achieve the ultimate goal.
[0004] Feature matching methods are divided into point, line, and surface feature matching according to different feature geometry types. Among them, line features include common important features such as rivers, roads, gullies, etc., and their matching algorithms are also relatively complex. If the matching accuracy is improved, it can greatly reduce manual operations, improve work efficiency, and speed up data updates.
[0005] exist Figure 1 As shown by the blue line feature, in the target line feature matching result, in addition to matching the correct L1 line feature, the L2 and L4 small line features are also matched. The matching results of L2 and L4 are not accurate, so they need to be removed before matching L1.
[0006] Figure 2 In the figure, the green number is the speed limit value of the reference data, and the red number is the speed limit value of the target data. After matching, the speed limit value of the reference data needs to be assigned to the speed limit value of the target data, so as to realize the fusion of the reference data and reduce the cost of manual work item by item.
[0007] In summary, the disadvantages of the prior art are as follows: since the amount of electronic map data is large, if the data is larger than a certain amount, the efficiency of the method will be reduced in application, and the hardware equipment requirements are high. Summary of the invention
[0008] In order to overcome the shortcomings of the prior art, the present invention provides a geometric matching method for updating geographic information line feature data. First, the reference data offset is confirmed and a reference data buffer is established; then the reference data buffer intersects with the target data to extract the target data; next, the small segment line feature is removed from the target data; and finally, the reference data is assigned to the target data. The present invention solves the problem of automatic attribute matching of line feature reference data, further improves the accuracy of matching, and reduces the cost of manual assignment. After a large amount of data and multi-scenario testing, the matching accuracy rate is over 90%.
[0009] The technical solution adopted by the present invention to solve the technical problem is as follows:
[0010] Step 1: Confirm the reference data offset and establish the reference data buffer;
[0011] Step 2: Intersect the reference data buffer with the target data to extract the target data;
[0012] Step 3: Remove small sections of road from target data;
[0013] Step 4: Assign reference data to target data.
[0014] Preferably, the step 2 is specifically as follows:
[0015] Step 2-1: Use the reference data buffer to intersect with the target road to obtain the road of the target layer within the reference data buffer;
[0016] Step 2-2: Calculate whether the center point of the intersected road segment is within the buffer zone. If not, remove the road segment, and keep the road segment whose center point is within the buffer zone.
[0017] Step 2-2-1: Calculate the coordinates of the road center point of the selected target layer m(x0,y0)=(x 1+ x2) / 2,(y 1+ y2) / 2;(x 1, y1)、(x 2, y2) are the coordinates of the starting point and the end point of the road respectively;
[0018] Step 2-2-2: After the center point intersects the buffer zone, the roads whose center points fall within the buffer zone are retained;
[0019] Preferably, the step 3 is specifically as follows:
[0020] Step 3-1: Filter out the roads to be removed according to the following principles:
[0021] 1) The length is less than twice the buffer distance;
[0022] 2) The angle between the short road segment and the other connected roads is between 80° and 100°;
[0023] 3) One end of a short road segment is a blind end, with only one road segment connected, and the other end is connected with ≥3 road segments;
[0024] Step 3-2: Remove the selected small sections of roads;
[0025] Preferably, the step 4 is specifically as follows:
[0026] After data geometry processing, the selected target roads are roads within 10 meters of the matching reference data, and the attributes of the reference data are matched to the target roads;
[0027] The assignment principle is to match the target road number within the buffer of this reference data, and then assign the matching reference data attributes to the target data.
[0028] 1) The first case: the reference data matches the target data, the value of the reference data is assigned to the target data, and the original value of the target data is replaced;
[0029] 2) The second case: if the reference data exists but there is no matching target data, the reference data will not be assigned;
[0030] 3) The third case: if the reference data does not exist and only the target data exists, the target data retains the original data value.
[0031] A computer program enables a computer to execute the geometric matching method.
[0032] An electronic device comprises: a processor and a memory; the memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory, so that the electronic device executes the above-mentioned geometric matching method.
[0033] A computer-readable storage medium stores a computer program, which implements the above-mentioned geometric matching method when executed by a processor.
[0034] A chip includes: a processor for calling and running a computer program from a memory, so that a device equipped with the chip executes the above-mentioned geometric matching method.
[0035] A computer program product comprises a computer storage medium storing a computer program, wherein the computer program comprises instructions executable by at least one processor, and the above-mentioned geometric matching method is implemented when the instructions are executed by the at least one processor.
[0036] The beneficial effects of the present invention are as follows:
[0037] The present invention solves the problem of automatic attribute matching of line element reference data, further improves the accuracy of matching, and reduces the cost of manual assignment. After testing with a large amount of data and multiple scenarios, the matching accuracy rate is over 90%. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 This is an example of the original matching result of line features;
[0039] Figure 2 This is an example of raw data for line features.
[0040] Figure 3 This is the effect diagram of matching front-line element data in the embodiment of the present invention
[0041] Figure 4 This is the effect diagram after the algorithm of the embodiment of the present invention is implemented
[0042] Figure 5 This is an example of road data before matching according to an embodiment of the present invention.
[0043] Figure 6 This is an example diagram of a 10-meter buffer zone for reference data in an embodiment of the present invention.
[0044] Figure 7 This is an example of the intersection result between the buffer zone and the target road in the embodiment of the present invention.
[0045] Figure 8 This is an example of the calculation result of the center point of a road segment according to an embodiment of the present invention.
[0046] Fig. 9 This is an example of the road data result with the center point in the buffer zone according to the embodiment of the present invention.
[0047] Fig.10 An example of a small road section that needs to be removed in an embodiment of the present invention
[0048] Fig.11 This is an example of the principle of screening small sections of roads that need to be removed in the embodiment of the present invention.
[0049] Fig.12 This is an example of the data result after removing a small section of road in an embodiment of the present invention.
[0050] Fig.13 An example of a speed limit value after matching and assigning values using reference data in an embodiment of the present invention
[0051] Fig.14 Flowchart for assigning values to reference data attributes DETAILED DESCRIPTION
[0052] The present invention is further described below in conjunction with the accompanying drawings and embodiments.
[0053] In the production of online features, the attributes are complex and diverse. The method of assigning reference data can be used to reduce labor costs. If the production task is based on image operations, this method also enriches the attributes of line features that cannot be identified based on images, thereby increasing the utilization rate of reference data.
[0054] Scenario: Use multi-source road data to perform attribute matching and assignment on target road data.
[0055] After comparing and analyzing the reference data with the target data, confirm the offset between the reference data and the target data, make a buffer for the reference data according to the offset, and then intersect with the target data. Based on the intersection result, remove the small burr line elements brought out during the matching. Based on the matching result, assign the reference data to the target data to complete the matching of data attributes.
[0056] (1) Confirm the reference data offset and establish a reference data buffer;
[0057] (2) The reference data buffer intersects with the target data to extract the target data;
[0058] (3) Remove small line elements from the target data;
[0059] (4) Reference data is assigned to target data.
[0060] Example:
[0061] by Figure 5 Take the scenario as an example, the green data is the reference data, and the red jagged data is the target data. The two colors are superimposed together to show that the reference data and the target data overlap. The value marked on the road line is the speed limit value, green is the reference data speed limit value, and red is the target data speed limit value.
[0062] The first step is to confirm the reference data offset and establish a reference data buffer.
[0063] Because the reference data production process is different and the accuracy is different, the offset between the reference data and the target data is different. It is necessary to analyze each reference data specifically. In this embodiment, a 10-meter offset is used as an example to establish a 10-meter buffer zone for the reference data. Figure 6 As shown:
[0064] In the second step, the reference data buffer is intersected with the target data to extract the target data.
[0065] 1. Use the buffer zone to intersect with the target road to obtain the target layer road within the buffer zone, such as Figure 7 .
[0066] 2. Calculate whether the center point of the intersecting road segment is within the buffer zone. If not, remove the road segment, and retain the road segment whose center point is within the buffer zone.
[0067] (1) Calculate the coordinates of the road center point of the selected target layer m(x0,y0) = (x 1+ x2) / 2,(y 1+ y2) / 2; Figure 8 .
[0068] (2) After the center point intersects the buffer zone, the roads whose center points fall within the buffer zone are retained, such as Fig. 9 .
[0069] The third step is to remove small sections of roads from the target data.
[0070] The 10-meter buffer used when the reference data intersects the target data is used. If the target data road has a small section of road, it will be calculated as a road in the buffer and selected. However, this data does not meet the assignment requirements and needs to be removed. Fig.10 :
[0071] 1. Filter out the roads that need to be removed, such as Fig.11 , filter according to the following principles:
[0072] 1) The length is less than twice the buffer distance. For example, if the buffer distance in this example is 10 meters, the length of the short road segment to be deleted is set to 20 meters.
[0073] 2) The angle between the short road segment and the other connected roads is between 80° and 100°.
[0074] 3) One end of a short road segment is a blind end, with only one road segment connected, and the other end has ≥ 3 road segments connected.
[0075] 2. Remove the small road sections that have been filtered out. The results after removal are as follows: Fig.12 As shown:
[0076] The fourth step is to assign the reference data to the target data, such as Fig.14 shown.
[0077] After data geometry processing, the selected target roads are roads within 10 meters of the matching reference data, and the attributes of the reference data need to be matched to the target roads.
[0078] like Fig.13 The assignment principle is to match the road number of the target road that falls within the buffer of this root reference data, and then assign the matching reference data attributes to the target data, such as the speed limit value example as shown in Table 1:
[0079] Table 1
[0080]
[0081] 1. The first case: the reference data matches the target data, and the value of the reference data needs to be assigned to the target data, and the original value of the target data is replaced;
[0082] 2. The second case: if the reference data exists but there is no matching target data, the reference data will not be assigned;
[0083] 3. The third situation: if the reference data does not exist and only the target data exists, the target data will retain the original data value.
[0084] The present invention is mainly to solve the problem of automatic attribute matching of line element reference data, further improve the accuracy of matching, and reduce the cost of manual assignment. Figure 3 and Figure 4 As shown, after testing with a large amount of data and multiple scenarios, the matching accuracy rate is over 90%.
Claims
1. A geometric matching method for updating geographic information line feature data, characterized in that: The steps include: Step 1: Confirm the reference data offset and establish the reference data buffer; Step 2: Intersect the reference data buffer with the target data to extract the target data; Step 3: Remove small sections of road from target data; Step 4: Assign reference data to target data.
2. A geometric matching method for updating geographic information line element data according to claim 1, characterized in that: The step 2 is specifically as follows: Step 2-1: Use the reference data buffer to intersect with the target road to obtain the road of the target layer within the reference data buffer; Step 2-2: Calculate whether the center point of the intersected road segment is within the buffer zone. If not, remove the road segment, and keep the road segment whose center point is within the buffer zone. Step 2-2-1: Calculate the coordinates of the road center point of the selected target layer m(x0,y0)=(x 1+ x2) / 2,(y1+y2) / 2; (x1,y1) and (x2,y2) are the coordinates of the starting point and the end point of the road respectively; Step 2-2-2: After the center point intersects the buffer zone, keep the roads whose center points fall within the buffer zone.
3. A geometric matching method for updating geographic information line element data according to claim 2, characterized in that: The step 3 is as follows: Step 3-1: Filter out the roads to be removed according to the following principles: 1) The length is less than twice the buffer distance; 2) The angle between the short road segment and the other connected roads is between 80° and 100°; 3) One end of a short road segment is a blind end, with only one road segment connected, and the other end is connected with ≥3 road segments; Step 3-2: Remove the selected small sections of roads.
4. A geometric matching method for updating geographic information line element data according to claim 3, characterized in that: The step 4 is specifically as follows: After data geometry processing, the selected target roads are roads within 10 meters of the matching reference data, and the attributes of the reference data are matched to the target roads; The assignment principle is to match the target road number within the buffer of this reference data, and then assign the matching reference data attributes to the target data. 1) The first case: the reference data matches the target data, the value of the reference data is assigned to the target data, and the original value of the target data is replaced; 2) The second case: if the reference data exists but there is no matching target data, the reference data will not be assigned; 3) The third case: if the reference data does not exist and only the target data exists, the target data retains the original data value.
5. A computer program, characterized in that The computer program enables a computer to execute the method according to any one of claims 1 to 4.
6. An electronic device, characterized in that: include: Processor and memory; The memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory, so that the electronic device executes the method as claimed in any one of claims 1 to 4.
7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 4 is implemented.
8. A chip, characterized in that: include: A processor, configured to call and run a computer program from a memory, so that a device equipped with the chip executes a method as claimed in any one of claims 1 to 4.
9. A computer program product, characterized in that The computer program product comprises a computer storage medium storing a computer program, wherein the computer program comprises instructions executable by at least one processor, and when the instructions are executed by the at least one processor, the method according to any one of claims 1 to 4 is implemented.