[go: up one dir, main page]

CN111325229A - Clustering method for object space closure based on single line data analysis of laser radar - Google Patents

Clustering method for object space closure based on single line data analysis of laser radar Download PDF

Info

Publication number
CN111325229A
CN111325229A CN201811544723.2A CN201811544723A CN111325229A CN 111325229 A CN111325229 A CN 111325229A CN 201811544723 A CN201811544723 A CN 201811544723A CN 111325229 A CN111325229 A CN 111325229A
Authority
CN
China
Prior art keywords
point
data
line
single line
points
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201811544723.2A
Other languages
Chinese (zh)
Other versions
CN111325229B (en
Inventor
周睿
车云飞
申泽邦
王金强
漆昱涛
周庆国
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Lanzhou University
Original Assignee
Lanzhou University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Lanzhou University filed Critical Lanzhou University
Priority to CN201811544723.2A priority Critical patent/CN111325229B/en
Publication of CN111325229A publication Critical patent/CN111325229A/en
Application granted granted Critical
Publication of CN111325229B publication Critical patent/CN111325229B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/23Clustering techniques
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06VIMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V10/00Arrangements for image or video recognition or understanding
    • G06V10/20Image preprocessing
    • G06V10/26Segmentation of patterns in the image field; Cutting or merging of image elements to establish the pattern region, e.g. clustering-based techniques; Detection of occlusion
    • G06V10/267Segmentation of patterns in the image field; Cutting or merging of image elements to establish the pattern region, e.g. clustering-based techniques; Detection of occlusion by performing operations on regions, e.g. growing, shrinking or watersheds
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06VIMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V10/00Arrangements for image or video recognition or understanding
    • G06V10/40Extraction of image or video features
    • G06V10/44Local feature extraction by analysis of parts of the pattern, e.g. by detecting edges, contours, loops, corners, strokes or intersections; Connectivity analysis, e.g. of connected components
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06VIMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V20/00Scenes; Scene-specific elements
    • G06V20/50Context or environment of the image
    • G06V20/56Context or environment of the image exterior to a vehicle by using sensors mounted on the vehicle

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Multimedia (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Evolutionary Computation (AREA)
  • Evolutionary Biology (AREA)
  • General Engineering & Computer Science (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Artificial Intelligence (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Image Analysis (AREA)
  • Optical Radar Systems And Details Thereof (AREA)
  • Image Processing (AREA)

Abstract

The invention discloses a clustering method for closing an object space based on single line data analysis of a laser radar, which comprises the following steps of S1: extracting single line data from the laser radar Velodyne, and mapping each group of single line data to a two-dimensional plane; step S2: extracting object edge lines by using the two-dimensional plane data in the step S1 and using a tangent method for each group of data, and sequentially segmenting and extracting the edges of a single object; step S3: processing the divided object edge point set to obtain the central point of the object and the area occupied by the object in the horizontal direction; step S4: and combining the single line data of all the two-dimensional planes, and determining the final accurate positions and the occupied area in the horizontal direction of all the objects in the three-dimensional space. The method has better robustness for the segmentation and clustering of the space objects with too close distance.

Description

一种基于激光雷达的单线数据分析对物体空间封闭的聚类 方法A clustering method for object space closure based on single-line data analysis based on lidar

技术领域technical field

本发明涉及车辆辅助驾驶技术领域,特别是一种基于激光雷达的单线数据分析对物体空间封闭的聚类方法。The invention relates to the technical field of assisted driving of vehicles, in particular to a clustering method for object space closure based on single-line data analysis of laser radar.

背景技术Background technique

环境感知是无人驾驶的核心部分之一,其中对空间物体的定位和追踪又是最重要的一部分。现如今广泛使用的激光雷达对于目标位置、速度等特征量的探测具有相当高精度,相比于其他环境感知方式,激光雷达都有相当大的优势。Environmental perception is one of the core parts of unmanned driving, of which the positioning and tracking of space objects is the most important part. Lidar, which is widely used today, has quite high accuracy for the detection of target position, speed and other characteristic quantities. Compared with other environmental perception methods, Lidar has considerable advantages.

激光雷达,是以发射激光束探测目标的位置、速度等特征量的雷达系统。其工作原理是向目标发射探测信号(激光束),然后将接收到的从目标反射回来的信号(目标回波)与发射信号进行比较,作适当处理后,就可获得目标的有关信息,如目标距离、方位、高度、速度、姿态、甚至形状等参数;激光雷达有分辨率高、隐蔽性好、抗有源干扰能力强、低空探测性能好、体积小、质量轻等优点。Lidar is a radar system that emits a laser beam to detect the position, velocity and other characteristic quantities of the target. Its working principle is to transmit a detection signal (laser beam) to the target, and then compare the received signal (target echo) reflected from the target with the transmitted signal, and after proper processing, the relevant information of the target can be obtained, such as Target distance, azimuth, height, speed, attitude, and even shape and other parameters; lidar has the advantages of high resolution, good concealment, strong anti-active interference, good low-altitude detection performance, small size, and light weight.

将物理空间中的激光雷达点云集合分成由类似的对象组成的多个类的过程被称为点云聚类。由聚类所生成的簇是一组数据对象的集合,这些对象与同一个簇中的对象彼此相似,与其他簇中的对象相异,这个集合即被认为是一个单独的个体。The process of dividing a collection of lidar point clouds in physical space into multiple classes consisting of similar objects is called point cloud clustering. A cluster generated by clustering is a collection of data objects, which are similar to objects in the same cluster and different from objects in other clusters, and this collection is considered as a single individual.

一般的聚类算法,如K-Means、均值漂移、DBSCAN聚类算法,都是在一个维度上对三维空间的点进行聚类,并计算空间物体的中心点;且大部分算法都是着眼于点云密度的变化来追踪空间物体的位置,当两个物体相聚太近时,这些算法容易将两个不同的物体误分类为同一个物体;而且由于激光雷达的穿透效果很差,不能捕捉背向激光雷达一面的点,往往聚类效果只能是实际物体的一半,甚至会出现聚类轮廓出现偏差。以上因素容易影响聚类效果,效果非常不稳定。General clustering algorithms, such as K-Means, mean shift, and DBSCAN clustering algorithms, cluster points in three-dimensional space in one dimension, and calculate the center point of space objects; and most algorithms focus on The change of point cloud density is used to track the position of space objects. When two objects are too close together, these algorithms are prone to misclassify two different objects as the same object; and because the penetration effect of lidar is poor, it cannot be captured. For the points facing away from the lidar, the clustering effect is often only half of the actual object, and even the clustering contour may be deviated. The above factors easily affect the clustering effect, and the effect is very unstable.

发明内容SUMMARY OF THE INVENTION

本发明的目的是要解决目前基于激光雷达点云聚类时,容易发生当两个物体靠的太近时,点云过于密集,聚类算法会将两个物体误认为同一个物体,因此,本发明提出一种鲁棒性较好的聚类方法。The purpose of the present invention is to solve the problem that when two objects are too close to each other, the point cloud is too dense, and the clustering algorithm will mistake the two objects as the same object. Therefore, The invention proposes a clustering method with better robustness.

为解决现有算法聚类的不足,本发明提出了一种基于激光雷达的单线数据分析对物体空间封闭的聚类方法,包括步骤如下:In order to solve the deficiencies of existing algorithm clustering, the present invention proposes a clustering method for object space closure based on single-line data analysis of lidar, including the following steps:

步骤S1:从激光雷达Velodyne中提取单线点云集生成多组数据,然后将每组的单线数据映射到二维平面上;Step S1: extracting single-line point cloud sets from the lidar Velodyne to generate multiple sets of data, and then mapping each set of single-line data to a two-dimensional plane;

步骤S2:利用步骤S1中的二维平面数据,对每组数据使用切线的方法提取所有物体的边缘点集;Step S2: using the two-dimensional plane data in step S1, extract the edge point sets of all objects by using the tangent method for each group of data;

步骤S3:连接每个物体的边缘点集的第一个和最后一个点,连线的中点作为中心,对该点集做中心对称以补足物体背面的边缘点,形成一个封闭的点集圈;此时连线的中点即为物体在该切面的中心,封闭点集圈所占的面积即为物体在该切面的面积;Step S3: Connect the first and last points of the edge point set of each object, the midpoint of the connection line is used as the center, and center symmetry is performed on the point set to complement the edge points on the back of the object to form a closed point set circle ; At this time, the midpoint of the connecting line is the center of the object in the section, and the area occupied by the closed point set circle is the area of the object in the section;

步骤S4:组合所有单线平面二维数据,在三维空间中确定所有物体最终的精确位置及水平方向所占面积。Step S4: Combine all the single-line plane two-dimensional data, and determine the final precise position and the area occupied by the horizontal direction of all objects in the three-dimensional space.

步骤S1的关键在于解析多线激光雷达消息协议,将收集的多线激光雷达点云数据处理为单线点云集,然后将每组单线点云数据映射到二维平面。The key of step S1 is to parse the multi-line lidar message protocol, process the collected multi-line lidar point cloud data into a single-line point cloud set, and then map each group of single-line point cloud data to a two-dimensional plane.

步骤S2所述使用切线方法提取所有物体的边缘点集,包括以下步骤:The step S2 uses the tangent method to extract the edge point set of all objects, including the following steps:

步骤S2A:在激光雷达单线点集数据中首先选取两个相近随机散点对;Step S2A: first select two similar random scatter point pairs in the lidar single-line point set data;

步骤S2B:连接点对产生一条直线,在这条直线两个相对的方向上取两个相对的,角度和宽度一定的扇形区域;Step S2B: connect the points to generate a straight line, and take two relative, fan-shaped regions with a certain angle and width in the two opposite directions of this straight line;

步骤S2C:在步骤S2B中的两个扇形区域中寻找点,标记得到的新的激光雷达点,可以认为得到的新的激光雷达点和步骤S2A中的两个点属于同一个物体的边缘点集;Step S2C: Find points in the two fan-shaped areas in step S2B, mark the obtained new lidar point, it can be considered that the obtained new lidar point and the two points in step S2A belong to the edge point set of the same object ;

步骤S2D:重复步骤S2B、S2C,直到无法在步骤S2B中描述的扇形区域中找到未被标记的点;Step S2D: Repeat steps S2B and S2C until the unmarked point cannot be found in the sector area described in step S2B;

步骤S2E:最后判断平面二维点集中是否还有未被标记的点,若有,重复步骤S2A、S2B、S2C、S2D。Step S2E: Finally, determine whether there are unmarked points in the two-dimensional point set of the plane, and if so, repeat steps S2A, S2B, S2C, and S2D.

步骤S3所述的通过物体边缘点集获得物体的中心点和水平方向面积,包括以下步骤:Obtaining the center point and the horizontal direction area of the object through the object edge point set described in step S3 includes the following steps:

步骤S3A:通过步骤S2可以获得一个近似圆弧的点集,每一个圆弧的水平面就代表一个物体的切面,连接点集首尾的两个点,以连线作为对称轴,做中心对称,补足物体背对雷达方向的面的点,这时可以得到一个物体切面的封闭点集,此中心记为O,切面高度为H;Step S3A: Through step S2, a point set that approximates an arc can be obtained. The horizontal plane of each arc represents a tangent plane of an object. Connect the two points at the beginning and end of the point set, and use the connecting line as the axis of symmetry to do center symmetry and complement. The point of the surface of the object facing the direction of the radar, then a closed point set of the object section can be obtained, the center is denoted as O, and the height of the section is H;

步骤S3B:使用旋转卡尺(旋转卡壳)算法,获取物体切面点集的外切矩形的形状W、V。Step S3B: Using the rotating caliper (rotating jamming) algorithm, the shapes W and V of the circumscribed rectangle of the point set of the tangent plane of the object are obtained.

步骤S4则是对不同组之间的数据进行组合迭代,当不同组中两个物体的边缘点集面在垂直空间上呈现50%以上的重叠时可以认为这两对信息来自同一个空间物体的不同高度,然后更新物体的中心位置和最小外切正方形,不断迭代组合不同组的数据,最终得到物体准确的位置和水平方向的占地面积信息。Step S4 is to combine and iterate the data between different groups. When the edge point sets of the two objects in different groups overlap by more than 50% in the vertical space, it can be considered that the two pairs of information come from the same space object. Different heights, then update the center position and minimum circumscribed square of the object, and iteratively combine different sets of data, and finally obtain the accurate position of the object and the footprint information in the horizontal direction.

本发明区别于一般基于密度的聚类算法,综合考虑到物体的外形因素,通过物体轮廓曲线的变化,识别和分割物体;同时在三维方向上对所有单线数据进行合并,可以有效的消除物体在垂直方向上密度分布不均匀的影响。因此本发明对近距离,垂直方向密度分布不均的物体聚类有较好的鲁棒性。Different from the general density-based clustering algorithm, the present invention comprehensively considers the shape factors of the object, and recognizes and divides the object through the change of the contour curve of the object. The effect of uneven density distribution in the vertical direction. Therefore, the present invention has better robustness to the clustering of objects with uneven density distribution in the close distance and vertical direction.

附图说明Description of drawings

图1为本发明基于激光雷达的单线数据分析对物体空间封闭的聚类方法的流程图;1 is a flowchart of a clustering method for object space closure based on single-line data analysis of lidar according to the present invention;

图2为本发明获取物体边缘点集的原理图;FIG. 2 is a schematic diagram of the present invention for obtaining an object edge point set;

图3为本发明聚类原理图。3 is a schematic diagram of the clustering principle of the present invention.

具体实施方式Detailed ways

为使本发明的目的、技术方案和有点更加清楚明白,以下结合具体实施流程,如图1,并参照附图,对本发明进一步详细说明。In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the specific implementation process, as shown in FIG. 1 and with reference to the accompanying drawings.

本发明提出了一种基于激光雷达的单线数据分析对物体空间封闭的聚类方法,激光雷达可以发射激光的线数从1到128不等,相应也有反馈得到的1到128线的点云数据,本发明就是基于对多线雷达的单线点云数据分析;直接观察激光雷达的三维点分布的时,多线激光雷达的单线数据可以在物体外表面呈现出明显的物体轮廓,因此本发明的重点在于通过点云拟合物体外部轮廓,来实现聚类。The invention proposes a clustering method based on single-line data analysis of lidar to close object space. The number of lines that lidar can emit laser ranges from 1 to 128, and correspondingly there are point cloud data of 1 to 128 lines obtained by feedback. , the invention is based on the analysis of the single-line point cloud data of the multi-line radar; when the three-dimensional point distribution of the laser radar is directly observed, the single-line data of the multi-line laser radar can present an obvious object outline on the outer surface of the object, so the invention The key point is to achieve clustering by fitting the outer contour of the object through the point cloud.

首先,从激光雷达Velodyne中提取所有的单线点云集生成多组数据。First, extract all single-line point clouds from the lidar Velodyne to generate multiple sets of data.

将每组单线数据映射到二维平面上,仅使用三维点坐标(x,y,z)中的x和y,即(x,y)。Map each set of single-line data onto a 2D plane, using only x and y in 3D point coordinates (x, y, z), i.e. (x, y).

使用切线方法提取二维平面上所有物体的边缘点集,包括以下步骤:Use the tangent method to extract the edge point set of all objects on the two-dimensional plane, including the following steps:

步骤S2A:在二维平面上的单线点集数据中首先选取两个没有并入点集的最相近随机散点对A和B,如图2,归入点集S中;Step S2A: in the single-line point set data on the two-dimensional plane, first select two closest random scatter pairs A and B that are not incorporated into the point set, as shown in Figure 2, are classified into the point set S;

步骤S2B:连接A和B产生一条直线,在这条直线两个方向上取两个相对的,以A和B为顶点,以这条直线为等分线的扇形区域,扇形区域的角度阈值和宽度为为α和L;Step S2B: connect A and B to generate a straight line, take two opposite ones in the two directions of this straight line, take A and B as vertices, take this straight line as the fan-shaped area of the bisector, the angle threshold of the fan-shaped area and The widths are α and L;

步骤S2C:在步骤S2B的扇形区域中寻找点,得到A方向的点A1,B方向的点B1,将A1和B1归入点集S中,并标记这两个点;Step S2C: search for points in the fan-shaped area of step S2B, obtain the point A1 in the A direction and the point B1 in the B direction, classify A1 and B1 into the point set S, and mark these two points;

步骤S2D:以A、A1和B、B1作为两组新的点对,重复步骤S2B、S2C,直到无法在步骤S2B中描述的扇形区域中找到未被标记的点。Step S2D: Taking A, A1 and B, B1 as two new sets of point pairs, repeating steps S2B and S2C until no unmarked point can be found in the sector area described in step S2B.

步骤S2E:最后判断二维平面中是否还有未被标记的点,若有,重复步骤S2A、S2B、S2C、S2D。Step S2E: Finally, determine whether there are any unmarked points in the two-dimensional plane, and if so, repeat steps S2A, S2B, S2C, and S2D.

所述的通过物体边缘点集获得物体的中心点和水平方向面积,如图3,包括以下步骤:The said obtaining the center point and the horizontal direction area of the object through the object edge point set, as shown in Figure 3, includes the following steps:

步骤S3A:通过步骤S2可以获得一个近似圆弧的点集,每一个圆弧的水平面就代表一个物体的切面,连接圆弧点集的首尾两个点,以连线作为对称轴,做中心对称,补足物体背对雷达方向的面的点,这时可以得到一个物体切面的封闭点集,此中心记为O,切面高度为H;Step S3A: Through step S2, a point set that approximates an arc can be obtained. The horizontal plane of each arc represents the tangent plane of an object, and the first and last points of the arc point set are connected, and the line is used as the axis of symmetry to do center symmetry. , to complement the point of the surface of the object facing the direction of the radar, then a closed point set of the tangent plane of the object can be obtained, the center is denoted as O, and the height of the tangent plane is H;

H=(H1+H2+...+Hn)/nH=(H 1 +H 2 +...+H n )/n

步骤S3B:使用旋转卡尺(旋转卡壳)算法,获取物体切面点集的外切矩形的形状W、V。Step S3B: Using the rotating caliper (rotating jamming) algorithm, the shapes W and V of the circumscribed rectangle of the point set of the tangent plane of the object are obtained.

所述合并单线平面二维数据,在三维空间中确定所有物体最终的精确位置及水平方向所占面积,如 O1、W1、V1、H1和O2、W2、V2、H2(这两对信息来自不同的组),在垂直空间上呈现50%以上的重叠时,有理由相信这两对信息来自同一个空间物体的不同高度,然后更新物体的中心位置和最小外切正方形,不断叠加更新。The combined single-line plane two-dimensional data is used to determine the final precise position and the area occupied by the horizontal direction of all objects in the three-dimensional space, such as O 1 , W 1 , V 1 , H 1 and O 2 , W 2 , V 2 , H 2 (the two pairs of information are from different groups), when there is more than 50% overlap in the vertical space, it is reasonable to believe that the two pairs of information are from different heights of the same space object, and then update the object's center position and minimum circumscribed Square, constantly superimposed and updated.

O=(O1+O2)/2O=(O 1 +O 2 )/2

H=(H1+H2)/2。H=(H 1 +H 2 )/2.

Claims (5)

1. A clustering method for object space closure based on laser radar single line data analysis is characterized in that the number of lines of laser emitted by a laser radar is different from 1 to 128, and correspondingly, point cloud data of 1 to 128 lines are obtained through feedback, the method is based on single line point cloud data analysis of a multi-line radar, and then analysis results of all single lines are combined to realize space object clustering, and comprises the following steps:
step S1: extracting a single-line point cloud set from the laser radar Velodyne to generate a plurality of groups of data, and then mapping each group of data to a two-dimensional plane;
step S2: extracting edge point sets of all objects in the group of data by using the two-dimensional plane data in the step S1 and using a tangent method for each group of data, wherein the edge point set of each object presents a circular arc shape on the two-dimensional plane;
step S3: connecting the first and last points of the edge point set of each object, taking the middle point of the connecting line as the center, and performing central symmetry on the point set to complement the edge points on the back of the object to form a closed point cluster; the middle point of the connecting line is the center of the object on the tangent plane, and the area occupied by the closed point ring is the area of the object on the tangent plane;
step S4: and combining the two-dimensional data of all the single line planes, and determining the final accurate positions and the occupied area in the horizontal direction of all the objects in the three-dimensional space.
2. The method of claim 1, wherein the single line data analysis of the multi-line lidar is performed by directly observing the three-dimensional point cloud distribution of the lidar such that the single line data of the multi-line lidar can present a distinct object contour on the outer surface of the object, and the step S1 is performed by analyzing the multi-line lidar message protocol to process the collected multi-line lidar point cloud data into a single line point cloud set, and then mapping each set of single line point cloud data to a two-dimensional plane.
3. The method for clustering object space closure based on lidar single-line data analysis according to claim 1, wherein the step S2 is to extract the edge point sets of all objects by using a tangent method, comprising the following steps:
step S2A: firstly, selecting two similar random scattered point pairs in the laser radar single line point set data;
step S2B: the connecting point pair generates a straight line, and two opposite fan-shaped areas with certain angles and widths are taken in two opposite directions of the straight line;
step S2C: searching points in the two fan-shaped areas in the step S2B, marking the obtained new laser radar point, and considering that the obtained new laser radar point and the two points in the step S2A belong to an edge point set of the same object;
step S2D: repeating steps S2B, S2C until no unmarked points can be found in the sector area described in step S2B;
step S2E: and finally, judging whether the plane two-dimensional data has unmarked points or not, and if so, repeating the steps S2A, S2B, S2C and S2D.
4. The method for clustering object space closure based on lidar single-line data analysis according to claim 1, wherein the step S3 of obtaining the center point and the horizontal area of the object by the object edge point set comprises the following steps:
step S3A: a point set approximate to circular arcs can be obtained through the step S2, the horizontal plane of each circular arc represents a tangent plane of an object, two points at the head and the tail of the point set are connected, a connecting line is used as a symmetry axis to be centrosymmetric, points of the plane of the object opposite to the radar direction are complemented, and at this time, a closed point set of the tangent plane of the object can be obtained, the center is marked as O, and the height of the tangent plane is H;
step S3B: using a rotating caliper (rotating cassette) algorithm, the shape W, V of the circumscribed rectangle of the object tangent point set is obtained.
5. The method for clustering objects with spatial closure based on single line data analysis of lidar according to claim 1, wherein after steps S1, S2, S3 are completed, a plurality of sets of data are obtained, each set representing a set of edge points of an object obtained by analyzing a certain single line data and detailed attitude information of each object in a tangent plane of the set of points; step S4 is to perform combination iteration on the data between different groups, and when the edge point set tangent planes of two objects in different groups overlap by more than 50% in the vertical space, it can be considered that the two pairs of information come from different heights, i.e. different planes, of the same object in space, then update the center position and the minimum circumscribed square of the object, and continuously iterate and combine the data of different groups, and finally obtain the accurate position of the object and the floor area information in the horizontal direction.
CN201811544723.2A 2018-12-17 2018-12-17 Clustering method for object space closure based on single line data analysis of laser radar Active CN111325229B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811544723.2A CN111325229B (en) 2018-12-17 2018-12-17 Clustering method for object space closure based on single line data analysis of laser radar

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811544723.2A CN111325229B (en) 2018-12-17 2018-12-17 Clustering method for object space closure based on single line data analysis of laser radar

Publications (2)

Publication Number Publication Date
CN111325229A true CN111325229A (en) 2020-06-23
CN111325229B CN111325229B (en) 2022-09-30

Family

ID=71163097

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811544723.2A Active CN111325229B (en) 2018-12-17 2018-12-17 Clustering method for object space closure based on single line data analysis of laser radar

Country Status (1)

Country Link
CN (1) CN111325229B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113177966A (en) * 2021-04-15 2021-07-27 中国科学院上海光学精密机械研究所 Three-dimensional scanning coherent laser radar point cloud processing method based on velocity cluster statistics
CN114820416A (en) * 2021-01-29 2022-07-29 中国移动通信有限公司研究院 Vehicle course angle calculation method, vehicle pose calculation method, device and equipment

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN203572962U (en) * 2013-11-11 2014-04-30 兰州大学 Single-channel polarization detection laser radar system
CN105512665A (en) * 2015-12-11 2016-04-20 中国测绘科学研究院 Airborne laser radar point cloud data edge extraction method
US20160154999A1 (en) * 2014-12-02 2016-06-02 Nokia Technologies Oy Objection recognition in a 3d scene
CN105667518A (en) * 2016-02-25 2016-06-15 福州华鹰重工机械有限公司 Lane detection method and device
CN105866790A (en) * 2016-04-07 2016-08-17 重庆大学 Laser radar barrier identification method and system taking laser emission intensity into consideration
CN106371105A (en) * 2016-08-16 2017-02-01 长春理工大学 Vehicle targets recognizing method, apparatus and vehicle using single-line laser radar
CN106530380A (en) * 2016-09-20 2017-03-22 长安大学 Ground point cloud segmentation method based on three-dimensional laser radar
CN107274417A (en) * 2017-07-05 2017-10-20 电子科技大学 A Single Tree Segmentation Method Based on Airborne Laser Point Cloud Aggregation Relationship
CN108460416A (en) * 2018-02-28 2018-08-28 武汉理工大学 A kind of structured road feasible zone extracting method based on three-dimensional laser radar

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN203572962U (en) * 2013-11-11 2014-04-30 兰州大学 Single-channel polarization detection laser radar system
US20160154999A1 (en) * 2014-12-02 2016-06-02 Nokia Technologies Oy Objection recognition in a 3d scene
CN105512665A (en) * 2015-12-11 2016-04-20 中国测绘科学研究院 Airborne laser radar point cloud data edge extraction method
CN105667518A (en) * 2016-02-25 2016-06-15 福州华鹰重工机械有限公司 Lane detection method and device
CN105866790A (en) * 2016-04-07 2016-08-17 重庆大学 Laser radar barrier identification method and system taking laser emission intensity into consideration
CN106371105A (en) * 2016-08-16 2017-02-01 长春理工大学 Vehicle targets recognizing method, apparatus and vehicle using single-line laser radar
CN106530380A (en) * 2016-09-20 2017-03-22 长安大学 Ground point cloud segmentation method based on three-dimensional laser radar
CN107274417A (en) * 2017-07-05 2017-10-20 电子科技大学 A Single Tree Segmentation Method Based on Airborne Laser Point Cloud Aggregation Relationship
CN108460416A (en) * 2018-02-28 2018-08-28 武汉理工大学 A kind of structured road feasible zone extracting method based on three-dimensional laser radar

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
THIJS VANLANKVELD等: "Identifying rectanglesinlaserrangedataforurbanscenereconstruction", 《COMPUTERS &GRAPHICS》 *
朱杰等: "多约束的平面点集形状重构方法", 《测绘学报》 *
李广敬等: "一种基于3D激光雷达的实时道路边缘提取算法", 《计算机科学》 *
陈奇: "机载LiDAR与影像结合的建筑物检测及其轮廓精化方法研究", 《中国博士学位论文全文数据库 工程科技Ⅱ辑》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114820416A (en) * 2021-01-29 2022-07-29 中国移动通信有限公司研究院 Vehicle course angle calculation method, vehicle pose calculation method, device and equipment
CN113177966A (en) * 2021-04-15 2021-07-27 中国科学院上海光学精密机械研究所 Three-dimensional scanning coherent laser radar point cloud processing method based on velocity cluster statistics
CN113177966B (en) * 2021-04-15 2022-06-28 中国科学院上海光学精密机械研究所 3D scanning coherent lidar point cloud processing method based on velocity clustering statistics

Also Published As

Publication number Publication date
CN111325229B (en) 2022-09-30

Similar Documents

Publication Publication Date Title
CN112526513B (en) Millimeter wave radar environment map construction method and device based on clustering algorithm
WO2021143778A1 (en) Positioning method based on laser radar
CN109544612B (en) Point cloud registration method based on feature point geometric surface description
WO2020007235A1 (en) Parking space detection method and apparatus, and medium and device
Yao et al. Extraction and motion estimation of vehicles in single-pass airborne LiDAR data towards urban traffic analysis
CN111524084A (en) Complex scene photon counting laser radar point cloud denoising algorithm based on multimodal Gaussian fitting
JP6381137B2 (en) Label detection apparatus, method, and program
CN107644452A (en) Airborne LiDAR point cloud roof dough sheet dividing method and system
CN116452852A (en) An Automatic Generation Method of High Precision Vector Map
CN110163871A (en) A kind of ground dividing method of multi-line laser radar
CN112946625A (en) B-spline-shape-driven multi-extension target track tracking and classifying method
CN113569958A (en) Laser point cloud data clustering method, device, equipment and medium
CN111325229B (en) Clustering method for object space closure based on single line data analysis of laser radar
CN110532963B (en) Vehicle-mounted laser radar point cloud driven road marking accurate extraction method
CN104569923B (en) Velocity restraint-based Hough transformation fast track starting method
Poggenhans et al. A universal approach to detect and classify road surface markings
CN111736167B (en) Method and device for obtaining laser point cloud density
CN103927743A (en) Method for detecting man-made targets in remotely-sensed images
Sun et al. Oriented point sampling for plane detection in unorganized point clouds
CN115249223A (en) Dynamic target detection method and device, storage medium and terminal
CN115930946A (en) Method for describing multiple characteristics of dynamic barrier in indoor and outdoor alternating environment
CN107274446A (en) A kind of sharp Geometry edge point recognition methods of utilization normal direction uniformity
JP6397386B2 (en) Region division processing apparatus, method, and program
Rapp et al. Clustering improved grid map registration using the normal distribution transform
TWI792108B (en) Inland river lidar navigation system for vessels and operation method thereof

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB03 Change of inventor or designer information

Inventor after: Zhou Qingguo

Inventor after: Wang Jinqiang

Inventor after: Zhou Rui

Inventor after: Che Yunfei

Inventor after: Shen Zebang

Inventor after: Qi Yutao

Inventor before: Zhou Rui

Inventor before: Che Yunfei

Inventor before: Shen Zebang

Inventor before: Wang Jinqiang

Inventor before: Qi Yutao

Inventor before: Zhou Qingguo

CB03 Change of inventor or designer information
GR01 Patent grant
GR01 Patent grant
OL01 Intention to license declared