scholarly journals UNSUPERVISED WINDOW EXTRACTION FROM PHOTOGRAMMETRIC POINT CLOUDS WITH THERMAL ATTRIBUTES

2019 ◽  
Vol IV-2/W5 ◽  
pp. 45-51 ◽  
Author(s):  
D. Lin ◽  
Z. Dong ◽  
X. Zhang ◽  
H.-G. Maas
Keyword(s):  
Point Cloud ◽  
Energy Optimization ◽  
Region Growing ◽  
Point Clouds ◽  
Automatic Extraction ◽  
3D Point Cloud ◽  
Art Nouveau ◽  
Point Cloud Segmentation ◽  
Object Based ◽  
Practical Validation

<p><strong>Abstract.</strong> The automatic extraction of windows from photogrammetric data has achieved increasing attention in recent times. An unsupervised windows extraction approach from photogrammetric point clouds with thermal attributes is proposed in this study. First, point cloud segmentation is conducted by a popular workflow: Multiscale supervoxel generation is applied to the image-based 3D point cloud, followed by region growing and energy optimization using spatial positions and thermal attributes of the raw points. Afterwards, an object-based feature (window index) is extracted using the average thermal attribute and the size of the object. Next, thresholding is applied to extract initial window regions. Finally, several criterions are applied to further refine the extraction results. For practical validation, the approach is evaluated on an art nouveau building row façade located at Dresden, Germany.</p>

scholarly journals An Efficient Encoding Voxel-Based Segmentation (EVBS) Algorithm Based on Fast Adjacent Voxel Search for Point Cloud Plane Segmentation

2019 ◽  
Vol 11 (23) ◽  
pp. 2727 ◽  
Author(s):  
Ming Huang ◽  
Pengcheng Wei ◽  
Xianglei Liu
Keyword(s):  
Point Cloud ◽  
Initial Point ◽  
Computation Time ◽  
Region Growing ◽  
Point Clouds ◽  
Recall Rate ◽  
Seed Selection ◽  
Cloud Processing ◽  
Point Cloud Segmentation ◽  
Noise Data

Plane segmentation is a basic yet important process in light detection and ranging (LiDAR) point cloud processing. The traditional point cloud plane segmentation algorithm is typically affected by the number of point clouds and the noise data, which results in slow segmentation efficiency and poor segmentation effect. Hence, an efficient encoding voxel-based segmentation (EVBS) algorithm based on a fast adjacent voxel search is proposed in this study. First, a binary octree algorithm is proposed to construct the voxel as the segmentation object and code the voxel, which can compute voxel features quickly and accurately. Second, a voxel-based region growing algorithm is proposed to cluster the corresponding voxel to perform the initial point cloud segmentation, which can improve the rationality of seed selection. Finally, a refining point method is proposed to solve the problem of under-segmentation in unlabeled voxels by judging the relationship between the points and the segmented plane. Experimental results demonstrate that the proposed algorithm is better than the traditional algorithm in terms of computation time, extraction accuracy, and recall rate.

scholarly journals SEGMENTATION OF LARGE UNSTRUCTURED POINT CLOUDS USING OCTREE-BASED REGION GROWING AND CONDITIONAL RANDOM FIELDS

2017 ◽  
Vol XLII-2/W8 ◽  
pp. 25-30 ◽  
Author(s):  
M. Bassier ◽  
M. Bonduel ◽  
B. Van Genechten ◽  
M. Vergauwen
Keyword(s):  
Random Fields ◽  
Point Cloud ◽  
Conditional Random Fields ◽  
Conditional Random Field ◽  
Region Growing ◽  
Point Clouds ◽  
Single Type ◽  
Point Cloud Data ◽  
Cloud Data ◽  
Point Cloud Segmentation

Point cloud segmentation is a crucial step in scene understanding and interpretation. The goal is to decompose the initial data into sets of workable clusters with similar properties. Additionally, it is a key aspect in the automated procedure from point cloud data to BIM. Current approaches typically only segment a single type of primitive such as planes or cylinders. Also, current algorithms suffer from oversegmenting the data and are often sensor or scene dependent.<br><br> In this work, a method is presented to automatically segment large unstructured point clouds of buildings. More specifically, the segmentation is formulated as a graph optimisation problem. First, the data is oversegmented with a greedy octree-based region growing method. The growing is conditioned on the segmentation of planes as well as smooth surfaces. Next, the candidate clusters are represented by a Conditional Random Field after which the most likely configuration of candidate clusters is computed given a set of local and contextual features. The experiments prove that the used method is a fast and reliable framework for unstructured point cloud segmentation. Processing speeds up to 40,000 points per second are recorded for the region growing. Additionally, the recall and precision of the graph clustering is approximately 80%. Overall, nearly 22% of oversegmentation is reduced by clustering the data. These clusters will be classified and used as a basis for the reconstruction of BIM models.

scholarly journals SUPERVOXEL-BASED MULTI-SCALE POINT CLOUD SEGMENTATION USING FNEA FOR OBJECT-ORIENTED ROCK SLOPE CLASSIFICATION USING TLS

2020 ◽  
Vol XLIII-B2-2020 ◽  
pp. 1049-1056
Author(s):  
I. Farmakis ◽  
D. Bonneau ◽  
D. J. Hutchinson ◽  
N. Vlachopoulos
Keyword(s):  
Remote Sensing ◽  
Data Analysis ◽  
Point Cloud ◽  
Rock Slope ◽  
3D Point Cloud ◽  
Multi Scale ◽  
Point Cloud Segmentation ◽  
Object Based ◽  
Point Cloud Analysis ◽  
Semantic Labelling

Abstract. Computer vision applications have been increasingly gaining space in the field of remote sensing and geosciences for automated terrain classification and semantic labelling purposes. The continuous and rapid development of monitoring techniques and enhancements in the spatial resolution of sensors have increased the demand for new remote sensing data analysis approaches. For semantic labelling of 2D (or 2.5D) image terrain representations for rock slopes, it has been shown that Object-Based Image Analysis (OBIA) results in high efficiency and accurate identification of landslide hazards. However, the application of such object-based approaches in 3D point cloud analysis is still under development for geospatial data analysis. In the field of engineering geology, which deals with complex rural landscapes, frequently the analysis needs to be conducted based solely on 3D geometrical information accounting for multiple scales simultaneously. In this study, the primary segmentation step of the object-based model is applied to a TLS-derived point cloud collected at a landslide-active rock slope. The 3D point cloud segmentation methodology proposed here builds on the principles of the Fractal Net Evolution Approach (FNEA). The objective is to provide a geometry-based point cloud segmentation framework that preserves the 3D character of the data throughout the process and favours the multi-scale analysis. The segmentation is performed on the basis of supervoxels based on purely geometrical local descriptors derived directly from the TLS point clouds and comprises the basis for the subsequent steps towards the development of an efficient Object-Based Point cloud Analysis (OBPA) framework in rock slope stability assessment by adding semantic meaning to the data through a homogenization process.

scholarly journals UNSUPERVISED SEGMENTATION OF INDOOR 3D POINT CLOUD: APPLICATION TO OBJECT-BASED CLASSIFICATION

2020 ◽  
Vol XLIV-4/W1-2020 ◽  
pp. 111-118 ◽  
Author(s):  
F. Poux ◽  
C. Mattes ◽  
L. Kobbelt
Keyword(s):  
Point Cloud ◽  
Computing Time ◽  
Region Growing ◽  
Point Clouds ◽  
Unsupervised Segmentation ◽  
Cloud Data ◽  
3D Point Clouds ◽  
Object Based ◽  
Indoor Scenes ◽  
Region Growing Segmentation

Abstract. Point cloud data of indoor scenes is primarily composed of planar-dominant elements. Automatic shape segmentation is thus valuable to avoid labour intensive labelling. This paper provides a fully unsupervised region growing segmentation approach for efficient clustering of massive 3D point clouds. Our contribution targets a low-level grouping beneficial to object-based classification. We argue that the use of relevant segments for object-based classification has the potential to perform better in terms of recognition accuracy, computing time and lowers the manual labelling time needed. However, fully unsupervised approaches are rare due to a lack of proper generalisation of user-defined parameters. We propose a self-learning heuristic process to define optimal parameters, and we validate our method on a large and richly annotated dataset (S3DIS) yielding 88.1% average F1-score for object-based classification. It permits to automatically segment indoor point clouds with no prior knowledge at commercially viable performance and is the foundation for efficient indoor 3D modelling in cluttered point clouds.

Supervoxel-Based Region Growing Segmentation for Point Cloud Data

2020 ◽  
pp. 2154007
Author(s):  
Nan Luo ◽  
Yuanyuan Jiang ◽  
Quan Wang
Keyword(s):  
Point Cloud ◽  
High Efficiency ◽  
Region Growing ◽  
Experimental Tests ◽  
Point Clouds ◽  
Spatial Distance ◽  
Local Geometry ◽  
Cloud Data ◽  
Point Cloud Segmentation ◽  
Region Growing Segmentation

Point cloud segmentation is a crucial fundamental step in 3D reconstruction, object recognition and scene understanding. This paper proposes a supervoxel-based point cloud segmentation algorithm in region growing principle to solve the issues of inaccurate boundaries and nonsmooth segments in the existing methods. To begin with, the input point cloud is voxelized and then pre-segmented into sparse supervoxels by flow constrained clustering, considering the spatial distance and local geometry between voxels. Afterwards, plane fitting is applied to the over-segmented supervoxels and seeds for region growing are selected with respect to the fitting residuals. Starting from pruned seed patches, adjacent supervoxels are merged in region growing style to form the final segments, according to the normalized similarity measure that integrates the smoothness and shape constraints of supervoxels. We determine the values of parameters via experimental tests, and the final results show that, by voxelizing and pre-segmenting the point clouds, the proposed algorithm is robust to noises and can obtain smooth segmentation regions with accurate boundaries in high efficiency.

scholarly journals PAIRWISE LINKAGE FOR POINT CLOUD SEGMENTATION

2016 ◽  
Vol III-3 ◽  
pp. 201-208 ◽  
Author(s):  
Xiaohu Lu ◽  
Jian Yao ◽  
Jinge Tu ◽  
Kai Li ◽  
Li Li ◽  
...  
Keyword(s):  
Point Cloud ◽  
Clustering Algorithm ◽  
Input Parameter ◽  
Point Clouds ◽  
Segmentation Algorithm ◽  
Experimental Results ◽  
3D Point Cloud ◽  
3D Point Clouds ◽  
Point Cloud Segmentation ◽  
Data Point

In this paper, we first present a novel hierarchical clustering algorithm named Pairwise Linkage (P-Linkage), which can be used for clustering any dimensional data, and then effectively apply it on 3D unstructured point cloud segmentation. The P-Linkage clustering algorithm first calculates a feature value for each data point, for example, the density for 2D data points and the flatness for 3D point clouds. Then for each data point a pairwise linkage is created between itself and its closest neighboring point with a greater feature value than its own. The initial clusters can further be discovered by searching along the linkages in a simple way. After that, a cluster merging procedure is applied to obtain the finally refined clustering result, which can be designed for specialized applications. Based on the P-Linkage clustering, we develop an efficient segmentation algorithm for 3D unstructured point clouds, in which the flatness of the estimated surface of a 3D point is used as its feature value. For each initial cluster a slice is created, then a novel and robust slicemerging method is proposed to get the final segmentation result. The proposed P-Linkage clustering and 3D point cloud segmentation algorithms require only one input parameter in advance. Experimental results on different dimensional synthetic data from 2D to 4D sufficiently demonstrate the efficiency and robustness of the proposed P-Linkage clustering algorithm and a large amount of experimental results on the Vehicle-Mounted, Aerial and Stationary Laser Scanner point clouds illustrate the robustness and efficiency of our proposed 3D point cloud segmentation algorithm.

scholarly journals PAIRWISE LINKAGE FOR POINT CLOUD SEGMENTATION

2016 ◽  
Vol III-3 ◽  
pp. 201-208 ◽  
Author(s):  
Xiaohu Lu ◽  
Jian Yao ◽  
Jinge Tu ◽  
Kai Li ◽  
Li Li ◽  
...  
Keyword(s):  
Point Cloud ◽  
Clustering Algorithm ◽  
Input Parameter ◽  
Point Clouds ◽  
Segmentation Algorithm ◽  
Experimental Results ◽  
3D Point Cloud ◽  
3D Point Clouds ◽  
Point Cloud Segmentation ◽  
Data Point

In this paper, we first present a novel hierarchical clustering algorithm named Pairwise Linkage (P-Linkage), which can be used for clustering any dimensional data, and then effectively apply it on 3D unstructured point cloud segmentation. The P-Linkage clustering algorithm first calculates a feature value for each data point, for example, the density for 2D data points and the flatness for 3D point clouds. Then for each data point a pairwise linkage is created between itself and its closest neighboring point with a greater feature value than its own. The initial clusters can further be discovered by searching along the linkages in a simple way. After that, a cluster merging procedure is applied to obtain the finally refined clustering result, which can be designed for specialized applications. Based on the P-Linkage clustering, we develop an efficient segmentation algorithm for 3D unstructured point clouds, in which the flatness of the estimated surface of a 3D point is used as its feature value. For each initial cluster a slice is created, then a novel and robust slicemerging method is proposed to get the final segmentation result. The proposed P-Linkage clustering and 3D point cloud segmentation algorithms require only one input parameter in advance. Experimental results on different dimensional synthetic data from 2D to 4D sufficiently demonstrate the efficiency and robustness of the proposed P-Linkage clustering algorithm and a large amount of experimental results on the Vehicle-Mounted, Aerial and Stationary Laser Scanner point clouds illustrate the robustness and efficiency of our proposed 3D point cloud segmentation algorithm.

scholarly journals VOXEL BASED SEGMENTATION OF LARGE AIRBORNE TOPOBATHYMETRIC LIDAR DATA

2017 ◽  
Vol XLII-1/W1 ◽  
pp. 107-114 ◽  
Author(s):  
R. Boerner ◽  
L. Hoegner ◽  
U. Stilla
Keyword(s):  
Point Cloud ◽  
Small Volume ◽  
Computation Time ◽  
Region Growing ◽  
Point Clouds ◽  
Second Step ◽  
Classification Result ◽  
Ground Segment ◽  
Point Cloud Segmentation ◽  
Class Information

Point cloud segmentation and classification is currently a research highlight. Methods in this field create labelled data, where each point has additional class information. Current approaches are to generate a graph on the basis of all points in the point cloud, calculate or learn descriptors and train a matcher for the descriptor to the corresponding classes. Since these approaches need to look on each point in the point cloud iteratively, they result in long calculation times for large point clouds. Therefore, large point clouds need a generalization, to save computation time. One kind of generalization is to cluster the raw points into a 3D grid structure, which is represented by small volume units ( i.e. voxels) used for further processing. This paper introduces a method to use such a voxel structure to cluster a large point cloud into ground and non-ground points. The proposed method for ground detection first marks ground voxels with a region growing approach. In a second step non ground voxels are searched and filtered in the ground segment to reduce effects of over-segmentations. This filter uses the probability that a voxel mostly consist of last pulses and a discrete gradient in a local neighbourhood . The result is the ground label as a first classification result and connected segments of non-ground points. The test area of the river Mangfall in Bavaria, Germany, is used for the first processing.

scholarly journals Label3DMaize: toolkit for 3D point cloud data annotation of maize shoots

GigaScience ◽  
2021 ◽  
Vol 10 (5) ◽  
Author(s):  
Teng Miao ◽  
Weiliang Wen ◽  
Yinglun Li ◽  
Sheng Wu ◽  
Chao Zhu ◽  
...  
Keyword(s):  
Deep Learning ◽  
Point Cloud ◽  
Training Dataset ◽  
Growth Stages ◽  
3D Point Cloud ◽  
Plant Structure ◽  
Data Annotation ◽  
Cloud Data ◽  
Point Cloud Segmentation ◽  
Different Growth Stages

Abstract Background The 3D point cloud is the most direct and effective data form for studying plant structure and morphology. In point cloud studies, the point cloud segmentation of individual plants to organs directly determines the accuracy of organ-level phenotype estimation and the reliability of the 3D plant reconstruction. However, highly accurate, automatic, and robust point cloud segmentation approaches for plants are unavailable. Thus, the high-throughput segmentation of many shoots is challenging. Although deep learning can feasibly solve this issue, software tools for 3D point cloud annotation to construct the training dataset are lacking. Results We propose a top-to-down point cloud segmentation algorithm using optimal transportation distance for maize shoots. We apply our point cloud annotation toolkit for maize shoots, Label3DMaize, to achieve semi-automatic point cloud segmentation and annotation of maize shoots at different growth stages, through a series of operations, including stem segmentation, coarse segmentation, fine segmentation, and sample-based segmentation. The toolkit takes ∼4–10 minutes to segment a maize shoot and consumes 10–20% of the total time if only coarse segmentation is required. Fine segmentation is more detailed than coarse segmentation, especially at the organ connection regions. The accuracy of coarse segmentation can reach 97.2% that of fine segmentation. Conclusion Label3DMaize integrates point cloud segmentation algorithms and manual interactive operations, realizing semi-automatic point cloud segmentation of maize shoots at different growth stages. The toolkit provides a practical data annotation tool for further online segmentation research based on deep learning and is expected to promote automatic point cloud processing of various plants.

Sign in / Sign up

Export Citation Format

Share Document