Method and device for desensitizing sensitive data of vehicle

Abstract

The invention provides a desensitization method and device for sensitive data of a vehicle. The desensitization method comprises the following steps: analyzing a geographic coordinate set of a vehicle driving and passing in a target area from a vehicle acquisition data set acquired by the vehicle in the target area; generating at least one track graph of the vehicle according to the geographic coordinate set; determining a target track graph from the track graphs based on a sensitive area topological relation between the track graphs and the target area; the sensitive area topological relation is generated according to sensitive geographic coordinates in the target area; performing desensitization processing on target acquisition data corresponding to the target geographic coordinates according to the target geographic coordinates covered by the target track graph; the target geographic coordinates are geographic coordinates covered by the target track graph in the geographic coordinate set, and the target collection data are vehicle collection data obtained by analyzing the target geographic coordinates in the vehicle collection data set. Whether the geographic coordinates need to be desensitized or not can be quickly judged, and the data processing speed is increased.

Description

Technical Field

[0001] The present application relates to the field of vehicle safety technology, and in particular to a method and device for desensitizing sensitive data of a vehicle. Background Art

[0002] In order to meet the development, training and simulation of algorithms, it is necessary to collect vehicle data, which includes geographic coordinates. However, the geographic coordinates of the vehicle may be sensitive data and need to be processed before subsequent use. Only then can the data be used for release.

[0003] In the process of data processing, it is first necessary to determine whether the geographic coordinates belong to sensitive data. Conventional methods require one-to-one comparison of geographic coordinates with sensitive data, which requires large amounts of calculation and slow query speed, resulting in slow data processing speed and low efficiency, which in turn leads to low efficiency of the entire data processing. Summary of the invention

[0004] The present application provides a method and device for desensitizing sensitive data of a vehicle, which can improve the data processing speed.

[0005] The present application provides a method for desensitizing sensitive data of a vehicle, comprising:

[0006] Parsing a set of geographic coordinates of the vehicle traveling in the target area from a vehicle collection data set collected by the vehicle in the target area;

[0007] generating at least one trajectory graph of the vehicle based on the set of geographic coordinates;

[0008] Determining a target trajectory graph from each trajectory graph based on a topological relationship between each trajectory graph and a sensitive area of ​​the target area; the sensitive area topological relationship is generated according to sensitive geographic coordinates in the target area;

[0009] According to the target geographic coordinates covered by the target trajectory graphic, the target collection data corresponding to the target geographic coordinates is desensitized; the target geographic coordinates are the geographic coordinates covered by the target trajectory graphic in the geographic coordinate set, and the target collection data are the vehicle collection data obtained by parsing the target geographic coordinates from the vehicle collection data set.

[0010] Optionally, the trajectory graphic includes a driving trajectory line of the vehicle and / or a geographic coordinate extension graphic, the driving trajectory line is determined by at least two first geographic coordinates in the geographic coordinate set, and the geographic coordinate extension graphic is a polygon generated by extending at least two second geographic coordinates in the geographic coordinate set and containing the at least two second geographic coordinates.

[0011] Optionally, generating at least one trajectory graph of the vehicle according to the geographic coordinate set includes:

[0012] Grouping the geographic coordinates in the geographic coordinate set according to the parsing order of the geographic coordinates of the geographic coordinate set to obtain at least one geographic coordinate group;

[0013] The following processing is performed for each geographic coordinate group: a line formed by connecting the position points represented by the geographic coordinates contained in the geographic coordinate group is determined as the trajectory graph.

[0014] Optionally, the sensitive area topological relationship includes an R-tree generated according to sensitive geographic coordinates in the target area;

[0015] The step of determining a target trajectory graph from each trajectory graph based on a topological relationship between each trajectory graph and a sensitive area of ​​the target area includes:

[0016] The trajectory graph having an overlapping area with the leaf node area of ​​the R-tree is determined as the target trajectory graph, and the leaf node area is the area corresponding to the leaf node of the R-tree.

[0017] Optionally, determining the trajectory graph having an overlapping area with the leaf node area of ​​the R-tree as a target trajectory graph includes:

[0018] The following processing is performed for each of the trajectory graphics: in response to the minimum circumscribed rectangle of the trajectory graphic and the minimum circumscribed rectangle of any leaf node of the R-tree having an overlapping area, the trajectory graphic is determined as the target trajectory graphic.

[0019] Optionally, in response to the minimum circumscribed rectangle of the trajectory graphic and the minimum circumscribed rectangle of any leaf node of the R-tree having an overlapping area, determining the trajectory graphic as the target trajectory graphic includes:

[0020] If the minimum bounding rectangle of the trajectory graph overlaps with the minimum bounding rectangle of the root node of the R-tree, recursively search for the child nodes of the root node;

[0021] If the minimum bounding rectangle of the trajectory graph and the minimum bounding rectangle of any node in the searched child nodes have an overlapping area, and the node is a leaf node, the trajectory graph is determined as the target trajectory graph.

[0022] Optionally, the R-tree is constructed in the following manner:

[0023] Acquire a sensitive area; the sensitive area is determined based on an area of ​​at least two of the sensitive geographic coordinates;

[0024] Generate a minimum bounding rectangle of the sensitive area;

[0025] Traversing the R-tree, finding the minimum bounding rectangle of the leaf node that has the largest overlapping area with the minimum bounding rectangle of the sensitive area;

[0026] If the space of the leaf node is greater than or equal to the space required for the minimum circumscribed rectangle of the sensitive area, insert the sensitive area into the leaf node;

[0027] If the space of the leaf node is smaller than the space required for the minimum circumscribed rectangle of the sensitive area, the leaf node is split, and the sensitive area is inserted into the split leaf node.

[0028] Optionally, the sensitive geographic coordinates are obtained in the following manner:

[0029] Get encrypted sensitive geographic coordinates from the database;

[0030] Decrypts encrypted sensitive geographic coordinates.

[0031] Optionally, the method further includes:

[0032] Check the database to see if there is any data update;

[0033] In response to the existence of updated sensitive geographic coordinates in the database, reading the updated sensitive geographic coordinates;

[0034] The R-tree is updated according to the updated sensitive geographic coordinates.

[0035] Optionally, performing desensitization processing on target acquisition data corresponding to the target geographic coordinates covered by the target trajectory graphic includes:

[0036] The target geographic coordinates are deleted from the target acquisition data.

[0037] Optionally, before parsing the geographic coordinate set through which the vehicle traveled in the target area from the vehicle collection data set collected from the vehicle in the target area, the desensitization method further includes:

[0038] receiving at least one data packet sent by the vehicle;

[0039] According to the data packet fragmentation indication information corresponding to each data packet, the data packets corresponding to the target area are screened out, and the screened out data packets are merged to obtain the vehicle collection data set.

[0040] Optionally, the desensitization method further comprises:

[0041] encrypting a transmission key of the data packet;

[0042] encrypting the data packet using the encrypted transmission key;

[0043] Before receiving the at least one data packet sent by the vehicle, the desensitization method further includes:

[0044] decrypting the transmission key;

[0045] The data packet is decrypted using the decrypted transmission key.

[0046] In some embodiments, sensitive geographic coordinates that need to be desensitized are stored to generate sensitive area topological relationships, and the geographic coordinates in the vehicle collection data set are compared with the sensitive area topological relationships to determine whether the geographic coordinates belong to sensitive geographic coordinates that need to be desensitized. The sensitive area topological relationships can improve the query speed, so that it can quickly determine whether the geographic coordinates need to be desensitized, thereby improving data processing speed.

[0047] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0049] Figure 1 Shown is a flow chart of an embodiment of a method for desensitizing sensitive data of a vehicle of the present application.

[0050] Figure 2 Shown is a schematic diagram of an embodiment in which the trajectory graph is a driving trajectory line.

[0051] Figure 3 The diagram is a schematic diagram of an embodiment in which the trajectory graph is a geographic coordinate expansion graph.

[0052] Figure 4 Shown is a schematic diagram of an embodiment in which the topological relationship of the sensitive areas of the present application is an R-tree.

[0053] Figure 5 Shown is a structural block diagram of an embodiment of a device for desensitizing sensitive data of a vehicle of the present application. DETAILED DESCRIPTION

[0054] The present application provides a method and device for desensitizing sensitive data of a vehicle. The method and device for desensitizing sensitive data of a vehicle of the present application are described in detail below in conjunction with the accompanying drawings. In the absence of conflict, the features of the following embodiments and implementations can be combined with each other.

[0055] The method for desensitizing sensitive data of a vehicle of the present application is applied to any device or system in a terminal, a vehicle, an independent server, a server cluster, a cloud, a vehicle network platform, an Internet of Things platform, etc.

[0056] Figure 1 Shown is a flow chart of an embodiment of a method 10 for desensitizing sensitive data of a vehicle of the present application.

[0057] like Figure 1 As shown, the method 10 for desensitizing sensitive data of a vehicle includes: steps 11 to 14.

[0058] Step 11: parse out a set of geographic coordinates through which the vehicle travels in the target area from a vehicle collection data set collected by the vehicle in the target area.

[0059] The target area can be any area that the vehicle passes through. The target area is the area used to collect the vehicle collection data set.

[0060] The vehicle collection data set refers to a collection of various types of vehicle data collected while the vehicle is traveling in the target area, such as the vehicle's speed, gear position, fuel consumption, geographic information data, etc. The data processed by the vehicle sensitive data desensitization method 10 of the present application is mainly the vehicle's geographic information data. The geographic information data includes the geographic location coordinates of the route the vehicle is traveling. The geographic information data can be GPS (Global Positioning System) data, GIS (Geographic Information System) data, and base station positioning data.

[0061] The geographic coordinate set is a set of coordinates of the geographical locations that the vehicle passes through in the target area. The geographic coordinate set contains the geographic coordinates of the locations that the vehicle passes through in the target area. The geographic coordinate set includes at least one geographic coordinate. The geographic coordinates in the geographic coordinate set represent the specific locations that the vehicle passes through when driving in the target area. The geographic coordinates in the geographic coordinate set are located on the driving route of the vehicle.

[0062] By parsing the vehicle collection data set, a geographic coordinate set can be obtained. Taking GPS data as an example, the GPS data packet is obtained from the vehicle collection data set. First, the GPS data packet is unpacked to obtain multiple files. Each file contains a topic, and the topic defines the bytecode structure file (for example, the first 4 bits of the byte represent the longitude coordinate, and the last 4 bits represent the latitude coordinate). For each file, according to the different topics of the file, the longitude and latitude coordinates are parsed from the data to obtain a geographic coordinate in the geographic coordinate set.

[0063] In some embodiments, before step 11, the method 10 for desensitizing sensitive data of a vehicle further includes: receiving at least one data packet sent by the vehicle; filtering out data packets corresponding to the target area according to data packet fragmentation indication information corresponding to each data packet, and merging the filtered data packets to obtain a vehicle collection data set.

[0064] In some embodiments, before sending a data packet, the vehicle will determine whether the file size of the data packet is greater than a file threshold; if the data packet is smaller than the file threshold, the data packet is sent directly; if the data packet is larger than the file threshold, the data packet is sent in fragments; after receiving the data packet, the received fragmented data packets are merged according to the fragmentation indication information contained in the data packet to obtain a vehicle collection data set.

[0065] The fragment indication information may include the fragment number, the total number of fragments, etc., which are used by the receiving end to reassemble the data packet.

[0066] During the vehicle data transmission process, the vehicle collected data set is organized into data packets of a certain size for transmission. The size of the data packet can be set according to the network protocol and application requirements.

[0067] The file threshold is used to determine whether the size of a data packet exceeds a certain limit. The file threshold can be set based on a combination of factors such as network bandwidth, storage capacity, processing speed, etc. In some embodiments, the file threshold is 10M.

[0068] If the size of the data packet is smaller than the preset file threshold, it means that the data volume is easy to manage and process under the current network and storage conditions. Therefore, these data packets can be directly transmitted without additional processing or splitting.

[0069] When the size of a data packet exceeds the file threshold, it means that the data volume is large. If it is directly transmitted or processed, it may put pressure on network bandwidth, storage resources or processing speed. Therefore, the fragmentation method is adopted to split the large data packet into multiple smaller fragments, and the size of each fragment is smaller than the file threshold. These fragments are transmitted one by one, and after receiving them, they are reassembled into a complete data packet in the original order and structure.

[0070] In some embodiments, the desensitization method 10 further comprises:

[0071] Encrypt the transmission key of the data packet;

[0072] encrypting the data packet using the encrypted transmission key;

[0073] Before receiving at least one data packet sent by the vehicle, the desensitization method 10 further includes:

[0074] Decrypt the transmission key;

[0075] The data packet is decrypted using the decrypted transport key.

[0076] Before the data packet is ready for transmission, the transmission key used to encrypt the data packet is first encrypted. This can protect the transmission key itself from being obtained by unauthorized third parties. The encryption of the transmission key can use a secure encryption algorithm, such as AES (Advanced Encryption Standard).

[0077] Before receiving at least one data packet sent by the vehicle, the received encrypted transmission key is first decrypted to recover the original key used to decrypt the data packet. The received encrypted data packet is decrypted using the decrypted transmission key to recover the original data content.

[0078] Before the data packet is sent, it is encrypted. When the data packet is received, it is first decrypted. This can improve the security of the data transmission process and prevent data leakage.

[0079] Step 12, generating at least one trajectory graph of the vehicle based on the geographic coordinate set.

[0080] After parsing the geographic coordinate set that the vehicle has traveled through in the target area, a corresponding trajectory graph is generated based on the geographic locations corresponding to the geographic coordinates contained in the geographic coordinate set. The trajectory graph can be any shape of a point, line or polygon. The trajectory graph is generated based on the geographic coordinate set and intuitively shows the driving path of the vehicle in the target area. If the geographic coordinate set contains multiple geographic coordinates, the multiple geographic coordinates can be grouped, and then the corresponding trajectory graph is generated based on the geographic coordinates of each group.

[0081] In some embodiments, the trajectory graphic includes a driving trajectory line of the vehicle and / or a geographic coordinate extension graphic, the driving trajectory line is determined by at least two first geographic coordinates in the geographic coordinate set, and the geographic coordinate extension graphic is a polygon generated by extending at least two second geographic coordinates in the geographic coordinate set and containing at least two second geographic coordinates.

[0082] Figure 2 Shown is a schematic diagram of an embodiment in which the trajectory graph is a driving trajectory line. Figure 3 The diagram is a schematic diagram of an embodiment in which the trajectory graph is a geographic coordinate expansion graph.

[0083] exist Figure 2In the figure, line 20 is a driving trajectory line, and points A, B, C, D, and E represent first geographic coordinates. At least two first geographic coordinates are required to obtain a driving trajectory line. The two first geographic coordinates can be regarded as the starting point and the end point on the vehicle's driving path (or any two points on the driving path). By connecting the position points of the first geographic coordinates, a continuous line, namely the driving trajectory line, can be formed to show the vehicle's driving path. The driving trajectory line can be a straight line or a curve.

[0084] exist Figure 3 In FIG. 1 , polygon 30 is a geographic coordinate expansion figure, and points F, G, H, and I represent second geographic coordinates. The second geographic coordinates are extended in a preset direction or according to a preset rule to obtain a geographic coordinate expansion figure. The geographic coordinate expansion figure is used to represent the geographic area where the vehicle's driving track is located. The second geographic coordinate can be located at the boundary of the geographic coordinate expansion figure or inside the geographic coordinate expansion figure.

[0085] In some embodiments, step 12 includes: grouping the geographic coordinates in the geographic coordinate set according to the parsing order of each geographic coordinate in the geographic coordinate set to obtain at least one geographic coordinate group; performing the following processing on each geographic coordinate group: connecting the position points represented by each geographic coordinate contained in the geographic coordinate group to form a line, and determining it as a trajectory graphic.

[0086] Each geographic coordinate in the geographic coordinate set is read, processed or stored in a certain order. The order may be a time order or a spatial order. The geographic coordinates are parsed and grouped according to the order.

[0087] Grouping can simplify the data processing process, making the number of geographic coordinates in each group controllable, which is convenient for subsequent graphics generation and analysis. At the same time, grouping can also help reduce performance problems caused by excessive data volume.

[0088] The data are grouped in the order of analysis so that each set of data has a continuous relationship in time or space. The trajectory graph containing each set of geographic coordinates represents the driving trajectory of the vehicle in a certain time or space.

[0089] In some embodiments, step 12 includes grouping the geographic coordinates in the geographic coordinate set according to a preset number.

[0090] The preset quantity can be flexibly determined according to the application scenario.

[0091] Step 13: Determine a target trajectory graph from each trajectory graph based on a topological relationship between each trajectory graph and a sensitive region of the target region. The topological relationship of the sensitive region is generated based on sensitive geographic coordinates in the target region.

[0092] Sensitive geographic coordinates refer to those geographic locations that may involve sensitive information such as national security, personal privacy or commercial secrets. Sensitive geographic coordinates are usually associated with specific areas or facilities, such as military bases, government agencies, private residential areas, critical infrastructure, etc.

[0093] In the present application, the sensitive geographic coordinates are stored in a database. When the method 10 for desensitizing sensitive data of a vehicle of the present application is executed, the pre-stored sensitive geographic coordinates are obtained from the database.

[0094] After obtaining the sensitive geographic coordinates, a sensitive area is obtained based on the sensitive geographic coordinates. The sensitive area is generated by at least two sensitive geographic coordinates. The sensitive area can be generated in advance and stored in a database. When executing the method 10 for desensitizing sensitive data of a vehicle of the present application, the sensitive area is obtained from the database.

[0095] The sensitive area topological relationship is an index structure that can represent the relationship between multiple sensitive areas, and is used to determine whether the trajectory graph involves sensitive geographic coordinates contained in the sensitive area. The sensitive area topological relationship can be pre-generated or dynamically generated each time the method 10 for desensitizing sensitive data of the vehicle is executed.

[0096] The target trajectory graph is a trajectory graph involving sensitive geographic coordinates included in the sensitive area. The geographic coordinates included in the geographic coordinate set for generating the target trajectory graph overlap with the sensitive geographic coordinates included in the sensitive area.

[0097] Based on the topological relationship between each trajectory graph and the sensitive area of ​​the target area, it can be determined whether each trajectory graph is a target trajectory graph.

[0098] Step 14, according to the target geographic coordinates covered by the target trajectory graph, the target collection data corresponding to the target geographic coordinates are desensitized. The target geographic coordinates are the geographic coordinates covered by the target trajectory graph in the geographic coordinate set, and the target collection data are the vehicle collection data from which the target geographic coordinates are parsed in the vehicle collection data set.

[0099] After the target trajectory graph is determined, the geographic coordinates included in the geographic coordinate set of the target trajectory graph are generated, namely, the target geographic coordinates.

[0100] After the target trajectory graph is determined, the target acquisition data is desensitized to ensure that the data will not be leaked. The desensitization process may include deleting, replacing or blurring the target acquisition data.

[0101] In some embodiments, step 14 includes: deleting the target geographic coordinates from the target acquisition data.

[0102] In some embodiments, sensitive geographic coordinates that need to be desensitized are stored to generate sensitive area topological relationships, and the geographic coordinates in the vehicle collection data set are compared with the sensitive area topological relationships to determine whether the geographic coordinates belong to sensitive geographic coordinates that need to be desensitized. The sensitive area topological relationships can improve the query speed, so that it can quickly determine whether the geographic coordinates need to be desensitized, thereby improving data processing speed.

[0103] In some embodiments, the sensitive area topological relationship includes an R-tree generated based on sensitive geographic coordinates in the target area; step 13 includes: determining a trajectory graph that has an overlapping area with a leaf node area of ​​the R-tree as a target trajectory graph, and the leaf node area is the area corresponding to the leaf node of the R-tree.

[0104] Figure 4 Shown is a schematic diagram of an embodiment in which the topological relationship of the sensitive areas of the present application is an R-tree.

[0105] R-tree is a tree data structure used to store multidimensional data (such as geospatial data). R-tree can quickly locate and query specific data sets, improving data processing speed. Each leaf node of R-tree represents a spatial region. The leaf node region refers to the region defined by the minimum bounding rectangle (MBR) of all sensitive regions composed of sensitive geographic coordinates in the leaf nodes of R-tree. Figure 4 As shown, nodes S1 and S2 are root nodes. Nodes S11, S12, S13, and S14 are child nodes of node S1. Nodes S21, S22, S23, and S24 are child nodes of node S2. Nodes S11, S12, S13, and S14 and nodes S21, S22, S23, and S24 represent a spatial area respectively, and the spatial area includes the sensitive area generated according to the sensitive geographic coordinates. The spatial area represented by node S1 includes the spatial area represented by nodes S11, S12, S13, and S14. The spatial area represented by node S2 includes the spatial area represented by nodes S21, S22, S23, and S24.

[0106] If there is an overlapping area between the trajectory graph and the leaf node area, it means that the geographical coordinates covered by the trajectory graph and the sensitive geographical coordinates contained in the sensitive area covered by the leaf node may overlap, and the trajectory graph is determined as the target trajectory graph.

[0107] In some embodiments, determining the trajectory graph having an overlapping area with the leaf node area of ​​the R-tree as the target trajectory graph includes:

[0108] The following processing is performed for each trajectory graph: in response to the minimum circumscribed rectangle of the trajectory graph and the minimum circumscribed rectangle of any leaf node of the R-tree having an overlapping area, the trajectory graph is determined as a target trajectory graph.

[0109] When judging whether the trajectory graph is the target trajectory graph, it is determined based on whether there is an overlapping area between the minimum bounding rectangle of the trajectory graph and the minimum bounding rectangle of any leaf node of the R-tree. Specifically, if any vertex of the minimum bounding rectangle of the trajectory graph is included in the minimum bounding rectangle of any leaf node of the R-tree, or the minimum bounding rectangle of the trajectory graph overlaps with the boundary of the minimum bounding rectangle of any leaf node of the R-tree, it is determined that there is an overlapping area between the two, and the trajectory graph is the target trajectory graph. If any vertex of the minimum bounding rectangle of the trajectory graph is not included in the minimum bounding rectangle of any leaf node of the R-tree, and the minimum bounding rectangle of the trajectory graph does not overlap with the boundary of the minimum bounding rectangle of any leaf node of the R-tree, it is determined that there is no overlapping area between the two, and the trajectory graph is not the target trajectory graph.

[0110] In some embodiments, the track graph is a driving track line. The minimum enclosing rectangle of the track graph is the minimum enclosing rectangle containing the driving track line, and its boundaries are determined by the northernmost, southernmost, easternmost, and westernmost position points of the driving track line.

[0111] In some embodiments, the trajectory graph is a geographic coordinate expansion graph. By traversing all vertices of the geographic coordinate expansion graph, the maximum and minimum values ​​in the longitude and latitude directions are found, and the minimum bounding rectangle of the geographic coordinate expansion graph is generated according to the minimum longitude, minimum latitude, maximum longitude, and maximum latitude.

[0112] In some embodiments, in response to the minimum bounding rectangle of the trajectory graphic and the minimum bounding rectangle of any leaf node of the R-tree having an overlapping area, determining the trajectory graphic as a target trajectory graphic includes:

[0113] If the minimum enclosing rectangle of the trajectory graph overlaps with the minimum enclosing rectangle of the root node of the R-tree, recursively search the child nodes of the root node;

[0114] If the minimum bounding rectangle of the trajectory graph overlaps with the minimum bounding rectangle of any node in the searched child nodes, and the node is a leaf node, the trajectory graph is determined as the target trajectory graph.

[0115] For example, in Figure 4In the embodiment shown, first determine whether the minimum bounding rectangle of the root nodes S1 and S2 overlaps with the minimum bounding rectangle of the trajectory graph. If the minimum bounding rectangle of the root nodes S1 and S2 overlaps with the minimum bounding rectangle of the trajectory graph, then take the node with the larger overlapping area. If the overlapping area of ​​the root node S1 is larger, recursively search whether the minimum bounding rectangle of the child nodes S11, S12, S13, and S14 of the root node S1 overlaps with the minimum bounding rectangle of the trajectory graph, and take the child node with the largest overlapping area. The sensitive geographic coordinates represented by the node overlap with the geographic coordinates represented by the trajectory graph, and the trajectory graph is the target trajectory graph. In the process of recursive search, as long as the minimum bounding rectangle of any leaf node is found to overlap with the minimum bounding rectangle of the trajectory graph, the trajectory graph is the target trajectory graph.

[0116] In some embodiments, the R-tree is constructed as follows:

[0117] Get sensitive areas; sensitive areas are determined based on areas with at least 2 sensitive geographic coordinates;

[0118] Generate the minimum bounding rectangle of the sensitive area;

[0119] Traverse the R-tree and find the minimum bounding rectangle of the leaf node that has the largest overlap with the minimum bounding rectangle of the sensitive area;

[0120] If the space of the leaf node is greater than or equal to the space required to accommodate the minimum circumscribed rectangle of the sensitive area, the sensitive area is inserted into the leaf node;

[0121] If the space of the leaf node is smaller than the space required to accommodate the minimum circumscribed rectangle of the sensitive area, the leaf node is split and the sensitive area is inserted into the split leaf node.

[0122] A sensitive area is an area containing at least two sensitive geographic coordinates. The sensitive area is pre-generated and stored in a database. After obtaining the sensitive area, a minimum bounding rectangle is generated for each sensitive area. Then find the node where the sensitive area should be inserted in the R tree, that is, find the minimum bounding rectangle of the leaf node with the largest overlapping area with the minimum bounding rectangle of the sensitive area. Specifically, starting from the root node N, if N is a leaf node, the sensitive area is directly inserted into node N. If N is not a leaf node, traverse the child nodes of N to find the node F with the smallest expansion area after adding the minimum bounding rectangle of the sensitive area (that is, after adding the minimum bounding rectangle of the sensitive area, the minimum bounding rectangle area of ​​F increases the least). If there are multiple such nodes, select the node with the smallest area. Set node F as the new root node N, and repeat the above process until a leaf node L is found.

[0123] Insert the minimum bounding rectangle of the sensitive area into the leaf node L. Specifically, determine whether the leaf node L has enough space to insert the minimum bounding rectangle; if so, directly add the minimum bounding rectangle to L; if not, split L to generate two new nodes L and LN, which contain all the minimum bounding rectangles in the original L and the newly added minimum bounding rectangle, ensuring that both nodes are as balanced as possible.

[0124] If a node split occurs, the structure of the R-tree needs to be adjusted. Starting from the leaf node L, recursively adjust the minimum bounding rectangle of each parent node upward to ensure that they still correctly enclose the minimum bounding rectangle of their child nodes. If a node split occurs during the adjustment process, the parent node of the newly split node needs to be adjusted at the same time. If the node split propagates all the way up to the root node and causes the root node to split as well, a new root node needs to be created and the two child nodes of the original root node after the split become the child nodes of the new root node.

[0125] In some embodiments, sensitive geographic coordinates are obtained by:

[0126] Get encrypted sensitive geographic coordinates from the database;

[0127] Decrypts encrypted sensitive geographic coordinates.

[0128] Sensitive geographic coordinates are encrypted and stored in the database to prevent unauthorized access and disclosure. Encryption can use various encryption algorithms, such as the AES (Advanced Encryption Standard) encryption algorithm. When sensitive geographic coordinates need to be obtained, they are read from the database. The encrypted data read needs to be decrypted before use. For symmetric encryption and asymmetric encryption, the decryption process needs to use the same key or key pair as the encryption to ensure the correctness and integrity of the data.

[0129] In some embodiments, the method 10 for desensitizing sensitive data of a vehicle of the present application further includes:

[0130] Check the database to see if there is any data update;

[0131] In response to the existence of updated sensitive geographic coordinates in the database, reading the updated sensitive geographic coordinates;

[0132] Update the R-tree according to the updated sensitive geographic coordinates.

[0133] In some embodiments, when the sensitive geographic coordinates stored in the database are updated, the user manually starts reading the updated sensitive geographic coordinates, thereby updating the R-tree. In some embodiments, the sensitive geographic coordinates are queried regularly, and when it is found that the sensitive geographic coordinate data is different from the original data, the R-tree is automatically regenerated based on the updated sensitive geographic coordinates.

[0134] If new sensitive geographic coordinates are added to the database, the new coordinates need to be inserted into the R-tree. Starting from the root node, traverse the R-tree layer by layer until a suitable leaf node is found to store the new sensitive geographic coordinates. Then, update the minimum enclosing rectangle of the relevant nodes according to the newly inserted sensitive geographic coordinates. If the existing sensitive geographic coordinates have changed, it is necessary to find the corresponding nodes in the R-tree and update the coordinate data and minimum enclosing rectangle contained in these nodes. If a sensitive geographic coordinate is deleted from the database, the corresponding coordinate needs to be deleted from the R-tree. Merge adjacent nodes layer by layer upward and recalculate the minimum enclosing rectangle of the parent node.

[0135] Figure 5 Shown is a structural block diagram of an embodiment of a device for desensitizing sensitive data of a vehicle of the present application.

[0136] like Figure 5 As shown, the device for desensitizing sensitive data of a vehicle includes one or more processors 21 for implementing the method 10 for desensitizing sensitive data of a vehicle as described above.

[0137] In some embodiments, the vehicle's sensitive data desensitization device may include a computer-readable storage medium 22, which may store a program that can be called by the processor 21 and may include a non-volatile storage medium. In some embodiments, the vehicle's sensitive data desensitization device may include a memory 23 and an interface 24. In some embodiments, the vehicle's sensitive data desensitization device may also include other hardware according to actual applications.

[0138] The computer-readable storage medium 22 of the embodiment of the present application stores a program thereon, which, when executed by the processor 21, is used to implement the method 10 for desensitizing sensitive data of the vehicle as described above.

[0139] The present application may take the form of a computer program product implemented on one or more computer-readable storage media 22 (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing program code. The computer-readable storage medium 22 includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. The information can be a computer-readable instruction, a data structure, a module of a program, or other data. Examples of computer-readable storage media 22 include but are not limited to: phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, read-only compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassette, tape disk storage or other magnetic storage device or any other non-transmission medium that can be used to store information that can be accessed by a computing device.

Claims

1. A method for desensitizing sensitive data of a vehicle, characterized in that: include: parsing a set of geographic coordinates of the vehicle traveling in the target area from a vehicle collection data set collected by the vehicle in the target area; generating at least one trajectory graph of the vehicle based on the set of geographic coordinates; Determine a target trajectory graph from each trajectory graph based on a topological relationship between each trajectory graph and a sensitive area of ​​the target area; The sensitive area topological relationship is generated according to the sensitive geographic coordinates in the target area; According to the target geographic coordinates covered by the target trajectory graphic, desensitizing the target collection data corresponding to the target geographic coordinates; The target geographic coordinates are the geographic coordinates covered by the target trajectory graphic in the geographic coordinate set, and the target collected data are the vehicle collected data obtained by parsing the target geographic coordinates from the vehicle collected data set.

2. The method for desensitizing sensitive data of a vehicle according to claim 1, characterized in that: The trajectory graphic includes a driving trajectory line and / or a geographic coordinate extension graphic of the vehicle, wherein the driving trajectory line is determined by at least two first geographic coordinates in the geographic coordinate set, and the geographic coordinate extension graphic is a polygon generated by extending at least two second geographic coordinates in the geographic coordinate set and containing the at least two second geographic coordinates.

3. The method for desensitizing sensitive data of a vehicle according to claim 1, characterized in that: Generating at least one trajectory graph of the vehicle according to the geographic coordinate set comprises: Grouping the geographic coordinates in the geographic coordinate set according to the parsing order of the geographic coordinates of the geographic coordinate set to obtain at least one geographic coordinate group; The following processing is performed for each geographic coordinate group: a line formed by connecting the position points represented by the geographic coordinates contained in the geographic coordinate group is determined as the trajectory graph.

4. The method for desensitizing sensitive data of a vehicle according to claim 1, characterized in that: The sensitive area topological relationship includes an R-tree generated according to sensitive geographic coordinates in the target area; The step of determining a target trajectory graph from each trajectory graph based on a topological relationship between each trajectory graph and a sensitive area of ​​the target area includes: The trajectory graph having an overlapping area with the leaf node area of ​​the R-tree is determined as the target trajectory graph, and the leaf node area is the area corresponding to the leaf node of the R-tree.

5. The method for desensitizing sensitive data of a vehicle according to claim 4, characterized in that: The step of determining the trajectory graph having an overlapping area with the leaf node area of ​​the R-tree as a target trajectory graph includes: The following processing is performed for each of the trajectory graphics: in response to the minimum circumscribed rectangle of the trajectory graphic and the minimum circumscribed rectangle of any leaf node of the R-tree having an overlapping area, the trajectory graphic is determined as the target trajectory graphic.

6. The method for desensitizing sensitive data of a vehicle according to claim 5, characterized in that: In response to the minimum circumscribed rectangle of the trajectory graphic and the minimum circumscribed rectangle of any leaf node of the R-tree having an overlapping area, determining the trajectory graphic as the target trajectory graphic includes: If the minimum bounding rectangle of the trajectory graph overlaps with the minimum bounding rectangle of the root node of the R-tree, recursively search for the child nodes of the root node; If the minimum bounding rectangle of the trajectory graph and the minimum bounding rectangle of any node in the searched child nodes have an overlapping area, and the node is a leaf node, the trajectory graph is determined as the target trajectory graph.

7. The method for desensitizing sensitive data of a vehicle according to claim 4, characterized in that: The R-tree is constructed as follows: Acquire a sensitive area; the sensitive area is determined based on an area of ​​at least two of the sensitive geographic coordinates; Generate a minimum bounding rectangle of the sensitive area; Traversing the R-tree, finding the minimum bounding rectangle of the leaf node that has the largest overlapping area with the minimum bounding rectangle of the sensitive area; If the space of the leaf node is greater than or equal to the space required for the minimum circumscribed rectangle of the sensitive area, insert the sensitive area into the leaf node; If the space of the leaf node is smaller than the space required for the minimum circumscribed rectangle of the sensitive area, the leaf node is split, and the sensitive area is inserted into the split leaf node.

8. The method for desensitizing sensitive data of a vehicle according to claim 7, characterized in that: The sensitive geographic coordinates are obtained in the following manner: Get encrypted sensitive geographic coordinates from the database; Decrypt encrypted sensitive geographic coordinates.

9. The method for desensitizing sensitive data of a vehicle according to any one of claims 4 to 8, characterized in that: The method further comprises: Check the database to see if there is any data update; In response to the existence of updated sensitive geographic coordinates in the database, reading the updated sensitive geographic coordinates; The R-tree is updated according to the updated sensitive geographic coordinates.

10. The method for desensitizing sensitive data of a vehicle according to claim 1, characterized in that: The desensitizing the target acquisition data corresponding to the target geographic coordinates according to the target geographic coordinates covered by the target trajectory graphic includes: The target geographic coordinates are deleted from the target acquisition data.

11. The method for desensitizing sensitive data of a vehicle according to claim 1, characterized in that: Before parsing out a set of geographic coordinates through which the vehicle traveled in the target area from the vehicle collection data set collected from the vehicle in the target area, the desensitization method further includes: receiving at least one data packet sent by the vehicle; According to the data packet fragmentation indication information corresponding to each data packet, the data packets corresponding to the target area are screened out, and the screened out data packets are merged to obtain the vehicle collection data set.

12. The method for desensitizing sensitive data of a vehicle according to claim 11, characterized in that: The desensitization method also includes: encrypting a transmission key of the data packet; encrypting the data packet using the encrypted transmission key; Before receiving the at least one data packet sent by the vehicle, the desensitization method further includes: decrypting the transmission key; The data packet is decrypted using the decrypted transmission key.

Images