Method and apparatus for desensitizing sensitive data of a vehicle

Abstract

The application provides a desensitization method and device for sensitive data of a vehicle. The desensitization method comprises the following steps: from vehicle collection data collected by the vehicle in a target area, a set of geographical coordinates through which the vehicle travels in the target area is parsed; at least one trajectory pattern of the vehicle is generated according to the set of geographical coordinates; a target trajectory pattern is determined from each trajectory pattern based on the sensitive region topological relationship of each trajectory pattern and the target area; the sensitive region topological relationship is generated according to sensitive geographical coordinates in the target area; target collection data corresponding to the target geographical coordinates is desensitized according to the target geographical coordinates covered by the target trajectory pattern; the target geographical coordinates are geographical coordinates covered by the target trajectory pattern in the set of geographical coordinates, and the target collection data is vehicle collection data in the vehicle collection data set corresponding to the target geographical coordinates. The application can quickly determine whether the geographical coordinates need to be desensitized, and improve the data processing speed.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of vehicle safety, in particular to a desensitization method and device for sensitive data of a vehicle. BACKGROUND

[0002] In order to meet the development, training and simulation of algorithms, it is necessary to collect data of a vehicle, which includes geographic coordinates. The geographic coordinates of the vehicle can be sensitive data, and the data can be used for publication only after being processed.

[0003] In the process of processing data, it is necessary to determine whether the geographic coordinates belong to sensitive data. The conventional method needs to compare the geographic coordinates with sensitive data one by one, which has large calculation amount and slow query speed, resulting in slow data processing speed and low efficiency, and further resulting in low processing efficiency of the entire data processing. SUMMARY

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

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

[0006] From a vehicle collection data set collected by a vehicle in a target area, a set of geographic coordinates through which the vehicle travels in the target area is parsed;

[0007] At least one trajectory pattern of the vehicle is generated according to the set of geographic coordinates;

[0008] Based on the sensitive region topological relationship of each trajectory pattern and the target area, a target trajectory pattern is determined from each trajectory pattern; the sensitive region 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 pattern, the target collection data corresponding to the target geographic coordinates is desensitized; the target geographic coordinates are geographic coordinates covered by the target trajectory pattern in the set of geographic coordinates, and the target collection data is vehicle collection data in which the target geographic coordinates are parsed in the vehicle collection data set.

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

[0011] Optionally, the generating the at least one trajectory pattern of the vehicle according to the set of geographic coordinates comprises:

[0012] grouping the geographic coordinates in the set of geographic coordinates according to the analysis order of each geographic coordinate in the set of geographic coordinates, to obtain at least one group of geographic coordinates;

[0013] for each group of geographic coordinates, connecting the position points represented by the geographic coordinates in the group of geographic coordinates to form a line, and determining the line as the trajectory pattern.

[0014] Optionally, the sensitive region topological relationship comprises an R-tree generated according to the sensitive geographic coordinates in the target region.

[0015] The determining the target trajectory pattern from the trajectory patterns based on the trajectory patterns and the sensitive region topological relationship of the target region comprises:

[0016] determining the trajectory pattern having an overlapping region with a leaf node region of the R-tree as the target trajectory pattern, the leaf node region being a region corresponding to a leaf node of the R-tree.

[0017] Optionally, the determining the trajectory pattern having an overlapping region with a leaf node region of the R-tree as the target trajectory pattern comprises:

[0018] for each trajectory pattern, determining the trajectory pattern as the target trajectory pattern in response to the minimum bounding rectangle of the trajectory pattern and the minimum bounding rectangle of any leaf node of the R-tree having an overlapping region.

[0019] Optionally, the determining the trajectory pattern as the target trajectory pattern in response to the minimum bounding rectangle of the trajectory pattern and the minimum bounding rectangle of any leaf node of the R-tree having an overlapping region comprises:

[0020] if the minimum bounding rectangle of the trajectory pattern and the minimum bounding rectangle of the root node of the R-tree have an overlapping region, recursively searching the child nodes of the root node.

[0021] if the minimum bounding rectangle of the trajectory pattern and the minimum bounding rectangle of any node in the searched child nodes have an overlapping region, and the node is a leaf node, determining the trajectory pattern as the target trajectory pattern.

[0022] Optionally, the R-tree is constructed by:

[0023] obtaining a sensitive region, the sensitive region being determined based on regions of at least two sensitive geographic coordinates;

[0024] generating a minimum circumscribed rectangle of the sensitive region;

[0025] traversing the R-tree to find a minimum circumscribed rectangle of a leaf node with the largest overlapping area with the minimum circumscribed rectangle of the sensitive region;

[0026] 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 region, inserting the sensitive region into the leaf node;

[0027] if the space of the leaf node is less than the space required to accommodate the minimum circumscribed rectangle of the sensitive region, splitting the leaf node and inserting the sensitive region into the split leaf node.

[0028] Optionally, the sensitive geographic coordinates are obtained by:

[0029] obtaining encrypted sensitive geographic coordinates from a database;

[0030] decrypting the encrypted sensitive geographic coordinates.

[0031] Optionally, the method further comprises:

[0032] querying whether there is data update in the database;

[0033] in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates;

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

[0035] Optionally, the desensitization processing of the target collection data corresponding to the target geographic coordinates according to the target trajectory graphic coverage comprises:

[0036] deleting the target geographic coordinates from the target collection data.

[0037] Optionally, before the parsing of the set of geographic coordinates through which the vehicle travels in the target region from the vehicle collection data set collected by the vehicle in the target region, the desensitization method further comprises:

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

[0039] screening data packets corresponding to the target region according to data packet fragment indication information corresponding to each data packet, and performing merging processing on the screened data packets to obtain the vehicle collection data set.

[0040] Optionally, the desensitization method further comprises:

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

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

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

[0044] decrypting the transmission key;

[0045] decrypting the data packet using the decrypted transmission key.

[0046] In some embodiments, a sensitive area topological relation is generated by storing sensitive geographic coordinates that need to be desensitized, and the geographic coordinates in the vehicle collected data set are compared with the sensitive area topological relation to determine whether the geographic coordinates belong to the sensitive geographic coordinates that need to be desensitized. The sensitive area topological relation can improve the query speed, so that it can be quickly determined whether the geographic coordinates need to be desensitized, and the data processing speed is improved.

[0047] It should be understood that the foregoing general description and the following detailed description are only exemplary and explanatory, and cannot limit the present application. BRIEF DESCRIPTION OF DRAWINGS

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

[0049] Figure 1 A flow chart of one embodiment of the desensitization method of the sensitive data of the vehicle of the present application is shown.

[0050] Figure 2 A schematic diagram of one embodiment of the trajectory graph as a driving trajectory line is shown.

[0051] Figure 3 A schematic diagram of one embodiment of the trajectory graph as a geographic coordinate expansion graph is shown.

[0052] Figure 4 A schematic diagram of one embodiment of the sensitive area topological relation R-tree of the present application is shown.

[0053] Figure 5 A structural block diagram of one embodiment of the desensitization device of the sensitive data of the vehicle of the present application is shown. DETAILED DESCRIPTION

[0054] The present application provides a desensitization method and device for sensitive data of a vehicle. The desensitization method and device for sensitive data of a vehicle of the present application are described in detail below with reference to the accompanying drawings. The features in the following embodiments and implementation manners can be combined with each other without conflict.

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

[0056] Figure 1 A flowchart of one embodiment of the desensitization method 10 of sensitive data of the vehicle of the present application is shown.

[0057] As shown in the figure, the desensitization method 10 of sensitive data of the vehicle includes steps 11-14. Figure 1 As shown in the figure, the desensitization method 10 of sensitive data of the vehicle includes steps 11-14.

[0058] Step 11: From the vehicle collection data set collected by the vehicle in the target area, the geographical coordinate set through which the vehicle travels in the target area is parsed.

[0059] The target area can be any area through which the vehicle travels. The target area is the area for collecting the vehicle collection data set.

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

[0061] The geographical coordinate set is a collection of coordinates of geographic positions through which the vehicle travels in the target area. The geographical coordinate set contains the geographic coordinates of the positions through which the vehicle travels in the target area. The geographical coordinate set includes at least one geographic coordinate. The geographic coordinates in the geographical coordinate set represent the specific positions through which the vehicle travels in the target area. The geographic coordinates in the geographical coordinate set are located on the vehicle's travel route.

[0062] By parsing the vehicle collection data set, the geographical coordinate set can be obtained. Taking GPS data as an example, the GPS data packets are obtained from the vehicle collection data set. First, the GPS data packets are unpacked to obtain multiple files, each of which contains a topic (topic). The topic defines a byte code structure file (for example, the first 4 bytes represent the longitude coordinate and the last 4 bytes represent the latitude coordinate). For each file, the longitude and latitude coordinates are parsed from the data according to the topic of the file, thereby obtaining a geographic coordinate in the geographical coordinate set.

[0063] In some embodiments, before step 11, the desensitization method 10 of sensitive data of the vehicle further comprises: receiving at least one data packet sent by the vehicle; screening out data packets corresponding to the target area according to the data packet fragment indication information corresponding to each data packet, and performing merging processing on the screened out data packets to obtain the vehicle collection data set.

[0064] In some embodiments, before sending the data packet, the vehicle judges whether the file size of the data packet is greater than the file threshold value; if the data packet is smaller than the file threshold value, the data packet is directly sent; if the data packet is greater than the file threshold value, the data packet is sent in fragments; after receiving the data packet, the data packet of the received fragment is combined according to the fragment indication information contained in the data packet to obtain the vehicle collection data set.

[0065] The fragment indication information can include fragment number, total number of fragments, etc., for reassembling the data packet at the receiving end.

[0066] In the data transmission process of the vehicle, the vehicle collection 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 value is used to judge whether the size of the data packet exceeds a certain specific limit. The file threshold value can be set based on network bandwidth, storage capacity, processing speed and other factors. In some embodiments, the file threshold value is 10M.

[0068] If the size of the data packet is smaller than the preset file threshold value, 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 the data packet exceeds the file threshold value, it means that the data volume is large, and direct transmission or processing may cause pressure on network bandwidth, storage resources or processing speed. Therefore, the large data packet is split into multiple smaller fragments, each of which is smaller than the file threshold value. These fragments are transmitted one by one, and after receiving, the fragments are recombined into a complete data packet according to the original order and structure.

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

[0071] encrypting 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 comprises:

[0074] decrypting the transmission key;

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

[0076] Before the data packet is transmitted, the transmission key used to encrypt the data packet is first encrypted. In this way, the transmission key itself can be protected 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) or the like.

[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] The data packet is encrypted before being sent, and the data packet is first decrypted when it is received. In this way, the security of the data transmission process can be improved, and data leakage can be prevented.

[0079] Step 12: generating at least one trajectory pattern of the vehicle according to the set of geographic coordinates.

[0080] After the set of geographic coordinates through which the vehicle travels in the target area is parsed, a corresponding trajectory pattern is generated according to the geographic location corresponding to the geographic coordinates included in the set of geographic coordinates. The trajectory pattern can be any shape in a point, a line, or a polygon. The trajectory pattern is generated according to the set of geographic coordinates, and intuitively displays the driving path of the vehicle in the target area. If the set of geographic coordinates includes multiple geographic coordinates, the multiple geographic coordinates can be grouped, and a corresponding trajectory pattern is generated according to the geographic coordinates in each group.

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

[0082] Figure 2 The figure shows a schematic diagram of one embodiment of the trajectory pattern as a driving trajectory line. Figure 3 The figure shows a schematic diagram of one embodiment of the trajectory pattern as a geographic coordinate expansion pattern.

[0083] In Figure 2In the diagram, line 20 represents the driving trajectory, and points A, B, C, D, and E represent primary geographic coordinates. At least two primary geographic coordinates are required to derive a driving trajectory. These two primary geographic coordinates can be considered the start and end points (or any two points on the driving path) of the vehicle. By connecting the points of these primary geographic coordinates, a continuous line, the driving trajectory, is formed to show the vehicle's travel path. The driving trajectory can be a straight line or a curve.

[0084] exist Figure 3 In the diagram, polygon 30 represents the outer geographic coordinate system, and points F, G, H, and I represent the second geographic coordinate system. Extending the second geographic coordinate system according to a preset direction or rule yields the outer geographic coordinate system. This outer geographic coordinate system is used to represent the geographic area where the vehicle's trajectory is located. The second geographic coordinate system can be located either on the boundary of the outer geographic coordinate system or inside it.

[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; and performing the following processing on each geographic coordinate group: connecting the location points represented by each geographic coordinate in the geographic coordinate group to form a line, which is then determined as a trajectory graphic.

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

[0087] Grouping simplifies data processing, keeping the number of geographic coordinates within each group manageable and facilitating subsequent graph generation and analysis. Grouping also helps reduce performance issues caused by excessive data volume.

[0088] The data is grouped according to the parsing order, ensuring that each group of data has a continuous relationship in time or space. The trajectory graphs containing each group of geographic coordinates represent the vehicle's travel trajectory 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: Based on the sensitive area topology relationship between each trajectory graphic and the target area, determine the target trajectory graphic from each trajectory graphic. The sensitive area topology relationship is generated based on the sensitive geographic coordinates in the target area.

[0092] Sensitive geographic coordinates refer to the coordinates of 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 this application, sensitive geographic coordinates are stored in a database, and pre-stored sensitive geographic coordinates are obtained from the database when the desensitization method 10 of sensitive data of the vehicle of the present application is executed.

[0094] After obtaining the sensitive geographic coordinates, the sensitive areas are obtained based on the sensitive geographic coordinates. The sensitive area is generated by at least two sensitive geographic coordinates. The sensitive area can be pre-generated and stored in a database, and the sensitive area is obtained from the database when the desensitization method 10 of sensitive data of the vehicle of the present application is executed.

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

[0096] The target trajectory graph is a trajectory graph that involves sensitive geographic coordinates contained in a sensitive area. The geographic coordinates set generated by the target trajectory graph contains geographic coordinates that overlap with the sensitive geographic coordinates contained in the sensitive area.

[0097] Based on the sensitive area topological relationship of each trajectory graph and 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 acquisition data corresponding to the target geographic coordinates is desensitized. The target geographic coordinates are the geographic coordinates in the geographic coordinates set covered by the target trajectory graph, and the target acquisition data is the vehicle acquisition data in the vehicle acquisition data set that parses the target geographic coordinates.

[0099] After determining the target trajectory graph, the geographic coordinates contained in the geographic coordinates set generated by the target trajectory graph are the target geographic coordinates.

[0100] After determining the target trajectory graph, the target acquisition data is desensitized to ensure that these data will not be leaked. Desensitization can 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, the sensitive region topological relationship is generated based on the sensitive geographic coordinates stored in the sensitive region topological relationship, and the geographic coordinates in the vehicle collection dataset are compared with the sensitive region topological relationship to determine whether the geographic coordinates belong to the sensitive geographic coordinates that need to be desensitized. The sensitive region topological relationship can improve the query speed, so that it can be quickly determined whether the geographic coordinates need to be desensitized, and the data processing speed is improved.

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

[0104] Figure 4 An embodiment of the sensitive region topological relationship of the present application is shown in the schematic diagram.

[0105] The R-tree is a tree data structure for storing multi-dimensional data (such as geographic spatial data), and through the R-tree, a specific data set can be quickly located and queried, improving the data processing speed. Each leaf node of the R-tree represents a spatial region. The leaf node region refers to a region defined by the minimum bounding rectangle (MBR) of all sensitive regions composed of sensitive geographic coordinates in the leaf node of the R-tree. As shown in the figure, 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 respectively represent a spatial region, which contains a sensitive region generated based on a sensitive geographic coordinate. The spatial region represented by node S1 contains the spatial regions represented by nodes S11, S12, S13, and S14. The spatial region represented by node S2 contains the spatial regions represented by nodes S21, S22, S23, and S24.

[0106] If the trajectory graph has an overlapping region with the leaf node region, it means that the geographic coordinates covered by the trajectory graph may coincide with the sensitive geographic coordinates contained in the sensitive region covered by the leaf node, and the trajectory graph is determined as a target trajectory graph.

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

[0108] The trajectory figure is determined as a target trajectory figure in response to the existence of an overlapping area between the minimum bounding rectangle of the trajectory figure and the minimum bounding rectangle of any leaf node of the R-tree.

[0109] In determining whether the trajectory figure is a target trajectory figure, determination is made according to whether there is an overlapping area between the minimum bounding rectangle of the trajectory figure 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 figure is contained in the minimum bounding rectangle of any leaf node of the R-tree, or the boundary of the minimum bounding rectangle of the trajectory figure 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 figure is a target trajectory figure. If none of the vertices of the minimum bounding rectangle of the trajectory figure is contained in the minimum bounding rectangle of any leaf node of the R-tree, and the boundary of the minimum bounding rectangle of the trajectory figure 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 figure is not a target trajectory figure.

[0110] In some embodiments, the trajectory figure is a driving trajectory line. The minimum bounding rectangle of the trajectory figure is a minimum bounding rectangle containing the driving trajectory line, and the boundary of the minimum bounding rectangle is determined by the northernmost, southernmost, easternmost, and westernmost location points of the driving trajectory line.

[0111] In some embodiments, the trajectory figure is a geographic coordinate expansion figure. The minimum bounding rectangle of the geographic coordinate expansion figure is generated by finding the maximum and minimum values in the longitude and latitude directions by traversing all the vertices of the geographic coordinate expansion figure.

[0112] In some embodiments, the determination of the trajectory figure as a target trajectory figure in response to the existence of an overlapping area between the minimum bounding rectangle of the trajectory figure and the minimum bounding rectangle of any leaf node of the R-tree comprises:

[0113] If there is an overlapping area between the minimum bounding rectangle of the trajectory figure and the minimum bounding rectangle of the root node of the R-tree, the child nodes of the root node are recursively searched.

[0114] If there is an overlapping area between the minimum bounding rectangle of the trajectory figure and the minimum bounding rectangle of any node in the searched child nodes, and the node is a leaf node, the trajectory figure is determined as a target trajectory figure.

[0115] For example, in the case of a driving trajectory line, the minimum bounding rectangle of the driving trajectory line is determined as follows: Figure 4In the illustrated embodiment, firstly, it is determined whether the minimum bounding rectangle of the root node S1, S2 and the minimum bounding rectangle of the trajectory graph exist an overlapping area, if the minimum bounding rectangle of the root node S1, S2 and the minimum bounding rectangle of the trajectory graph exist an overlapping area, the node with larger overlapping area is taken. If the overlapping area of the root node S1 is larger, it is recursively searched whether the minimum bounding rectangle of the child nodes S11, S12, S13, S14 of the root node S1 and the minimum bounding rectangle of the trajectory graph exist an overlapping area, the child node with the largest overlapping area is taken, the sensitive geographic coordinate represented by the node and the geographic coordinate represented by the trajectory graph exist coincidence, 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 and the minimum bounding rectangle of the trajectory graph exist an overlapping area, the trajectory graph is the target trajectory graph.

[0116] In some embodiments, the R-tree is constructed by the following way:

[0117] Obtaining a sensitive region; the sensitive region is determined based on a region of at least 2 sensitive geographic coordinates;

[0118] Generating a minimum bounding rectangle of the sensitive region;

[0119] Traversing the R-tree to find the minimum bounding rectangle of the leaf node with the largest overlapping area with the minimum bounding rectangle of the sensitive region;

[0120] If the space of the leaf node is greater than or equal to the space required for accommodating the minimum bounding rectangle of the sensitive region, the sensitive region is inserted into the leaf node;

[0121] If the space of the leaf node is less than the space required for accommodating the minimum bounding rectangle of the sensitive region, the leaf node is split, and the sensitive region is inserted into the split leaf node.

[0122] The sensitive region is a region containing at least 2 sensitive geographic coordinates. The sensitive region is generated in advance and stored in the database. After obtaining the sensitive region, for each sensitive region, a minimum bounding rectangle is generated. Then in the R-tree, the node where the sensitive region should be inserted is found, that is, the minimum bounding rectangle of the leaf node with the largest overlapping area with the minimum bounding rectangle of the sensitive region. Specifically, starting from the root node N, if N is a leaf node, the sensitive region is directly inserted into node N. If N is not a leaf node, the child nodes of N are traversed to find the node F with the smallest area after adding the minimum bounding rectangle of the sensitive region (that is, after adding the minimum bounding rectangle of the sensitive region, the minimum bounding rectangle of F grows the least). If there are multiple such nodes, the node with the smallest area is selected. The node F is set as the new root node N, and the above process is repeated until a leaf node L is found.

[0123] A minimum bounding rectangle of the sensitive area is inserted into the leaf node L. Specifically, it is determined whether the leaf node L has enough space to insert the minimum bounding rectangle; if so, the minimum bounding rectangle is directly added to L; if not, L is split 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 node splitting occurs, the structure of the R-tree needs to be adjusted. Starting from the leaf node L, the minimum bounding rectangles of each parent node are recursively adjusted upwards to ensure that they still correctly enclose the minimum bounding rectangles of their child nodes. If node splitting occurs during the adjustment process, the parent nodes of the newly split nodes also need to be adjusted. If the splitting of nodes propagates upwards to the root node and causes the root node to split, a new root node needs to be created, and the two child nodes of the original root node become the children of the new root node.

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

[0126] The encrypted sensitive geographic coordinates are obtained from the database;

[0127] The encrypted sensitive geographic coordinates are decrypted.

[0128] The sensitive geographic coordinates are stored in the database after being encrypted to prevent unauthorized access and leakage. Encryption can use various encryption algorithms, such as the AES (Advanced Encryption Standard) encryption algorithm. When the sensitive geographic coordinates are needed, the sensitive geographic coordinates 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 during encryption to ensure the correctness and integrity of the data.

[0129] In some embodiments, the desensitization method 10 of the sensitive data of the vehicle of the present application further comprises:

[0130] Querying whether there is an update of the data in the database;

[0131] In response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates;

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

[0133] In some embodiments, when there is an update of the database-stored sensitive geographic coordinates, the user manually initiates reading of the updated sensitive geographic coordinates, and then updates the R-tree. In some embodiments, the sensitive geographic coordinates are queried at a fixed time, and when it is found that the sensitive geographic coordinate data is different from the original data, the R-tree is automatically regenerated according to the updated sensitive geographic coordinates.

[0134] If a new sensitive geographic coordinate is added to the database, the new coordinate needs to be inserted into the R-tree. Starting from the root node, the R-tree is traversed layer by layer downwards until a suitable leaf node is found to store the new sensitive geographic coordinate. Then, the minimum bounding rectangle of the relevant node is updated according to the newly inserted sensitive geographic coordinate. If an existing sensitive geographic coordinate is changed, the corresponding nodes in the R-tree need to be found, and the coordinate data and the minimum bounding rectangle contained in these nodes are updated. If a certain sensitive geographic coordinate is deleted from the database, the corresponding coordinate needs to be deleted from the R-tree. Adjacent nodes are merged layer by layer upwards, and the minimum bounding rectangle of the parent node is recalculated.

[0135] Figure 5 Fig. 1 shows a structural block diagram of one embodiment of the desensitization device for sensitive data of a vehicle of the present application.

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

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

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

[0139] ​The application can take the form of a computer program product accessible from a computer- readable storage medium 22 (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having a computer program code embodied therein. The computer-readable storage medium 22 includes permanent and non-permanent, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules 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, compact disc read-only memory (CD-ROM), digital versatile disc (DVD), or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible to a computing device.

Claims

1. A method for desensitizing sensitive data of a vehicle, characterized in that, The method comprises: resolving a set of geographic coordinates through which the vehicle travels in the target area from vehicle collection data collected by the vehicle in the target area; generating at least one trajectory pattern of the vehicle according to the set of geographic coordinates; determining a target trajectory pattern from each trajectory pattern based on each trajectory pattern and a sensitive area topological relationship of the target area; the sensitive area topological relationship is generated according to sensitive geographic coordinates in the target area; the sensitive area topological relationship comprises an R-tree generated according to the sensitive geographic coordinates in the target area; wherein the trajectory pattern having an overlapping area with a leaf node area of the R-tree is determined as the target trajectory pattern, and the leaf node area is a region corresponding to a leaf node of the R-tree; wherein the R-tree is constructed by the following method: obtaining a sensitive area; the sensitive area is determined based on the regions of at least two sensitive geographic coordinates; generating a minimum circumscribed rectangle of the sensitive area; traversing the R-tree to find a minimum circumscribed rectangle of a leaf node with the largest overlapping area with the minimum circumscribed rectangle of the sensitive area; 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, inserting the sensitive area into the leaf node; if the space of the leaf node is less than the space required to accommodate the minimum circumscribed rectangle of the sensitive area, splitting the leaf node and inserting the sensitive area into the split leaf node; performing desensitization processing on target collection data corresponding to target geographic coordinates covered by the target trajectory pattern according to the target geographic coordinates; the target geographic coordinates are geographic coordinates covered by the target trajectory pattern in the set of geographic coordinates, and the target collection data are vehicle collection data in which the target geographic coordinates are resolved from the vehicle collection data.

2. The method of claim 1, wherein, The trajectory pattern comprises a driving trajectory line of the vehicle and / or a geographic coordinate expansion pattern, the driving trajectory line is determined by at least two first geographic coordinates in the set of geographic coordinates, and the geographic coordinate expansion pattern is a polygon generated by extending at least two second geographic coordinates and containing the at least two second geographic coordinates.

3. The method of claim 1, wherein, The method comprises: grouping geographic coordinates in the set of geographic coordinates according to the resolution order of each geographic coordinate in the set of geographic coordinates to obtain at least one geographic coordinate group; for each geographic coordinate group, connecting position points represented by each geographic coordinate in the geographic coordinate group to form a line to determine the trajectory pattern.

4. The method of claim 1, wherein, The method comprises: for each trajectory pattern, determining the trajectory pattern as the target trajectory pattern in response to the existence of an overlapping area between the minimum circumscribed rectangle of the trajectory pattern and the minimum circumscribed rectangle of any leaf node of the R-tree.

5. The method of claim 4, wherein, The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; 6. The method of claim 1, wherein, updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; 7. The method of claim 4-6, wherein, in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; 8. The method of claim 1, wherein, in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates.

9. The method of claim 1, wherein, The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; 10. The method of claim 9, wherein, updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive geographic coordinates, reading the updated sensitive geographic coordinates; updating the R-tree according to the updated sensitive geographic coordinates. The method further comprises: querying whether the database has updated sensitive geographic coordinates; in response to the database having updated sensitive

Images