Data processing method, device and computer readable storage medium

In the LCC scene of pure perception map, the vehicle information and lane numbering information in continuous image frames are used to determine the intent lane information of the target vehicle, which solves the problem of vehicle perception limitation and jitter, and improves the accuracy of vehicle intention recognition and the accuracy of lane line association.

CN119169828BActive Publication Date: 2025-03-14ZHEJIANG GEELY HLDG GRP CO LTD +1
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
CN202411680457.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-11-22
Publication Date
2025-03-14
Estimated Expiration
2044-11-22

AI Technical Summary

Technical Problem

In the LCC scenario of purely perceptual map, the vehicle perception is limited, resulting in a short lane length, a decrease in perception accuracy with a long distance, and there is a jitter problem, resulting in a low accuracy of lane lines and vehicle intention recognition.

Method used

By acquiring vehicle information and lane numbering information in continuous image frames, determining the intent lane information of the target vehicle, using the vehicle intersection between the current frame and the future frame to bind lane information, reducing the number of lane trajectory points, reducing jitter problems, and improving the reliability of lane trajectory and the accuracy of lane line association.

Benefits of technology

It effectively improves the accuracy of vehicle intention recognition, reduces the number of lane trajectory points, reduces the jitter problem between consecutive different frames, and ensures the reliability of lane trajectory and the accuracy of lane line association.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119169828B_ABST
    Figure CN119169828B_ABST
Patent Text Reader

Abstract

The present application discloses a data processing method, device and computer-readable storage medium, the method comprising: obtaining the first vehicle information of the vehicle corresponding to the current frame and the lane number information of the corresponding lane in a preset number of continuous image frames, and obtaining the second vehicle information of the vehicle corresponding to the future frame; traversing the first vehicle information in sequence, and determining whether there is target vehicle information in the second vehicle information; if there is target vehicle information, based on the target vehicle information, obtaining the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame; based on the first bound lane information, the second bound lane information and the lane number information, determining the intended lane information. The present application can greatly reduce the number of trajectory points of the original lane trajectory points, reduce the jitter problem between consecutive frames, ensure the reliability of the lane trajectory, and thus improve the accuracy of vehicle intention recognition.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of intelligent driving technology, and in particular to a data processing method, device and computer-readable storage medium. Background Art

[0002] In the LCC (Lane Centering Control) scenario of pure perception map, due to limited vehicle perception, the length L of the lane that can be identified is short (usually 20~60 meters), and the perception accuracy will decrease as the distance from the ego increases. There may be occlusion of other vehicles during vehicle driving, making it difficult to identify a larger range of map information in a single frame scenario. When the map information is perceived through consecutive frames, due to the jitter problem between consecutive frames, when tracking the same lane, even if the lane number is the same, its information in different frames is inconsistent, resulting in low accuracy of the constructed lane line, low accuracy of lane line association in different frames, low accuracy of association between vehicles and lanes, and thus low accuracy of vehicle intention recognition.

[0003] Therefore, how to improve the accuracy of vehicle intention recognition is a problem that needs to be solved urgently. Summary of the invention

[0004] The main purpose of this application is to provide a data processing method, device and computer-readable storage medium, aiming to solve the technical problem of how to improve the accuracy of vehicle intention recognition.

[0005] To achieve the above objectives, the present application provides a data processing method, comprising:

[0006] Acquire first vehicle information of a vehicle corresponding to a current frame and lane number information of a corresponding lane in a preset number of consecutive image frames, and acquire second vehicle information of a vehicle corresponding to a future frame;

[0007] Traversing the first vehicle information in sequence, obtaining target vehicle information, and determining whether the target vehicle information exists in the second vehicle information;

[0008] If the target vehicle information exists in the second vehicle information, acquiring the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame based on the target vehicle information;

[0009] Based on the first bound lane information, the second bound lane information and the lane number information, the intended lane information of the vehicle corresponding to the target vehicle information in the future frame is determined.

[0010] Further, the determining, based on the first bound lane information, the second bound lane information and the lane number information, the intended lane information of the target vehicle corresponding to the target vehicle information in the future frame includes:

[0011] If the first bound lane information is inconsistent with the second bound lane information, determining whether the second bound lane information exists in the lane number information;

[0012] If the second bound lane information does not exist, obtaining the association relationship corresponding to each lane line in the continuous image frames;

[0013] Based on the association relationship and the second bound lane information, the intended lane information of the target vehicle in the future frame is determined.

[0014] Further, the determining the intended lane information of the target vehicle in the future frame based on the association relationship and the second bound lane information includes:

[0015] Acquire a target association relationship corresponding to the second bound lane information in the association relationship;

[0016] Based on the target association relationship, obtaining candidate lane information corresponding to the second bound lane information;

[0017] The intended lane information of the target vehicle in the future frame is determined based on the candidate lane information and the lane number information.

[0018] Further, the determining the intended lane information of the target vehicle in the future frame based on the candidate lane information and the lane number information includes:

[0019] Determine whether there is target lane information belonging to the lane number information in the candidate lane information;

[0020] If the target lane information exists in the candidate lane information, the target lane information is used as the intended lane information of the target vehicle in the future frame.

[0021] Furthermore, the data processing method further includes:

[0022] If the second bound lane information exists in the lane number information, or the first bound lane information is consistent with the second bound lane information, the first bound lane information is used as the intended lane information of the target vehicle in the future frame;

[0023] If the target lane information does not exist in the candidate lane information, the free lane is used as the intended lane information of the target vehicle in the future frame.

[0024] Furthermore, the obtaining of the association relationship corresponding to each lane line in the continuous image frames includes:

[0025] Acquire the trajectory point coordinates of the trajectory points corresponding to each lane line in a preset number of continuous image frames, and perform thinning processing on the trajectory point coordinates to obtain the first trajectory point coordinates corresponding to each lane line;

[0026] Based on the coordinates of the first trajectory point, determine a horizontal coordinate span and a vertical coordinate span, and establish a first two-dimensional grid based on the horizontal coordinate span and the vertical coordinate span;

[0027] Based on the first trajectory point coordinates, marking lane numbers of lane lines in each grid of the first two-dimensional grid;

[0028] Based on the marked first two-dimensional grid, the association relationship between each lane line is determined.

[0029] Furthermore, determining the association relationship between lane lines based on the marked first two-dimensional grid includes:

[0030] Establishing a second two-dimensional grid based on the number of numbers corresponding to the lane numbers;

[0031] Determine a first grid in which a plurality of lane numbers exist for elements of the grid in the first two-dimensional grid;

[0032] Based on the elements of the first grid, updating the elements of each grid in the second two-dimensional grid, wherein the elements of the grid in the updated second two-dimensional grid are the number of times the corresponding two lane numbers belong to the same grid in the first two-dimensional grid;

[0033] Based on the updated second two-dimensional grid, the association relationship between the lane lines is determined.

[0034] Further, the obtaining the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame includes:

[0035] Determine first bound lane information based on the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the current frame;

[0036] Determine the second bound lane information based on the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the future frame;

[0037] If the second bound lane information is a free lane, the second bound lane information is updated based on the target lane numbers corresponding to each traffic vehicle in a preset number of consecutive image frames.

[0038] In addition, to achieve the above-mentioned purpose, the present application also provides a data processing device, which includes: a memory, a processor, and a data processing program stored in the memory and executable on the processor, and the data processing program implements the steps of the aforementioned data processing method when executed by the processor.

[0039] In addition, to achieve the above-mentioned purpose, the present application also provides a computer-readable storage medium, on which a data processing program is stored, and when the data processing program is executed by a processor, the steps of the aforementioned data processing method are implemented.

[0040] The present application obtains the first vehicle information of the vehicle corresponding to the current frame and the lane number information of the corresponding lane in a preset number of continuous image frames, and obtains the second vehicle information of the vehicle corresponding to the future frame; then traverses the first vehicle information in sequence to obtain the target vehicle information, and determines whether the target vehicle information exists in the second vehicle information; then if the target vehicle information exists in the second vehicle information, based on the target vehicle information, obtains the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame; then based on the first bound lane information, the second bound lane information and the lane number information, determines the intended lane information of the vehicle corresponding to the target vehicle information in the future frame, and identifies the intention of the vehicle in the current frame through the bound lane information of the vehicle intersection between the current frame and the future frame in the continuous image frames, which can greatly reduce the number of trajectory points of the original lane trajectory points, reduce the jitter problem between consecutive frames, ensure the reliability of the lane trajectory, improve the accuracy of the association relationship between lane lines in different frames, and thus improve the accuracy of vehicle intention recognition. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] 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.

[0042] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0043] Figure 1 A schematic diagram of vehicle intention marking provided by an embodiment of the related art;

[0044] Figure 2 A schematic diagram of vehicle intention marking provided by another embodiment of the related art;

[0045] Figure 3 A flowchart of the first embodiment of the data processing method of the present application is provided;

[0046] Figure 4 This is a schematic diagram of a scenario in an embodiment of the data processing method of this application;

[0047] Figure 5 This is a schematic diagram of the data structure of a dictionary in an embodiment of the data processing method of this application;

[0048] Figure 6 This is a schematic diagram of a lane line scene in an embodiment of the data processing method of this application;

[0049] Figure 7 A schematic diagram of a first two-dimensional grid in an embodiment of a data processing method of the present application;

[0050] Figure 8 A schematic diagram of a second two-dimensional grid in an embodiment of the data processing method of the present application;

[0051] Fig. 9 A schematic diagram of a first global grid in an embodiment of a data processing method of the present application;

[0052] Fig.10 This is a schematic diagram of the module structure of the data processing device according to an embodiment of the present application.

[0053] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0054] It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0055] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0056] The main solution of the present application is: to obtain the first vehicle information of the vehicle corresponding to the current frame and the lane number information of the corresponding lane in a preset number of consecutive image frames, and to obtain the second vehicle information of the vehicle corresponding to the future frame; to traverse the first vehicle information in sequence, obtain the target vehicle information, and determine whether the target vehicle information exists in the second vehicle information; if the target vehicle information exists in the second vehicle information, then based on the target vehicle information, obtain the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame; based on the first bound lane information, the second bound lane information and the lane number information, determine the intended lane information of the vehicle corresponding to the target vehicle information in the future frame.

[0057] At present, in the LCC (Lane Centering Control) scenario of pure perception map, due to the limited vehicle perception, the lane length L that can be identified is short (usually 20~60 meters), and the perception accuracy will decrease as the distance from the ego increases. There may be occlusion of other vehicles during vehicle driving, making it difficult to identify a larger range of map information in a single frame scenario. When the map information is perceived through consecutive different frames, due to the jitter problem between consecutive different frames, when tracking the same lane, even if the lane number is the same, its information in different frames is inconsistent, resulting in low accuracy of the constructed lane line, low accuracy of lane line association in different frames, low accuracy of association between vehicles and lanes, and thus low accuracy of vehicle intention recognition.

[0058] For example, Figure 1 As shown, the visible map part at the current moment has lanes 101, 102, 201, 301, 302, and the vehicle agent is in lane 101 at the current moment (because the agent is closest to 101); the visible map part of the map 3 seconds after the current moment is: lanes 102, 103, 202, 203, 302, 303, and the agent is in lane 103 3 seconds after the current moment; the visible map part of the map 6 seconds after the current moment is: lanes 103, 104, 203, 303, 304, and the agent is in lane 203 6 seconds after the current moment.

[0059] Among them, 101, 102, 103, and 104 belong to the same lane sequence (recorded as lane sequence 1); 201, 202, and 203 belong to the same lane sequence (recorded as lane sequence 2); and 301, 302, 303, and 304 belong to the same lane sequence (recorded as lane sequence 3).

[0060] At the current moment, the agent's intended lane in 3 seconds is marked as 102, because only 101, 102, 202, 203, 302, and 303 are visible at the current moment, and the intended lane in 3 seconds is 103, which is not visible at the current moment. Therefore, the currently visible and frontmost lane in the same lane sequence as 103 is taken as the true predicted intention in 3 seconds (this time it is lane 102).

[0061] Similarly, the agent's intended lane after 6 seconds is marked as 201, because only 101, 102, 202, 203, 302, and 303 are visible at the current moment, and the intended lane after 6 seconds is 203, which is not visible at the current moment. Therefore, the currently visible and frontmost lane in the same lane sequence as 203 is taken as the true predicted intention for 6 seconds (this time it is lane 201).

[0062] In the LCC (pure perception map) scenario, due to the limited perception distance, the map range is small in a single frame, many agents are outside the map, and there is no actual lane to bind. Moreover, the lane numbers given at different times are the same, but the actual trajectory point sequences are different.

[0063] like Figure 2 As shown: At the current moment, the visible map parts are: lanes 101, 201, and 301. Vehicle 1 (agent1) is on lane 101, vehicles 2 (agent2) and 4 (agent4) are outside the bound lanes, and vehicle 3 (agent3) is on lane 201.

[0064] 3 seconds after the current moment, the visible map part is: lanes 101, 201, and 301. Although the lane encoding is the same as the current moment, the actual trajectory sequence is different. Vehicle 1 (agent1) is on lane 101, vehicle 2 (agent2) is outside the bound lane, and vehicle 3 (agent3) is on lane 301.

[0065] 6 seconds after the current moment, the visible map part is: lanes 102, 201, and 302. Some lane codes continue to use the lane numbers used previously, and some are newly set lane codes. Even if the lane codes are the same as the current moment, their actual trajectory sequences are different. The newly set vehicles 102 and 302 are in lane sequence 1 and lane sequence 3 respectively. Vehicles 1 and 2 are outside the bound lanes, and vehicle 3 is in lane 302.

[0066] Therefore, how to improve the accuracy of vehicle intention recognition is a problem that needs to be solved urgently.

[0067] The present application identifies the intention of the vehicle in the current frame by binding lane information of the vehicle intersection between the current frame and the future frame in continuous image frames, which can greatly reduce the number of trajectory points of the original lane trajectory points, reduce the jitter problem between consecutive frames, ensure the reliability of the lane trajectory, and improve the accuracy of the correlation between lane lines in different frames, thereby improving the accuracy of vehicle intention recognition.

[0068] It should be noted that the execution subject of this embodiment may be a data processing device, or a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or a data processing device capable of realizing the above functions, etc., and this embodiment does not specifically limit this. The following takes the data processing device as the execution subject as an example to illustrate this embodiment and the following embodiments.

[0069] Based on this, this application proposes a data processing method of the first embodiment, please refer to Figure 3 , the data processing method includes steps S410~S440:

[0070] Step S410, obtaining first vehicle information of a vehicle corresponding to a current frame and lane number information of a corresponding lane in a preset number of continuous image frames, and obtaining second vehicle information of a vehicle corresponding to a future frame;

[0071] In this embodiment, a data stream of images taken by the vehicle before the current moment may be acquired in chronological order, the data stream including a preset number of continuous image frames, the preset number may be 1000, and the interval between frames in the continuous image frames may be 0.1s.

[0072] After obtaining a preset number of continuous image frames, it is necessary to first construct lane lines, associate lane lines of different frames, and associate vehicles with lanes. Specifically, in a feasible implementation, the data processing method further includes steps S310 to S340:

[0073] Step S310, based on the association relationship corresponding to each lane line in a preset number of continuous image frames, the lane lines are merged to obtain global lane lines, wherein the global lane lines include merged lane lines and lane lines without an association relationship;

[0074] Step S320, establishing a first global grid based on the global trajectory point coordinates corresponding to the global lane line, and marking the global lane number corresponding to the global lane line in each grid of the first global grid;

[0075] Step S330, determining a target grid corresponding to each traffic vehicle in the first global grid based on the vehicle coordinates of the traffic vehicle in each image frame;

[0076] Step S340: determining the target lane number corresponding to each traffic vehicle based on the target grid.

[0077] In this embodiment, a data stream of images taken by the vehicle before the current moment may be acquired in chronological order, the data stream including a preset number of continuous image frames, the preset number may be 1000, and the interval between frames in the continuous image frames may be 0.1s.

[0078] After obtaining a preset number of continuous image frames, the association relationship corresponding to each lane line in the preset number of continuous image frames is obtained. In a feasible implementation, step S310 may include steps S210 to S240:

[0079] Step S210, obtaining the trajectory point coordinates of the trajectory points corresponding to each lane line in a preset number of continuous image frames, and performing a thinning process on the trajectory point coordinates to obtain the first trajectory point coordinates corresponding to each lane line;

[0080] Step S220, determining a horizontal coordinate span and a vertical coordinate span based on the coordinates of the first trajectory point, and establishing a first two-dimensional grid based on the horizontal coordinate span and the vertical coordinate span;

[0081] Step S230, marking the lane number of the lane line in each grid of the first two-dimensional grid based on the coordinates of the first trajectory point;

[0082] Step S240: determining the association relationship between lane lines based on the marked first two-dimensional grid.

[0083] In this embodiment, the trajectory point coordinates of the trajectory points corresponding to each lane line in a preset number of continuous image frames are obtained, and the trajectory point coordinates are thinned to obtain the first trajectory point coordinates corresponding to each lane line. In a feasible implementation, step S210 may include steps S110 to S140:

[0084] Step S110, generating a dictionary based on lane lines in a preset number of consecutive image frames, wherein the dictionary includes lane numbers of lane lines and track point coordinates of track points on the lane lines;

[0085] Step S120, determining the coordinates of the third track points corresponding to the lane lines of each lane number based on the dictionary;

[0086] Step S130, establishing two-dimensional grids corresponding to each lane line based on a preset grid spacing and the coordinates of the third trajectory point;

[0087] Step S140: performing thinning processing on the third trajectory point coordinates of each lane line based on the two-dimensional grid to obtain the first trajectory point coordinates corresponding to each lane line.

[0088] In this embodiment, a dictionary lane_dict can be initialized in advance. The key value of the dictionary is the lane number laneid that has appeared in consecutive image frames. The value of the dictionary is the data information of the lane corresponding to the key spliced ​​between different frames. It can be a list list, which is used to store the trajectory point sequence of the lane line corresponding to the key.

[0089] Next, based on the lane number of the lane line within the preset area corresponding to the vehicle in the image frame, the trajectory point coordinates are added to the dictionary. Specifically, for the target image frame in each image frame, the target lane line within the preset area corresponding to the vehicle in the target image frame is determined; the trajectory point coordinates of the trajectory point on the target lane line are obtained; and the trajectory point coordinates of the trajectory point on the target lane line are added to the end of the list corresponding to the lane number of the target lane line in the dictionary.

[0090] In this embodiment, for the target image frame in each image frame, the target lane line in the preset area corresponding to the vehicle in the target image frame is determined. Specifically, the lane line in the target image frame and the preset area corresponding to the vehicle in the target image frame can be identified by a recognition algorithm in the relevant technology, and then the target lane line in the preset area corresponding to the vehicle in the target image frame is determined, such as Figure 4 As shown, Figure 4 Where v is the driving direction of the vehicle (ego vehicle), the line segment with an arrow is the lane line, the dotted box is the preset area, the lane line in the dotted box is the target lane line, including lane line 1 (lane1), lane line 2 (lane2), lane line 3 (lane3) and lane line 4 (lane4), the trajectory points on lane line 1 (lane1) include trajectory point 1 (point1), trajectory point 2 (point2), trajectory point 3 (point3), where the preset area can be the area between α meters directly behind the vehicle and β meters directly in front of the vehicle, for example, α=5, β=20.

[0091] Next, obtain the trajectory point coordinates of the target lane line, such as Figure 4 As shown in , point1, point2, and point3 are the track point coordinates of the track points on lane line lane1. After obtaining the track point coordinates of the track point on the target lane line, add the track point coordinates of the track point on the target lane line to the end of the list corresponding to the lane number of the target lane line in the dictionary, such as Figure 5As shown in the figure, taking lane 1 (lane1) as an example, the value of lane 1 in the dictionary includes track point 1 (point1), track point 2 (point2), track point 3 (point3) in image frame 1 (frame1), track point 4 (point4), track point 5 (point5) in image frame 2 (frame2), track point M (pointM), track point M+1 (pointM+1), track point M+2 (pointM+2) in image frame M (frameM), etc.

[0092] It should be noted that the coordinates of the trajectory points are all coordinates in the vehicle coordinate system, and the lane line can be the lane center line, lane boundary line, road edge, etc.

[0093] In this embodiment, after adding the trajectory point coordinates corresponding to all image frames in the continuous image frames to the dictionary, the third trajectory point coordinates corresponding to the lane lines of each lane number are determined based on the dictionary. For example, for the lane line lane1, its third trajectory point coordinates include point1, point2, point3, point4, point5…pointM, pointM+1, pointM+2…pointN.

[0094] In this embodiment, after obtaining the third trajectory point coordinates corresponding to the lane lines of each lane number, the preset grid spacing is obtained, and based on the preset grid spacing and the third trajectory point coordinates, the two-dimensional grids corresponding to each lane line are established respectively. Specifically, for the lane line of each lane number, the maximum value of the horizontal coordinate, the minimum value of the horizontal coordinate, the maximum value of the vertical coordinate and the minimum value of the vertical coordinate are obtained in all the third trajectory point coordinates of the lane line, and based on the maximum value of the horizontal coordinate, the minimum value of the horizontal coordinate, the maximum value of the vertical coordinate, the minimum value of the vertical coordinate and the preset grid spacing, the two-dimensional grid corresponding to the lane line is established, wherein the preset grid spacing may be 1m*1m, and the basic unit of 1m*1m is a grid of the two-dimensional grid, and the elements of the grid are initialized to a first preset value, which may be 0, and the second preset value may be 1.

[0095] In a feasible implementation, step S130 may include steps S131-S132:

[0096] Step S131, obtaining the maximum value of the horizontal coordinate, the minimum value of the horizontal coordinate, the maximum value of the vertical coordinate, and the minimum value of the vertical coordinate corresponding to each lane line in the third trajectory point coordinates corresponding to each lane line;

[0097] Step S132, based on the maximum value of the horizontal coordinate, the minimum value of the horizontal coordinate, the maximum value of the vertical coordinate, the minimum value of the vertical coordinate and the preset grid spacing, respectively establish a two-dimensional grid corresponding to each lane line.

[0098] In this embodiment, after obtaining the third trajectory point coordinates corresponding to the lane lines of each lane number, the maximum horizontal coordinate, minimum horizontal coordinate, maximum vertical coordinate and minimum vertical coordinate corresponding to each lane line are obtained in the third trajectory point coordinates corresponding to each lane line. For each lane line with a lane number, horizontal coordinate comparison and vertical coordinate comparison are performed respectively in all the third trajectory point coordinates of the lane line to obtain the maximum horizontal coordinate, minimum horizontal coordinate, maximum vertical coordinate and minimum vertical coordinate corresponding to the lane line.

[0099] Next, the preset grid spacing is obtained, and based on the maximum value of the horizontal coordinate, the minimum value of the horizontal coordinate, the maximum value of the vertical coordinate, the minimum value of the vertical coordinate and the preset grid spacing, the two-dimensional grids corresponding to each lane line are established respectively, wherein the preset grid spacing can be 1m*1m, and the basic unit of 1m*1m is a grid of the two-dimensional grid, and the elements of the grid are initialized to a first preset value, which can be 0, and the second preset value can be 1.

[0100] Specifically, for each lane line with a lane number, a two-dimensional grid corresponding to the lane line is established based on the maximum value of the horizontal coordinate, the minimum value of the horizontal coordinate, the maximum value of the vertical coordinate, the minimum value of the vertical coordinate and the preset grid spacing of the lane line, wherein the horizontal spacing of the two-dimensional grid is the spacing between the maximum value of the horizontal coordinate and the minimum value of the horizontal coordinate, and the vertical spacing of the two-dimensional grid is the spacing between the maximum value of the vertical coordinate and the minimum value of the vertical coordinate, so that the grid row index and the grid column index of each grid in the two-dimensional grid are both integers, so as to facilitate the thinning of the trajectory points through the two-dimensional grid.

[0101] In this embodiment, after establishing a two-dimensional grid, the third trajectory point coordinates of each lane line are thinned out based on the two-dimensional grid to obtain the first trajectory point coordinates corresponding to each lane line. Specifically, for each lane line with a lane number, one trajectory point coordinate is obtained in turn from all the third trajectory point coordinates of the lane line, and the obtained trajectory point coordinates are projected to the two-dimensional grid to obtain a grid corresponding to the obtained trajectory point coordinates. If an element of the grid is a first preset value, the obtained trajectory point coordinate is retained, that is, the obtained trajectory point coordinate is added to the first trajectory point coordinates corresponding to the lane line, and the elements of the grid are set to the second preset value; if the elements of the grid are the second preset value, the obtained trajectory point coordinate is discarded to achieve screening of the trajectory points of the lane line.

[0102] In a feasible implementation, step S140 may include steps S141 to S143:

[0103] Step S141, based on the coordinates of the third track points corresponding to each lane line, determining the horizontal coordinate spacing and the vertical coordinate spacing between two adjacent track points corresponding to each lane line;

[0104] Step S142, based on the preset spacing, the horizontal coordinate spacing and the vertical coordinate spacing, the third track point coordinates corresponding to each lane line are screened to obtain the fourth track point coordinates corresponding to each lane line;

[0105] Step S143: performing thinning processing on the fourth trajectory point coordinates of each lane line based on the two-dimensional grid to obtain the first trajectory point coordinates corresponding to each lane line.

[0106] In this embodiment, after establishing a two-dimensional grid, based on the third trajectory point coordinates corresponding to each lane line, the horizontal coordinate spacing and the vertical coordinate spacing between two adjacent trajectory points corresponding to each lane line are determined. Specifically, for each lane line with a lane number, in all the third trajectory point coordinates of the lane line, the trajectory point coordinates of two adjacent trajectory points are obtained in turn, and based on the horizontal coordinates and the vertical coordinates in the trajectory point coordinates of the two adjacent trajectory points, the corresponding horizontal coordinate spacing and vertical coordinate spacing are calculated respectively, wherein the horizontal coordinate spacing is the absolute value of the difference between the horizontal coordinates of the two adjacent trajectory points, and the vertical coordinate spacing is the absolute value of the difference between the vertical coordinates of the two adjacent trajectory points, and finally the horizontal coordinate spacing and the vertical coordinate spacing of all two adjacent trajectory points in the third trajectory point coordinates of the lane line are obtained.

[0107] After obtaining the horizontal coordinate spacing and the vertical coordinate spacing, the third trajectory point coordinates corresponding to each lane line are screened based on the preset spacing, the horizontal coordinate spacing and the vertical coordinate spacing to obtain the fourth trajectory point coordinates corresponding to each lane line. Specifically, for each lane line with a lane number, the horizontal coordinate spacing and the vertical coordinate spacing of each group of two adjacent trajectory points are compared with the preset spacing to determine whether there are two adjacent trajectory points of the lane line whose horizontal coordinate spacing is less than the preset spacing and whose vertical coordinate spacing is less than the preset spacing. If so, the latter trajectory point of the two adjacent trajectory points is discarded, wherein the front-to-back order of the two adjacent trajectory points is the order of the coordinates of the two trajectory points in the third trajectory point coordinates.

[0108] After obtaining the fourth trajectory point coordinates, the fourth trajectory point coordinates of each lane line are thinned out based on the two-dimensional grid to obtain the first trajectory point coordinates corresponding to each lane line. Specifically, for each lane line with a lane number, one trajectory point coordinate is obtained in turn from all the fourth trajectory point coordinates of the lane line, and the obtained trajectory point coordinates are projected onto the two-dimensional grid to obtain a grid corresponding to the obtained trajectory point coordinates. If an element of the grid is a first preset value, the obtained trajectory point coordinates are retained, that is, the obtained trajectory point coordinates are added to the first trajectory point coordinates corresponding to the lane line, and the elements of the grid are set to the second preset values; if the elements of the grid are the second preset values, the obtained trajectory point coordinates are discarded to achieve screening of the trajectory points of the lane line.

[0109] In a feasible implementation, step S143 may include steps S1431 to S1434:

[0110] Step S1431, rounding down the coordinates of the fourth track point to obtain the coordinates of the fifth track point corresponding to each lane line;

[0111] Step S1432, performing thinning processing on the fifth track point coordinates of each lane line based on the two-dimensional grid to obtain the sixth track point coordinates corresponding to each lane line;

[0112] Step S1433, rounding the coordinates of the sixth track point to obtain the coordinates of the seventh track point corresponding to each lane line;

[0113] Step S1434: thinning the coordinates of the seventh trajectory point of each lane line based on the two-dimensional grid to obtain the coordinates of the first trajectory point corresponding to each lane line.

[0114] In this embodiment, after obtaining the fourth trajectory point coordinates, the fourth trajectory point coordinates are rounded down to obtain the corresponding fifth trajectory point coordinates of each lane line. For example, the coordinate 1.1 is rounded down to 1, and the coordinate 1.9 is rounded down to 1. By rounding down, the coordinates of each fourth trajectory point are converted into integer fifth trajectory point coordinates, and then the horizontal coordinate and the vertical coordinate of the fifth trajectory point coordinate can be used as the grid row and grid column indexes in the two-dimensional grid, respectively.

[0115] After obtaining the coordinates of the fifth track point, the coordinates of the fifth track point of each lane line are thinned out based on the two-dimensional grid to obtain the coordinates of the sixth track point corresponding to each lane line. Specifically, in a feasible implementation, step S1432 may include steps a1 to a3:

[0116] Step a1, for each first target lane line in the lane lines, traverse the coordinates of the fifth track point of the first target lane line in sequence to obtain the first coordinates;

[0117] Step a2, determining a third grid corresponding to the first coordinate in the two-dimensional grid, and obtaining a first grid element of the third grid;

[0118] Step a3, if the first grid element is the first preset value, then the trajectory point coordinates corresponding to the first coordinates in the fourth trajectory point coordinates are added to the sixth trajectory point coordinates corresponding to the first target lane line, and the first grid element is set to the second preset value until the traversal of each fifth trajectory point coordinate is completed.

[0119] In this embodiment, for each first target lane line in the lane lines, the fifth track point coordinates of the first target lane line are traversed in sequence to obtain the first coordinate (the fifth track point coordinate currently traversed), and the traversal is performed in sequence according to the order of the fifth track point coordinates in the target lane lines. The third grid corresponding to the first coordinate is determined in the two-dimensional grid, that is, the grid row and grid column indexes of the third grid are consistent with the two coordinate values ​​of the first coordinate, the grid row index is the horizontal coordinate of the first coordinate, and the grid column index is the vertical coordinate of the first coordinate, the first grid element of the third grid is obtained, and it is determined whether the first grid element is the first preset value.

[0120] If the first grid element is the first preset value, the trajectory point coordinate corresponding to the first coordinate in the fourth trajectory point coordinate is added to the sixth trajectory point coordinate corresponding to the first target lane line, and the first grid element is set to the second preset value to add the trajectory point coordinate before rounding down to the corresponding sixth trajectory point coordinate; if the first grid element is the second preset value, the first coordinate is discarded; until the traversal of each fifth trajectory point coordinate is completed, all the sixth trajectory point coordinates of the target lane line are obtained.

[0121] In this embodiment, after obtaining the coordinates of the sixth trajectory point, the coordinates of the sixth trajectory point are rounded to obtain the coordinates of the seventh trajectory point corresponding to each lane line; for example, the coordinate 1.4 is rounded to 1, and the coordinate 1.9 is rounded to 2. By rounding, the coordinates of each sixth trajectory point are converted into integer coordinates of the seventh trajectory point, and then the horizontal coordinate and the vertical coordinate of the seventh trajectory point coordinate can be used as the grid row and grid column indexes in the two-dimensional grid, respectively.

[0122] After obtaining the coordinates of the seventh track point, the coordinates of the seventh track point of each lane line are thinned out based on the two-dimensional grid to obtain the coordinates of the first track point corresponding to each lane line. Specifically, in a feasible implementation, step S1434 may include steps b1 to b4:

[0123] Step b1, setting the elements of each grid in the two-dimensional grid to a first preset value;

[0124] Step b2, for each second target lane line in the lane line, traverse the coordinates of the seventh track point of the second target lane line in sequence to obtain the second coordinates;

[0125] Step b3, determining a fourth grid corresponding to the second coordinate in the two-dimensional grid, and obtaining a second grid element of the fourth grid;

[0126] Step b4, if the second grid element is the first preset value, then the trajectory point coordinates corresponding to the second coordinates in the sixth trajectory point coordinates are added to the first trajectory point coordinates corresponding to the second target lane line, and the second grid element is set to the second preset value until the traversal of each seventh trajectory point coordinate is completed.

[0127] In this embodiment, after the coordinates of the seventh trajectory point are acquired, the elements of each grid in the two-dimensional grid are set to the first preset value, that is, the elements of each grid in the two-dimensional grid are reset to the first preset value.

[0128] Next, for each second target lane line in the lane line, the seventh track point coordinates of the second target lane line are traversed in sequence to obtain the second coordinate (the seventh track point coordinate currently traversed), and the traversal is performed in sequence according to the order of the seventh track point coordinates in the target lane line, and the fourth grid corresponding to the second coordinate is determined in the two-dimensional grid, that is, the grid row and grid column indexes of the fourth grid are consistent with the two coordinate values ​​of the second coordinate, the grid row index is the horizontal coordinate of the second coordinate, and the grid column index is the vertical coordinate of the second coordinate, the second grid element of the fourth grid is obtained, and it is determined whether the second grid element is the first preset value.

[0129] If the second grid element is the first preset value, the trajectory point coordinate corresponding to the second coordinate in the sixth trajectory point coordinate is added to the first trajectory point coordinate corresponding to the second target lane line, and the second grid element is set to the second preset value, so as to add the trajectory point coordinate before rounding to the corresponding first trajectory point coordinate; if the first grid element is the second preset value, the first coordinate is discarded; until the traversal of each seventh trajectory point coordinate is completed, all the first trajectory point coordinates of the target lane line are obtained, such as Figure 6 As shown, Figure 6 This is the sequence of trajectory points of the lane line after two thinning processes. By performing two thinning processes on the coordinates of the trajectory points of the lane line, the number of trajectory points of each lane line is reduced, and the jitter problem between the trajectory points in the lane line is reduced.

[0130] In this embodiment, after the fourth trajectory point coordinates of all lane lines are processed by the processing method of this embodiment, the first trajectory point coordinates corresponding to each lane line can be obtained.

[0131] In this embodiment, after obtaining the first track point coordinates corresponding to each lane line, the horizontal coordinate span and the vertical coordinate span are determined based on the first track point coordinates. Specifically, the maximum horizontal coordinate, the minimum horizontal coordinate, the maximum vertical coordinate and the minimum vertical coordinate can be determined in the first track point coordinates corresponding to each lane line, that is, the maximum horizontal coordinate is the maximum value of all horizontal coordinates in the first track point coordinates, the minimum horizontal coordinate is the minimum value of all horizontal coordinates in the first track point coordinates, the maximum vertical coordinate is the maximum value of all vertical coordinates in the first track point coordinates, and the minimum vertical coordinate is the maximum value of all vertical coordinates in the first track point coordinates. minimum value; then, determine the horizontal coordinate span based on the maximum horizontal coordinate and the minimum horizontal coordinate, and determine the vertical coordinate span based on the maximum vertical coordinate and the minimum vertical coordinate, wherein the horizontal coordinate span can be determined according to the result of rounding up the difference between the maximum horizontal coordinate and the minimum horizontal coordinate, and the vertical coordinate span can be determined according to the result of rounding up the difference between the maximum vertical coordinate and the minimum vertical coordinate, or, first round the maximum horizontal coordinate and the minimum horizontal coordinate, determine the horizontal coordinate span based on the difference of the rounding results, round the maximum horizontal coordinate and the minimum horizontal coordinate, and determine the vertical coordinate span based on the difference of the rounding results.

[0132] After obtaining the horizontal coordinate span and the vertical coordinate span, a first two-dimensional grid is established based on the horizontal coordinate span and the vertical coordinate span. Specifically, a preset grid spacing can be obtained, and the first two-dimensional grid is established based on the preset grid spacing, the horizontal coordinate span and the vertical coordinate span, wherein n is the horizontal coordinate span, m is the vertical coordinate span, the first two-dimensional grid is a grid of m rows and n columns, and the length and width of each grid in the first two-dimensional grid are both the preset grid spacing.

[0133] The horizontal distance of the first two-dimensional grid is the horizontal coordinate span, and the vertical distance is the vertical coordinate span. The length and width of each grid in the first two-dimensional grid are both preset grid spacings.

[0134] In a feasible implementation, step S220 may include steps S221 to S223:

[0135] Step S221, determining the maximum horizontal coordinate, the minimum horizontal coordinate, the maximum vertical coordinate and the minimum vertical coordinate in the first track point coordinates corresponding to each lane line;

[0136] Step S222, determining the horizontal coordinate span based on the maximum horizontal coordinate and the minimum horizontal coordinate, and determining the vertical coordinate span based on the maximum vertical coordinate and the minimum vertical coordinate;

[0137] Step S223: establishing a first two-dimensional grid based on the preset grid spacing, the horizontal coordinate span, and the vertical coordinate span.

[0138] In this embodiment, after obtaining the first trajectory point coordinates corresponding to each lane line, the maximum horizontal coordinate, the minimum horizontal coordinate, the maximum vertical coordinate and the minimum vertical coordinate are determined in the first trajectory point coordinates corresponding to each lane line, that is, the horizontal coordinates of each trajectory point in the first trajectory point coordinates are compared to obtain the maximum horizontal coordinate and the minimum horizontal coordinate, and the vertical coordinates of each trajectory point in the first trajectory point coordinates are compared to obtain the maximum vertical coordinate and the minimum vertical coordinate.

[0139] Next, the horizontal coordinate span is determined based on the maximum horizontal coordinate and the minimum horizontal coordinate, and the vertical coordinate span is determined based on the maximum vertical coordinate and the minimum vertical coordinate; in a feasible implementation, step S222 may include steps S2221 to S2225:

[0140] Step S2221, respectively rounding down and rounding off the maximum horizontal coordinate, and taking the maximum value of the rounding results as the target maximum horizontal coordinate;

[0141] Step S2222, respectively rounding down and rounding the minimum horizontal coordinate, and taking the minimum value of the rounding results as the target minimum horizontal coordinate;

[0142] Step S2223, respectively rounding down and rounding off the maximum vertical coordinate, and taking the maximum value of the rounding results as the target maximum vertical coordinate;

[0143] Step S2224, respectively rounding down and rounding the minimum vertical coordinate, and taking the minimum value of the rounding results as the target minimum vertical coordinate;

[0144] Step S2225, determining the horizontal coordinate span based on the target maximum horizontal coordinate and the target minimum horizontal coordinate, and determining the vertical coordinate span based on the target maximum vertical coordinate and the target minimum vertical coordinate.

[0145] In this embodiment, the maximum horizontal coordinate is rounded down and rounded up to obtain two rounding results of the maximum horizontal coordinate, and the maximum value of the rounding results is used as the target maximum horizontal coordinate. If the two rounding results are equal, the target maximum horizontal coordinate is any one of the two rounding results.

[0146] The minimum horizontal coordinate is rounded down and rounded up respectively to obtain two rounding results of the minimum horizontal coordinate, and the minimum value of the rounding results is used as the target minimum horizontal coordinate. If the two rounding results are equal, the target minimum horizontal coordinate is any one of the two rounding results.

[0147] The maximum vertical coordinate is rounded down and rounded to obtain two rounding results of the maximum vertical coordinate, and the maximum value of the rounding results is used as the target maximum vertical coordinate. If the two rounding results are equal, the target maximum vertical coordinate is any one of the two rounding results.

[0148] The minimum vertical coordinate is rounded down and rounded to obtain two rounding results of the minimum vertical coordinate, and the minimum value of the rounding results is used as the target minimum vertical coordinate. If the two rounding results are equal, the target minimum vertical coordinate is any one of the two rounding results.

[0149] After obtaining the maximum horizontal coordinate and the minimum horizontal coordinate of the target, the horizontal coordinate span is determined based on the maximum horizontal coordinate and the minimum horizontal coordinate of the target, and the vertical coordinate span is determined based on the maximum vertical coordinate and the minimum vertical coordinate of the target. The formulas for the horizontal coordinate span and the vertical coordinate span are:

[0150] m=max(round(y_global_max),int(y_global_max))- min(round(y_global_min), int(y_global_min)) + 1;

[0151] n=max(round(x_global_max), int(x_global_max)) - min(round(x_global_min), int(x_global_min)) + 1;

[0152] Among them, n is the horizontal coordinate span, m is the vertical coordinate span, x_global_max is the maximum horizontal coordinate in the coordinates of the first track point, x_global_min is the minimum horizontal coordinate in the coordinates of the first track point, y_global_max is the maximum vertical coordinate in the coordinates of the first track point, y_global_min is the minimum vertical coordinate in the coordinates of the first track point, round(x) means rounding x to the nearest integer, int(x) means rounding x down, max(x, y) means taking the larger value of x and y, min(x, y) means taking the smaller value of x and y.

[0153] After obtaining the horizontal coordinate span and the vertical coordinate span, a first two-dimensional grid is established based on the preset grid spacing, the horizontal coordinate span and the vertical coordinate span, wherein the first two-dimensional grid is a grid of m rows and n columns, and the length and width of each grid in the first two-dimensional grid are both the preset grid spacing.

[0154] In this embodiment, after the first two-dimensional grid is established, the lane number of the lane line is marked in each grid of the first two-dimensional grid based on the coordinates of the first trajectory point. Specifically, the coordinates of each first trajectory point may be rounded first, and the trajectory point index of the corresponding trajectory point may be determined according to the rounded coordinates. According to the trajectory point index of each trajectory point, the lane number of each lane line is marked in each grid of the first two-dimensional grid, that is, for a grid where there is no lane number corresponding to the current trajectory point, the lane code corresponding to the trajectory point having the same trajectory point index and grid index (grid row index and grid column index) is marked in the grid, such as Figure 7 In a feasible implementation, step S230 may include steps S231 to S233:

[0155] Step S231, performing rounding processing on the coordinates of each first trajectory point to obtain the coordinates of the second trajectory point;

[0156] Step S232, determining the trajectory point index of each trajectory point corresponding to the first trajectory point coordinate based on the second trajectory point coordinate;

[0157] Step S233: based on the index of each trajectory point, marking the lane number of each lane line in each grid of the first two-dimensional grid.

[0158] In this embodiment, after establishing the first two-dimensional grid, the coordinates of each first trajectory point are rounded to obtain the coordinates of the second trajectory point, and based on the second trajectory point coordinates, the trajectory point index of each trajectory point corresponding to the first trajectory point coordinate is determined. Specifically, the formula of the trajectory point index is:

[0159] index_x = int(x) - int(x_global_min);

[0160] index_y = int(y) - int(y_global_min);

[0161] or

[0162] index_x = round(x) - int(x_global_min);

[0163] index_y = round(y) - int(y_global_min);

[0164] Among them, round(x) means rounding x to the nearest integer, int(x) means rounding x to the nearest integer, x_global_min means the minimum value of the horizontal coordinate in the coordinates of the first trajectory point, y_global_min means the minimum value of the vertical coordinate in the coordinates of the first trajectory point, and (index_x, index_y) is the index of the trajectory point corresponding to the coordinates (x, y).

[0165] After obtaining the track point index, the lane number of each lane line is marked on each grid of the first two-dimensional grid based on each track point index, that is, for a grid where there is no lane number corresponding to the current track point, the lane code corresponding to the track point with the same track point index and grid index (grid row index and grid column index) is marked on the grid, as shown. In a feasible implementation, step S233 may include steps S2331~S2333:

[0166] Step S2331, for each target trajectory point index in the trajectory point index, obtaining the target lane number of the lane line to which the trajectory point corresponding to the target trajectory point index belongs;

[0167] Step S2332, determining a third grid corresponding to the target trajectory point index in the first two-dimensional grid;

[0168] Step S2333: If the target lane number does not exist in the elements of the third grid, add the target lane number to the elements of the third grid.

[0169] In this embodiment, for each target trajectory point index in the trajectory point index, the target lane number of the lane line to which the trajectory point corresponding to the target trajectory point index belongs is obtained, and a third grid corresponding to the target trajectory point index is determined in the first two-dimensional grid, that is, the grid row index of the third grid is the same as the index_x of the target trajectory point index, and the grid column index is the same as the index_y of the target trajectory point index.

[0170] After obtaining the third grid, determine whether the target lane number exists in the elements of the third grid. If the target lane number does not exist in the elements of the third grid, add the target lane number to the elements of the third grid, thereby achieving the addition of the lane number to the elements of the grid in the first two-dimensional grid.

[0171] In this embodiment, after obtaining the marked first two-dimensional grid, the association relationship between each lane line is determined based on the marked first two-dimensional grid. Specifically, a first grid with multiple lane numbers in each grid of the first two-dimensional grid can be obtained, and the association relationship between each lane line is determined according to the lane number in the first grid. In a feasible implementation, step S240 may include steps S241 to S244:

[0172] Step S241, establishing a second two-dimensional grid based on the number of lane numbers corresponding to the lane numbers;

[0173] Step S242, determining a first grid in which a grid element in the first two-dimensional grid has multiple lane numbers;

[0174] Step S243, based on the elements of the first grid, updating the elements of each grid in the second two-dimensional grid, wherein the elements of the grid in the updated second two-dimensional grid are the number of times the corresponding two lane numbers belong to the same grid in the first two-dimensional grid;

[0175] Step S244: determining the association relationship between lane lines based on the updated second two-dimensional grid.

[0176] In this embodiment, after obtaining the marked first two-dimensional grid, a second two-dimensional grid is established based on the number of numbers corresponding to the lane numbers; for example, the number of numbers corresponding to the lane numbers (the number of lanes in the global map) is L, and 1, 2, ...L are respectively used as indexes of L lanes to establish a second two-dimensional grid of L*L with L rows and L columns, and the initial value of the elements of each grid in the second two-dimensional grid is 0.

[0177] After the second two-dimensional grid is established, the first grid in which the elements of the grid in the first two-dimensional grid have multiple lane numbers is obtained. Specifically, the number of elements in each grid in the first two-dimensional grid is counted. If the number of elements corresponding to a certain grid is greater than 1, it is determined that the elements of the grid have multiple lane numbers, and the grid is the first grid. Figure 7 As shown, Figure 7 In the figure, the grid jointly occupied by lane 2 (lane2) and lane 3 (lane3), the grid jointly occupied by lane 1 (lane1) and lane 2 (lane2), the grid jointly occupied by lane 1, lane 2 and lane 3, and the two grids jointly occupied by lane 6 (lane6) and lane 5 (lane5) are all first grids.

[0178] After determining the first grid in the first two-dimensional grid, based on the elements of the first grid, update the elements of each grid in the second two-dimensional grid to obtain an updated second two-dimensional grid. Specifically, for each grid in the first grid, extract the elements of the grid, combine the lane numbers laneid in the extracted elements in pairs, use each combination as a position index of a second two-dimensional grid, and add 1 to the element of the grid corresponding to the position index in the second two-dimensional grid. For example, if the elements of a grid in the first grid are the list [2,7,9], then after pairwise combination, obtain the combinations [2,7], [2,9], [7,9], add 1 to the element of the grid with index [2,7] in the second two-dimensional grid with [2,7] as the position index of the second two-dimensional grid, add 1 to the element of the grid with index [2,9] in the second two-dimensional grid with [2,9] as the position index of the second two-dimensional grid, and add 1 to the element of the grid with index [7,9] in the second two-dimensional grid with [7,9] as the position index of the second two-dimensional grid.

[0179] like Figure 8 As shown, Figure 8 What is shown is the updated second two-dimensional grid. Since the relationship between two different lanes satisfies the commutative law, that is, the relationship between lane 1 (lane1) and lane 2 (lane2) is the same as the relationship between lane 2 and lane 1, that is, the updated second two-dimensional grid is symmetrical about the main diagonal line, so only the upper right corner of the second two-dimensional grid needs to be considered.

[0180] Then, based on the updated second two-dimensional grid, the association relationship between the lane lines is determined. In a feasible implementation, step S244 may include steps S2441 to S2443:

[0181] Step S2441, for the target lane number in each lane number, obtaining the first element of each second grid corresponding to the same row of each target lane number in the updated second two-dimensional grid;

[0182] Step S2442, determining a second element in the first element that is greater than a preset threshold;

[0183] Step S2443: Determine an association relationship list corresponding to the target lane number based on the lane number of the second grid corresponding to the second element.

[0184] In this embodiment, after obtaining the updated second two-dimensional grid, for the target lane number in each lane number, the first element of each second grid corresponding to the same row of each target lane number is obtained in the updated second two-dimensional grid, such as Figure 8As shown, for a lane line with an index (lane number) of 1, the first element may include an element of a grid with a row index of 1 and a column index of 2, 3, ..., L-1, L in the second two-dimensional grid.

[0185] After obtaining the first elements, each first element is compared with a preset threshold to determine a second element in the first elements that is greater than the preset threshold. The preset threshold can be reasonably set, for example, the preset threshold can be 5.

[0186] After obtaining the second element, based on the lane number of the second grid corresponding to the second element, determine the association relationship list corresponding to the target lane number. For example, for the lane line with index 1, establish a list lane_list_1 containing lane lines with index 1, extract lanes with indexes 2, 3, ..., L respectively, and if the number of corresponding elements in the updated second two-dimensional grid is greater than the preset threshold, add this lane to lane_list_1. In this way, a lane sequence related to lane line lane with index 1, that is, the association relationship list of lane line lane1, can be obtained, such as Figure 8 As shown, when the preset threshold is 5, lane_list_1 is [1, L], and lane_list_2 is [2, 3, L-1], thereby realizing the association relationship between each lane line through the association relationship list.

[0187] In a feasible implementation, after step S2443, the lane association method may further include steps S2444 to S2445:

[0188] Step S2444, determining whether there are multiple association relationship lists to be merged that have the same lane number in the association relationship lists corresponding to the lane numbers;

[0189] Step S2445: If there are association relationship lists to be merged, the association relationship lists to be merged with the same lane number are merged to obtain a target association relationship list.

[0190] In this embodiment, after obtaining the association relationship lists corresponding to each lane number, it is determined whether there are multiple association relationship lists to be merged with the same lane number in the association relationship lists corresponding to each lane number. For example, if association relationship list 1 is [2, 4, 6, 8] and association relationship list 2 is [4, 7, 9], then association relationship list 1 and association relationship list 2 are the association relationship lists to be merged.

[0191] If there are association lists to be merged, the association lists to be merged with the same lane number are merged to obtain the target association list. For example, association list 1 is [2, 4, 6, 8] and association list 2 is [4, 7, 9], then the merged target association list is [2, 4, 6, 7, 8, 9]. The final association list includes the lists in the association list except the association list to be merged and the target association list. By merging the association lists, the accuracy of the association lists can be further improved.

[0192] In this embodiment, after obtaining the association relationship corresponding to each lane line in a preset number of continuous image frames, the lane lines are merged based on the association relationship. For example, when the association relationship between each lane line is represented by an association relationship list, the trajectory points of each lane line in each association relationship list are merged to obtain the merged lane line. For example, for the association relationship list [1415, 1359, 1513], where 1415, 1359 and 1513 represent the lane numbers laneids of the lanes, where the lane trajectory point sequence with laneid 1415 is [point1, pont2, point3, point4], the lane trajectory point sequence with laneid 1359 is [point11, pont12, point13, point14, point15, point16], and the lane trajectory point sequence with laneid 1513 is [point21, pont22, point23]. The trajectory point sequence of the merged lane line is [point1, pont2, point3, point4, point11, pont12, point13, point14, point15, point16, point21, pont22, point23], and the lane trajectory point sequence can be represented by laneid 1415.

[0193] Afterwards, the merged lane lines and the lane lines that have no associated relationship (lane lines that have not been merged) are used as global lane lines.

[0194] In this embodiment, after obtaining the global lane line, the global trajectory point coordinates corresponding to the global lane line are obtained, and a first global grid is established based on the global trajectory point coordinates. In a feasible implementation, step S320 may include steps S321 to S323:

[0195] Step S321, performing a thinning process on the trajectory point coordinates of the global lane line to obtain the global trajectory point coordinates of each global lane line;

[0196] Step S322, determining a global horizontal coordinate span and a global vertical coordinate span based on the global trajectory point coordinates;

[0197] Step S323: establishing a first global grid based on the preset grid spacing, the global horizontal coordinate span, and the global vertical coordinate span.

[0198] In this embodiment, after obtaining the global lane line, the global trajectory point coordinates corresponding to the global lane line are obtained. Specifically, the trajectory point coordinates of the global lane line are obtained first. If the global lane line is a merged lane line, the trajectory point coordinates of the global lane line include the trajectory point coordinates of all lane lines in the corresponding association relationship list. Then, the trajectory point coordinates of the global lane line are thinned to obtain the global trajectory point coordinates of each global lane line.

[0199] In a feasible implementation, step S321 may include steps S3211 to S3215:

[0200] Step S3211, based on the preset grid spacing and the coordinates of the trajectory points of the global lane lines, respectively establish a second global grid corresponding to each global lane line;

[0201] Step S3212, rounding down the trajectory point coordinates of the global lane line to obtain the first global trajectory point coordinates corresponding to each global lane line;

[0202] Step S3213, performing thinning processing on the first global trajectory point coordinates of each global lane line based on the second global grid to obtain the second global trajectory point coordinates corresponding to each global lane line;

[0203] Step S3214, rounding the second global trajectory point coordinates to obtain third global trajectory point coordinates corresponding to each global lane line;

[0204] Step S3215: reset the elements of each grid in the second global grid, and perform thinning processing on the third global trajectory point coordinates of each global lane line based on the second global grid to obtain the global trajectory point coordinates corresponding to each global lane line.

[0205] In this embodiment, after the trajectory point coordinates of the global lane line are obtained, a second global grid corresponding to each global lane line is established based on the preset grid spacing and the trajectory point coordinates of the global lane line. Specifically, in the trajectory point coordinates of each global lane line, the global horizontal coordinate maximum value, the global horizontal coordinate minimum value, the global vertical coordinate maximum value and the global vertical coordinate minimum value corresponding to each global lane line are obtained. That is, for each global lane line, in the trajectory point coordinates of the global lane line, horizontal coordinate comparison and vertical coordinate comparison are performed respectively to obtain the global horizontal coordinate maximum value, the global horizontal coordinate minimum value, the global vertical coordinate maximum value and the global vertical coordinate minimum value corresponding to the global lane line.

[0206] Next, the preset grid spacing is obtained, and based on the preset grid spacing, the global maximum value of the horizontal coordinate, the global minimum value of the horizontal coordinate, the global maximum value of the vertical coordinate and the global minimum value of the vertical coordinate, the second global grid corresponding to each global lane line is established respectively, wherein the preset grid spacing may be 1m*1m, and a basic unit of 1m*1m is a grid of the second global grid, and the elements of the grid are initialized to a first preset value, which may be 0, and the second preset value may be 1.

[0207] Specifically, for each global lane line, a second global grid corresponding to the lane line is established based on the global horizontal coordinate maximum value, global horizontal coordinate minimum value, global vertical coordinate maximum value, global vertical coordinate minimum value and preset grid spacing of the global lane line, wherein the horizontal spacing of the second global grid is the spacing between the global horizontal coordinate maximum value and the global horizontal coordinate minimum value, and the vertical spacing of the second global grid is the spacing between the global vertical coordinate maximum value and the global vertical coordinate minimum value, so that the grid row index and grid column index of each grid in the two-dimensional grid are both integers, so as to facilitate the thinning of trajectory points through the two-dimensional grid.

[0208] After establishing the second global grid, the trajectory point coordinates of the global lane line are rounded down to obtain the first global trajectory point coordinates corresponding to each global lane line; and based on the second global grid, the first global trajectory point coordinates of each global lane line are thinned out to obtain the second global trajectory point coordinates corresponding to each global lane line. In a feasible implementation, step S3213 may include steps c1 to c3:

[0209] Step c1, for each target global lane line in the global lane lines, traverse the first global trajectory point coordinates of the target global lane line in sequence to obtain the target coordinates;

[0210] Step c2, based on the second global grid, obtaining the target element of the grid corresponding to the target coordinates;

[0211] Step c3, if the target element is the first preset value, the trajectory point coordinates corresponding to the target coordinates in the trajectory point coordinates of the target global lane line are added to the second global trajectory point coordinates corresponding to the target global lane line until the traversal of each first global trajectory point coordinate is completed.

[0212] In this embodiment, after obtaining the first global trajectory point coordinates, for each target global lane line in the global lane line, the first global trajectory point coordinates of the target global lane line are traversed in sequence to obtain the target coordinates, specifically, traversing in sequence according to the order of the first global trajectory point coordinates in the target lane line.

[0213] Next, based on the second global grid, the target element of the grid corresponding to the target coordinates is obtained. Specifically, the grid corresponding to the target coordinates is determined in the second global grid, that is, the grid row and grid column indexes of the grid corresponding to the target coordinates are consistent with the two coordinate values ​​of the target coordinates, the target element of the grid corresponding to the target coordinates is obtained, and it is determined whether the target element is a first preset value.

[0214] If the target element is the second preset value, the target coordinates are discarded; if the target element is the first preset value, the trajectory point coordinates corresponding to the target coordinates in the trajectory point coordinates of the target global lane line are added to the second global trajectory point coordinates corresponding to the target global lane line, that is, the trajectory point coordinates before rounding down corresponding to the target coordinates are added to the corresponding second global trajectory point coordinates, and the target element is set to the second preset value; until the traversal of each first global trajectory point coordinate is completed.

[0215] In this embodiment, the second global trajectory point coordinates are rounded to obtain the third global trajectory point coordinates corresponding to each global lane line. Then, the elements of each grid in the second global grid are reset, and the third global trajectory point coordinates of each global lane line are thinned based on the second global grid to obtain the global trajectory point coordinates corresponding to each global lane line. Among them, the thinning process of the third global trajectory point coordinates is similar to that of the first global trajectory point coordinates, which will not be repeated here. For each global lane line, its global trajectory point coordinates are the second global trajectory point coordinates corresponding to the third global trajectory point coordinates after the thinning process, that is, the global trajectory point coordinates are the trajectory point coordinates before rounding.

[0216] After obtaining the global trajectory point coordinates of each global lane line, the global horizontal coordinate span and the global vertical coordinate span are determined based on the global trajectory point coordinates. In a feasible implementation, step S322 may include steps S3221 to S3226:

[0217] Step S3221, determining the maximum global horizontal coordinate, the minimum global horizontal coordinate, the maximum global vertical coordinate and the minimum global vertical coordinate in the global trajectory point coordinates;

[0218] Step S3222, respectively rounding down and rounding off the maximum global horizontal coordinate, and taking the maximum value of the rounding results as the target maximum global horizontal coordinate;

[0219] Step S3223, respectively rounding down and rounding the minimum global horizontal coordinate, and taking the minimum value of the rounding results as the target minimum global horizontal coordinate;

[0220] Step S3224, respectively rounding down and rounding the maximum global ordinate, and taking the maximum value of the rounding results as the target maximum global ordinate;

[0221] Step S3225, respectively rounding down and rounding the minimum global ordinate, and taking the minimum value of the rounding results as the target minimum global ordinate;

[0222] Step S3226: determining the global horizontal coordinate span based on the target maximum global horizontal coordinate and the target minimum global horizontal coordinate, and determining the global vertical coordinate span based on the target maximum global vertical coordinate and the target minimum global vertical coordinate.

[0223] In this embodiment, the global abscissa and the global ordinate of each global trajectory point in the global trajectory point coordinates are compared respectively to determine the maximum global abscissa, the minimum global abscissa, the maximum global ordinate and the minimum global ordinate.

[0224] Next, the maximum global horizontal coordinate is rounded down and rounded up to obtain two rounding results of the maximum global horizontal coordinate, and the maximum value of the rounding results is used as the target maximum global horizontal coordinate. If the two rounding results are equal, the target maximum global horizontal coordinate is any one of the two rounding results.

[0225] The minimum global horizontal coordinate is rounded down and rounded up respectively to obtain two rounding results of the minimum global horizontal coordinate, and the minimum value of the rounding results is used as the target minimum global horizontal coordinate. If the two rounding results are equal, the target minimum global horizontal coordinate is any one of the two rounding results.

[0226] The maximum global ordinate is rounded down and rounded to obtain two rounding results of the maximum global ordinate, and the maximum value of the rounding results is used as the target maximum global ordinate. If the two rounding results are equal, the target maximum global ordinate is any one of the two rounding results.

[0227] The minimum global ordinate is rounded down and rounded to obtain two rounding results of the minimum global ordinate, and the minimum value of the rounding results is used as the target minimum global ordinate. If the two rounding results are equal, the target minimum global ordinate is any one of the two rounding results.

[0228] Then, the global horizontal coordinate span is determined based on the target maximum global horizontal coordinate and the target minimum global horizontal coordinate, and the global vertical coordinate span is determined based on the target maximum global vertical coordinate and the target minimum global vertical coordinate. The formulas of the global horizontal coordinate span and the global vertical coordinate span are:

[0229] m=max(round(y_global_max),int(y_global_max))- min(round(y_global_min), int(y_global_min)) + 1;

[0230] n=max(round(x_global_max), int(x_global_max)) - min(round(x_global_min), int(x_global_min)) + 1;

[0231] Among them, n is the global horizontal coordinate span, m is the global vertical coordinate span, x_global_max is the maximum global horizontal coordinate in the global trajectory point coordinates, x_global_min is the minimum global horizontal coordinate in the global trajectory point coordinates, y_global_max is the maximum global vertical coordinate in the global trajectory point coordinates, y_global_min is the minimum global vertical coordinate in the global trajectory point coordinates, round(x) means rounding x to the nearest integer, int(x) means rounding x down, max(x, y) means taking the larger value of x and y, and min(x, y) means taking the smaller value of x and y.

[0232] After obtaining the global horizontal coordinate span and the global vertical coordinate span, a first global grid is established based on the preset grid spacing, the global horizontal coordinate span and the global vertical coordinate span, wherein the first global grid is a grid of m rows and n columns, and the length and width of each grid in the first global grid are both the preset grid spacing.

[0233] Next, the global lane number corresponding to the global lane line is marked in each grid of the first global grid. Specifically, each global trajectory point coordinate is rounded to obtain a fourth global trajectory point coordinate, and the global trajectory point index corresponding to each global trajectory point coordinate is determined based on the fourth global trajectory point coordinate; based on each global trajectory point index, the global lane number corresponding to the global lane line is marked in each grid of the first global grid.

[0234] Specifically, the formula for the global trajectory point index is:

[0235] index_x = int(x) - int(x_global_min);

[0236] index_y = int(y) - int(y_global_min);

[0237] or

[0238] index_x = round(x) - int(x_global_min);

[0239] index_y = round(y) - int(y_global_min);

[0240] Among them, round(x) means rounding x to the nearest integer, int(x) means rounding x downward, x_global_min means the minimum value of the horizontal coordinate in the global trajectory point coordinates, y_global_min means the minimum value of the vertical coordinate in the global trajectory point coordinates, (index_x, index_y) is the global trajectory point index corresponding to the global trajectory point coordinates (x, y).

[0241] After obtaining the global trajectory point index, the global lane number corresponding to the global lane line is marked in each grid of the first global grid based on each global trajectory point index. That is, for a grid where there is no global lane number corresponding to the current global trajectory point, the global lane code corresponding to the global trajectory point with the same global trajectory point index and global grid index (global grid row index and global grid column index) is marked in the grid.

[0242] Specifically, for each target global trajectory point index in the global trajectory point index, obtain the global lane number of the global lane line to which the global trajectory point corresponding to the target global trajectory point index belongs, and determine the grid corresponding to the target global trajectory point index in the first global grid; the row index of the grid corresponding to the target global trajectory point index is the same as the index_x of the target global trajectory point index, and the column index of the grid corresponding to the target global trajectory point index is the same as the index_y of the target global trajectory point index. If the global lane number corresponding to the target global trajectory point index does not exist in the element of the grid corresponding to the target global trajectory point index, then add the global lane number corresponding to the target global trajectory point index to the element of the grid corresponding to the target global trajectory point index.

[0243] It should be noted that if the global lane number corresponding to the target global trajectory point index exists in the element of the grid corresponding to the target global trajectory point index, the global lane number is not added to the grid corresponding to the target global trajectory point index to avoid duplication of the global lane number in the element.

[0244] In this embodiment, after marking the global lane number in the first global grid, based on the vehicle coordinates of the traffic vehicles in each image frame, the target grid corresponding to each traffic vehicle is determined in the first global grid. In a feasible implementation, step S330 may include steps S331 to S333:

[0245] Step S331, rounding the vehicle coordinates of each traffic vehicle to obtain rounded vehicle coordinates;

[0246] Step S332, determining the vehicle index corresponding to each traffic vehicle based on the rounded vehicle coordinates;

[0247] Step S333: determining a target grid corresponding to each traffic vehicle in the first global grid based on the vehicle index.

[0248] In this embodiment, after marking the global lane number in the first global grid, the vehicle coordinates of the traffic vehicles contained in each frame of a preset number of continuous image frames are obtained, the vehicle coordinates of each traffic vehicle obtained are rounded to obtain the rounded vehicle coordinates, and the vehicle index corresponding to each traffic vehicle is determined based on the rounded vehicle coordinates, wherein the formula of the vehicle index is:

[0249] index_x = int(obj_x) - int(x_global_min);

[0250] index_y = int(obj_y) - int(y_global_min);

[0251] Among them, int(x) means rounding down x, x_global_min means the minimum value of the horizontal coordinate in the global trajectory point coordinates, y_global_min means the minimum value of the vertical coordinate in the global trajectory point coordinates, and (index_x, index_y) is the vehicle index corresponding to the vehicle coordinates (obj_x, obj_y).

[0252] After obtaining the vehicle index, the target grid corresponding to each traffic vehicle is determined in the first global grid based on the vehicle index. Specifically, for each traffic vehicle, the grid whose global grid index is the vehicle index is queried in the first global grid as the target grid of the traffic vehicle. The global row index of the target grid is index_x in the vehicle index, and the global column index of the target grid is index_y in the vehicle index.

[0253] In this embodiment, after the target grid is determined, the target lane number corresponding to each vehicle is determined based on the target grid. Specifically, for each vehicle, the element of the target grid corresponding to the vehicle is obtained, and the target lane number corresponding to the vehicle is determined based on the global lane number in the element. For example, the element is a list, and the list includes the global lane number.

[0254] In a feasible implementation, step S340 may include steps S341 to S344:

[0255] Step S341, determining whether there is a first target grid whose element is a non-global lane number in the target grid;

[0256] Step S342: if the first target grid exists, determining multiple lane line segments corresponding to each global lane line based on a preset sliding window;

[0257] Step S343, based on the vehicle coordinates, determining the distances between the first traffic vehicle corresponding to the first target grid and each lane segment, and obtaining the minimum distance among the distances;

[0258] Step S344: If the minimum distance is less than a preset distance, the global lane number of the global lane line corresponding to the minimum distance is used as the first target lane number corresponding to the first traffic vehicle.

[0259] In this embodiment, after determining the target grid, elements of each target grid are obtained, and based on the elements of the target grid, it is determined whether there is a first target grid in the target grid whose elements are non-global lane numbers. For example, when establishing the first global grid, the elements of the grids in the first global grid are initialized to a first preset value of 0, then it is determined whether there is a first target grid in the target grid whose elements are the first preset value of 0.

[0260] If there is a first target grid, multiple lane segments corresponding to each global lane line are determined based on a preset sliding window. For example, taking the global lane line lane1 as an example, lane1 is a trajectory point sequence composed of several global trajectory points including point1, point2, point3, ..., pointN. Each point on lane1 can be taken one by one by sliding the window. For the trajectory point point_i, the previous point point_i-1 is taken, and point_i and point_i-1 constitute a lane segment, or the first two points point_i-1 are taken, and point_i, point_i-1, and point_i-2 constitute a lane segment to obtain multiple lane segments of the global lane line lane1. The same processing is performed on each global lane line to finally obtain multiple lane segments of each global lane line.

[0261] After obtaining multiple lane segments of each global lane line, the distance between the first traffic vehicle and each lane segment is calculated according to the vehicle coordinates and the global trajectory point coordinates contained in the lane segment, and all the obtained distances are compared to obtain the minimum distance among all the distances.

[0262] In this embodiment, after the minimum distance is obtained, it is determined whether the minimum distance is less than the preset distance. If the minimum distance is less than the preset distance, the global lane number of the global lane line corresponding to the minimum distance is used as the first target lane number corresponding to the first traffic vehicle. Specifically, the global lane line to which the lane line segment corresponding to the minimum distance belongs is obtained, and the global lane number of the global lane line is used as the first target lane number to associate the first traffic vehicle with the global lane line closest to it, establish a binding relationship between the first traffic vehicle and the lane, and improve the accuracy of the association between the vehicle and the lane.

[0263] Among them, the preset distance can be reasonably set. If the minimum distance is greater than or equal to the preset distance, it is considered that the first traffic vehicle has no lane, and the binding lane of the first traffic vehicle is determined to be a free lane.

[0264] In a feasible implementation manner, step S340 may further include steps S345-S346:

[0265] Step S345, obtaining a second target grid whose elements in the target grid are global lane numbers;

[0266] Step S346: Determine a second target lane number of the second target grid corresponding to the second traffic vehicle based on the global lane number of the second target grid.

[0267] In this embodiment, after determining the target grid, the elements of each target grid are obtained, and based on the elements of the target grid, it is determined whether there is a second target grid in the target grid whose elements are global lane numbers. For example, when establishing the first global grid, the elements of the grid in the first global grid are initialized to a first preset value of 0. When marking the global lane number corresponding to the global lane line in the grid, the elements of the grid are updated to the corresponding global lane number, and then it is determined whether there is a second target grid in the target grid whose elements are non-zero.

[0268] When there is a second target grid, a second target grid whose element in the target grid is a global lane number is obtained, and based on the global lane number of the second target grid, a second target lane number corresponding to the second traffic vehicle of the second target grid is determined.

[0269] Specifically, for each grid in the second target grid, if the element of the grid is a global lane number, the global lane number is used as the second target lane number corresponding to the second traffic vehicle of the grid; if the element of the grid is multiple global lane numbers, the first global lane number among the multiple global lane numbers can be used as the second target lane number corresponding to the second traffic vehicle, or any one of the multiple global lane numbers can be used as the second target lane number corresponding to the second traffic vehicle.

[0270] This embodiment can accurately determine the target lane number of the traffic vehicle through the global lane number in the element of the second target grid, so as to accurately establish the binding relationship between the traffic vehicle and the lane, thereby improving the accuracy of the association between the vehicle and the lane.

[0271] In a feasible implementation manner, after step S341, steps d1 to d5 may also be included:

[0272] Step d1, if there is a first target grid whose element is a non-global lane number in the target grid, a third target grid is determined in the first global grid based on a preset number of grids and the first target grid;

[0273] Step d2, obtaining the target global lane number in each element of the third target grid;

[0274] Step d3, determining multiple lane line segments of the global lane line corresponding to each target global lane number based on a preset sliding window;

[0275] Step d4, determining the distance between the first traffic vehicle and each lane segment based on the vehicle coordinates of the first traffic vehicle, and obtaining the minimum distance among the distances;

[0276] Step d5: If the minimum distance is less than a preset distance, the global lane number of the global lane line corresponding to the minimum distance is used as the first target lane number.

[0277] In this embodiment, after determining the target grid, elements of each target grid are obtained, and based on the elements of the target grid, it is determined whether there is a first target grid in the target grid whose elements are non-global lane numbers. For example, when establishing the first global grid, the elements of the grids in the first global grid are initialized to a first preset value of 0, then it is determined whether there is a first target grid in the target grid whose elements are the first preset value of 0.

[0278] If there is a first target grid whose element is a non-global lane number in the target grid, a third target grid is determined in the first global grid based on the preset number of grids and the first target grid. Specifically, a grid separated from the first target grid by the preset number of grids is first determined in the first global grid, and a grid in an area enclosed by the grid separated by the preset number of grids is used as the third target grid; Fig. 9 As shown, the first target grid is the grid corresponding to the traffic vehicle agent, and the third target grid includes the first target grid and grids with a preset number of grids around the first target grid. If the preset number of grids is 1, the third target grid includes the first target grid and the grids in the 25-grid area formed by the surrounding 24 grids. If the preset number of grids is 0, the third target grid includes the first target grid and the grids in the 9-grid area formed by the surrounding 8 grids.

[0279] In this embodiment, after the third target grid is obtained, the target global lane number in the elements of each third target grid is obtained. Specifically, the elements of each third target grid are obtained, and the target global lane number is determined based on the global lane number in the lane number list corresponding to the obtained element.

[0280] After obtaining the target global lane number, multiple lane segments of the global lane line corresponding to each target global lane number are determined based on a preset sliding window. For example, taking the global lane line of the target global lane number lane1 as an example, lane1 is a trajectory point sequence composed of a number of global trajectory points including point1, point2, point3, ..., pointN. Each point on lane1 can be taken one by one using the sliding window. For the trajectory point point_i, the previous point point_i-1 is taken, and point_i and point_i-1 constitute a lane segment, or the first two points point_i-1 are taken, and point_i, point_i-1, and point_i-2 constitute a lane segment to obtain multiple lane segments of the global lane line lane1. The same processing is performed on the global lane line corresponding to each target global lane number, and finally multiple lane segments of the global lane line corresponding to each target global lane number are obtained.

[0281] After obtaining multiple lane segments corresponding to the global lane line of each target global lane number, the distance between the first traffic vehicle and each lane segment is calculated according to the vehicle coordinates and the global trajectory point coordinates contained in the lane segment, and all the obtained distances are compared to obtain the minimum distance among all distances.

[0282] In this embodiment, after the minimum distance is obtained, it is determined whether the minimum distance is less than the preset distance. If the minimum distance is less than the preset distance, the target global lane number corresponding to the minimum distance is used as the first target lane number corresponding to the first traffic vehicle. Specifically, the global lane line to which the lane line segment corresponding to the minimum distance belongs is obtained, and the target global lane number of the global lane line is used as the first target lane number, so as to associate the first traffic vehicle with the global lane line closest to it, establish a binding relationship between the first traffic vehicle and the lane, and improve the accuracy of the association between the vehicle and the lane.

[0283] Among them, the preset distance can be reasonably set. If the minimum distance is greater than or equal to the preset distance, it is considered that the first traffic vehicle has no lane, and the binding lane of the first traffic vehicle is determined to be a free lane.

[0284] It should be noted that the lane binding information includes the target lane number corresponding to the traffic vehicle and the free lane, that is, when the vehicle's lane binding is a free lane, the lane binding information is the free lane information, and the first target lane number corresponding to the first traffic vehicle is the lane binding information of the first traffic vehicle.

[0285] In this embodiment, after the above-mentioned processing is performed on a preset number of continuous image frames, a current frame is selected from the preset number of continuous image frames and a future frame is determined, wherein the future frame may be an image frame corresponding to the current frame in the future 3 / 6S, and the current frame may be any future frame in the continuous image frames. Then, first vehicle information of a vehicle corresponding to the current frame and lane number information of a corresponding lane in the preset number of continuous image frames are obtained, and second vehicle information of a vehicle corresponding to the future frame is obtained. The first vehicle information may be vehicle information (such as license plate information) of all traffic vehicles in the current frame, the second vehicle information may be vehicle information of all traffic vehicles in the future frame, and the lane number information may be information of all lane lines in the current frame. Specifically, the first vehicle information and lane number information may be obtained through identification information corresponding to the current frame, and the second vehicle information may be obtained through identification information of the future frame.

[0286] Step S420, traversing the first vehicle information in sequence, obtaining target vehicle information, and determining whether the target vehicle information exists in the second vehicle information;

[0287] In this embodiment, after obtaining the first vehicle information and the second vehicle information, the first vehicle information is traversed in sequence to obtain the currently traversed target vehicle information, and it is determined whether the target vehicle information exists in the second vehicle information, that is, whether the traffic vehicle corresponding to the target vehicle information appears in the future frame.

[0288] Step S430: if the target vehicle information exists in the second vehicle information, acquiring the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame based on the target vehicle information;

[0289] In this embodiment, if the target vehicle information exists in the second vehicle information, that is, the traffic vehicle corresponding to the target vehicle information exists in the future frame, then based on the target vehicle information, the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame are obtained.

[0290] Specifically, for the current frame, the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the current frame is calculated. If the minimum value in the projection distance is less than or equal to the preset distance value (for example, 3 meters), the lane code of the lane line corresponding to the minimum value is used as the first bound lane information; for the future frame, the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the future frame is calculated. If the minimum value in the projection distance is less than or equal to the preset distance value (for example, 3 meters), the lane code of the lane line corresponding to the minimum value is used as the second bound lane information. The first bound lane information and the second bound lane information are both lane numbers.

[0291] It should be noted that if the minimum value corresponding to the current frame is greater than the preset distance value, the first bound lane information is determined to be a free lane with a value of -1; if the minimum value corresponding to the future frame is greater than the preset distance value, the second bound lane information is determined to be a free lane with a value of -1. The calculation method of the lane-bound information of other traffic vehicles in the current frame and the future frame is similar to the calculation method of the first bound lane information; in other image frames in the continuous image frames except the current frame and the future frame, the calculation method of the lane-bound information of each traffic vehicle is similar to the calculation method of the first bound lane information, which will not be repeated here.

[0292] Step S440: Determine the intended lane information of the vehicle corresponding to the target vehicle information in the future frame based on the first bound lane information, the second bound lane information and the lane number information.

[0293] In this embodiment, after obtaining the first bound lane information and the second bound lane information, the intended lane information of the vehicle corresponding to the target vehicle information in the future frame is determined based on the first bound lane information, the second bound lane information and the lane number information. Specifically, first determine whether the first bound lane information is consistent with the second bound lane information. If the first bound lane information is inconsistent with the second bound lane information, obtain the association relationship corresponding to each lane line in the continuous image frame; based on the association relationship and the second bound lane information, determine the intended lane information of the target vehicle in the future frame.

[0294] In a feasible implementation, step S440 may include steps S441 to S443:

[0295] Step S441: if the first bound lane information is inconsistent with the second bound lane information, determining whether the second bound lane information exists in the lane number information;

[0296] Step S442: if the second bound lane information does not exist, obtaining the association relationship corresponding to each lane line in the continuous image frames;

[0297] Step S443: Determine the intended lane information of the target vehicle in the future frame based on the association relationship and the second bound lane information.

[0298] In this embodiment, after obtaining the first bound lane information and the second bound lane information, it is determined whether the first bound lane information is consistent with the second bound lane information. If the first bound lane information is inconsistent with the second bound lane information, it is determined whether the second bound lane information exists in the lane number information, that is, it is determined whether the lane number corresponding to the second bound lane information exists in the lane number information.

[0299] If the lane number information does not contain the second bound lane information, the association relationship corresponding to each lane line in the continuous image frames is obtained; wherein the association relationship corresponding to each lane line in the continuous image frames is the association relationship between each lane line obtained in step S240.

[0300] In this embodiment, after obtaining the association relationship corresponding to each lane line, the intended lane information of the target vehicle in the future frame is determined based on the association relationship and the second bound lane information, so as to accurately determine the intention of the vehicle in the future frame according to the association relationship, thereby improving the accuracy of vehicle intention recognition.

[0301] In a feasible implementation, step S443 may include steps S4431 to S4433:

[0302] Step S4431, obtaining a target association relationship corresponding to the second bound lane information in the association relationship;

[0303] Step S4432: based on the target association relationship, obtaining candidate lane information corresponding to the second bound lane information;

[0304] Step S4433: Determine the intended lane information of the target vehicle in the future frame based on the candidate lane information and the lane number information.

[0305] In this embodiment, after the association relationship corresponding to each lane line is obtained, the target association relationship corresponding to the second bound lane information is obtained in the association relationship, and the target association relationship is the association relationship including the second bound lane information.

[0306] After obtaining the target association relationship, the candidate lane information corresponding to the second bound lane information is obtained based on the target association relationship. For example, the second bound lane information is 1212, and the association relationship is [1212, 1245, 1468], that is, the associated lanes are 1245 and 1468, and the candidate lane information is [1245, 1468].

[0307] After the candidate lane information is obtained, the intended lane information of the target vehicle in the future frame is determined based on the candidate lane information and the lane number information. In a feasible implementation, step S4433 may include steps e1 to e2:

[0308] Step e1, determining whether there is target lane information belonging to the lane number information in the candidate lane information;

[0309] Step e2: If the target lane information exists in the candidate lane information, the target lane information is used as the intended lane information of the target vehicle in the future frame.

[0310] In this embodiment, after the candidate lane information is obtained, it is determined whether there is target lane information belonging to the lane number information in the candidate lane information, that is, it is determined whether there is an intersection between the candidate lane information and the lane number information. If there is an intersection, the intersection is the target lane information.

[0311] If the target lane information exists in the candidate lane information, the target lane information is used as the intended lane information of the target vehicle in the future frame, so as to accurately determine the intention of the vehicle in the future frame according to the candidate lane information in the association relationship, thereby improving the accuracy of vehicle intention recognition.

[0312] In a feasible implementation, the data processing method may include steps f1 to f2:

[0313] Step f1: if the second bound lane information exists in the lane number information, or the first bound lane information is consistent with the second bound lane information, the first bound lane information is used as the intended lane information of the target vehicle in the future frame;

[0314] Step f2: If the target lane information does not exist in the candidate lane information, the free lane is used as the intended lane information of the target vehicle in the future frame.

[0315] In this embodiment, if the lane number information contains second bound lane information, or the first bound lane information is consistent with the second bound lane information, the first bound lane information is used as the intended lane information of the target vehicle in the future frame, that is, the first bound lane information of the current frame is used to represent the target vehicle's intention in the future, thereby improving the accuracy of vehicle intention recognition.

[0316] If the target lane information does not exist in the candidate lane information, the free lane is used as the intended lane information of the target vehicle in the future frame, indicating that the intention of the vehicle at the corresponding time in the future frame cannot be represented in the current frame.

[0317] In a feasible implementation, step S430 may include steps S431 to S433:

[0318] Step S431, determining first bound lane information based on the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the current frame;

[0319] Step S432, determining the second bound lane information based on the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the future frame;

[0320] Step S433: if the second bound lane information is a free lane, the second bound lane information is updated based on the target lane number corresponding to each traffic vehicle in a preset number of consecutive image frames.

[0321] In this embodiment, if the target vehicle information exists in the second vehicle information, that is, the traffic vehicle corresponding to the target vehicle information exists in the future frame, the first bound lane information is determined based on the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the current frame. Specifically, for the current frame, the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the current frame is calculated. If the minimum value of the projection distance is less than or equal to the preset distance value (for example, 3 meters), the lane code of the lane line corresponding to the minimum value is used as the first bound lane information.

[0322] At the same time, based on the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the future frame, the second bound lane information is determined. For the future frame, the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the future frame is calculated. If the minimum value of the projection distance is less than or equal to the preset distance value (for example, 3 meters), the lane code of the lane line corresponding to the minimum value is used as the second bound lane information.

[0323] After obtaining the second bound lane information, determine whether the second bound lane information is a free lane. If the second bound lane information is a free lane, update the second bound lane information based on the target lane number corresponding to each traffic vehicle in a preset number of consecutive image frames. Specifically, the target lane number corresponding to each traffic vehicle in the consecutive image frames is the target lane number corresponding to each traffic vehicle obtained in step S340. The lane number corresponding to the target vehicle information is queried in the target lane number corresponding to each traffic vehicle, and the queried lane number is used as the second bound lane information.

[0324] The data processing method proposed in this embodiment obtains the first vehicle information of the vehicle corresponding to the current frame and the lane number information of the corresponding lane in a preset number of continuous image frames, and obtains the second vehicle information of the vehicle corresponding to the future frame; then traverses the first vehicle information in sequence to obtain the target vehicle information, and determines whether the target vehicle information exists in the second vehicle information; then if the target vehicle information exists in the second vehicle information, based on the target vehicle information, obtains the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame; then based on the first bound lane information, the second bound lane information and the lane number information, determines the intended lane information of the vehicle corresponding to the target vehicle information in the future frame, and identifies the intention of the vehicle in the current frame through the bound lane information of the intersection of the vehicles between the current frame and the future frame in the continuous image frames, which can greatly reduce the number of trajectory points of the original lane trajectory points, reduce the jitter problem between different consecutive frames, ensure the reliability of the lane trajectory, improve the accuracy of the association relationship between lane lines in different frames, and thus improve the accuracy of vehicle intention recognition.

[0325] The data processing device provided in the embodiment of the present application adopts the data processing method in the above embodiment, which can solve the technical problem of how to improve the accuracy of vehicle intention recognition. Compared with the prior art, the beneficial effects of the data processing device provided in the embodiment of the present application are the same as the beneficial effects of the data processing method provided in the above embodiment, and other technical features in the data processing device are the same as the features disclosed in the above embodiment method, which will not be repeated here.

[0326] The present application provides a data processing device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the data processing method in the above-mentioned embodiment 1.

[0327] Reference below Fig.10 , which shows a schematic diagram of the structure of a data processing device suitable for implementing an embodiment of the present application. The data processing device in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Fig.10 The data processing device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0328] like Fig.10As shown, the data processing device may include a processing device 1001 (such as a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. In RAM1004, various programs and data required for the operation of the data processing device are also stored. The processing device 1001, ROM1002 and RAM1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: an input device 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD: Liquid Crystal Display), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the data processing device to communicate with other devices wirelessly or by wire to exchange data. Although the figure shows a data processing device with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems can be implemented or have alternatively.

[0329] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0330] The data processing device provided by the present application adopts the data processing method in the above embodiment, which can solve the technical problem of how to improve the accuracy of vehicle intention recognition. Compared with the prior art, the beneficial effects of the data processing device provided by the present application are the same as the beneficial effects of the data processing method provided by the above embodiment, and the other technical features in the data processing device are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.

[0331] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0332] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0333] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) stored thereon, wherein the computer-readable program instructions are used to execute the data processing method in the above-mentioned embodiment.

[0334] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM: Random Access Memory), a read-only memory (ROM: Read Only Memory), an erasable programmable read-only memory (EPROM: Erasable Programmable Read Only Memory or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM: CD-Read Only Memory), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency: Radio Frequency), etc., or any suitable combination of the above.

[0335] The computer-readable storage medium may be included in the data processing device; or may exist independently without being installed in the data processing device.

[0336] The above-mentioned computer-readable storage medium carries one or more programs. When the above-mentioned one or more programs are executed by a data processing device, the data processing device: obtains the first vehicle information of the vehicle corresponding to the current frame and the lane number information of the corresponding lane in a preset number of consecutive image frames, and obtains the second vehicle information of the vehicle corresponding to the future frame; traverses the first vehicle information in sequence, obtains the target vehicle information, and determines whether the target vehicle information exists in the second vehicle information; if the target vehicle information exists in the second vehicle information, then based on the target vehicle information, obtains the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame; based on the first bound lane information, the second bound lane information and the lane number information, determines the intended lane information of the vehicle corresponding to the target vehicle information in the future frame.

[0337] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0338] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0339] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0340] The readable storage medium provided in this application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned data processing method, and can solve the technical problem of how to improve the accuracy of vehicle intention recognition. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided in this application are the same as the beneficial effects of the data processing method provided in the above-mentioned embodiment, and will not be repeated here.

[0341] An embodiment of the present application provides a computer program product, including a computer program, which implements the steps of the above-mentioned data processing method when executed by a processor.

[0342] The computer program product provided in this application can solve the technical problem of how to improve the accuracy of vehicle intention recognition. Compared with the prior art, the beneficial effects of the computer program product provided in the embodiment of this application are the same as the beneficial effects of the data processing method provided in the above embodiment, which will not be repeated here.

[0343] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A data processing method, characterized in that: include: Obtaining first vehicle information of a vehicle corresponding to a current frame and lane number information of a corresponding lane from a preset number of consecutive image frames, and obtaining second vehicle information of a vehicle corresponding to a future frame, where the future frame is an image frame after the current frame from the preset number of consecutive image frames; Traversing the first vehicle information in sequence, obtaining target vehicle information, and determining whether the target vehicle information exists in the second vehicle information; If the target vehicle information exists in the second vehicle information, acquiring the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame based on the target vehicle information; Based on the first bound lane information, the second bound lane information and the lane number information, determine the intended lane information of the vehicle corresponding to the target vehicle information in the future frame, wherein if the first bound lane information is consistent with the second bound lane information, the first bound lane information is used as the intended lane information of the target vehicle in the future frame.

2. The data processing method according to claim 1, characterized in that: The determining, based on the first bound lane information, the second bound lane information, and the lane number information, the intended lane information of the target vehicle corresponding to the target vehicle information in the future frame includes: If the first bound lane information is inconsistent with the second bound lane information, determining whether the second bound lane information exists in the lane number information; If the second bound lane information does not exist, obtaining the association relationship corresponding to each lane line in the continuous image frames; Based on the association relationship and the second bound lane information, the intended lane information of the target vehicle in the future frame is determined.

3. The data processing method according to claim 2, characterized in that: The determining, based on the association relationship and the second bound lane information, the intended lane information of the target vehicle in the future frame includes: Acquire a target association relationship corresponding to the second bound lane information in the association relationship; Based on the target association relationship, obtaining candidate lane information corresponding to the second bound lane information; The intended lane information of the target vehicle in the future frame is determined based on the candidate lane information and the lane number information.

4. The data processing method according to claim 3, characterized in that: The determining the intended lane information of the target vehicle in the future frame based on the candidate lane information and the lane number information includes: Determine whether there is target lane information belonging to the lane number information in the candidate lane information; If the target lane information exists in the candidate lane information, the target lane information is used as the intended lane information of the target vehicle in the future frame.

5. The data processing method according to claim 4, characterized in that: The data processing method further includes: If the second bound lane information exists in the lane number information, the first bound lane information is used as the intended lane information of the target vehicle in the future frame; If the target lane information does not exist in the candidate lane information, the free lane is used as the intended lane information of the target vehicle in the future frame.

6. The data processing method according to claim 2, characterized in that: The obtaining of the association relationship corresponding to each lane line in the continuous image frames includes: Acquire the trajectory point coordinates of the trajectory points corresponding to each lane line in a preset number of continuous image frames, and perform thinning processing on the trajectory point coordinates to obtain the first trajectory point coordinates corresponding to each lane line; Based on the coordinates of the first trajectory point, determine a horizontal coordinate span and a vertical coordinate span, and establish a first two-dimensional grid based on the horizontal coordinate span and the vertical coordinate span; Based on the first trajectory point coordinates, marking lane numbers of lane lines in each grid of the first two-dimensional grid; Based on the marked first two-dimensional grid, the association relationship between each lane line is determined.

7. The data processing method according to claim 6, characterized in that: The determining the association relationship between lane lines based on the marked first two-dimensional grid includes: Establishing a second two-dimensional grid based on the number of numbers corresponding to the lane numbers; Determine a first grid in which a plurality of lane numbers exist for elements of the grid in the first two-dimensional grid; Based on the elements of the first grid, updating the elements of each grid in the second two-dimensional grid, wherein the elements of the grid in the updated second two-dimensional grid are the number of times the corresponding two lane numbers belong to the same grid in the first two-dimensional grid; Based on the updated second two-dimensional grid, the association relationship between the lane lines is determined.

8. The data processing method according to any one of claims 1 to 7, characterized in that: The acquiring the first bound lane information corresponding to the current frame and the second bound lane information corresponding to the future frame includes: Determine first bound lane information based on the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the current frame; Determine the second bound lane information based on the projection distance between the vehicle corresponding to the target vehicle information and each lane line in the future frame; If the second bound lane information is a free lane, the second bound lane information is updated based on the target lane numbers corresponding to each traffic vehicle in a preset number of consecutive image frames.

9. A data processing device, characterized in that: The data processing device comprises: a memory, a processor, and a data processing program stored in the memory and executable on the processor, wherein the data processing program implements the steps of the data processing method according to any one of claims 1 to 8 when executed by the processor.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a data processing program, and when the data processing program is executed by a processor, the steps of the data processing method according to any one of claims 1 to 8 are implemented.

Citation Information

Patent Citations

  • Vehicle control method and device, electronic equipment and storage medium

    CN114802233A