# Intelligent Point Cloud Edge Detection Method Based on Projection Transformation

Authors: Juan Zhu; Xiaofeng Yue; Jipeng Huang; Zongwei Huang
Journal: Wireless Communications and Mobile Computing
 (2021)

---

## Abstract

An edge detection method based on projection transformation is proposed. First, the vertical projection transformation is carried out on the target point cloud. DataX and data Y are normalized to the width and height of the image, respectively. Data Z is normalized to the range of 0-255, and the depth represents the gray level of the image. Then, the Canny algorithm is used to detect the edge of the projection transformed image, and the detected edge data is back projected to extract the edge point cloud in the point cloud. Evaluate the performance by calculating the normal vector of the edge point cloud. Compared with the normal vector of the whole data point cloud of the target, the normal vector of the edge point cloud can well express the characteristics of the target, and the calculation time is reduced to 10% of the original.


---

## Body

## 1. Introduction

As a key automation technology, machine vision is very important to the modernization of the economy. Machine vision has been widely studied by scholars. Machine vision uses machines to measure the size of target or detect the surface of target instead of eyes. Machine vision mainly uses computers to simulate the function of human visual and reproduce certain intelligent behaviors related to human vision. Information is extracted from the image of an objective object, processed and understood, and finally used for practical detection and control. Machine vision started from statistical pattern recognition in the 1950s. The main work is focused on two-dimensional image analysis, recognition, and understanding. In recent years, various noncontact research results emerged [1–4]. Machine vision in the industrial field can be divided into four aspects. Surface detection is always used in product quality inspection and product classification. A camera and a robot are combined to package products. Feature detection is always used in robot positioning. Civil Machine Vision Technology is widely used in intelligent transportation, safety protection, character recognition, identity verification, medical equipment, etc. In the field of scientific research, machine vision can be used for material analysis, biological analysis, chemical analysis, and life science. In the military field, it can be used in aerospace, aviation, weapons, and mapping. Its technology mainly includes image processing, mechanical engineering, control, and optical imaging.With the rapid development of 3D acquisition technology, 3D sensors are becoming more available and affordable, including various types of 3D scanners, LiDAR, and RGB-D cameras (such as Kinect, RealSense, and Apple depth cameras). The 3D data from these sensors can provide rich geometry, shape, and scale information. Complementing 2D images, 3D data provides an opportunity to better understand the environment around the machine. 3D data can often be represented in different formats, including depth images, point clouds, grids, and volumetric grids. As a common format, the point cloud representation preserves the original geometry in 3D space without any discretization. It is the preferred notation for understanding related applications in many scenarios. 3D point cloud detection is widely researched by scholars. Ali et al. [5] build on the success of the one-shot regression meta-architecture in the 2D perspective image space and extend it to generate oriented 3D object bounding boxes from LiDAR point cloud. Zhou et al. [6] remove the need of manual feature engineering for 3D point clouds and propose VoxelNet, a generic 3D detection network that unifies feature extraction and bounding box prediction into a single-stage, end-to-end trainable deep network. Meyer et al. [7] present LaserNet, a computationally efficient method for 3D object detection from LiDAR data for autonomous driving. Beltran et al. [8] present a LiDAR-based 3D object detection pipeline entailing three stages. Minemura et al. [9] employ dilated convolutions to gradually increase the perceptive field as depth increases; this helps to reduce the computation time by about 30%. Asvadi et al. [10] address the problem of vehicle detection using Deep Convolutional Neural Network (ConvNet) and 3D-LIDAR data with application in advanced driver assistance systems and autonomous driving. Propose a vehicle detection system based on the Hypothesis Generation (HG) and Verification (HV) paradigms. Simon et al. [11] propose a specific Euler-Region-Proposal Network (E-RPN) to estimate the pose of the object by adding an imaginary and real fraction to the regression network.Edge detection is a key technology to detect the target [12]. Most of the information of the image exists in the edge of the image, which is mainly represented by the discontinuity of the local features of the image. Edge detection is first proposed for a two-dimensional digital image; the purpose is to identify and detect the position where the image characteristics change [13]. Point cloud edge refers to some edge measurement points that can express the target features. Point cloud edge can not only express the geometric characteristics of the object but also play an important role in the quality and accuracy of object recognition and surface model reconstruction [14, 15]. As an important research field of image analysis and computer vision, edge detection has attracted the attention of many scholars. A variety of mature edge detection algorithms have been developed.Different point cloud data models have different edge feature extraction methods, which can be roughly divided into grid-based and scattered point cloud-based feature extraction methods [16, 17]. In feature extraction based on mesh, firstly, the point cloud is gridded, and then, the edge features of the point cloud are obtained by traversing the triangulated point cloud and threshold constraints. Among them, the most famous algorithm of Delaunay is simple and intuitive. But in the process of triangulation, we need to evaluate the Euclidean distance between point clouds. If the Euclidean distance is not suitable, holes will be generated. In addition, if the method is applied to three-dimensional point clouds, it needs to use the normal direction of each point cloud to determine the projection direction, so the algorithm is more suitable for uniform and smooth point clouds. The feature extraction based on scattered point cloud mainly extracts some regular points, lines, surfaces, and other features from this type of point cloud, so it pays more attention to local features. Song et al. [18] take the vector of each point in the point cloud and the vector of K adjacent points as the root mean square as the standard of edge feature extraction, although this method well reflects the relationship between the normal direction of each point in the point cloud and its adjacent points, the nonedge points adjacent to the edge will be detected in the result of edge extraction. Han et al. [19] keep the edge feature by using the feature that the normal direction of the boundary point is different from the nonboundary normal direction, but the density of the edge is the same as that of the nonedge part. Chen et al. [20] proposed a feature extraction algorithm with multiparameter constraints. Feature points are determined by normal, curvature, and Euclidean distance. In [21, 22], principal component analysis (PCA) and normal method were used to extract edge feature points.Referring to the edge detection algorithm of two-dimensional image, this paper proposes a Canny operator based on projection transformation for edge detection of point cloud data and obtains the normal vector of the edge point cloud after edge detection. The point cloud can better reflect the characteristics of the target, and the speed of solving the normal vector is greatly improved. Compared with the normal vector of the whole data point cloud of the target, the normal vector of the edge point cloud can well express the characteristics of the target, and the calculation time is reduced to 10% of the original.


## 2. Methodology Vertical Projection of Point Data

Projection transformation is the process of transforming the coordinates of one map projection point into the coordinates of another map projection point. 3D point cloud is a massive set of points that express the spatial distribution and surface characteristics of targets in the same spatial reference system. It is a collection of points after obtaining the spatial coordinates of each sampling point on the object surface. Compared with a 2D image, 3D point cloud usually only hasX,Y,Z coordinate information. Its spatial information is redundant to a 2D image. The corresponding geometric structure is more complex, and the neighbour structure of point cloud data is more complex.In this paper, the Canny edge detection algorithm based on projection transformation is proposed to detect the edge of point cloud data. The point cloud data is projected along the vertical direction to the XY two-dimensional plane, and the projected point cloud data is normalized. TheX direction represents the width, the Y direction represents the height, and the Z value represents the gray value of the pixel in the image. The edge of the transformed data is detected, and then, the final edge point cloud is obtained by inverse transformation.Supposing the number of point clouds ism, all point clouds are represented as
(1)P=x1,x2,⋯,xmy1,y2,⋯,ymz1,z2,⋯,zm.Here,Pi=xi,yi,ziT is the three-dimensional coordinates of point i.The point cloud data is vertically projected in theZ direction, and the Z value is converted into the depth value of the current point. The projected point set is expressed as
(2)fxi,yi=zi.For the projected point set, the maximum value and minimum value ofX and Y directions are counted, which are marked as follows: xmin, xmax, ymin, and ymax. The X,Y axis data is quantized into a form corresponding to the image width W and height H. Then, the abscissa and ordinate of xi,yi are as
(3)i=W∗xi−xminxmax−xmin+1,(4)j=H∗yi−yminymax−ymin+1.A linear transformation is performed on the matrixzi. In order to realize the corresponding relationship between point cloud and image, statistically, the minimum and maximum values of Z are marked as follows: zmin and zmax. The Z value is linearly transformed to the range of 100~255. For a coordinate where there is no point cloud, it is represented by 0. The Z value is like the gray value of an image. The projection transformation is shown in
(5)grayzi=100+zi−zmin∗155zmax−zmin.The point set after quantization is expressed as(6)fi,j=grayzi.As an example, the industrial part target is vertically projected, and the projection result is shown in Figure1.Figure 1
Target point cloud and vertical projection.
(a)
Original target of tee(b)
Point cloud of tee(c)
Vertical projection of tee(d)
Original target—elbow(e)
Point cloud of elbow(f)
Vertical projection of elbowFigures1(a) and 1(d) are the original target of tee and elbow. Figures 1(b) and 1(e) are the point cloud of tee and elbow. Figures 1(c) and 1(f) are the vertical projection of tee and elbow. Because the angle of view is the Z direction when shooting the target, the data shape of the target point cloud data after vertical projection in the Z direction is consistent with the original image features.


## 3. Edge Detection with Canny Operator

Canny edge detection was first proposed by John Canny in the paper with a computational approach to edge detection in 1986. Canny edge detection is a technology to extract useful structural information from different visual objects and greatly reduce the amount of data to be processed. It has been widely used in various computer vision systems. Canny found that the requirements of edge detection in different vision systems are similar, so it can achieve a widely used edge detection technology. The Canny algorithm is based on three basic objectives. (1) In the low error rate, all edges should be found with no pseudoresponse. Capture as many edges as possible in the image as accurately as possible. (2) The detected edge should be accurately located in the center of the real edge. (3) In single edge point response, the detector should not point out multiple pixel edges where there is only one single edge point. In order to meet these requirements, Canny uses the variation method. The optimal function in Canny detector is described by the sum of four exponential terms, which can be approximated by the first derivative of Gaussian function. The Canny edge detection algorithm can be divided into the following five steps. (1) Gaussian filter is used to smooth the image and remove the noise. (2) Calculate the gradient intensity and direction of each pixel point in the image. (3) Nonmaximum suppression is applied to eliminate the spurious response caused by edge detection. (4) Double threshold detection is applied to determine real and potential edges. (5) Finally, the edge detection is completed by suppressing the isolated weak edge.


### 3.1. Gaussian Smoothing

Gaussian smoothing is a 2D convolution operation, which is applied to blurred images to remove details and noise. In order to reduce the influence of noise on the result of edge detection as much as possible, the noise must be filtered to prevent false detection caused by noise. In order to smoothen the image, Gaussian filter is used to convolute the image. In this step, the image is smoothed to reduce the obvious noise effect on the edge detector. The generation equation of Gaussian filter kernel with size of2k+1∗2k+1 is given by
(7)Hij=12πσ2e−i−k+12+j−k+12/2σ2,1≤i,j≤2k+1.Here,σ is the standard deviation of the distribution K=i+j. Assume that the mean of the distribution is 0; that is, its center is on the line x=0. The distribution of two-dimension Gaussian filter kernel is shown in Figure 2.Figure 2
Distribution of 2D Gaussian filter kernel.Whenσ=1.4, k=i, and the size of Gaussian filter kernel is 3∗3, the corresponding Gauss kernel is shown in
(8)0.09240.11920.09240.11920.15380.11920.09240.11920.0924.Whenσ=1.4, k=2, and the size of Gaussian filter kernel is 5∗5, the corresponding Gauss kernel is shown in
(9)0.01050.02270.02930.02270.01050.02270.09240.11920.09240.02270.02930.11920.15380.11920.02930.02270.09240.11920.09240.02270.01050.02270.02930.02270.0105.Whenσ=2, k=1, and the size of Gaussian filter kernel is 3∗3, the corresponding Gauss kernel is shown in
(10)0.03100.03510.03100.03510.03980.03510.03100.03510.0310.Whenσ=2, k=2, and the size of Gaussian filter kernel is 5∗5, the corresponding Gauss kernel is shown
(11)0.04160.02130.02410.02130.04160.02130.03100.03510.03100.02130.02410.03510.03980.03510.02410.02130.03100.03510.03100.02130.04160.02130.02410.02130.0416.The choice of Gaussian convolution kernel size will affect the performance of Canny detector. The larger the size, the lower the sensitivity of the detector to noise, but the positioning error of edge detection will increase slightly.If a3∗3 window in the image is f and the Pixel to be filtered is fi,j, then after Gauss filtering, the value of pixel fi,j is shown in
(12)fi,j=H∗f=h11h12h13h21h22h23h31h32h33∗fi−1,j−1fi−1,jfi−1,j+1fi,j−1fi,jfi,j+1fi+1,j−1fi+1,jfi+1,j+1.In equation (12), ∗ is a convolution symbol.


### 3.2. Calculate the Intensity and Direction of the Gradient

Using a discrete difference operator, convolution operation is carried out from thex-axis and y-axis, respectively. The gray change value and direction in the horizontal and vertical directions are obtained. Determine the gradient amplitude and direction with
(13)Mi,j=Gx2i,j+Gy2i,j,(14)θi,j=arctanGyi,jGxi,j.Here,Gxi,j and Gyi,j are the first derivatives of horizontal and vertical directions, respectively. Suppose Gx and Gy are the Sobel operators which are shown in
(15)Gx=−101−202−101,Gy=−1−2−1000121,where Gx is the Sobel operator in the x direction, which is used to detect the edge in the y direction and Gy is the Sobel operator in the y direction, which is used to detect the edge in the x direction (edge direction is perpendicular to gradient direction). Gxi,j and Gyi,j are the convolution of GxGy and the image data. The calculation formula is shown in
(16)Gxi,j=−1∗fi−1,j−1−2∗fi,j−1−fi+1,j−1+fi−1,j+1+2∗fi,j+1+2∗fi+1,j+1,(17)Gyi,j=−1∗fi−1,j−1−2∗fi−1,j−fi−1,j+1+fi+1,j−1+2∗fi+1,j+2∗fi+1,j+1.


### 3.3. Nonmaximum Suppression

Nonmaximum suppression is a kind of edge sparsity technology. The effect of nonmaximum suppression lies in the “thin” edge. After calculating the gradient of the image, the edge extracted only based on the gradient value is still very fuzzy. The edge should have only one accurate response. Nonmaximum suppression can help to suppress all gradient values except local maximum to 0. The algorithm of nonmaximum suppression for each pixel in gradient image is as follows. (1) The gradient intensity of the current pixel is compared with two pixels along the positive and negative gradient direction. (2) If the gradient intensity of the current pixel is the largest compared with the other two pixels, the pixel will remain as the edge point; otherwise, the pixel will be suppressed.


### 3.4. Double Threshold Detection and Suppress Isolated Low Threshold Points

In order to delete the edge pixels that are caused by noise, delete the edge pixels with weak gradient, and retain edge pixels with high gradient through selecting high and low thresholds. The gradient of weak edge pixel is less than the high threshold and greater than the low threshold that should be suppressed.Generally, weak edge pixels caused by real edges are connected to strong edge pixels, but noise response is not connected, in order to track the edge connection, by looking at the weak edge pixel and its eight neighbours. When one of them is a strong edge pixel, the weak edge point can be retained as a real edge.Edge detection is performed on the image after the point cloud is vertically projected, and the result is shown in Figure3.Figure 3
Edge detection of vertical projection images.
(a)
Vertical projection of tee(b)
Edge of tee(c)
Vertical projection of elbow(d)
Edge of elbowFigures3(a) and 3(c) are the vertical projection images of tee and elbow. Figures 3(b) and 3(d) are the edges of vertical projection images. Through edge detection, the edge feature of target can be detected. Compared with the target point cloud, the edge feature can represents the target very well and the point number is reduced greatly.


## 3.1. Gaussian Smoothing

Gaussian smoothing is a 2D convolution operation, which is applied to blurred images to remove details and noise. In order to reduce the influence of noise on the result of edge detection as much as possible, the noise must be filtered to prevent false detection caused by noise. In order to smoothen the image, Gaussian filter is used to convolute the image. In this step, the image is smoothed to reduce the obvious noise effect on the edge detector. The generation equation of Gaussian filter kernel with size of2k+1∗2k+1 is given by
(7)Hij=12πσ2e−i−k+12+j−k+12/2σ2,1≤i,j≤2k+1.Here,σ is the standard deviation of the distribution K=i+j. Assume that the mean of the distribution is 0; that is, its center is on the line x=0. The distribution of two-dimension Gaussian filter kernel is shown in Figure 2.Figure 2
Distribution of 2D Gaussian filter kernel.Whenσ=1.4, k=i, and the size of Gaussian filter kernel is 3∗3, the corresponding Gauss kernel is shown in
(8)0.09240.11920.09240.11920.15380.11920.09240.11920.0924.Whenσ=1.4, k=2, and the size of Gaussian filter kernel is 5∗5, the corresponding Gauss kernel is shown in
(9)0.01050.02270.02930.02270.01050.02270.09240.11920.09240.02270.02930.11920.15380.11920.02930.02270.09240.11920.09240.02270.01050.02270.02930.02270.0105.Whenσ=2, k=1, and the size of Gaussian filter kernel is 3∗3, the corresponding Gauss kernel is shown in
(10)0.03100.03510.03100.03510.03980.03510.03100.03510.0310.Whenσ=2, k=2, and the size of Gaussian filter kernel is 5∗5, the corresponding Gauss kernel is shown
(11)0.04160.02130.02410.02130.04160.02130.03100.03510.03100.02130.02410.03510.03980.03510.02410.02130.03100.03510.03100.02130.04160.02130.02410.02130.0416.The choice of Gaussian convolution kernel size will affect the performance of Canny detector. The larger the size, the lower the sensitivity of the detector to noise, but the positioning error of edge detection will increase slightly.If a3∗3 window in the image is f and the Pixel to be filtered is fi,j, then after Gauss filtering, the value of pixel fi,j is shown in
(12)fi,j=H∗f=h11h12h13h21h22h23h31h32h33∗fi−1,j−1fi−1,jfi−1,j+1fi,j−1fi,jfi,j+1fi+1,j−1fi+1,jfi+1,j+1.In equation (12), ∗ is a convolution symbol.


## 3.2. Calculate the Intensity and Direction of the Gradient

Using a discrete difference operator, convolution operation is carried out from thex-axis and y-axis, respectively. The gray change value and direction in the horizontal and vertical directions are obtained. Determine the gradient amplitude and direction with
(13)Mi,j=Gx2i,j+Gy2i,j,(14)θi,j=arctanGyi,jGxi,j.Here,Gxi,j and Gyi,j are the first derivatives of horizontal and vertical directions, respectively. Suppose Gx and Gy are the Sobel operators which are shown in
(15)Gx=−101−202−101,Gy=−1−2−1000121,where Gx is the Sobel operator in the x direction, which is used to detect the edge in the y direction and Gy is the Sobel operator in the y direction, which is used to detect the edge in the x direction (edge direction is perpendicular to gradient direction). Gxi,j and Gyi,j are the convolution of GxGy and the image data. The calculation formula is shown in
(16)Gxi,j=−1∗fi−1,j−1−2∗fi,j−1−fi+1,j−1+fi−1,j+1+2∗fi,j+1+2∗fi+1,j+1,(17)Gyi,j=−1∗fi−1,j−1−2∗fi−1,j−fi−1,j+1+fi+1,j−1+2∗fi+1,j+2∗fi+1,j+1.


## 3.3. Nonmaximum Suppression

Nonmaximum suppression is a kind of edge sparsity technology. The effect of nonmaximum suppression lies in the “thin” edge. After calculating the gradient of the image, the edge extracted only based on the gradient value is still very fuzzy. The edge should have only one accurate response. Nonmaximum suppression can help to suppress all gradient values except local maximum to 0. The algorithm of nonmaximum suppression for each pixel in gradient image is as follows. (1) The gradient intensity of the current pixel is compared with two pixels along the positive and negative gradient direction. (2) If the gradient intensity of the current pixel is the largest compared with the other two pixels, the pixel will remain as the edge point; otherwise, the pixel will be suppressed.


## 3.4. Double Threshold Detection and Suppress Isolated Low Threshold Points

In order to delete the edge pixels that are caused by noise, delete the edge pixels with weak gradient, and retain edge pixels with high gradient through selecting high and low thresholds. The gradient of weak edge pixel is less than the high threshold and greater than the low threshold that should be suppressed.Generally, weak edge pixels caused by real edges are connected to strong edge pixels, but noise response is not connected, in order to track the edge connection, by looking at the weak edge pixel and its eight neighbours. When one of them is a strong edge pixel, the weak edge point can be retained as a real edge.Edge detection is performed on the image after the point cloud is vertically projected, and the result is shown in Figure3.Figure 3
Edge detection of vertical projection images.
(a)
Vertical projection of tee(b)
Edge of tee(c)
Vertical projection of elbow(d)
Edge of elbowFigures3(a) and 3(c) are the vertical projection images of tee and elbow. Figures 3(b) and 3(d) are the edges of vertical projection images. Through edge detection, the edge feature of target can be detected. Compared with the target point cloud, the edge feature can represents the target very well and the point number is reduced greatly.


## 4. Back Projection Transform of Edge Detection Data

In order to express the three-dimensional information of edge points, the edge detection data is back projected to the origin cloud. The points in the edge map after projection transformation of point cloud are represented asfi,j, in which i is the horizontal ordinate. The value range is 1~W. j is the vertical ordinate. The value range is 1~H. When fi,j=1, that means the point is the edge point. The corresponding point in point cloud should be found. First, calculate the x and y of point cloud. The transformation method is as follows:
(18)xi=i−1∗xmax−xminW+xmin,(19)yi=j−1∗ymax−yminH+ymin.In the origin point cloud data, search the horizontal ordinate and vertical ordinate. Then, mark the points as edge points. The search code is as follows:Code 1
pc=[];for i=1:km = find(abs(f(:,1)-newx(i))<0.1);n = find(abs(f(:,2)-newy(i))<0.1);R = intersect(m(:),n(:));[a,b]=size(R);if a&&bfor j=1:atemp(j,1)=f(R(j),1);temp(j,2)=f(R(j),2);temp(j,3)=f(R(j),3);endpc=[pc;temp];endendThe effect of the edge point cloud after the inverse transformation of the edge points is shown in Figure4, in which gray represents the target and red represents the edge point cloud.Figure 4
Back projection transform of edge detection data.
(a)
Point cloud of tee(b)
Edge point cloud of tee(c)
Point cloud of elbow(d)
Edge point cloud of elbowFigures4(a) and 4(c) are the point cloud of tee and elbow. Figures 4(b) and 4(d) are the edge point cloud of them. Calculate the number of original point and edge point. The number is shown in Table 1.Table 1
The number of original point and edge point.
Target typeOriginal pointEdge pointTee64798460015Elbow52091553353The edge point of each target is around 10% of the original point. After extracting the edge points, it can provide a reliable basis for the subsequent point cloud normal vector calculation and point cloud registration.


## 5. Normal Vector Calculation of Edge Points Based on PCA

After edge detection, the normal vector of the local fitting plane is taken as the normal vector of the point. Suppose the edge point isPi=xi,yi,ziT, K-Neighbourhood search in origin cloud dataset. Calculate the best fit plane Ax+By+Cz−D=0. Here, A,B,C is the normal vector of a plane equation. D represents the distance from the origin to the plane, A2+B2+C2=1, and D>0. The distance from each point to the plane is di=Axi+Byi+Czi−d. The sum of the distance from each point to the best fit plane is the smallest, that is,
(20)e=∑i=1ndi2⟶min.The normal vector estimation of the edge point cloud is shown in Figure5.Figure 5
Normal vector of tee and elbow.
(a)
Point cloud of tee(b)
Normal vector of point cloud of tee(c)
Edge point cloud of tee(d)
Normal vector of edge point cloud of tee(e)
Point cloud of elbow(f)
Normal vector of point cloud of elbow(g)
Edge point cloud of elbow(h)
Normal vector of edge point cloud of elbowBecause the number of points corresponding to edge features is greatly reduced, the calculation time of using edge features to calculate normal vector is also greatly shortened. The calculation time is shown in Table2.Table 2
The calculation time of normal vector.
Order numberTargetCalculation time (s)1Point cloud of tee53.032Edge point cloud of tee4.943Point cloud of elbow42.034Edge point cloud of elbow4.37It can be seen from the figure that compared with the normal vector of all data point clouds of the target, the normal vector of the edge point cloud can well express the characteristics of the target, and the processing time of the tee target is reduced from 53.03 s to 4.94 s, and the elbow target is reduced from 42.03 s to 4.37 s, which is around 10% of the original.


## 6. Conclusions

The data of point cloud is large and contains a lot of invalid information. It is very important to extract the characteristics of point cloud. Edge features can well express the geometric features of the target, so it is very important to extract edge point cloud. This paper proposes an edge detection algorithm based on projection transformation. Firstly, the target point cloud is projected vertically. Then, the Canny algorithm is used to detect the edge of the image. The detected edge data is back projected to extract the edge point cloud. By calculating the normal vector of the edge point cloud, compared with the normal vector of the whole data point cloud of the target, the normal vector of the edge point cloud can well express the characteristics of the target, and the calculation time is reduced to 10% of the original, which greatly saves the calculation time. This paper only detects 3D tee and elbow. Give the advantages of edge features in normal vector calculation. The advantages of edge point cloud in point cloud matching need to be further studied.



---

*Source: 2706462-2021-12-21.xml*