Search NASA⌕ Search

SEARCH · Search NASA

Results for “segmentation algorithm”

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 127 records · Page 7

Segmentation of RDX and TNT in X‐Ray Computed Tomography Reconstructions of Melt‐Cast Explosives

ABSTRACT Three‐dimensional mesoscale characterization of heterogeneous melt‐cast high explosives is challenging because of the difficulty differentiating binder from explosive crystals: two functionally different materials which are typically similar in density by design. Here, we report an algorithm which can differentiate hexahydro‐1,3,5‐trinitro‐1,3,5‐triazine (RDX) from 2,4,6‐trinitrotoluene (TNT) in x‐ray computed tomography (CT) volumes with tens of microns resolution. This method allows us to quantify RDX/TNT content, porosity, and RDX domain size. We calibrated the segmentation algorithm using simulated x‐ray CT volumes containing object models of RDX crystals within a TNT matrix. We then segmented and analyzed CT data for Composition B (Comp B), a 60/40 RDX/TNT mixture, and Cyclotol, a 75/25 RDX/TNT mixture. We examined melt‐cast samples fabricated with 100% theoretical maximum density (TMD) and 85% TMD. For the 100% TMD Comp B and Cyclotol samples, the RDX content values calculated by segmentation were 3% and 9% lower, respectively, than the values measured by high‐performance liquid chromatography on material from the same synthesis lots. This result is consistent with the expected underreporting of RDX content resulting from x‐ray CT resolution limits on RDX particles with diameters smaller than 25 µm. The 85% TMD samples were less accurately segmented with our algorithm due to the confounding presence of voids.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Imaging and Segmenting Grains and Subgrains Using Backscattered Electron Techniques

We present two new methods of processing data from backscattered electron signals in a scanning electron microscope to image grains and subgrains. The first combines data from multiple backscattered electron images acquired at different specimen geometries to (1) better reveal grain boundaries in recrystallized microstructures and (2) distinguish between recrystallized and unrecrystallized regions in partially recrystallized microstructures. The second utilizes spherical harmonic transform indexing of electron backscatter diffraction patterns to produce high angular resolution orientation data that enable the characterization of subgrains. Subgrains are produced during high-temperature plastic deformation and have boundary misorientation angles ranging from a few degrees down to a few hundredths of a degree. Here, we also present an algorithm to automatically segment grains from combined backscattered electron image data or grains and subgrains from high angular resolution electron backscatter diffraction data. Together, these new techniques enable rapid measurements of individual grains and subgrains from large populations.

36 MATERIALS SCIENCE↗

Planning Transport and Manufacturing for Lowest Cost

A method applicable to transportation and manufacturing. New algorithm alleviates some mathematical difficulties of planning segmented trajectories for lowest cost. Algorithm involves modified Newtonian iterative method in which periapse times, closest approach distances, and orientations of approach hyperbolas serves as independent variables.

Damario, L. A.↗

Segmentation of multifrequency polarimetric radar images to facilitate the inference of geophysical parameters

An unsupervised clustering algorithm is used to segment multifrequency polarimetric radar data from the NASA/JPL airborne SAR (synthetic aperture radar). Twenty-two parameters are evaluated for their discriminatory capability for each pixel of an image. A clustering analysis is then performed using different subsets of these parameters. This analysis relies on data taken as part of an intensive field experiment during the summer of 1988 in the vicinity of the Pisgah lava flow in the Mojave Desert in southern California. As part of the experiment, extensive ground truth was acquired, including dielectric constant and topography measurements. Segmentation results show good agreement with these measurements.

Burnette, C F.↗

Robust High-Throughput Phenotyping with Deep Segmentation Enabled by a Web-Based Annotator

The abilities of plant biologists and breeders to characterize the genetic basis of physiological traits are limited by their abilities to obtain quantitative data representing precise details of trait variation, and particularly to collect this data at a high-throughput scale with low cost. Although deep learning methods have demonstrated unprecedented potential to automate plant phenotyping, these methods commonly rely on large training sets that can be time-consuming to generate. Intelligent algorithms have therefore been proposed to enhance the productivity of these annotations and reduce human efforts. We propose a high-throughput phenotyping system which features a Graphical User Interface (GUI) and a novel interactive segmentation algorithm: Semantic-Guided Interactive Object Segmentation (SGIOS). By providing a user-friendly interface and intelligent assistance with annotation, this system offers potential to streamline and accelerate the generation of training sets, reducing the effort required by the user. Our evaluation shows that our proposed SGIOS model requires fewer user inputs compared to the state-of-art models for interactive segmentation. As a case study of the use of the GUI applied for genetic discovery in plants, we present an example of results from a preliminary genome-wide association study (GWAS) of in planta regeneration in Populus trichocarpa (poplar). We further demonstrate that the inclusion of a semantic prior map with SGIOS can accelerate the training process for future GWAS, using a sample of a dataset extracted from a poplar GWAS of in vitro regeneration. The capabilities of our phenotyping system surpass those of unassisted humans to rapidly and precisely phenotype our traits of interest. The scalability of this system enables large-scale phenomic screens that would otherwise be time-prohibitive, thereby providing increased power for GWAS, mutant screens, and other studies relying on large sample sizes to characterize the genetic basis of trait variation. Our user-friendly system can be used by researchers lacking a computational background, thus helping to democratize the use of deep segmentation as a tool for plant phenotyping.

54 ENVIRONMENTAL SCIENCES↗

Frosted Tracks

SAND2025-01893O Frosted Tracks is a software tool to group trajectories according to sequences of their behavior. The goal is to start with a very large number of trajectories and identify groups that exhibit similar behavior patterns. The application combines TICC and Metric DBSCAN clustering algorithms for behavioral segmentation and labeling of air/sea trajectory data. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Dalbey, Keith↗

Automated segmentation and analysis of point clouds of pier foundations using Pier Inspection and Evaluation Report (PIER)

Pier foundations are commonly used in locations with unstable soil or where other types of foundations are unsuitable or cost prohibitive. A pier foundation consists of vertical columns to support the structure and elevate it above the ground. Common materials for pier foundations include masonry, concrete, timber, and steel. The methods for accurate placement of pier foundations have remained relatively unchanged for decades. For simple installations, construction chalk lines are used to layout the locations of piers to ensure accurate placement and elevation. For more complex installations, surveying instruments operated by trained professionals are employed to accurately locate piers and assess correct elevation before construction. After installation, another survey may need to be performed to assess the quality of the as-built foundation. However, with the advent of terrestrial laser scanners (TLS), the means now exist for contractors to conduct their own assessments of as-built foundations. The major barrier preventing contractors from performing their own assessments of as-built foundation quality is the segmentation and analysis of point cloud data, a skill that often requires a trained user. The objective of this research is to develop a software tool (PIER: Pier Inspection and Evaluation Report) to enable automated segmentation and analysis of point clouds of pier foundations. In this paper, the automated segmentation and analysis algorithms are detailed. A mockup lay out of pier foundations was built using concrete masonry units, and the algorithms were tested to evaluate performance. Limitations of the current algorithms and future research direction are discussed.

Turki, Amine [ORNL]↗

A finite element method for diffusion dominated unsteady viscous flows

A general conforming finite element scheme for computing viscous flows is presented which is of second-order accuracy in space and time. Viscous terms are treated implicitly and advection terms are treated explicitly in the time marching segment of the algorithm. A method for solving the algebraic equations at each time step is given. The method is demonstrated on two test problems, one of them being a plane vortex flow for which asymptotic methods are used to obtain suitable numerical boundary conditions at each time step.

Gunzburger, M. D.↗

Automatic continuum analysis of reflectance spectra

A continuum algorithm based on a Segmented Upper Hull method (SUH) is described. An upper hull is performed on segments of a spectrum defined by local minima and maxima. The segments making a complete spectrum are then combined. The definition of the upper hull allows the continuum to be both concave and/or convex, adapting to the shape of the spectrum. The method performs multiple passes on a spectrum by segmenting each local maximum to minimum and performing an upper hull. The algorithm naturally adapts to the widths of absorption features, so that all features are found, including the nature of doublets, triplets, etc. The algorithm is also reasonably fast on common minicomputers so that it might be applied to the large data sets from imaging spectrometers.

Clark, Roger N.↗

Marine stratocumulus cloud fields off the coast of southern California observed using Landsat imagery. I - Structural characteristics

The structural characteristics of stratocumulus cloud fields off the coast of southern California are investigated using Landsat Multispectral Scanner imagery. Twelve scenes in this area are examined along with three other stratocumulus scenes near San Francisco, over central Oregon, and in the Gulf of Mexico. Results from this initial study of stratocumulus clouds indicate that cloud-background threshold selection techniques based upon edge detection gradient assumptions are not appropriate for cloud segmentation and classification algorithms, cloud size distributions obey a power law, and cell horizontal aspect ratio increases with cell diameter. It was also found that stratocumulus clouds are bifractal in nature with fractal dimension of d of about 1.2 for cells with diameter D smaller than 0.5 km and d of about 1.5 for cells with D greater than 0.5 km; stratocumulus cloud fields appear to be homogeneous over regions of about 100 km x 100 km, a much smaller region than the 2.5-deg x 2.5-deg boxes to be used in the ISCCP regional averaging algorithms; and that structural properties of stratocumulus clouds observed off the coast of southern California are similar to those observed for stratocumulus clouds at three other locations.

Welch, R. M.↗

Multimodal correlation and intraoperative matching of virtual models in neurosurgery

The multimodal correlation between different diagnostic exams, the intraoperative calibration of pointing tools and the correlation of the patient's virtual models with the patient himself, are some examples, taken from the biomedical field, of a unique problem: determine the relationship linking representation of the same object in different reference frames. Several methods have been developed in order to determine this relationship, among them, the surface matching method is one that gives the patient minimum discomfort and the errors occurring are compatible with the required precision. The surface matching method has been successfully applied to the multimodal correlation of diagnostic exams such as CT, MR, PET and SPECT. Algorithms for automatic segmentation of diagnostic images have been developed to extract the reference surfaces from the diagnostic exams, whereas the surface of the patient's skull has been monitored, in our approach, by means of a laser sensor mounted on the end effector of an industrial robot. An integrated system for virtual planning and real time execution of surgical procedures has been realized.

Ceresole, Enrico↗

CALIOP Version 3 Data Products: A Comparison to Version 2

After launch we discovered that the CALIOP daytime measurements were subject to thermally induced beamdrift,and this caused the calibration to vary by as much as 30% during the course of a single daytime orbit segment. Using an algorithm developed by Powell et al.(2010), empirically derived correction factors are now computed in near realtime as a function of orbit elapsed time, and these are used to compensate for the beam wandering effects.

Vaughan, Mark↗

Improve Data Mining and Knowledge Discovery Through the Use of MatLab

Data mining is widely used to mine business, engineering, and scientific data. Data mining uses pattern based queries, searches, or other analyses of one or more electronic databases/datasets in order to discover or locate a predictive pattern or anomaly indicative of system failure, criminal or terrorist activity, etc. There are various algorithms, techniques and methods used to mine data; including neural networks, genetic algorithms, decision trees, nearest neighbor method, rule induction association analysis, slice and dice, segmentation, and clustering. These algorithms, techniques and methods used to detect patterns in a dataset, have been used in the development of numerous open source and commercially available products and technology for data mining. Data mining is best realized when latent information in a large quantity of data stored is discovered. No one technique solves all data mining problems; challenges are to select algorithms or methods appropriate to strengthen data/text mining and trending within given datasets. In recent years, throughout industry, academia and government agencies, thousands of data systems have been designed and tailored to serve specific engineering and business needs. Many of these systems use databases with relational algebra and structured query language to categorize and retrieve data. In these systems, data analyses are limited and require prior explicit knowledge of metadata and database relations; lacking exploratory data mining and discoveries of latent information. This presentation introduces MatLab(R) (MATrix LABoratory), an engineering and scientific data analyses tool to perform data mining. MatLab was originally intended to perform purely numerical calculations (a glorified calculator). Now, in addition to having hundreds of mathematical functions, it is a programming language with hundreds built in standard functions and numerous available toolboxes. MatLab's ease of data processing, visualization and its enormous availability of built in functionalities and toolboxes make it suitable to perform numerical computations and simulations as well as a data mining tool. Engineers and scientists can take advantage of the readily available functions/toolboxes to gain wider insight in their perspective data mining experiments.

Shaykhian, Gholam Ali↗

Improve Data Mining and Knowledge Discovery through the use of MatLab

Data mining is widely used to mine business, engineering, and scientific data. Data mining uses pattern based queries, searches, or other analyses of one or more electronic databases/datasets in order to discover or locate a predictive pattern or anomaly indicative of system failure, criminal or terrorist activity, etc. There are various algorithms, techniques and methods used to mine data; including neural networks, genetic algorithms, decision trees, nearest neighbor method, rule induction association analysis, slice and dice, segmentation, and clustering. These algorithms, techniques and methods used to detect patterns in a dataset, have been used in the development of numerous open source and commercially available products and technology for data mining. Data mining is best realized when latent information in a large quantity of data stored is discovered. No one technique solves all data mining problems; challenges are to select algorithms or methods appropriate to strengthen data/text mining and trending within given datasets. In recent years, throughout industry, academia and government agencies, thousands of data systems have been designed and tailored to serve specific engineering and business needs. Many of these systems use databases with relational algebra and structured query language to categorize and retrieve data. In these systems, data analyses are limited and require prior explicit knowledge of metadata and database relations; lacking exploratory data mining and discoveries of latent information. This presentation introduces MatLab(TradeMark)(MATrix LABoratory), an engineering and scientific data analyses tool to perform data mining. MatLab was originally intended to perform purely numerical calculations (a glorified calculator). Now, in addition to having hundreds of mathematical functions, it is a programming language with hundreds built in standard functions and numerous available toolboxes. MatLab's ease of data processing, visualization and its enormous availability of built in functionalities and toolboxes make it suitable to perform numerical computations and simulations as well as a data mining tool. Engineers and scientists can take advantage of the readily available functions/toolboxes to gain wider insight in their perspective data mining experiments.

Shaykahian, Gholan Ali↗

Algorithm Plans Collision-Free Path for Robotic Manipulator

An algorithm has been developed to enable a computer aboard a robot to autonomously plan the path of the manipulator arm of the robot to avoid collisions between the arm and any obstacle, which could be another part of the robot or an external object in the vicinity of the robot. In simplified terms, the algorithm generates trial path segments and tests each segment for potential collisions in an iterative process that ends when a sequence of collision-free segments reaches from the starting point to the destination. The main advantage of this algorithm, relative to prior such algorithms, is computational efficiency: the algorithm is designed to make minimal demands upon the limited computational resources available aboard a robot. This path-planning algorithm utilizes a modified version of the collision-detection method described in "Improved Collision-Detection Method for Robotic Manipulator" (NPO-30356), NASA Tech Briefs, Vol. 27, No. 3 (June 2003), page 72. The method involves utilization of mathematical models of the robot constructed prior to operation and similar models of external objects constructed automatically from sensory data acquired during operation. This method incorporates a previously developed method, known in the art as the method of oriented bounding boxes (OBBs), in which an object is represented approximately, for computational purposes, by a box that encloses its outer boundary. Because many parts of a robotic manipulator are cylindrical, the OBB method has been extended in this method to enable the approximate representation of cylindrical parts by use of octagonal or other multiple-OBB assemblies denoted oriented bounding prisms (OBPs). A multiresolution OBB/OBP representation of the robot and its manipulator arm and a multiresolution OBB representation of external objects (including terrain) are constructed and used in a process in which collisions at successively finer resolutions are detected through computational detection of overlaps between the corresponding OBB and OBP models. For computational efficiency, the process is started at the coarsest resolution and stopped as soon as possible, preferably before reaching the finest resolution. At the coarsest resolution, there is a single OBB enclosing all relevant external objects and a single OBB enclosing the entire robot. At the next finer level of resolution, the coarsest-resolution OBB is divided into two OBBs, and so forth. If no collision is detected at the coarsest resolution, then there is no need for further computation to detect collisions. If a collision is detected at the coarsest resolution, then tests for collisions are performed at the next finer level of resolution. This process is continued to successively finer resolutions until either no more collisions are detected or the finest resolution is reached.

Backes, Paul↗

Labview Implementation of Image Processing and Phasing Control for the SIBOA Segmented Mirror Testbed

NASA is preparing to launch the Next Generation Space Telescope (NGST). This telescope will be larger than the Hubble Space Telescope, be launched on an Atlas missile rather than the Space Shuttle, have a segmented primary mirror, and be placed in a higher orbit. All these differences pose significant challenges.' This effort addresses the challenge of implementing an algorithm for aligning the segments of the primary mirror during the initial deployment that was designed by Philip Olivier and members of SOMTC (Space Optics Manufacturing Technology Center). The implementation was to be performed on the SIBOA (Systematic Image Based Optical Alignment) test bed. Unfortunately, hardware/software aspect concerning SIBOA and an extended time period for algorithm development prevented testing before the end of the study period. Properties of the digital camera were studied and understood, resulting in the current ability of selecting optimal settings regarding saturation. The study was successful in manually capturing several images of two stacked segments with various relative phases. These images can be used to calibrate the algorithm for future implementation. Currently the system is ready for testing.

James D. Partridge↗

Prong Segmentation using Point Set Transformers in Multiple View Neutrino Detectors

NOvA is a long-baseline neutrino experiment studying neutrino oscillations by detecting neutrinos from the NuMI beam at Fermilab. Its physics analysis relies on accurate prong segmentation, which involves matching each hit to its source particle and identifying the particle type. This task has commonly been addressed using a combination of traditional clustering algorithms and convolutional neural networks (CNNs). However, NOvA’s detector design presents data as two sparse and decoupled 2D images (XZ and YZ views) rather than a native 3D representation, posing a significant challenge for traditional CNN-based models. In this talk, we propose a novel neural network based on the Point Set Transformer. By treating detector hits as sparse point clouds and implementing a cross-view attention mechanism, our model enables efficient information mixing between both views. Evaluated on NOvA simulated data, our model achieves superior accuracy while requiring significantly fewer computational resources compared to other models. Furthermore, the model demonstrates great performance when applied to Liquid Argon Time Projection Chamber (LArTPC) data, which shows its potential as a universal prong segmentation algorithm for multiple view neutrino detectors.

Liu, Jiaxi [UC, Irvine]↗