Multi-scale Information Extraction Residual Network for 3D Point Clouds Classification

2020 ◽  
Author(s):  
Yumei Li ◽  
Shan Meng ◽  
Daoyuan Liang
Keyword(s):  
Information Extraction ◽  
Point Clouds ◽  
Residual Network ◽  
Multi Scale ◽  
3D Point Clouds

scholarly journals An Inverse Node Graph-Based Method for the Urban Scene Segmentation of 3D Point Clouds

2021 ◽  
Vol 13 (15) ◽  
pp. 3021
Author(s):  
Bufan Zhao ◽  
Xianghong Hua ◽  
Kegen Yu ◽  
Xiaoxing He ◽  
Weixing Xue ◽  
...  
Keyword(s):  
Semantic Segmentation ◽  
Point Clouds ◽  
Intelligent Vehicles ◽  
Critical Data ◽  
Multi Scale ◽  
3D Point Clouds ◽  
Cluster Optimization ◽  
Urban Scene ◽  
Processing Steps

Urban object segmentation and classification tasks are critical data processing steps in scene understanding, intelligent vehicles and 3D high-precision maps. Semantic segmentation of 3D point clouds is the foundational step in object recognition. To identify the intersecting objects and improve the accuracy of classification, this paper proposes a segment-based classification method for 3D point clouds. This method firstly divides points into multi-scale supervoxels and groups them by proposed inverse node graph (IN-Graph) construction, which does not need to define prior information about the node, it divides supervoxels by judging the connection state of edges between them. This method reaches minimum global energy by graph cutting, obtains the structural segments as completely as possible, and retains boundaries at the same time. Then, the random forest classifier is utilized for supervised classification. To deal with the mislabeling of scattered fragments, higher-order CRF with small-label cluster optimization is proposed to refine the classification results. Experiments were carried out on mobile laser scan (MLS) point dataset and terrestrial laser scan (TLS) points dataset, and the results show that overall accuracies of 97.57% and 96.39% were obtained in the two datasets. The boundaries of objects were retained well, and the method achieved a good result in the classification of cars and motorcycles. More experimental analyses have verified the advantages of the proposed method and proved the practicability and versatility of the method.

scholarly journals Recognizing Objects in 3D Point Clouds with Multi-Scale Local Features

Sensors ◽  
2014 ◽  
Vol 14 (12) ◽  
pp. 24156-24173 ◽  
Author(s):  
Min Lu ◽  
Yulan Guo ◽  
Jun Zhang ◽  
Yanxin Ma ◽  
Yinjie Lei
Keyword(s):  
Point Clouds ◽  
Local Features ◽  
Multi Scale ◽  
3D Point Clouds

scholarly journals MULTI-SCALE BASED EXTRACION OF VEGETATION FROM TERRESTRIAL LiDAR DATA FOR ASSESSING LOCAL LANDSCAPE

2015 ◽  
Vol II-3/W4 ◽  
pp. 263-270 ◽  
Author(s):  
T. Wakita ◽  
J. Susaki
Keyword(s):  
Urban Areas ◽  
Three Dimensional ◽  
Point Clouds ◽  
Lidar Data ◽  
Data Sets ◽  
Landscape Index ◽  
Terrestrial Lidar ◽  
Multi Scale ◽  
3D Point Clouds ◽  
Set Of Points

In this study, we propose a method to accurately extract vegetation from terrestrial three-dimensional (3D) point clouds for estimating landscape index in urban areas. Extraction of vegetation in urban areas is challenging because the light returned by vegetation does not show as clear patterns as man-made objects and because urban areas may have various objects to discriminate vegetation from. The proposed method takes a multi-scale voxel approach to effectively extract different types of vegetation in complex urban areas. With two different voxel sizes, a process is repeated that calculates the eigenvalues of the planar surface using a set of points, classifies voxels using the approximate curvature of the voxel of interest derived from the eigenvalues, and examines the connectivity of the valid voxels. We applied the proposed method to two data sets measured in a residential area in Kyoto, Japan. The validation results were acceptable, with F-measures of approximately 95% and 92%. It was also demonstrated that several types of vegetation were successfully extracted by the proposed method whereas the occluded vegetation were omitted. We conclude that the proposed method is suitable for extracting vegetation in urban areas from terrestrial light detection and ranging (LiDAR) data. In future, the proposed method will be applied to mobile LiDAR data and the performance of the method against lower density of point clouds will be examined.

scholarly journals PCEDNet: A Lightweight Neural Network for Fast and Interactive Edge Detection in 3D Point Clouds

2022 ◽  
Vol 41 (1) ◽  
pp. 1-21
Author(s):  
Chems-Eddine Himeur ◽  
Thibault Lejemble ◽  
Thomas Pellegrini ◽  
Mathias Paulin ◽  
Loic Barthe ◽  
...  
Keyword(s):  
Neural Network ◽  
Network Architecture ◽  
Point Clouds ◽  
Scale Space ◽  
Neural Network Architecture ◽  
Multi Scale ◽  
3D Point Clouds ◽  
Space Matrix ◽  
Processing Point

In recent years, Convolutional Neural Networks (CNN) have proven to be efficient analysis tools for processing point clouds, e.g., for reconstruction, segmentation, and classification. In this article, we focus on the classification of edges in point clouds, where both edges and their surrounding are described. We propose a new parameterization adding to each point a set of differential information on its surrounding shape reconstructed at different scales. These parameters, stored in a Scale-Space Matrix (SSM) , provide a well-suited information from which an adequate neural network can learn the description of edges and use it to efficiently detect them in acquired point clouds. After successfully applying a multi-scale CNN on SSMs for the efficient classification of edges and their neighborhood, we propose a new lightweight neural network architecture outperforming the CNN in learning time, processing time, and classification capabilities. Our architecture is compact, requires small learning sets, is very fast to train, and classifies millions of points in seconds.

scholarly journals Point2Sequence: Learning the Shape Representation of 3D Point Clouds with an Attention-Based Sequence to Sequence Network

2019 ◽  
Vol 33 ◽  
pp. 8778-8785 ◽  
Author(s):  
Xinhai Liu ◽  
Zhizhong Han ◽  
Yu-Shen Liu ◽  
Matthias Zwicker
Keyword(s):  
Shape Representation ◽  
Contextual Information ◽  
Point Clouds ◽  
Learning Model ◽  
Local Region ◽  
Discriminative Ability ◽  
Fine Grained ◽  
Multi Scale ◽  
3D Point Clouds ◽  
Deep Learning Model

Exploring contextual information in the local region is important for shape understanding and analysis. Existing studies often employ hand-crafted or explicit ways to encode contextual information of local regions. However, it is hard to capture fine-grained contextual information in hand-crafted or explicit manners, such as the correlation between different areas in a local region, which limits the discriminative ability of learned features. To resolve this issue, we propose a novel deep learning model for 3D point clouds, named Point2Sequence, to learn 3D shape features by capturing fine-grained contextual information in a novel implicit way. Point2Sequence employs a novel sequence learning model for point clouds to capture the correlations by aggregating multi-scale areas of each local region with attention. Specifically, Point2Sequence first learns the feature of each area scale in a local region. Then, it captures the correlation between area scales in the process of aggregating all area scales using a recurrent neural network (RNN) based encoder-decoder structure, where an attention mechanism is proposed to highlight the importance of different area scales. Experimental results show that Point2Sequence achieves state-of-the-art performance in shape classification and segmentation tasks.

scholarly journals FAST SEMANTIC SEGMENTATION OF 3D POINT CLOUDS WITH STRONGLY VARYING DENSITY

2016 ◽  
Vol III-3 ◽  
pp. 177-184 ◽  
Author(s):  
Timo Hackel ◽  
Jan D. Wegner ◽  
Konrad Schindler
Keyword(s):  
Computation Time ◽  
Semantic Segmentation ◽  
Point Clouds ◽  
Computationally Efficient ◽  
Terrestrial Lidar ◽  
Semantic Classification ◽  
Multi Scale ◽  
3D Point Clouds ◽  
Point Density ◽  
Careful Handling

We describe an effective and efficient method for point-wise semantic classification of 3D point clouds. The method can handle unstructured and inhomogeneous point clouds such as those derived from static terrestrial LiDAR or photogammetric reconstruction; and it is computationally efficient, making it possible to process point clouds with many millions of points in a matter of minutes. The key issue, both to cope with strong variations in point density and to bring down computation time, turns out to be careful handling of neighborhood relations. By choosing appropriate definitions of a point’s (multi-scale) neighborhood, we obtain a feature set that is both expressive and fast to compute. We evaluate our classification method both on benchmark data from a mobile mapping platform and on a variety of large, terrestrial laser scans with greatly varying point density. The proposed feature set outperforms the state of the art with respect to per-point classification accuracy, while at the same time being much faster to compute.

scholarly journals DPRNet: Deep 3D Point Based Residual Network for Semantic Segmentation and Classification of 3D Point Clouds

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 68892-68904 ◽  
Author(s):  
Saira Arshad ◽  
Muhammad Shahzad ◽  
Qaiser Riaz ◽  
Muhammad Moazam Fraz
Keyword(s):  
Semantic Segmentation ◽  
Point Clouds ◽  
Residual Network ◽  
3D Point Clouds

scholarly journals Hierarchical Optimization of 3D Point Cloud Registration

Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6999
Author(s):  
Huikai Liu ◽  
Yue Zhang ◽  
Linjian Lei ◽  
Hui Xie ◽  
Yan Li ◽  
...  
Keyword(s):  
Point Cloud ◽  
Point Clouds ◽  
Hierarchical Optimization ◽  
Minimum Problem ◽  
Optimization Approach ◽  
3D Point Cloud ◽  
Point Cloud Registration ◽  
Multi Scale ◽  
3D Point Clouds ◽  
Coarse Registration

Rigid registration of 3D point clouds is the key technology in robotics and computer vision. Most commonly, the iterative closest point (ICP) and its variants are employed for this task. These methods assume that the closest point is the corresponding point and lead to sensitivity to the outlier and initial pose, while they have poor computational efficiency due to the closest point computation. Most implementations of the ICP algorithm attempt to deal with this issue by modifying correspondence or adding coarse registration. However, this leads to sacrificing the accuracy rate or adding the algorithm complexity. This paper proposes a hierarchical optimization approach that includes improved voxel filter and Multi-Scale Voxelized Generalized-ICP (MVGICP) for 3D point cloud registration. By combining traditional voxel sampling with point density, the outlier filtering and downsample are successfully realized. Through multi-scale iteration and avoiding closest point computation, MVGICP solves the local minimum problem and optimizes the operation efficiency. The experimental results demonstrate that the proposed algorithm is superior to the current algorithms in terms of outlier filtering and registration performance.

Sign in / Sign up

Export Citation Format

Share Document