Graph theory based three-dimensional point cloud data plane extracting method
A technology of 3D point cloud and data plane, which is applied in the field of 3D point cloud data plane extraction based on graph theory to achieve the effect of improving accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0029] A 3D point cloud data plane extraction method based on graph theory, the method first constructs a graph, each vertex in the graph corresponds to a data point in the 3D point cloud, and the edges on the graph pass through K-nearest neighbors (K-Nearest Neighbor, KNN) algorithm is calculated; Simultaneously, calculate the plane normal vector of each point in the three-dimensional point cloud, the present embodiment uses a kind of weighted local plane fitting method to estimate the plane normal vector of each point.
[0030] Then, calculate the weight value corresponding to each edge in the graph, that is, the normal vector difference between the two vertices corresponding to each edge, and arrange all the edges in ascending order of weight value, so that the edge with the smaller normal vector difference will be ranked In the front; at the same time, assign an initial threshold to each vertex in the graph.
[0031] Next, for each edge on the graph, if the corresponding t...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 