scholarly journals Detail Preserved Surface Reconstruction from Point Cloud

Sensors ◽  
2019 ◽  
Vol 19 (6) ◽  
pp. 1278 ◽  
Author(s):  
Yang Zhou ◽  
Shuhan Shen ◽  
Zhanyi Hu
Keyword(s):  
Total Energy ◽  
Surface Reconstruction ◽  
Point Cloud ◽  
State Of The Art ◽  
Point Clouds ◽  
Experimental Result ◽  
Line Of Sight ◽  
Noise Filtering ◽  
Energy Term ◽  
Object Edge

In this paper, we put forward a new method for surface reconstruction from image-based point clouds. In particular, we introduce a new visibility model for each line of sight to preserve scene details without decreasing the noise filtering ability. To make the proposed method suitable for point clouds with heavy noise, we introduce a new likelihood energy term to the total energy of the binary labeling problem of Delaunay tetrahedra, and we give its s-t graph implementation. Besides, we further improve the performance of the proposed method with the dense visibility technique, which helps to keep the object edge sharp. The experimental result shows that the proposed method rivalled the state-of-the-art methods in terms of accuracy and completeness, and performed better with reference to detail preservation.

scholarly journals Computational Geometry-Based Surface Reconstruction for Volume Estimation: A Case Study on Magnitude-Frequency Relations for a LiDAR-Derived Rockfall Inventory

2021 ◽  
Vol 10 (3) ◽  
pp. 157
Author(s):  
Paul-Mark DiFrancesco ◽  
David A. Bonneau ◽  
D. Jean Hutchinson
Keyword(s):  
Computational Geometry ◽  
Surface Reconstruction ◽  
Power Law ◽  
Point Cloud ◽  
Point Clouds ◽  
Volume Estimation ◽  
Estimation Methods ◽  
Small Scale ◽  
Reconstruction Methods ◽  
3D Volume

Key to the quantification of rockfall hazard is an understanding of its magnitude-frequency behaviour. Remote sensing has allowed for the accurate observation of rockfall activity, with methods being developed for digitally assembling the monitored occurrences into a rockfall database. A prevalent challenge is the quantification of rockfall volume, whilst fully considering the 3D information stored in each of the extracted rockfall point clouds. Surface reconstruction is utilized to construct a 3D digital surface representation, allowing for an estimation of the volume of space that a point cloud occupies. Given various point cloud imperfections, it is difficult for methods to generate digital surface representations of rockfall with detailed geometry and correct topology. In this study, we tested four different computational geometry-based surface reconstruction methods on a database comprised of 3668 rockfalls. The database was derived from a 5-year LiDAR monitoring campaign of an active rock slope in interior British Columbia, Canada. Each method resulted in a different magnitude-frequency distribution of rockfall. The implications of 3D volume estimation were demonstrated utilizing surface mesh visualization, cumulative magnitude-frequency plots, power-law fitting, and projected annual frequencies of rockfall occurrence. The 3D volume estimation methods caused a notable shift in the magnitude-frequency relations, while the power-law scaling parameters remained relatively similar. We determined that the optimal 3D volume calculation approach is a hybrid methodology comprised of the Power Crust reconstruction and the Alpha Solid reconstruction. The Alpha Solid approach is to be used on small-scale point clouds, characterized with high curvatures relative to their sampling density, which challenge the Power Crust sampling assumptions.

scholarly journals A comprehensive study of the rate-distortion performance in MPEG point cloud compression

2019 ◽  
Vol 8 ◽  
Author(s):  
Evangelos Alexiou ◽  
Irene Viola ◽  
Tomás M. Borges ◽  
Tiago A. Fonseca ◽  
Ricardo L. de Queiroz ◽  
...  
Keyword(s):  
Point Cloud ◽  
State Of The Art ◽  
Subjective Evaluation ◽  
Rate Distortion ◽  
Point Clouds ◽  
Current Approach ◽  
User Engagement ◽  
Viable Solution ◽  
Wide Range ◽  
Objective Quality

Abstract Recent trends in multimedia technologies indicate the need for richer imaging modalities to increase user engagement with the content. Among other alternatives, point clouds denote a viable solution that offers an immersive content representation, as witnessed by current activities in JPEG and MPEG standardization committees. As a result of such efforts, MPEG is at the final stages of drafting an emerging standard for point cloud compression, which we consider as the state-of-the-art. In this study, the entire set of encoders that have been developed in the MPEG committee are assessed through an extensive and rigorous analysis of quality. We initially focus on the assessment of encoding configurations that have been defined by experts in MPEG for their core experiments. Then, two additional experiments are designed and carried to address some of the identified limitations of current approach. As part of the study, state-of-the-art objective quality metrics are benchmarked to assess their capability to predict visual quality of point clouds under a wide range of radically different compression artifacts. To carry the subjective evaluation experiments, a web-based renderer is developed and described. The subjective and objective quality scores along with the rendering software are made publicly available, to facilitate and promote research on the field.

scholarly journals Single-Stage Adaptive Multi-Scale Point Cloud Noise Filtering Algorithm Based on Feature Information

2022 ◽  
Vol 14 (2) ◽  
pp. 367
Author(s):  
Zhen Zheng ◽  
Bingting Zha ◽  
Yu Zhou ◽  
Jinbo Huang ◽  
Youshi Xuchen ◽  
...  
Keyword(s):  
Point Cloud ◽  
Large Scale ◽  
Point Clouds ◽  
Single Stage ◽  
Estimation Methods ◽  
Computational Time ◽  
Noise Filtering ◽  
Filtering Algorithm ◽  
Multi Scale ◽  
Feature Information

This paper proposes a single-stage adaptive multi-scale noise filtering algorithm for point clouds, based on feature information, which aims to mitigate the fact that the current laser point cloud noise filtering algorithm has difficulty quickly completing the single-stage adaptive filtering of multi-scale noise. The feature information from each point of the point cloud is obtained based on the efficient k-dimensional (k-d) tree data structure and amended normal vector estimation methods, and the adaptive threshold is used to divide the point cloud into large-scale noise, a feature-rich region, and a flat region to reduce the computational time. The large-scale noise is removed directly, the feature-rich and flat regions are filtered via improved bilateral filtering algorithm and weighted average filtering algorithm based on grey relational analysis, respectively. Simulation results show that the proposed algorithm performs better than the state-of-art comparison algorithms. It was, thus, verified that the algorithm proposed in this paper can quickly and adaptively (i) filter out large-scale noise, (ii) smooth small-scale noise, and (iii) effectively maintain the geometric features of the point cloud. The developed algorithm provides research thought for filtering pre-processing methods applicable in 3D measurements, remote sensing, and target recognition based on point clouds.

scholarly journals FAST PROBABILISTIC FUSION OF 3D POINT CLOUDS VIA OCCUPANCY GRIDS FOR SCENE CLASSIFICATION

2016 ◽  
Vol III-3 ◽  
pp. 325-332
Author(s):  
Andreas Kuhn ◽  
Hai Huang ◽  
Martin Drauschke ◽  
Helmut Mayer
Keyword(s):  
High Resolution ◽  
Point Cloud ◽  
State Of The Art ◽  
Point Clouds ◽  
Automatic Generation ◽  
Scene Classification ◽  
Semantic Classification ◽  
3D Point Clouds ◽  
Occupancy Grids ◽  
High Scalability

High resolution consumer cameras on Unmanned Aerial Vehicles (UAVs) allow for cheap acquisition of highly detailed images, e.g., of urban regions. Via image registration by means of Structure from Motion (SfM) and Multi View Stereo (MVS) the automatic generation of huge amounts of 3D points with a relative accuracy in the centimeter range is possible. Applications such as semantic classification have a need for accurate 3D point clouds, but do not benefit from an extremely high resolution/density. In this paper, we, therefore, propose a fast fusion of high resolution 3D point clouds based on occupancy grids. The result is used for semantic classification. In contrast to state-of-the-art classification methods, we accept a certain percentage of outliers, arguing that they can be considered in the classification process when a per point belief is determined in the fusion process. To this end, we employ an octree-based fusion which allows for the derivation of outlier probabilities. The probabilities give a belief for every 3D point, which is essential for the semantic classification to consider measurement noise. For an example point cloud with half a billion 3D points (cf. Figure 1), we show that our method can reduce runtime as well as improve classification accuracy and offers high scalability for large datasets.

scholarly journals Dynamic Point Cloud Compression Based on Projections, Surface Reconstruction and Video Compression

Sensors ◽  
2021 ◽  
Vol 22 (1) ◽  
pp. 197
Author(s):  
Emil Dumic ◽  
Anamaria Bjelopera ◽  
Andreas Nüchter
Keyword(s):  
Surface Reconstruction ◽  
Video Compression ◽  
Point Cloud ◽  
Voronoi Diagrams ◽  
Reconstruction Algorithm ◽  
Point Clouds ◽  
Algorithm Comparison ◽  
Point To Point ◽  
Original Point

In this paper we will present a new dynamic point cloud compression based on different projection types and bit depth, combined with the surface reconstruction algorithm and video compression for obtained geometry and texture maps. Texture maps have been compressed after creating Voronoi diagrams. Used video compression is specific for geometry (FFV1) and texture (H.265/HEVC). Decompressed point clouds are reconstructed using a Poisson surface reconstruction algorithm. Comparison with the original point clouds was performed using point-to-point and point-to-plane measures. Comprehensive experiments show better performance for some projection maps: cylindrical, Miller and Mercator projections.

scholarly journals Pointwise Rotation-Invariant Network with Adaptive Sampling and 3D Spherical Voxel Convolution

2020 ◽  
Vol 34 (07) ◽  
pp. 12717-12724
Author(s):  
Yang You ◽  
Yujing Lou ◽  
Qi Liu ◽  
Yu-Wing Tai ◽  
Lizhuang Ma ◽  
...  
Keyword(s):  
Adaptive Sampling ◽  
Point Cloud ◽  
Data Augmentation ◽  
Feature Matching ◽  
State Of The Art ◽  
Point Clouds ◽  
Rotation Invariant ◽  
Learning Framework ◽  
Point Set ◽  
Part Segmentation

Point cloud analysis without pose priors is very challenging in real applications, as the orientations of point clouds are often unknown. In this paper, we propose a brand new point-set learning framework PRIN, namely, Pointwise Rotation-Invariant Network, focusing on rotation-invariant feature extraction in point clouds analysis. We construct spherical signals by Density Aware Adaptive Sampling to deal with distorted point distributions in spherical space. In addition, we propose Spherical Voxel Convolution and Point Re-sampling to extract rotation-invariant features for each point. Our network can be applied to tasks ranging from object classification, part segmentation, to 3D feature matching and label alignment. We show that, on the dataset with randomly rotated point clouds, PRIN demonstrates better performance than state-of-the-art methods without any data augmentation. We also provide theoretical analysis for the rotation-invariance achieved by our methods.

scholarly journals DERIVING 3D POINT CLOUDS FROM TERRESTRIAL PHOTOGRAPHS - COMPARISON OF DIFFERENT SENSORS AND SOFTWARE

2016 ◽  
Vol XLI-B5 ◽  
pp. 685-692 ◽  
Author(s):  
Robert Niederheiser ◽  
Martin Mokroš ◽  
Julia Lange ◽  
Helene Petschko ◽  
Günther Prasicek ◽  
...  
Keyword(s):  
Point Cloud ◽  
State Of The Art ◽  
User Interaction ◽  
Point Clouds ◽  
Rock Face ◽  
3D Point Clouds ◽  
Software Packages ◽  
User Friendly ◽  
Insight Into

Terrestrial photogrammetry nowadays offers a reasonably cheap, intuitive and effective approach to 3D-modelling. However, the important choice, which sensor and which software to use is not straight forward and needs consideration as the choice will have effects on the resulting 3D point cloud and its derivatives. <br><br> We compare five different sensors as well as four different state-of-the-art software packages for a single application, the modelling of a vegetated rock face. The five sensors represent different resolutions, sensor sizes and price segments of the cameras. The software packages used are: (1) Agisoft PhotoScan Pro (1.16), (2) Pix4D (2.0.89), (3) a combination of Visual SFM (V0.5.22) and SURE (1.2.0.286), and (4) MicMac (1.0). We took photos of a vegetated rock face from identical positions with all sensors. Then we compared the results of the different software packages regarding the ease of the workflow, visual appeal, similarity and quality of the point cloud. <br><br> While PhotoScan and Pix4D offer the user-friendliest workflows, they are also “black-box” programmes giving only little insight into their processing. Unsatisfying results may only be changed by modifying settings within a module. The combined workflow of Visual SFM, SURE and CloudCompare is just as simple but requires more user interaction. MicMac turned out to be the most challenging software as it is less user-friendly. However, MicMac offers the most possibilities to influence the processing workflow. The resulting point-clouds of PhotoScan and MicMac are the most appealing.

scholarly journals FROM POINT CLOUDS TO 3D ISOVISTS IN INDOOR ENVIRONMENTS

2018 ◽  
Vol XLII-4 ◽  
pp. 149-154 ◽  
Author(s):  
L. Díaz-Vilariño ◽  
L. González-deSantos ◽  
E. Verbree ◽  
G. Michailidou ◽  
S. Zlatanova
Keyword(s):  
Point Cloud ◽  
Eye Gaze ◽  
Point Clouds ◽  
Observation Point ◽  
Line Of Sight ◽  
Indoor Environments ◽  
Spatial Behaviour ◽  
Visibility Analysis ◽  
Spatial Properties ◽  
Tracing Algorithm

<p><strong>Abstract.</strong> Visibility is a common measure to describe the spatial properties of an environment related to the spatial behaviour. Isovists represent the space that can be seen from one observation point, and they are used to analyse the existence of obstacles affecting or blocking intervisibility in an area. Although point clouds depict the as-built reality in a very detailed and accurate way, literature addressing the analysis of visibility in 3D, and more specifically the usage of point clouds to visibility analysis, is rather limited. In this paper, a methodology to evaluate visibility from point clouds in indoor environments is proposed, resulting in the creation of 3D isovists. Point cloud is firstly discretized in a voxel-based structure and voxels are labelled into ‘exterior’, ‘occupied’, ‘visible’ and ‘occluded’ based on an occupancy followed by a visibility analysis performed from a ray-tracing algorithm. 3D Isovists are created from the boundary of visible voxels from an observer position and considering as input parameters the visual angle, maximum line of sight, and eye gaze direction.</p>

scholarly journals Effective Planar Cluster Detection in Point Clouds Using Histogram-Driven Kd-Like Partition and Shifted Mahalanobis Distance Based Regression

2019 ◽  
Vol 11 (21) ◽  
pp. 2465 ◽  
Author(s):  
Jakub Walczak ◽  
Tadeusz Poreda ◽  
Adam Wojciechowski
Keyword(s):  
Mahalanobis Distance ◽  
Point Cloud ◽  
State Of The Art ◽  
Point Clouds ◽  
Rejection Rate ◽  
Regular Space ◽  
Planar Surface ◽  
Point Cloud Segmentation ◽  
Partition Method ◽  
Excessive Number

Point cloud segmentation for planar surface detection is a valid problem of automatic laser scans analysis. It is widely exploited for many industrial remote sensing tasks, such as LIDAR city scanning, creating inventories of buildings, or object reconstruction. Many current methods rely on robustly calculated covariance and centroid for plane model estimation or global energy optimization. This is coupled with point cloud division strategies, based on uniform or regular space subdivision. These approaches result in many redundant divisions, plane maladjustments caused by outliers, and excessive number of processing iterations. In this paper, a new robust method of point clouds segmentation, based on histogram-driven hierarchical space division, inspired by kd-tree is presented. The proposed partition method produces results with a smaller oversegmentation rate. Moreover, state-of-the-art partitions often lead to nodes of low cardinality, which results in the rejection of many points. In the proposed method, the point rejection rate was reduced. Point cloud subdivision is followed by resilient plane estimation, using Mahalanobis distance with respect to seven cardinal points. These points were established based on eigenvectors of the covariance matrix of the considered point cluster. The proposed method shows high robustness and yields good quality metrics, much faster than a FAST-MCD approach. The overall results indicate improvements in terms of plane precision, plane recall, under-, and the over- segmentation rate with respect to the reference benchmark methods. Plane precision for the S3DIS dataset increased on average by 2.6pp and plane recall- by 3pp. Both over- and under- segmentation rates fell by 3.2pp and 4.3pp.

scholarly journals Dynamic polygon clouds: representation and compression for VR/AR

2018 ◽  
Vol 7 ◽  
Author(s):  
Eduardo Pavez ◽  
Philip A. Chou ◽  
Ricardo L. de Queiroz ◽  
Antonio Ortega
Keyword(s):  
Point Cloud ◽  
State Of The Art ◽  
Three Dimensional ◽  
Point Clouds ◽  
Polygonal Meshes ◽  
Triangle Meshes ◽  
Previous State ◽  
Temporal Redundancy ◽  
Inter Frame ◽  
Robust To Noise

We introduce the polygon cloud, a compressible representation of three-dimensional geometry (including attributes, such as color), intermediate between polygonal meshes and point clouds. Dynamic polygon clouds, like dynamic polygonal meshes and dynamic point clouds, can take advantage of temporal redundancy for compression. In this paper, we propose methods for compressing both static and dynamic polygon clouds, specifically triangle clouds. We compare triangle clouds to both triangle meshes and point clouds in terms of compression, for live captured dynamic colored geometry. We find that triangle clouds can be compressed nearly as well as triangle meshes, while being more robust to noise and other structures typically found in live captures, which violate the assumption of a smooth surface manifold, such as lines, points, and ragged boundaries. We also find that triangle clouds can be used to compress point clouds with significantly better performance than previously demonstrated point cloud compression methods. For intra-frame coding of geometry, our method improves upon octree-based intra-frame coding by a factor of 5–10 in bit rate. Inter-frame coding improves this by another factor of 2–5. Overall, our proposed method improves over the previous state-of-the-art in dynamic point cloud compression by 33% or more.

Sign in / Sign up

Export Citation Format

Share Document