Point cloud data segmentation method based on spectral clustering

A point cloud data and spectral clustering technology, which is applied in image data processing, image analysis, instruments, etc., can solve problems such as slow running speed, over-segmentation, noise and density, and achieve the effect of improving processing speed

Active Publication Date: 2020-07-28
SOUTH CHINA UNIV OF TECH
View PDF4 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

This patented technology allows for faster processing without sacrificing accuracy or resolution compared to previous methods like grid models. It converts points clouds from different shapes onto graphs that are easier to analyze than traditional techniques such as histograms. Additionally, it considers both spatially varying characteristics (density) and rotational properties of each vertex's coordinate system. Overall, this method enhances image analysis capabilities while reducing computational time required.

Problems solved by technology

This patents describes different techniques for analyzing three dimensional points (such as laser radar) images from various sources such as aerial photography imagery. These analysis tools have limitations due to factors like complexity of shape recognition patterns, difficulty handling complicated environments containing irregularly shaped targets, high computational requirements, etc., which makes them difficult to use effectively without excessive processing times.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Point cloud data segmentation method based on spectral clustering
  • Point cloud data segmentation method based on spectral clustering
  • Point cloud data segmentation method based on spectral clustering

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0057] A point cloud data segmentation method based on spectral clustering, such as figure 1 shown, including the following steps:

[0058] Step 1: Read the input point cloud data set and the number of clusters m;

[0059] Step 2: Normalize the coordinates of the point cloud data set;

[0060] Further, the coordinate normalization process in the step 2 is as follows:

[0061] Step 2.1: Move the origin of the point cloud dataset to the center of gravity, the calculation formula is:

[0062]

[0063] Among them, (x 0 ,y 0 ,z 0 ) represents the center of gravity of the point cloud, (x i ,y i ,z i ) means point p i coordinate of;

[0064] Step 2.2: Put each point p i The coordinates (x i ,y i ,z i ) minus the point cloud center of gravity (x 0 ,y 0 ,z 0 ) to get the new coordinates of the point cloud dataset (x i ',y i ',z i '), calculated as follows:

[0065] (x i ,y i ,z i )←(x i ,y i ,z i )-g(x 0 ,y 0 ,z 0 ) (2)

[0066] Step 2.3: Calculate t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a point cloud data segmentation method based on spectral clustering . The method comprises the following steps of reading an input point cloud data set and a clustering number;normalizing the coordinates of the point cloud data set to obtain normalized coordinates; constructing a similar matrix by normalizing the coordinates, calculating a Laplacian matrix Lrw, and calculating minimum m + 2 eigenvalues and eigenvectors f corresponding to the minimum m + 2 eigenvalues; standardizing a matrix formed by the feature vectors f according to rows to obtain a feature matrix F;taking each row in the feature matrix F as an m + 2-dimensional sample, obtaining m clusters from the samples by using a K-means clustering method, and outputting the m clusters; the method solves aproblem that a conventional point cloud segmentation result is not fine enough, maintains the invariance of the segmentation result for the translation, rotation and zooming of the point cloud data, and is also suitable for point cloud data or sparse data with non-uniform density.

Description

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Owner SOUTH CHINA UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products