# 3D Object Detection from Point Cloud Based on Deep Learning

Authors: Ning Hao
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

In order to study the modern 3D object detection algorithm based on deep learning, this paper studies the point-based 3D object detection algorithm, that is, a 3D object detection algorithm that uses multilayer perceptron to extract point features. This paper proposes a method based on point RCNN. A three-stage 3D object detection algorithm improves the accuracy of the algorithm by fusing image information. The algorithm in this paper integrates the information and image information of the three stages well, which improves the information utilization of the whole algorithm. Compared with the traditional 3D target detection algorithm, the structure of the algorithm in this paper is more compact, which effectively improves the utilization of information.


---

## Body

## 1. Introduction

Nowadays, with the rapid development of artificial intelligence and deep learning, many problems that are difficult to overcome by traditional machine learning can be successfully solved by using deep learning methods, such as image classification and detection [1], machine translation in natural language processing [2] and reading comprehension [3], and reinforcement learning [4]. At the same time, with the rapid development of high-performance computing devices, operating speed is no longer the main factor restricting the development of deep neural networks. These hardware and software factors have contributed to the vigorous development of deep learning.Image analysis and detection is a major research hotspot in the computer field. Target detection plays an important role in traditional research. For example, the well-known open source image analysis library OpenCV already supports algorithms such as face detection tracking and vehicle detection tracking. Object detection technology is widely used in the military field. [5] applied target detection to bullet defect detection, and [6, 7] used target detection techniques to detect CT ships and radar targets. In the civilian field that is closely related to people’s lives, object detection also has many applications in the civilian field. [8] applied object detection to helmet-wearing detection, and [9] used object detection to refine real-time pedestrian detection in orchards. Object detection is also widely used in the medical field. [10] used object detection to realize automatic diagnosis of diabetic fundus lesions. However, traditional methods need to manually design features to detect objects, which is time-consuming and labor-intensive. In the era of rapid development of deep learning, it is of great significance to apply deep learning to object detection.Object detection technology also plays an important role in the field of autonomous driving. Autonomous driving has always been a research hotspot in the automotive field. Current autonomous driving systems can be divided into two types: driverless and ADAS (advanced driver assistance systems). This form focuses on fully driverless car driving to save the driver’s labor cost, and the other focuses on assisting the driver, reducing the driver’s stress while driving, and improving the safety of the vehicle. Both use various sensors installed on the vehicle to collect data and combine the map data for system calculation, so as to realize the planning of the driving route and control the vehicle to reach the predetermined position [11]. Breakthroughs in the field of artificial intelligence such as machine vision and deep learning are of great significance to the development of autonomous driving. A series of excellent artificial intelligence companies such as Mobileye have emerged to serve autonomous driving.Self-driving cars typically use LiDAR (Light Detection and Ranging) and several cameras installed in different locations of the vehicle to collect perception data and then analyze and localize the collected visual data to locate objects such as lanes, vehicles, and pedestrians. Recently, with the rapid development of deep learning and artificial intelligence technology, the ability of computers to analyze image data has been significantly improved compared with traditional methods, and many companies have begun to develop artificial intelligence-specific chips. In intelligent driving systems, mainstream sensor solutions include LiDAR, cameras, and millimeter-wave radar (RADAR). The advantage of LiDAR lies in 3D modeling, wide detection range, and high detection accuracy. Therefore, deep learning target detection systems using LiDAR detectors are a hot research direction. However, there are still some problems in the current deep learning-based LiDAR detection systems. First, the data output by the LiDAR sensor is a sparse point cloud, not as dense as the image output by the camera, so traditional deep learning target detection methods cannot be used, directly used for LiDAR perception. The second is that the point cloud output by the LiDAR is three-dimensional data. Due to the time-consuming operation of traditional 3D convolution, current point cloud-based object detection methods usually run slowly. Therefore, it is of great significance to study the fast target detection of LiDAR sensors based on point cloud output. The improved point cloud target detection method with sparse convolution acceleration proposed in this paper has theoretical and practical significance and has certain research and application value. Model experiments are carried out, and it is proved that it can achieve high detection accuracy, reaching 79.51% (moderate). The accuracy of the model is 0.66% higher than the baseline, demonstrating the effectiveness of the third-level point cloud classifier and image classifier.


## 2. Related Work

We observe that point cloud-based object detection is closely related to point cloud-based 3D instance segmentation algorithms. For point clouds in 3D scenes, the 3D instance segmentation algorithm needs to give each point cloud a class label and individual instance labels and needs to distinguish different instances of the same class. Several approaches to 3D instance segmentation are based on 3D detection bounding boxes and an additional mask branch to predict masks for objects inside the boxes.Reference [12] proposes a 2D-driven 3D object detection method, where they use hand-crafted features (hitograms based on point coordinates) to regress the position and pose of a 3D bounding box. Thanks to the advent of PointNet [13], a new possibility is provided to directly process native point clouds, which can directly learn features and identify objects in point clouds. [14] et al. used the latest deep point cloud 3D feature learning network PointNet [15] and proposed a more flexible and effective solution F-PointNet [16], by implementing 3D instance segmentation and finally obtaining 3D bounding boxes. It is estimated that experiments show that 3D segmentation in the point cloud can make the 3D localization clearer and more accurate. [17] By dividing the space into a series of small cubic grids, the point cloud of the cubic grid also uses the feature extraction method of PointNet and finally fills it into a space, using an end-to-end trainable deep neural network, intermediate features. The extraction stage adopts the form of 3D convolution and then uses 2D convolution by compressing the height dimension of the point cloud.PointRCNN [18] proposes a new way of generating 3D proposal candidate frames from point clouds. By semantically segmenting the point cloud, a bin-based localization method is used to determine the object’s location in the predicted foreground point, center point, while STD [19] proposes a method of taking each foreground point as the center of the object, using a spherical anchor to generate 3D region candidate proposals, and finally, by aggregating sparse point clouds into a more compact representation to predict the frame, further fine-tuning. [20] proposed a multitask learning framework to learn feature embeddings and orientation information of instance centers to better cluster points into instances.PointRCNN is a paper on 3D target detection in CVPR2019. The article uses two-stage approach, using PointNet++ as the backbone network, to first complete the segmentation task to determine the label of each 3D point. For each point divided into foreground, a box is generated using FEATURE. Then, the box is roi crop for the optimization of the box. The previous methods are to do the box on the basis of the detected object; the method mentioned in this paper is to predict the box for all points and then remove the box predicted by the background points, then the box generated by the foreground points left basically contains the detection target, and then filter and optimize from these boxes to get the final prediction box.


## 3. The Proposed Model

The algorithm in this paper is based on the improvement of the PointRCNN network [21] and improves the detection accuracy of the algorithm by fusing image information. PointRCNN is a point-based 3D object detection algorithm, which itself has two stages: in the first stage, PointRCNN extracts the semantic feature of each point through a network and then uses this feature to separate the foreground points and extract the preselected frame. In the second stage, by fusing the semantic features and classification confidence of the first stage, PointRCNN further refines the candidate frame proposed in the first stage and then uses nonmaximum suppression (NMS, nonmaximum suppression) to screen the candidate frame to obtain the final result [22]. The network framework of PointRCNN is shown in Figure 1.Figure 1
Framework of PointRCNN.After researching the network, this paper finds that when the network extracts foreground points, some background points have a similar appearance to the foreground points in the form of point cloud, which is prone to misjudgment or omission. Therefore, this paper proposes a way to fuse image information that improves this situation. Mainly by adding a point cloud classifier and an image classifier. The framework of this paper is shown in Figure2, where each stage is trained separately. In the next few chapters, this paper will first introduce the PointRCNN network; then, the method of fusing image information in this paper will be explained; then, the point cloud classifier and image classifier of this paper, as well as the corresponding model structure will be introduced; finally, the experimental verification will be carried out and the speed and accuracy of the above algorithm.Figure 2
Framework of 3D object detection combined with image.


### 3.1. PointRCNN Network

First, the network model needs to extract features from the point cloud data. In this paper, the PointNet network is chosen for feature extraction because it is fast and performs well in the semantic segmentation task. Next, foreground points and 3D preselected frames need to be extracted. The precursors themselves contain rich information that can be used to locate the position, size, and orientation of the target. The network model obtains the foreground points by learning semantic information [23]. Since this semantic information also helps to locate 3D bounding boxes, predicting both forespots and 3D preselected boxes can be mutually beneficial. For large outdoor site attraction clouds, the number of background points is much larger than the number of preattractions. Therefore, to solve the problem of positive and negative sample imbalance, focal is chosen for the foreground point prediction task in this paper. Loss is used as the classification loss, and its expression is shown in Equation (2).
(1)Lfocalpt=−αt1−ptγlogpt,(2)pt=p,pg=1,1−p,pg=0.In the preselected box regression task, PointRCNN needs to predict a preselected box for each foreground point. The preselected box is in the form ofx,y,z,w,l,h,θ, P stands for semantic value, x,y,z is the center coordinate of the preselected box, w,l,h is the size of the preselector, and θ is the orientation of the preselected box in the top view. To limit the range of generated preselection boxes, PointRCNN uses a patch-based regression loss.In order to predict the center coordinates of an object, PointRCNN divides the surrounding area under the top view of each foreground point into small blocks. Then, a one-dimensional search distanceS is set, and according to this distance and a fixed parameter δ, it is determined which small block different targets are located in the top view. A small block categorical cross-entropy loss is also used here, which can improve the accuracy and robustness of localization. The schematic diagram of the block-based regression method is shown in Figure 3.Figure 3
Figure of bin-based regressing method.For the regression loss ofx,y, it consists of two parts, one is the classification loss function of which patch the target center is located in, and the other is the regression loss of x,y relative to this patch. For the regression of the z value, since the fluctuation of the target in the z direction is not large, the regression loss function is directly used [24]. Therefore, the regression target can be obtained by Equation (4).
(3)binxp=xp−xp+Sδ,binyp=yp−yp+Sδ,(4)resupu∈x,z=1Cup−up+S−binup⋅δ+δ2,(5)resyp=yp−yp.xp,yp,zp is the coordinate of the foreground point of interest, xp,yp,zp is the center coordinate of the target corresponding to the point, binxp,binyp is the coordinate of the patch to which the label is mapped and is the distance of the point relative to the corresponding patch, and C is used for normalization parameter. For the parameter w,l,h, the smooth L1 loss function is directly used for regression, and the expression of the smooth L1 function is shown in Equation (6). For θ, first divide 2π into n parts, and then, as above, predict which part of binθp it belongs to and the angle value resθp relative to this part.
(6)SmoothL1x=0.5x2,ifx<1,x−0.5,otherwise.Therefore, the overall loss function is shown in Equations (6)–(7).
(7)Lbinp=∑u∈x,z,θFclsbin^up,binup+Fregres^up,resup,(8)Lresp=∑v∈y,h,w,lFregres^vp,binvp,(9)Lreg=1Npos∑p∈posLbinp+Lresp.Among them,Npos is the number of foreground points, bin^up and res^up are the predicted small block to which the point belongs and the corresponding deviation value, Fcls is the cross entropy loss, and Freg is the smooth L1 loss. In order to reduce redundant preselection boxes, in the training phase, this paper uses nonmaximum suppression algorithm to filter all preselection boxes. The 512 preselected boxes with the highest confidence are handed over to the second stage for refining. For the two preselected boxes b1 and b2, the calculation formula of IOU is shown in Equation (10), and its schematic diagram is shown in Figure 4. IOU is the area of the blue part divided by the area of the green part. In the prediction stage, a smaller number of preselected boxes are kept.
(10)IOU=b1∩b2b1∪b2.Figure 4
Image of IOU.After obtaining the preselected boxes in the first step, these preselected boxes need to be further refined to obtain more accurate bounding boxes. For any preselected boxbi=xi,yi,zi,hi,wi,li,θi, PointRCNN slightly expands it to obtain nearby semantic information, namely, bie=xi,yi,zi,hi+η,wi+η,li+η,θi.For any pointp=xp,yp,zp, see if it lies within bie. If true, keep the point. The feature of the point in the preselected box consists of the following parts: its three-dimensional coordinate xp,yp,zp, its laser point intensity R, the mask value mp obtained in the first stage, and the semantic information fp.The above features are global features. In order to further refine the preselection box, the point in positionbie and the corresponding target point are converted into a standard coordinate system. This coordinate system must meet the following conditions: (1) the origin is located in the center of the prediction box. (2) The X-axis and the Y-axis should be parallel to the ground, and the X-axis should point to the direction of the prediction frame; (3) The Z-axis should be consistent with the original coordinate axis. Through rotation and translation, all internal points are transferred to this coordinate system to extract good local features.Although this coordinate system can obtain local features well, it inevitably loses depth information. In order to preserve this information, a featuredp=xp2+yp2+zp2 is defined. Finally, connect rp,dp,mp as the final local feature, and use a multilayer perceptron for feature extraction to obtain a feature with the same dimension as the first stage fp. Then, concatenate this feature with fp to get a new feature. This feature is input into a network that extracts point cloud features to obtain the final refined 3D box and the confidence of the corresponding box. The box will participate in the final backpropagation only if the IOU of the label box, and the box is greater than a threshold.In terms of loss function, a loss function similar to that of the first stage is used here, but when the search distanceS is selected, a smaller search distance is selected. And, since all preselection boxes and annotations will be transformed into the standard coordinate system, that is, the preselection boxes bi=xi,yi,zi,hi,wi,li,θi and the annotation boxes bigt=xigt,yigt,zigt,higt,wigt,ligt,θigt will be transformed into Equations (11).
(11)b~i=0,0,0,hi,wi,li,0,(12)b~igt=xigt−xi,yigt−yi,zigt−zi,higt,wigt,ligt,θigt−θi.Therefore, the loss function of the second stage is shown in(13)Lrefine=1B∑i∈BFclsprobi,labeli+1B∑i∈BposL~bini+L~resi.Among them,B is the preselected box obtained in the first stage, Bpos is the number of positive samples predicted, probi is the confidence level of the prediction, labeli is the corresponding label, and the remaining parameters are similar to formula (7). Then, after sorting the confidence of the final prediction box result, the maximum value is suppressed, and the overlapping 3D boxes are filtered out to obtain the final result.


## 3.1. PointRCNN Network

First, the network model needs to extract features from the point cloud data. In this paper, the PointNet network is chosen for feature extraction because it is fast and performs well in the semantic segmentation task. Next, foreground points and 3D preselected frames need to be extracted. The precursors themselves contain rich information that can be used to locate the position, size, and orientation of the target. The network model obtains the foreground points by learning semantic information [23]. Since this semantic information also helps to locate 3D bounding boxes, predicting both forespots and 3D preselected boxes can be mutually beneficial. For large outdoor site attraction clouds, the number of background points is much larger than the number of preattractions. Therefore, to solve the problem of positive and negative sample imbalance, focal is chosen for the foreground point prediction task in this paper. Loss is used as the classification loss, and its expression is shown in Equation (2).
(1)Lfocalpt=−αt1−ptγlogpt,(2)pt=p,pg=1,1−p,pg=0.In the preselected box regression task, PointRCNN needs to predict a preselected box for each foreground point. The preselected box is in the form ofx,y,z,w,l,h,θ, P stands for semantic value, x,y,z is the center coordinate of the preselected box, w,l,h is the size of the preselector, and θ is the orientation of the preselected box in the top view. To limit the range of generated preselection boxes, PointRCNN uses a patch-based regression loss.In order to predict the center coordinates of an object, PointRCNN divides the surrounding area under the top view of each foreground point into small blocks. Then, a one-dimensional search distanceS is set, and according to this distance and a fixed parameter δ, it is determined which small block different targets are located in the top view. A small block categorical cross-entropy loss is also used here, which can improve the accuracy and robustness of localization. The schematic diagram of the block-based regression method is shown in Figure 3.Figure 3
Figure of bin-based regressing method.For the regression loss ofx,y, it consists of two parts, one is the classification loss function of which patch the target center is located in, and the other is the regression loss of x,y relative to this patch. For the regression of the z value, since the fluctuation of the target in the z direction is not large, the regression loss function is directly used [24]. Therefore, the regression target can be obtained by Equation (4).
(3)binxp=xp−xp+Sδ,binyp=yp−yp+Sδ,(4)resupu∈x,z=1Cup−up+S−binup⋅δ+δ2,(5)resyp=yp−yp.xp,yp,zp is the coordinate of the foreground point of interest, xp,yp,zp is the center coordinate of the target corresponding to the point, binxp,binyp is the coordinate of the patch to which the label is mapped and is the distance of the point relative to the corresponding patch, and C is used for normalization parameter. For the parameter w,l,h, the smooth L1 loss function is directly used for regression, and the expression of the smooth L1 function is shown in Equation (6). For θ, first divide 2π into n parts, and then, as above, predict which part of binθp it belongs to and the angle value resθp relative to this part.
(6)SmoothL1x=0.5x2,ifx<1,x−0.5,otherwise.Therefore, the overall loss function is shown in Equations (6)–(7).
(7)Lbinp=∑u∈x,z,θFclsbin^up,binup+Fregres^up,resup,(8)Lresp=∑v∈y,h,w,lFregres^vp,binvp,(9)Lreg=1Npos∑p∈posLbinp+Lresp.Among them,Npos is the number of foreground points, bin^up and res^up are the predicted small block to which the point belongs and the corresponding deviation value, Fcls is the cross entropy loss, and Freg is the smooth L1 loss. In order to reduce redundant preselection boxes, in the training phase, this paper uses nonmaximum suppression algorithm to filter all preselection boxes. The 512 preselected boxes with the highest confidence are handed over to the second stage for refining. For the two preselected boxes b1 and b2, the calculation formula of IOU is shown in Equation (10), and its schematic diagram is shown in Figure 4. IOU is the area of the blue part divided by the area of the green part. In the prediction stage, a smaller number of preselected boxes are kept.
(10)IOU=b1∩b2b1∪b2.Figure 4
Image of IOU.After obtaining the preselected boxes in the first step, these preselected boxes need to be further refined to obtain more accurate bounding boxes. For any preselected boxbi=xi,yi,zi,hi,wi,li,θi, PointRCNN slightly expands it to obtain nearby semantic information, namely, bie=xi,yi,zi,hi+η,wi+η,li+η,θi.For any pointp=xp,yp,zp, see if it lies within bie. If true, keep the point. The feature of the point in the preselected box consists of the following parts: its three-dimensional coordinate xp,yp,zp, its laser point intensity R, the mask value mp obtained in the first stage, and the semantic information fp.The above features are global features. In order to further refine the preselection box, the point in positionbie and the corresponding target point are converted into a standard coordinate system. This coordinate system must meet the following conditions: (1) the origin is located in the center of the prediction box. (2) The X-axis and the Y-axis should be parallel to the ground, and the X-axis should point to the direction of the prediction frame; (3) The Z-axis should be consistent with the original coordinate axis. Through rotation and translation, all internal points are transferred to this coordinate system to extract good local features.Although this coordinate system can obtain local features well, it inevitably loses depth information. In order to preserve this information, a featuredp=xp2+yp2+zp2 is defined. Finally, connect rp,dp,mp as the final local feature, and use a multilayer perceptron for feature extraction to obtain a feature with the same dimension as the first stage fp. Then, concatenate this feature with fp to get a new feature. This feature is input into a network that extracts point cloud features to obtain the final refined 3D box and the confidence of the corresponding box. The box will participate in the final backpropagation only if the IOU of the label box, and the box is greater than a threshold.In terms of loss function, a loss function similar to that of the first stage is used here, but when the search distanceS is selected, a smaller search distance is selected. And, since all preselection boxes and annotations will be transformed into the standard coordinate system, that is, the preselection boxes bi=xi,yi,zi,hi,wi,li,θi and the annotation boxes bigt=xigt,yigt,zigt,higt,wigt,ligt,θigt will be transformed into Equations (11).
(11)b~i=0,0,0,hi,wi,li,0,(12)b~igt=xigt−xi,yigt−yi,zigt−zi,higt,wigt,ligt,θigt−θi.Therefore, the loss function of the second stage is shown in(13)Lrefine=1B∑i∈BFclsprobi,labeli+1B∑i∈BposL~bini+L~resi.Among them,B is the preselected box obtained in the first stage, Bpos is the number of positive samples predicted, probi is the confidence level of the prediction, labeli is the corresponding label, and the remaining parameters are similar to formula (7). Then, after sorting the confidence of the final prediction box result, the maximum value is suppressed, and the overlapping 3D boxes are filtered out to obtain the final result.


## 4. Algorithms for Fusing Image Information

After studying PointRCNN in this paper, it is found that in the form of point clouds, some foreground points have similar appearance characteristics to background points, so it is difficult to distinguish. However, it can be easily distinguished from the image corresponding to the point cloud, so a third stage is added [25]. In the third stage, an algorithm that uses image information to enhance the confidence of the prediction frame is proposed to improve the accuracy of the algorithm. As shown in Figure 5, the green bounding box is the preselection box that the second stage and the third stage agree with high confidence, the red is the preselection box that the third stage thinks is high confidence, and the second stage is low confidence frame. It can be seen that the algorithm in this paper can effectively identify distant foreground points after adding image information and improve the confidence of these preselected boxes.Figure 5
Result figure of proposals with high confidence projected to image.The algorithm in this paper is a three-stage 3D target detection algorithm. After the second stage of PointRCNN, in order to improve the confidence of the second-stage preselected box, this paper adds a point cloud classifier and an image classifier in the third stage. By combining these two classifiers, the confidence of foreground boxes with similar appearance to the background is improved. This improves the recognition accuracy of the entire algorithm. After obtaining the preselected framebi from the first stage, for any point p=xp,yp,zp in the point cloud, it is also checked whether it is located in bi. If true, keep the point. The features of the points in the preselection box in the third stage are similar to those in the second stage and are composed of the following parts: its three-dimensional coordinate xp,yp,zp, its laser point intensity r, the mask value mp obtained in the first stage, and the semantics obtained in the second stage information fp. These point clouds are then directly fed into a multilayer perceptron to extract features and obtain the final classification confidence. In order to obtain better results here, a higher intersection ratio threshold than the second stage is set, that is, when the intersection ratio between the preselected box and the annotation on the bird’s eye view is greater than the threshold, it will be trained. In addition, this paper does not further regress the size of the preselected box, because the second stage of the algorithm has obtained a sufficiently accurate preselected box, and no further refinement is required. In order to improve the classification confidence, this paper uses the projection matrix in the annotation file to project the 3D prediction box into the corresponding images, as shown in Figure 6, and then convolves these images. In order to facilitate convolution and obtain outputs of the same size, this paper scales the corresponding images to the same resolution, as shown in Figure 7, and then uses the VGG-16 network for feature extraction. At the same time, the depth of the corresponding image frame is calculated and connected with the image features to obtain new features, and finally, a fully connected layer is used to obtain the classification confidence at the image level. The final classification confidence can be obtained by Equation (14).
(14)scorex,I=sigmoidpredx+clsx,I,(15)clsx,I=cls3Dregx+clsimgprojregx,I,depthregx.Figure 6
3D proposals and ROIs of image.
(a)
3D proposals(b)
ROIs of imageFigure 7
ROIs of resized image.Among them,score is the final classification confidence, x refers to the three-dimensional prediction frame, I is the corresponding image prediction frame, pred is the classifier of the second stage, cls is the classifier of the third stage, cls3D is the point of the third stage cloud classifier, clsimg is the image classifier of the third stage, prog is the projection operation, reg is the prediction box regressor of the second stage, and depth is the operation of calculating the depth.


## 5. Experimental Results and Analysis

The 3D detection results of the model in this paper on the KITTI validation set are compared with the detection results of the traditional 3D target detection algorithm. In this paper, according to the requirements of the KITTI official website, if the 3D intersection ratio between the detection frame and the label is higher than 0.7, the detection frame is considered to be successfully detected; otherwise, the detection is considered to fail. The detection results obtained by the model on the validation set according to the above principles are shown in Table1. It can be seen that the detection rate of the algorithm in this paper is higher than that of the original 3D target detection algorithm, but the algorithm speed is higher than that of the original 3D target detection algorithm and has declined. This is because the algorithm in this paper is based on points, and the three stages require repeated projection, mask operation, coordinate transformation, etc., which waste a lot of time. Experiments show that the detection accuracy of the algorithm is very high, but it also cannot meet the real-time requirements of automatic driving. The number of training and validation sets selected is 100.Table 1
The accuracy of the algorithm on the KITTI validation set.
AlgorithmSimple (%)Medium (%)Difficulty (%)Speed (ms)PointRCNN89.2078.8577.91157Algorithms for fusing image information89.7679.5178.58392In order to verify the effectiveness of each algorithm in this paper, the model is then subjected to stripping experiments, and the results are shown in Table2, where L refers to the original 3D target detection algorithm, I is the image classifier in the third stage, P refers to adding a point cloud classifier using the training method in this paper, and P refers to directly assigning the parameters of the second stage to the point cloud the way of the classifier. The results show that both the new point cloud classifier and the image classifier can effectively improve the detection accuracy of the algorithm.Table 2
The accuracy of the algorithm on the KITTI validation set for 3D objects.
AlgorithmSimple (%)Medium (%)Difficulty (%)L89.2078.8577.91L+P89.6179.2578.38L+P′89.5079.1078.20L+I89.6179.3178.25L+P+I89.7679.5178.58In order to analyze the impact of each classifier on the speed of the algorithm and the memory consumption, a comparative experiment is carried out in this paper, and the results are shown in Table3. It can be found that with the increase of the classifier, the memory and algorithm consumption time of the model increase. Among them, the point cloud classifier only occupies 8 MB of video memory, but the algorithm consumption time increases by 87 ms, indicating that the connection between each stage is time-consuming, while the image classifier consumes 2600 MB of memory, and the time also increases by 154 ms, indicating that image classifiers are time-consuming. It can be seen that the algorithm cannot meet the real-time requirements. The final detection results of this model are shown in Figures 8.Table 3
Effects of algorithms on video memory, speed, and accuracy 1.
AlgorithmDisplay memory usage (MB)Speed (ms)Accuracy (%) (medium)L199715478.85L+P200524179.25L+I459730879.31L+P+I461239279.51Figure 8
Result of 3D object detection combined with image.


## 6. Conclusion

To address the limitations of the overall framework of traditional 3D object detection algorithms, this paper investigates a point-based 3D object detection algorithm. In this paper, PointRCNN, a pure deep learning 3D object detection algorithm, is investigated. A third-level point cloud classifier and an image classifier are proposed to enhance the classification confidence. First, the network structure of PointRCNN is introduced and how it returns the target and refines it; then, the proposed point cloud classifier and image classifier are described in detail, including the network design, loss function; finally, model experiments are conducted to demonstrate that it can achieve a high detection accuracy of 79.51% (medium). The accuracy of the model is 0.66% higher than the baseline, which proves the effectiveness of the third level point cloud classifier and image classifier.



---

*Source: 6228797-2022-06-16.xml*