Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “point cloud”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Aerial Data and Processed Models of Port Arthur Coastal Neighborhood and Pleasure Island Golf Course, June 2024

Our Co-design team is from the University of Texas, working on a Department of Energy-funded project focused on the Beaumont-Port Arthur area. As part of this project, we will be developing climate-resilient design solutions for areas of the region. More on www.caee.utexas.edu.We captured aerial photos in the Port Arthur Coastal Neighborhood Community and the Golf Course on Pleasure Island, Texas, in June 2024.Aerial photos taken were through DroneDeploy autonomous flight, and models were processed through the DroneDeploy engine as well. All aerial photos are in .JPG format and contained in zipped files for each area.The processed data package includes 3D models, geospatial data, mappings, and point clouds. Please be aware that DTM, Elevation toolbox, Point cloud, and Orthomosaic use EPSG: 6588. And 3D Model uses EPSG: 3857.For using these data:- The Adobe Suite gives you great software to open .Tif files.- You can use LASUtility (Windows), ESRI ArcGIS Pro (Windows), or Blaze3D (Windows, Linux) to open a LAS file and view the data it contains.- Open an .OBJ file with a large number of free and commercial applications. Some examples include Microsoft 3D Builder, Apple Preview, Blender, and Autodesk.- You may use ArcGIS, Merkaartor, Blender (with the Google Earth Importer plug-in), Global Mapper, and Marble to open .KML files.- The .tfw world file is a text file used to georeference the GeoTIFF raster images, like the orthomosaic and the DSM. You need suitable software like ArcView to open a .TFW file.This dataset provides researchers with sufficient geometric data and the status quo of the land surface at the locations mentioned above. This dataset could streamline researchers' decision-making processes and enhance the design as well.

2D mapping↗
DOE OSTI2023

Learning Canonical Embeddings for Unsupervised Shape Correspondence With Locally Linear Transformations

We present a new approach to unsupervised shape correspondence learning between pairs of point clouds. We make the first attempt to adapt the classical locally linear embedding algorithm (LLE)-originally designed for nonlinear dimensionality reduction-for shape correspondence. The key idea is to find dense correspondences between shapes by first obtaining high-dimensional neighborhood-preserving embeddings of low-dimensional point clouds and subsequently aligning the source and target embeddings using locally linear transformations. We demonstrate that learning the embedding using a new LLE-inspired point cloud reconstruction objective results in accurate shape correspondences. More specifically, the approach comprises an end-to-end learnable framework of extracting high-dimensional neighborhood-preserving embeddings, estimating locally linear transformations in the embedding space, and reconstructing shapes via divergence measure-based alignment of probability density functions built over reconstructed and target shapes. Our approach enforces embeddings of shapes in correspondence to lie in the same universal/canonical embedding space, which eventually helps regularize the learning process and leads to a simple nearest neighbors approach between shape embeddings for finding reliable correspondences. Comprehensive experiments show that the new method makes noticeable improvements over state-of-the-art approaches on standard shape correspondence benchmark datasets covering both human and nonhuman shapes.

deformation↗
NASA NTRS2019

Bounding Methods for Heterogeneous Lidar-derived Navigational Geofences

Safe Unmanned Aerial Vehicle (UAV) operations near the ground require navigation methods that avoid fixed obstacles such as buildings, power lines and trees. Aerial lidar surveys of ground structures are available with the precision and accuracy to geolocate obstacles, but the high volume of raw survey data can exceed the compute power of onboard processors and the rendering ability of ground-based flight planning maps. Representing ground structures with bounding polyhedra instead of point clouds greatly reduces the data size and can enable effective obstacle avoidance, as long as the bounding geometry envelopes the structures with high spatial fidelity. This report describes in detail four methods to compute bounding geometries of ground obstacles from lidar point clouds. The four methods are: 1) 2.5D Maximum Elevation Box, 2) 2.5D Ground Map Extrusion, 3) 3D Bounding Cylinder, and 4) 3D Bounding Box. The methods are applied to five point cloud datasets from lidar surveys of UAV flight research sites in Georgia and Virginia with an average point spacing that ranges from 0.1m to 0.6m. The methods are assessed using survey areas with geometrically heterogeneous ground structures: buildings, vegetation, power lines, and sub-meter structures such as road signs and guy wires. The 2.5D Maximum Elevation Box method is useful for simple structures. The 2.5D Ground Map Extrusion method efficiently encloses vegetation, but requires handdrawn ground footprints. The 3D Bounding Cylinder method excels at enclosing linear structures such as power lines and fences. The 3D Bounding Box method excels at enclosing planar structures such as buildings. The methods are compared on the basis of data compression and boundary fidelity on selected areas. The 2.5D methods yield the highest data compression but the polyhedra produced by them enclose significant amounts of empty space. Boundary fidelity is superior for the 3D methods, though this fidelity comes at the cost of a roughly thirtyfold lower data compression ratio than the 2.5D Maximum Elevation Box method. A mix of these output geometries is proposed for autonomous UAV navigation with limited on-board computing. Both the accuracy and spatial detail of emerging satellite-based survey technology lower than that of aerial lidar scanning survey technology. Sub-meter structures and thin linear structures are not reliably mapped at present by satellite-based surveys.

Moore, Andrew J.↗
NASA NTRSDate not supplied

Visualization and 3D Mesh Generation for ASSEMBLERS Range of Motion

In an effort to create a base and foundation for ASSEMBLERS with an informed layout, data representing the range of motion of varying heights of Stewart platforms were analyzed. 3D shapes were generated first to be approximately representative of these data in the form of rotationally symmetric shells, making use of 2D alpha shapes to create a border that did not account for asymmetry inherent in the true range of motion. Further work was performed to generate mesh files more fully representative of reach, creating 3D alpha shapes based directly on point clouds generated from uniformly random platform positions. These shapes were initially not representative of the entire range of motion of a platform stack due to the low likelihood of the most extreme positions being added to a given point cloud but were more representative of the asymmetry inherent in the possible positions of a Stewart platform as they no longer relied on a single 2D contour. The same algorithm for generating 3D alpha shapes was then applied to point clouds designed to represent extreme positions, generating larger smooth shells with six clear planes of symmetry. All shells were converted to STLs to aid in further modeling of range of motion for base layouts and in visualizing reachable area for varying stack heights, successfully creating closed shells representative of typical and extreme positions for platform stacks of varying heights.

Jonah DeGuire Vanke↗
DOE OSTI2023

Three-dimensional phenotyping of peach tree-crown architecture utilizing terrestrial laser scanning

Tree training systems for temperate fruit have been developed throughout history by pomologists to improve light interception, fruit yield, and fruit quality. These training systems direct crown and branch growth to specific configurations. Quantifying crown architecture could aid the selection of trees that require less pruning or that naturally excel in specific growing/training system conditions. Regarding peaches [Prunus persica (L.) Batsch], access tools such as branching indices have been developed to characterize tree-crown architecture. However, the required branching data (BD) to develop these indices are difficult to collect. Traditionally, BD have been collected manually, but this process is tedious, time-consuming, and prone to human error. These barriers can be circumnavigated by utilizing terrestrial laser scanning (TLS) to obtain a digital twin of the real tree. TLS generates three-dimensional (3D) point clouds of the tree crown, wherein every point contains 3D coordinates (x, y, z). To facilitate the use of these tools for peach, we selected 16 young peach trees scanned in 2021 and 2022. These 16 trees were then modeled and quantified using the open-source software TreeQSM. As a result, “in silico” branching and biometric data for the young peach trees were calculated to demonstrate the capabilities of TLS phenotyping of peach tree-crown architecture. The comparison and analysis of field measurements (in situ) and in silico BD, biometric data, and quantitative structural model branch uncertainty data were utilized to determine the reconstructive model’s reliability as a source substitute for field measurements. Mean average deviation when comparing young tree (YT) height was approx. 5.93%, with crown volume was approx. 13.26% across both 2021 and 2022. All point clouds of the YTs in 2022 showed residuals lower than 12 mm to cylinders fitted to all branches, and mean surface coverage greater than 40% for both the trunk and primary branching orders.

09 BIOMASS FUELS↗
DOE OSTI2023

Experimental Observations of the Topology of Convolutional Neural Network Activations

Topological data analysis (TDA) is a branch of computational mathematics, bridging algebraic topology and data science, that provides compact, noise-robust representations of complex structures. Deep neural networks (DNNs) learn millions of parameters associated with a series of transformations defined by the model architecture resulting in high-dimensional, difficult to interpret internal representations of input data. As DNNs become more ubiquitous across multiple sectors of our society, there is increasing recognition that mathematical methods are needed to aid analysts, researchers, and practitioners in understanding and interpreting how these models' internal representations relate to the final classification. In this paper we apply cutting edge techniques from TDA with the goal of gaining insight towards interpretability of convolutional neural networks used for image classification. We use two common TDA approaches to explore several methods for modeling hidden layer activations as high-dimensional point clouds, and provide experimental evidence that these point clouds capture valuable structural information about the model's process. First, we demonstrate that a distance metric based on persistent homology can be used to quantify meaningful differences between layers and discuss these distances in the broader context of existing representational similarity metrics for neural network interpretability. Second, we show that a mapper graph can provide semantic insight as to how these models organize hierarchical class knowledge at each layer. These observations demonstrate that TDA is a useful tool to help deep learning practitioners unlock the hidden structures of their models.

topological data analysis, deep learning↗
DOE OSTI2024

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Generalized moving least squares vs. radial basis function finite difference methods for approximating surface derivatives

Approximating differential operators defined on two-dimensional surfaces is an important problem that arises in many areas of science and engineering. Over the past ten years, localized meshfree methods based on generalized moving least squares (GMLS) and radial basis function finite differences (RBF-FD) have been shown to be effective for this task as they can give high orders of accuracy at low computational cost, and they can be applied to surfaces defined only by point clouds. However, there have yet to be any studies that perform a direct comparison of these methods for approximating surface differential operators (SDOs). The first purpose of this work is to fill that gap. For this comparison, we focus on an RBF-FD method based on polyharmonic spline kernels and polynomials (PHS+Poly) since they are most closely related to the GMLS method. Additionally, we use a relatively new technique for approximating SDOs with RBF-FD called the tangent plane method since it is simpler than previous techniques and natural to use with PHS+Poly RBF-FD. Further, the second purpose of this work is to relate the tangent plane formulation of SDOs to the local coordinate formulation used in GMLS and to show that they are equivalent when the tangent space to the surface is known exactly. The final purpose is to use ideas from the GMLS SDO formulation to derive a new RBF-FD method for approximating the tangent space for a point cloud surface when it is unknown. For the numerical comparisons of the methods, we examine their convergence rates for approximating the surface gradient, divergence, and Laplacian as the point clouds are refined for various parameter choices. We also compare their efficiency in terms of accuracy per computational cost, both when including and excluding setup costs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A resolution independent neural operator

The Deep operator network (DeepONet) is a powerful yet simple neural operator architecture that utilizes two deep neural networks to learn mappings between infinite-dimensional function spaces. This architecture is highly flexible, allowing the evaluation of the solution field at any location within the desired domain. However, it imposes a strict constraint on the input space, requiring all input functions to be discretized at the same locations; this limits its practical applications. Here, in this work, we introduce a general framework for operator learning from input–output data with arbitrary number and locations of sensors. This begins by introducing a resolution-independent DeepONet (RI-DeepONet), enabling it to handle input functions that are arbitrarily, but sufficiently finely, discretized. To this end, we propose two dictionary learning algorithms to adaptively learn a set of appropriate continuous basis functions, parameterized as implicit neural representations (INRs), from correlated signals defined on arbitrary point cloud data. These basis functions are then used to project arbitrary input function data as a point cloud onto an embedding space (i.e., a vector space of finite dimensions) with dimensionality equal to the dictionary size, which can be directly used by DeepONet without any architectural changes. In particular, we utilize sinusoidal representation networks (SIRENs) as trainable INR basis functions. The introduced dictionary learning algorithms are then used in a similar way to learn an appropriate dictionary of basis functions for the output function data, which defines a new neural operator architecture referred to as the R esolution I ndependent N eural O perator (RINO). In the RINO, the operator learning task simplifies to learning a mapping from the coefficients of input basis functions to the coefficients of output basis functions. We demonstrate the robustness and applicability of RINO in handling arbitrarily (but sufficiently richly) sampled input and output functions during both training and inference through several numerical examples.

Deep operator network (DeepONet)↗
DOE OSTI2024

Automated Approach to Accurate, Precise, and Fast Detector Simulation and Reconstruction

Detector simulation and reconstruction are a significant computational bottleneck in particle physics. Here, we develop particle-flow neural-assisted simulations (parnassus) to address this challenge. Our deep learning model takes as input a point cloud (particles impinging on a detector) and produces a point cloud (reconstructed particles). By combining detector simulations and reconstruction into one step, we aim to minimize resource utilization and enable fast surrogate models suitable for application both inside and outside large collaborations. We demonstrate this approach using a publicly available dataset of jets passed through the full simulation and reconstruction pipeline of the Compact Muon Solenoid (CMS) experiment. We show that parnassus accurately mimics the CMS particle flow algorithm on the (statistically) same events it was trained on and can generalize to jet momentum and type outside of the training distribution.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Kinematics reconstruction in solenoidal spectrometers operated in active target mode

Here, we discuss the reconstruction of low-energy nuclear reaction kinematics from charged-particle tracks in solenoidal spectrometers working in Active Target Time Projection Chamber mode. In this operation mode, reaction products are tracked within the active gas medium of the Active Target with a three dimensional space point cloud. We have inferred the reaction kinematics from the point cloud using an algorithm based on a linear quadratic estimator (Kalman filter). The performance of this algorithm has been evaluated using experimental data from nuclear reactions measured with the Active Target Time Projection Chamber (AT-TPC) detector.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Probing criticality with deep learning in relativistic heavy-ion collisions

Systems with different interactions could develop the same critical behavior due to the underlying symmetry and universality. Using this principle of universality, we can embed critical correlations modeled on the 3D Ising model into the simulated data of heavy-ion collisions, hiding weak signals of a few inter-particle correlations within a large particle cloud. Employing a point cloud network with dynamical edge convolution, we are able to identify events with critical fluctuations through supervised learning, and pick out a large fraction of signal particles used for decision-making in each single event.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2014

Computational Aerodynamic Analysis of Three-Dimensional Ice Shapes on a NACA 23012 Airfoil

The present study identifies a process for performing computational fluid dynamic calculations of the flow over full three-dimensional (3D) representations of complex ice shapes deposited on aircraft surfaces. Rime and glaze icing geometries formed on a NACA23012 airfoil were obtained during testing in the NASA Glenn Research Center's Icing Research Tunnel (IRT). The ice shape geometries were scanned as a cloud of data points using a 3D laser scanner. The data point clouds were meshed using Geomagic software to create highly accurate models of the ice surface. The surface data was imported into Pointwise grid generation software to create the CFD surface and volume grids. It was determined that generating grids in Pointwise for complex 3D icing geometries was possible using various techniques that depended on the ice shape. Computations of the flow fields over these ice shapes were performed using the NASA National Combustion Code (NCC). Results for a rime ice shape for angle of attack conditions ranging from 0 to 10 degrees and for freestream Mach numbers of 0.10 and 0.18 are presented. For validation of the computational results, comparisons were made to test results from rapid-prototype models of the selected ice accretion shapes, obtained from a separate study in a subsonic wind tunnel at the University of Illinois at Urbana-Champaign. The computational and experimental results were compared for values of pressure coefficient and lift. Initial results show fairly good agreement for rime ice accretion simulations across the range of conditions examined. The glaze ice results are promising but require some further examination.

Aerodynamics↗
NASA NTRS2014

Computational Aerodynamic Analysis of Three-Dimensional Ice Shapes on a NACA 23012 Airfoil

The present study identifies a process for performing computational fluid dynamic calculations of the flow over full three-dimensional (3D) representations of complex ice shapes deposited on aircraft surfaces. Rime and glaze icing geometries formed on a NACA23012 airfoil were obtained during testing in the NASA Glenn Research Centers Icing Research Tunnel (IRT). The ice shape geometries were scanned as a cloud of data points using a 3D laser scanner. The data point clouds were meshed using Geomagic software to create highly accurate models of the ice surface. The surface data was imported into Pointwise grid generation software to create the CFD surface and volume grids. It was determined that generating grids in Pointwise for complex 3D icing geometries was possible using various techniques that depended on the ice shape. Computations of the flow fields over these ice shapes were performed using the NASA National Combustion Code (NCC). Results for a rime ice shape for angle of attack conditions ranging from 0 to 10 degrees and for freestream Mach numbers of 0.10 and 0.18 are presented. For validation of the computational results, comparisons were made to test results from rapid-prototype models of the selected ice accretion shapes, obtained from a separate study in a subsonic wind tunnel at the University of Illinois at Urbana-Champaign. The computational and experimental results were compared for values of pressure coefficient and lift. Initial results show fairly good agreement for rime ice accretion simulations across the range of conditions examined. The glaze ice results are promising but require some further examination.

Aerodynamics↗
NASA NTRS2018

Range and Intensity Image-Based Terrain and Vehicle Relative Pose Estimation System

A navigation system includes an image acquisition device for acquiring a range image of a target vehicle, at least one processor, a memory including a target vehicle model and computer readable program code, where the processor and the computer readable program code are configured to cause the navigation system to convert the range image to a point cloud having three dimensions, compute a transform from the target vehicle model to the point cloud, and use the transform to estimate the target vehicle's attitude and position for capturing the target vehicle.

Gill, Nathaniel↗
DOE OSTI2021

Accurate surface estimation from high-resolution 3D microwave images

Active millimeter and microwave imaging techniques can be used to create a high-resolution 3D image volume of a target’s reflectivity. Millimeter-wave imaging is commonly used for personnel security screening and numerous other applications. Backprojection based image reconstruction techniques form a 3D complex-valued volume. The complex-valued volume is commonly reduced to a real-valued volume by taking the magnitude. For anomaly detection and cross image registration of an object it is beneficial to generate an accurate representation of an object’s surface. Extracting a smooth and accurate surface from a magnitude only image is challenging. One difficulty is the magnitude image has limited resolution in the depth direction which normally limits precision to a moderate fraction of the depth resolution. Another difficulty is that the magnitude of the image depends heavily on the geometry and orientation of the object being imaged. The phase information in a complex-valued image volume provides a means to decouple the magnitude of the image from the geometry of an object and provide precision much finer than the depth resolution would indicate. This enables the generation of a smooth and accurate point cloud representation of the surface of an imaged object. A method to extract a point cloud from the phase information in a 3D complex-valued millimeter-wave image volume is developed and results with simulated and experimental data are presented.

Clark, Richard T.↗
DOE OSTI2021

Comprehension of Spatial Constraints by Neural Logic Learning from a Single RGB-D Scan

Autonomous industrial assembly relies on the precise measurement of spatial constraints as designed by computer-aided design (CAD) software such as SolidWorks. This paper proposes a framework for an intelligent industrial robot to understand the spatial constraints for model assembly. An extended generative adversary network (GAN) with a 3D long short-term memory (LSTM) network was designed to composite 3D point clouds from a single RGB-D scan. The spatial constraints of the segmented point clouds are identified by a neural-logic network that incorporates general knowledge of spatial constraints in terms of first-order logic. The model was designed to comprehend a complete set of spatial constraints that are consistent with industrial CAD software, including left, right, above, below, front, behind, parallel, perpendicular, concentric, and coincident relations. The accuracy of 3D model composition and spatial constraint identification was evaluated by the RGB-D scans and 3D models in the ABC dataset. The proposed model achieved 57.23% intersection over union (IoU) in 3D model composition, and over 99% in comprehending all spatial constraints.

Wang, Dali↗
DOE OSTI2026

Oak Ridge National Laboratory Building Envelope Library (ORNOBEL)

The Oak Ridge National Laboratory Building Envelope Library (ORNOBEL) is a collection of dense exterior building-facade point clouds acquired using a survey-grade terrestrial laser scanner. Each file represents an individual facade from a building on the Oak Ridge National Laboratory (ORNL) campus or in Knoxville, Tennessee, with an average point-cloud resolution of approximately 3 mm. The points in each facade are semantically labeled into three classes: (1) window/door, representing openings in the building envelope; (2) wall, representing planar opaque envelope surfaces; and (3) other, representing the remaining facade-adjacent elements, architectural features, and protrusions. ORNOBEL supports the development, training, and evaluation of advanced deep-learning methods for automated building-envelope segmentation, geometric reconstruction, and building information modeling (BIM).

Maldonado Puente, Bryan [ORNL] (ORCID:000000033880↗