Point cloud data denoising method based on k near neighborhood division
A point cloud data, k-nearest neighbor technology, applied in image data processing, image analysis, instruments, etc., can solve problems such as time-consuming and memory consumption, and achieve the effect of improved computing efficiency and simple structure
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0080] This paper provides a point cloud data denoising method based on k-nearest neighbor division, which specifically includes the following steps:
[0081] Step 1: Use the cell method to spatially divide the point cloud data. Including the following steps:
[0082] Step 11: Determine the minimum bounding box of the point cloud data: Traverse all the point cloud data, read in the coordinates of the points, find out the maximum and minimum values of the point cloud data in the directions of the three coordinate axes of X, Y, and Z, respectively use x max 、x min 、y max 、y min ,z max ,z min Indicates that the total number of point clouds recorded at the same time is represented by N; with A(x min ,y min ,z min ), B(x min ,y max ,z min ), C(x max ,y max ,z min ), D(x max ,y min ,z min ), E(x min ,y min ,z max ), F(x min ,y max ,z max ), G(x max ,y max ,z max ), H(x max ,y min ,z max ) is a vertex, constructing a cube that can surround all point cl...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com