Method, device and storage medium for processing drive test data location information

Through the geographic hash encoding method based on preset distance, the problem of missing latitude and longitude information and large calculation amount in the processing of road test data in wireless communication is solved, and the rapid and accurate matching and processing of road test data is achieved, and the accuracy of data analysis is improved. and efficiency.

CN114584985BActive Publication Date: 2024-11-26CHINA MOBILE GROUP DESIGN INST +1
View PDF 14 Cites 0 Cited by

Patent Information

Application Number
CN202011383342.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-11-30
Publication Date
2024-11-26
Estimated Expiration
2040-11-30

AI Technical Summary

Technical Problem

The existing wireless communication mid-way test data processing methods have problems such as data abandonment caused by missing latitude and longitude information, and the tailing phenomenon caused by inertial navigation filling, and large calculations, especially in the testing of high-speed rail and high-speed roads.

Method used

Using a geographic hash encoding method based on preset distances, the sample point matching relationship in line lattice matrix and road test data is determined, and the two-dimensional latitude and longitude information is converted into one-dimensional lattice matrix index code through GeoHash encoding, improving matching efficiency and reducing calculations quantity.

Benefits of technology

It realizes fast matching and accurate processing of road test data, reduces the misjudgment rate in the event of insufficient satellite signals or tunneling, and improves the efficiency and accuracy of data processing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114584985B_ABST
    Figure CN114584985B_ABST
Patent Text Reader

Abstract

The present invention provides a method, device and storage medium for processing location information of drive test data. In the method of the present invention, based on a preset distance, a first geographic hash code corresponding to each vector point in a line lattice and a second geographic hash code corresponding to a target sample point in the drive test data are determined, the target sample point is a sample point with longitude and latitude information, based on the second geographic hash code and the first geographic hash code, a target vector point matching each target sample point in the drive test data is determined, and the two-dimensional longitude and latitude information of each target sample point in the drive test data is converted into a one-dimensional lattice index code of the corresponding target vector point, based on the first geographic hash code corresponding to each vector point in the line lattice and the second geographic hash code corresponding to the target sample point in the drive test data, the target sample point in the drive test data can be quickly matched with the target vector point in the line lattice, saving a lot of time for subsequent data processing.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technology, and in particular to a method, device and storage medium for processing location information of drive test data. Background Art

[0002] Field testing is an important means of optimizing wireless network coverage. Based on the latitude and longitude information carried by the test data, problem points can be quickly located, thereby discovering network coverage and interference problems. The test equipment obtains the latitude and longitude information of the test data through the satellite positioning system. During the test, the latitude and longitude information of some satellite signal blind spots will be filled in through inertial navigation information technology. In the existing technical solutions, the test data of linear roads such as high-speed railways and highways are basically saved in the form of longitude and latitude. When processing trunk line data, the two-dimensional longitude and latitude information of the test data will be normalized, and the location information of the test data will be converted into a one-dimensional form by matching with the line dot matrix, and the information database will be used for subsequent data retrieval and processing.

[0003] The existing method of processing the location information of trunk line test data has the following problems:

[0004] 1. The existing test data will directly discard the data entries with missing longitude and latitude. This processing method has a great impact on the coverage analysis of areas with insufficient satellite positioning system signals, especially tunnel scenes, and cannot timely discover coverage anomalies caused by device problems.

[0005] 2. For the blind spots of satellite positioning system signals, the original inertial navigation information technology will fill in the longitude and latitude information, but this filling method will produce a tailing phenomenon, resulting in inaccurate location information of the test data, and this data will also cause misjudgment in subsequent analysis.

[0006] 3. The one-dimensional processing of longitude and latitude information requires calculating the nearest projection point of each sampling point from the line. In order to ensure the accuracy of the calculation, the line will be sampled at 1 meter to obtain the dot matrix information of the vector, resulting in a large number of vector points in the dot matrix library. As a result, there are a lot of calculation processes when matching the test sampling points with the vector points in the dot matrix library, which cannot be completed efficiently. Summary of the invention

[0007] In view of the above technical problems existing in the prior art, the present invention provides a method, device and storage medium for processing location information of drive test data.

[0008] In a first aspect, the present invention provides a method for processing drive test data location information, comprising:

[0009] Based on the preset distance, determine a first geographic hash code corresponding to each vector point in the line dot matrix and a second geographic hash code corresponding to a target sample point in the drive test data; the target sample point is a sample point with longitude and latitude information;

[0010] Based on the second geographic hash code and the first geographic hash code, a target vector point matching each target sample point in the drive test data is determined, and the two-dimensional longitude and latitude information of each target sample point in the drive test data is converted into a one-dimensional dot matrix index code of the corresponding target vector point.

[0011] Optionally, according to the method for processing the location information of the drive test data of the present invention, determining the target vector point matching each target sample point in the drive test data based on the second geographic hash code and the first geographic hash code specifically includes:

[0012] Determine a third geo-hash code corresponding to each of the second geo-hash codes, where the third geo-hash code is a geo-hash code corresponding to eight areas surrounding the area corresponding to the second geo-hash code;

[0013] Comparing each of the second geo-hash codes and the third geo-hash code corresponding to the second geo-hash code with each of the first geo-hash codes, respectively, to determine a target first geo-hash code matching each of the second geo-hash codes;

[0014] Based on the distance between the vector point corresponding to the target first geographic hash code and the target sample point corresponding to the second geographic hash code, a target vector point matching the target sample point is determined.

[0015] Optionally, the method for processing drive test data location information according to the present invention further includes:

[0016] Based on the first sample point matched to the target vector point, determine the target vector point corresponding to the second sample point not matched to the target vector point and the third sample point without longitude and latitude information respectively;

[0017] The two-dimensional longitude and latitude information of the second sample point and the third sample point is converted into a one-dimensional dot matrix index code of the corresponding target vector point.

[0018] Optionally, according to the method for processing the location information of the drive test data of the present invention, the determining, based on the first sample point matched to the target vector point, the target vector point corresponding to the second sample point that is not matched to the target vector point and the third sample point that does not have the longitude and latitude information, specifically includes:

[0019] Based on the serial number of each sample point and the position of the target vector point matching the first sample point in the route, the target vector points corresponding to the second sample point and the third sample point are determined.

[0020] Optionally, according to the method for processing drive test data location information of the present invention, determining a target vector point matching the target sample point based on a distance between a vector point corresponding to the first geographic hash code of the target and a target sample point corresponding to the second geographic hash code specifically includes:

[0021] Determine, based on the distances between each vector point corresponding to the first target geo-hash code and the target sample point corresponding to the second geo-hash code, a first vector point that is closest to the target sample point corresponding to the second geo-hash code among the vector points corresponding to the first target geo-hash code;

[0022] If the distance between the first vector point and the target sample point corresponding to the second geohash code does not exceed the preset distance, the first vector point is used as a target vector point that matches the target sample point.

[0023] Optionally, according to the method for processing drive test data location information of the present invention, the target first geo-hash code is a first geo-hash code that is equal to the second geo-hash code or a third geo-hash code corresponding to the second geo-hash code.

[0024] In a second aspect, the present invention further provides a device for processing drive test data location information, comprising:

[0025] A coding module, used to determine, based on a preset distance, a first geographic hash code corresponding to each vector point in the line lattice and a second geographic hash code corresponding to a target sample point in the drive test data; the target sample point is a sample point with longitude and latitude information;

[0026] A location information processing module is used to determine a target vector point matching each target sample point in the drive test data based on the second geographic hash code and the first geographic hash code, and convert the two-dimensional longitude and latitude information of each target sample point in the drive test data into a one-dimensional dot matrix index code of the corresponding target vector point.

[0027] Optionally, the device for processing location information of drive test data according to the present invention determines, based on the second geographic hash code and the first geographic hash code, a target vector point matching each target sample point in the drive test data, specifically comprising:

[0028] Determine a third geo-hash code corresponding to each of the second geo-hash codes, where the third geo-hash code is a geo-hash code corresponding to eight areas surrounding the area corresponding to the second geo-hash code;

[0029] Comparing each of the second geo-hash codes and the third geo-hash code corresponding to the second geo-hash code with each of the first geo-hash codes, respectively, to determine a target first geo-hash code matching each of the second geo-hash codes;

[0030] Based on the distance between the vector point corresponding to the target first geographic hash code and the target sample point corresponding to the second geographic hash code, a target vector point matching the target sample point is determined.

[0031] In a third aspect, the present invention further provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the steps of the method provided in the first aspect are implemented.

[0032] In a fourth aspect, the present invention further provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method provided in the first aspect above.

[0033] The method, device and storage medium for processing the location information of the drive test data provided by the present invention can quickly complete the matching of the target sample points in the drive test data with the target vector points in the line lattice based on the first geographic hash code corresponding to each vector point in the line lattice and the second geographic hash code corresponding to the target sample point in the drive test data, thereby saving a lot of time for subsequent data processing. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] In order to more clearly illustrate the technical solutions in the present invention or the prior art, a brief introduction will be given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0035] Figure 1 It is a flowchart of a method for processing location information of drive test data provided by the present invention;

[0036] Figure 2 It is a schematic diagram of the data matching process provided by the present invention;

[0037] Figure 3 It is a schematic diagram of the test data assignment and filling process of the non-auxiliary anchor point provided by the present invention;

[0038] Figure 4 It is a schematic diagram of the result of converting the two-dimensional latitude and longitude information of the target sample point provided by the present invention into the one-dimensional dot matrix index code of the target vector point;

[0039] Figure 5 It is a structural schematic diagram of a device for processing location information of drive test data provided by the present invention;

[0040] Figure 6 is a schematic diagram of the structure of an electronic device provided by the present invention; DETAILED DESCRIPTION

[0041] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0042] Combine the following Figure 1-Figure 6 The present invention describes a method, device and storage medium for processing location information of drive test data.

[0043] Figure 1 A flowchart of a method for processing location information of drive test data provided by the present invention is shown as follows: Figure 1 As shown, the method includes:

[0044] Step 110, based on a preset distance, determine a first geographic hash code corresponding to each vector point in the line lattice and a second geographic hash code corresponding to a target sample point in the drive test data; the target sample point is a sample point with longitude and latitude information.

[0045] Specifically, before performing geohash coding, i.e., GeoHash coding, on each vector point in the line lattice and the target sample point in the drive test data, it is necessary to first determine the effective distance at which the target sample point and the target vector point are considered to be successfully matched, i.e., the preset distance. The accuracy / error of the GeoHash coding is determined based on the preset distance, and then the length of the GeoHash coding is determined based on the accuracy / error of the GeoHash coding.

[0046] The accuracy / error of GeoHash encoding is closely related to the encoding length. The specific relationship is shown in Table 1:

[0047] Table 1 Relationship between GeoHash encoding error and encoding length

[0048]

[0049]

[0050] In the table, Lat is Latitude, which ranges from -90 to +90, Lng is Longitude, which ranges from -180 to +180, and the circumference of the Earth reference sphere is 40075016.68 meters; according to Table 1, the algorithm can automatically determine the GeoHash code length according to the preset distance. For example, assuming that the effective distance between the target sample point and the vector point is within 50 meters, the match is considered successful, then the generated GeoHash code error must be greater than and closest to 50 meters. According to the rules in Table 1 above, when matching points within 50 meters, the code length is preferably 7 bits.

[0051] Table 2 shows the line point matrix data set, and Table 3 shows the result set of the line point matrix after GeoHash encoding. As shown in Table 2, the data in the line point matrix data set are arranged row by row, and each vector point corresponds to longitude and latitude data. The longitude and latitude data of each vector point in Table 2 are GeoHash encoded, and the line point matrix encoding result set XS in Table 3 is obtained. As shown in Table 3, GeoHash encoding also adopts the form of row by row arrangement. Since a GeoHash code represents an area, each row of GeoHash code corresponds to multiple vector points. Based on this, the amount of calculation for matching the target sample point with the vector point can be greatly reduced. As for the specific method of GeoHash encoding, it is the content of the prior art, and the present invention does not make specific limitations on this.

[0052] Table 2 Line dot matrix data set

[0053] Column 1 Column 2 Column 3 … longitude latitude X1 ** ** … 39.923201 116.390705 X2 ** ** … 39.92320101 116.39070501 X3 ** ** … 39.12320101 116.19070501

[0054] Table 3 Line dot coding result set

[0055]

[0056]

[0057] Step 120: determine the target vector point matching each target sample point in the drive test data based on the second geo-hash code and the first geo-hash code, and convert the two-dimensional longitude and latitude information of each target sample point in the drive test data into a one-dimensional dot matrix index code of the corresponding target vector point.

[0058] Specifically, based on the second geographic hash code and the first geographic hash code, a first geographic hash code that is equal to or close to the second geographic hash code corresponding to the target sample point in the drive test data can be quickly determined, and then the target vector point matching each target sample point in the drive test data can be determined, and the conversion of two-dimensional longitude and latitude information and one-dimensional dot matrix index code can be realized, saving a lot of time for subsequent data processing.

[0059] The method provided by the present invention can quickly complete the matching of target sample points in the drive test data with target vector points in the line lattice based on the first geographic hash code corresponding to each vector point in the line lattice and the second geographic hash code corresponding to the target sample point in the drive test data, thereby saving a lot of time for subsequent data processing.

[0060] Based on the above embodiment, determining a target vector point matching each target sample point in the drive test data based on the second geographic hash code and the first geographic hash code specifically includes:

[0061] Determine a third geo-hash code corresponding to each of the second geo-hash codes, where the third geo-hash code is a geo-hash code corresponding to eight areas surrounding the area corresponding to the second geo-hash code;

[0062] Comparing each of the second geo-hash codes and the third geo-hash code corresponding to the second geo-hash code with each of the first geo-hash codes, respectively, to determine a target first geo-hash code matching each of the second geo-hash codes;

[0063] Based on the distance between the vector point corresponding to the target first geographic hash code and the target sample point corresponding to the second geographic hash code, a target vector point matching the target sample point is determined.

[0064] Specifically, GeoHash encoding is performed on the sampling points with original longitude and latitude information in the test data (i.e., the target sample points) to obtain the second geographic hash code. By comparing it with the line dot matrix code (i.e., the first geographic hash code), the amount of calculation required for distance calculation is greatly reduced, and the matching of the test data with the nearest point of the line dot matrix data is completed.

[0065] Table 4 shows the test data point set LS, whose arrangement structure is similar to the line point matrix data set.

[0066] Table 4 Line dot matrix data set

[0067] Column 1 Column 2 Column 3 … longitude latitude L1 ** ** … 39.923201 116.390705 L2 ** ** … 39.92320101 116.39070501 L3 ** ** … 39.12320101 116.19070501

[0068] Figure 2 FIG. 1 is a schematic diagram of a data matching process provided by the present invention. Figure 2 As shown, the data matching process is briefly described as follows:

[0069] Step 1: All sample points of the original test data are recorded in the sample point set LS, the i-th row of data is taken from LS as LS[i], and the code is generated as HashCode according to the longitude and latitude of LS[i];

[0070] Step 2: Generate a code set based on HashCode, including the codes of the eight blocks around the block indicated by the code and the block code of the code itself (i.e., generate a new set of codes of the nine-square area centered on the rectangle itself), which is ExHashCode.

[0071] Step 3: Create a new empty line object set as NewXObj, and take out the c-th row data from the ExHashCode set as ExHashCode[c].

[0072] Step 4: Take out the k-th row of data from the line dot matrix precoding processing result set XS as XS[k], match it with ExHashCode[c], and loop to determine whether the two codes are completely consistent. If so, take out all the line objects in XS[k] and insert them into the NewXObj collection until the ExHashCode loop ends.

[0073] Step 5: After the ExHashCode loop ends, use the longitude and latitude points of LS[i] to calculate the distance with the longitude and latitude of each object in the NewXObj collection, and get the nearest route point object as XMinObj and the closest distance as Dic.

[0074] Step 6: Determine whether the closest distance Dic is within the set distance range. If so, the matching result is added to the successful result set Result. If not, the calculation result is discarded.

[0075] Step 7: Determine whether the LS drive test data cycle is completed. If not, return to step 1 to continue the next data judgment process. If it is completed, output the matching success result set Result.

[0076] According to the successful matching result set Result, the target vector point matching the target sample point can be determined.

[0077] The method provided by the present invention determines the geographic hash codes corresponding to eight areas around the area corresponding to the second geographic hash code, and compares them with each of the first geographic hash codes respectively, determines the target first geographic hash codes matching each of the second geographic hash codes, and then determines the target vector point matching the target sample point based on the distance between the vector point corresponding to the target first geographic hash code and the target sample point corresponding to the second geographic hash code. The method can quickly and accurately complete the matching of the target sample point in the drive test data with the target vector point in the line lattice, saving a lot of time for subsequent data processing.

[0078] Based on the above embodiment, it also includes:

[0079] Based on the first sample point matched to the target vector point, determine the target vector point corresponding to the second sample point not matched to the target vector point and the third sample point without longitude and latitude information respectively;

[0080] The two-dimensional longitude and latitude information of the second sample point and the third sample point is converted into a one-dimensional dot matrix index code of the corresponding target vector point.

[0081] Specifically, in view of the fact that the test sample points have no valid longitude and latitude information or the longitude and latitude jump seriously due to the problems of insufficient satellite positioning system signals, tunnels, antenna shielding, etc., the present invention proposes the definition of auxiliary anchor points, that is, if the test data sample point matches the target vector point, then the test sample point is defined as an auxiliary anchor point (i.e., the first sampling point), and is set according to the conditions. If multiple consecutive sampling points are matched to the target vector point, a set of continuous auxiliary anchor point information is formed (continuous auxiliary anchor points mean that the longitude and latitude information carried by the test sample is credible). For the test data sample points with serious longitude and latitude jumps, they generally cannot be matched to the target vector point. Such test sample points are the second sample points. At the same time, for the test data sample points without valid longitude and latitude information (i.e., the third sample points), they cannot be GeoHash encoded and matched at all. The second and third sample points are non-auxiliary anchor points. Based on the auxiliary anchor point information, the non-auxiliary anchor points can be assigned and filled to complete the matching mapping of the full test sample points and the line dot matrix.

[0082] The method provided by the present invention determines the target vector points respectively corresponding to the second sample point that does not match the target vector point and the third sample point that does not have longitude and latitude information based on the first sample point that matches the target vector point, introduces auxiliary anchor point determination to solve the assignment and filling of invalid longitude and latitude information and inertial navigation distorted longitude and latitude data sample points, realizes fast and accurate matching of full test samples with line dot matrix, saves a lot of time for subsequent data processing, and ensures the accuracy of data processing.

[0083] Based on the above embodiment, the step of determining the target vector points respectively corresponding to the second sample point that is not matched to the target vector point and the third sample point that does not have longitude and latitude information based on the first sample point that matches the target vector point specifically includes:

[0084] Based on the serial number of each sample point and the position of the target vector point matching the first sample point in the route, the target vector points corresponding to the second sample point and the third sample point are determined.

[0085] Specifically, through the successful matching results, the auxiliary anchor point is determined to obtain the position of the test point in the dot matrix, and the test data sample points of non-auxiliary anchor points are filled with data in a geometric manner to improve the location information of all test samples. Continuous auxiliary anchor points mean that the latitude and longitude information carried by the test sample is credible, and the test data of non-auxiliary anchor points is filled with data in a uniformly distributed manner.

[0086] Figure 3 FIG. 1 is a schematic diagram of the test data assignment filling process of the non-auxiliary anchor point provided by the present invention. Figure 3 As shown, assuming that the 5th to 7th test data sample points in the figure are non-auxiliary anchor points, that is, they are sampling points that need to be assigned values, the 4th test data sample point is matched to the vector point at the 290-meter position in the line dot matrix, and the 8th sample point is matched to the vector point at the 790-meter position in the line dot matrix. The distance between the 4th to 8th sample point data is 500 meters, and the average distance is 500 / (3+1)=125 meters. According to this spacing, the 5th to 7th sample points are matched to the nearest points of the line dot matrix, that is, they are matched to the vector points at the 415-meter, 540-meter and 665-meter positions in the line dot matrix, respectively, to achieve line dot matrix matching of the test data sampling points of the non-auxiliary anchor points, and complete the matching mapping of the full test sample points and the line dot matrix.

[0087] After obtaining the matching relationship between the full test samples and the line dot matrix library, the conversion between the two-dimensional longitude and latitude information of all test data and the one-dimensional dot matrix index code can be completed, which is convenient for the subsequent data retrieval calculation. As mentioned above, the line generation accuracy is a line dot matrix set with an interval of 1 meter. There are several reference points (such as stations, toll booths, etc.) in the line dot matrix set. At this time, the relationship between the points in the line dot matrix set can be obtained by simply describing it as the line dot matrix vector point index code (for example, if the reference point is marked as A, then each vector point after A can be marked as A-1, A-2, etc., which is used to mark the vector points 1 meter and 2 meters away from the reference point). After the test data sample points are matched with the line dot matrix vector points, the index mark can be used to realize the one-dimensional conversion of longitude and latitude information, which is convenient for the subsequent data calculation and retrieval operations.

[0088] Figure 4 FIG. 1 is a schematic diagram showing the result of converting the two-dimensional latitude and longitude information of the target sample point provided by the present invention into a one-dimensional dot matrix index code of the target vector point, as shown in FIG. Figure 4 As shown, the test sample point with longitude and latitude (114.4698, 37.9561) is directly represented by the nearest point A-7 in the line point set.

[0089] The method provided by the present invention determines the target vector points corresponding to the second sample point and the third sample point respectively based on the number of each sample point and the position of the target vector point matching the first sample point in the line, so as to quickly and accurately achieve line dot matrix matching of the test data sampling points of non-auxiliary anchor points and complete the matching mapping of all test sample points and the line dot matrix.

[0090] Based on the above embodiment, determining the target vector point matching the target sample point based on the distance between the vector point corresponding to the first target geographic hash code and the target sample point corresponding to the second geographic hash code specifically includes:

[0091] Determine, based on the distances between each vector point corresponding to the first target geo-hash code and the target sample point corresponding to the second geo-hash code, a first vector point that is closest to the target sample point corresponding to the second geo-hash code among the vector points corresponding to the first target geo-hash code;

[0092] If the distance between the first vector point and the target sample point corresponding to the second geohash code does not exceed the preset distance, the first vector point is used as a target vector point that matches the target sample point.

[0093] Specifically, as in the above steps 5-6: After the ExHashCode loop is completed, the latitude and longitude points of LS[i] (i.e., the target sample point) are used to calculate the distance with the latitude and longitude of each object in the NewXObj set (i.e., each vector point corresponding to the first target geographic hash code), and the nearest route point object is XMinObj (i.e., the first vector point), and the nearest distance is Dic. It is determined whether the nearest distance Dic is within the set distance (i.e., the preset distance). If so, the matching result is added to the successful result set Result. If not, the calculation result is discarded.

[0094] Most of the existing methods for the nearest point matching calculation link are full calculation or similar multi-region cutting calculation, but the efficiency is not as good as the present invention. The present invention automatically seeks a suitable encoding length according to a predetermined calculation accuracy, and uses nested comparison of encoding and objects to further reduce the time consumption of matching, saving a lot of time for subsequent data processing.

[0095] According to the statistics of the two sets of comparison data, the new algorithm and the traditional algorithm have improved efficiency by more than 100 times, especially as the number of point arrays increases, the processing efficiency is improved even more. As shown in Table 5, when the preset distance is 50 meters, the calculation amount comparison table of the method of the present invention and the existing method is as follows:

[0096] Table 5 Comparison of the calculation amount of the method of the present invention and the existing method

[0097]

[0098] The method provided by the present invention determines the target vector point that matches the target sample point based on the distance between each vector point corresponding to the first geographic hash code of the target and the target sample point corresponding to the second geographic hash code, thereby improving the matching efficiency and ensuring the matching accuracy.

[0099] Based on the above embodiment, the target first geo-hash code is a first geo-hash code that is equal to the second geo-hash code or a third geo-hash code corresponding to the second geo-hash code.

[0100] Specifically, since a GeoHash code represents a rectangular area, if two locations are divided into two different rectangular areas (i.e., represented by two different GeoHash codes), their matching degree is very low, but the two locations are very close. In order to solve this problem, in addition to using the GeoHash code of the positioning point (i.e., the second geohash code) for matching, the GeoHash codes of the surrounding 8 areas (i.e., the third geohash code) are also used. This method can maximize the matching accuracy.

[0101] The method provided by the present invention can maximize the accuracy of matching the target sample point with the vector point by determining the first geo-hash code that is equal to the second geo-hash code or the third geo-hash code corresponding to the second geo-hash code.

[0102] Based on any of the above embodiments, Figure 5 A schematic diagram of a device for processing location information of drive test data provided by the present invention, such as Figure 5 As shown, the device comprises:

[0103] The encoding module 510 is used to determine, based on a preset distance, a first geographic hash code corresponding to each vector point in the line lattice and a second geographic hash code corresponding to a target sample point in the drive test data; the target sample point is a sample point with longitude and latitude information.

[0104] Specifically, the encoding module 510 determines the accuracy / error of the GeoHash encoding according to the preset distance, and further determines the length of the GeoHash encoding according to the accuracy / error of the GeoHash encoding.

[0105] The location information processing module 520 is used to determine the target vector point matching each target sample point in the drive test data based on the second geographic hash code and the first geographic hash code, and convert the two-dimensional longitude and latitude information of each target sample point in the drive test data into a one-dimensional dot matrix index code of the corresponding target vector point.

[0106] Specifically, the location information processing module 520 can quickly determine the first geographic hash code that is equal to or close to the second geographic hash code corresponding to the target sample point in the drive test data based on the second geographic hash code and the first geographic hash code, and then determine the target vector point that matches each target sample point in the drive test data, and realize the conversion of two-dimensional longitude and latitude information and one-dimensional dot matrix index code, saving a lot of time for subsequent data processing.

[0107] The device provided by the present invention can quickly complete the matching of target sample points in the drive test data with target vector points in the line lattice based on the first geographic hash code corresponding to each vector point in the line lattice and the second geographic hash code corresponding to the target sample point in the drive test data, thereby saving a lot of time for subsequent data processing.

[0108] Based on the above embodiment, determining a target vector point matching each target sample point in the drive test data based on the second geographic hash code and the first geographic hash code specifically includes:

[0109] Determine a third geo-hash code corresponding to each of the second geo-hash codes, where the third geo-hash code is a geo-hash code corresponding to eight areas surrounding the area corresponding to the second geo-hash code;

[0110] Comparing each of the second geo-hash codes and the third geo-hash code corresponding to the second geo-hash code with each of the first geo-hash codes, respectively, to determine a target first geo-hash code matching each of the second geo-hash codes;

[0111] Based on the distance between the vector point corresponding to the target first geographic hash code and the target sample point corresponding to the second geographic hash code, a target vector point matching the target sample point is determined.

[0112] Based on the above embodiment, it also includes:

[0113] Based on the first sample point matched to the target vector point, determine the target vector point corresponding to the second sample point not matched to the target vector point and the third sample point without longitude and latitude information respectively;

[0114] The two-dimensional longitude and latitude information of the second sample point and the third sample point is converted into a one-dimensional dot matrix index code of the corresponding target vector point.

[0115] Based on the above embodiment, the step of determining the target vector points respectively corresponding to the second sample point that is not matched to the target vector point and the third sample point that does not have longitude and latitude information based on the first sample point that matches the target vector point specifically includes:

[0116] Based on the serial number of each sample point and the position of the target vector point matching the first sample point in the route, the target vector points corresponding to the second sample point and the third sample point are determined.

[0117] Based on the above embodiment, determining the target vector point matching the target sample point based on the distance between the vector point corresponding to the first target geographic hash code and the target sample point corresponding to the second geographic hash code specifically includes:

[0118] Determine, based on the distances between each vector point corresponding to the first target geo-hash code and the target sample point corresponding to the second geo-hash code, a first vector point that is closest to the target sample point corresponding to the second geo-hash code among the vector points corresponding to the first target geo-hash code;

[0119] If the distance between the first vector point and the target sample point corresponding to the second geohash code does not exceed the preset distance, the first vector point is used as a target vector point that matches the target sample point.

[0120] Based on the above embodiment, the target first geo-hash code is a first geo-hash code that is equal to the second geo-hash code or a third geo-hash code corresponding to the second geo-hash code.

[0121] The device for processing the drive test data location information provided by the present invention can execute the above-mentioned method for processing the drive test data location information. Its specific working principle and corresponding technical effects are the same as those of the above-mentioned method, which will not be described in detail herein.

[0122] Figure 6 An example of a physical structure diagram of an electronic device is shown in FIG. Figure 6 As shown, the electronic device may include: a processor 610, a communication interface 620, a memory 630 and a communication bus 640, wherein the processor 610, the communication interface 620 and the memory 630 communicate with each other through the communication bus 640. The processor 610 may call the logic instructions in the memory 630 to execute the method for processing the drive test data location information provided by the above methods.

[0123] In addition, the logic instructions in the above-mentioned memory 630 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0124] On the other hand, the present invention further provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method for processing the drive test data location information provided by the above methods.

[0125] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0126] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0127] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for processing location information of drive test data, characterized in that: include: Based on the preset distance, determine a first geographic hash code corresponding to each vector point in the line lattice and a second geographic hash code corresponding to the target sample point in the drive test data; The target sample point is a sample point with longitude and latitude information; Determine a target vector point matching each target sample point in the drive test data based on the second geo-hash code and the first geo-hash code, and convert the two-dimensional longitude and latitude information of each target sample point in the drive test data into a one-dimensional dot matrix index code of the corresponding target vector point; Wherein, determining a target vector point matching each target sample point in the drive test data based on the second geographic hash code and the first geographic hash code specifically includes: Determine a third geo-hash code corresponding to each of the second geo-hash codes, where the third geo-hash code is a geo-hash code corresponding to eight areas surrounding the area corresponding to the second geo-hash code; Comparing each of the second geo-hash codes and the third geo-hash code corresponding to the second geo-hash code with each of the first geo-hash codes, respectively, to determine a target first geo-hash code matching each of the second geo-hash codes; Determine a target vector point that matches the target sample point based on a distance between a vector point corresponding to the target first geographic hash code and a target sample point corresponding to the second geographic hash code; The determining of the target vector point matching the target sample point based on the distance between the vector point corresponding to the first target geographic hash code and the target sample point corresponding to the second geographic hash code specifically includes: Determine, based on the distances between each vector point corresponding to the first target geo-hash code and the target sample point corresponding to the second geo-hash code, a first vector point that is closest to the target sample point corresponding to the second geo-hash code among the vector points corresponding to the first target geo-hash code; If the distance between the first vector point and the target sample point corresponding to the second geohash code does not exceed the preset distance, the first vector point is used as a target vector point that matches the target sample point.

2. The method for processing drive test data location information according to claim 1, characterized in that: Also includes: Based on the first sample point matched to the target vector point, determine the target vector point corresponding to the second sample point not matched to the target vector point and the third sample point without longitude and latitude information respectively; The two-dimensional longitude and latitude information of the second sample point and the third sample point is converted into a one-dimensional dot matrix index code of the corresponding target vector point.

3. The method for processing drive test data location information according to claim 2, characterized in that: The determining, based on the first sample point matched to the target vector point, the target vector point corresponding to the second sample point not matched to the target vector point and the third sample point without longitude and latitude information, specifically includes: Based on the serial number of each sample point and the position of the target vector point matching the first sample point in the route, the target vector points corresponding to the second sample point and the third sample point are determined.

4. The method for processing drive test data location information according to claim 1, characterized in that: The target first geo-hash code is a first geo-hash code that is equal to the second geo-hash code or a third geo-hash code corresponding to the second geo-hash code.

5. A device for processing location information of drive test data, characterized in that: include: A coding module, used to determine, based on a preset distance, a first geographic hash code corresponding to each vector point in the line lattice and a second geographic hash code corresponding to a target sample point in the drive test data; The target sample point is a sample point with longitude and latitude information; a location information processing module, configured to determine, based on the second geographic hash code and the first geographic hash code, a target vector point matching each target sample point in the drive test data, and convert the two-dimensional longitude and latitude information of each target sample point in the drive test data into a one-dimensional dot matrix index code of the corresponding target vector point; Wherein, determining a target vector point matching each target sample point in the drive test data based on the second geographic hash code and the first geographic hash code specifically includes: Determine a third geo-hash code corresponding to each of the second geo-hash codes, where the third geo-hash code is a geo-hash code corresponding to eight areas surrounding the area corresponding to the second geo-hash code; Comparing each of the second geo-hash codes and the third geo-hash code corresponding to the second geo-hash code with each of the first geo-hash codes, respectively, to determine a target first geo-hash code matching each of the second geo-hash codes; Determine a target vector point that matches the target sample point based on a distance between a vector point corresponding to the target first geographic hash code and a target sample point corresponding to the second geographic hash code; The determining of the target vector point matching the target sample point based on the distance between the vector point corresponding to the first target geographic hash code and the target sample point corresponding to the second geographic hash code specifically includes: Determine, based on the distances between each vector point corresponding to the first target geo-hash code and the target sample point corresponding to the second geo-hash code, a first vector point that is closest to the target sample point corresponding to the second geo-hash code among the vector points corresponding to the first target geo-hash code; If the distance between the first vector point and the target sample point corresponding to the second geohash code does not exceed the preset distance, the first vector point is used as a target vector point that matches the target sample point.

6. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the steps of the method for processing the drive test data location information according to any one of claims 1 to 4 are implemented.

7. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method for processing the drive test data location information according to any one of claims 1 to 4 are implemented.

Citation Information

Patent Citations

  • Geographic position-based information retrieval method, device and system

    CN106407213A

  • Map retrieving calculation path engine testing system and testing method

    CN108920476A

  • MDT-based network coverage management method and MC system

    CN109495905A

  • Geographic information positioning and partitioning method and device based on deep learning

    CN109614456A

  • Weak coverage area determination method and device and computer readable storage medium

    CN110677859A