Search NASA⌕ Search

SEARCH · Search NASA

Results for “classification algorithms”

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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Versatile feature learning with graph convolutions and graph structures

Graphs represent real world relationships, and graph embedding projects nodes in a graph to a latent space that can help simplify downstream tasks. Recent development of graph convolutions in deep learning significantly improves the performance of many learning tasks on graphs. Unfortunately, prior embedding methods either do not embed graphs with node features, or fail to produce high-quality embeddings for downstream learning tasks that result in large performance gap in comparison to direct learning on graphs.We present a versatile and effective embedding method, Conv2Vec, for embedding graphs with or without node features. It is based on graph convolutions with objective functions motivated by concepts and structures from classical graph algorithms. Conv2Vec produce high-quality embedding for both plain graphs and graphs with node features for downstream tasks.We evaluate the embeddings generated by Conv2Vec with a transductive node classification task. With the generated embeddings and very simple machine learning approaches, we are able to achieve accuracies similar to those achieved by direct learning with graph convolutions. Interestingly, if we strip the node features from the graph and thus learning an embedding has to rely entirely on the graph topology, node classification with our embedding significantly outperforms direct learning with various graph convolutions. This suggests that structures from classical graph algorithms may play an important role in learning on graphs.

Cong, Guojing↗
NASA NTRS2012

A Marker-Based Approach for the Automated Selection of a Single Segmentation from a Hierarchical Set of Image Segmentations

The Hierarchical SEGmentation (HSEG) algorithm, which combines region object finding with region object clustering, has given good performances for multi- and hyperspectral image analysis. This technique produces at its output a hierarchical set of image segmentations. The automated selection of a single segmentation level is often necessary. We propose and investigate the use of automatically selected markers for this purpose. In this paper, a novel Marker-based HSEG (M-HSEG) method for spectral-spatial classification of hyperspectral images is proposed. Two classification-based approaches for automatic marker selection are adapted and compared for this purpose. Then, a novel constrained marker-based HSEG algorithm is applied, resulting in a spectral-spatial classification map. Three different implementations of the M-HSEG method are proposed and their performances in terms of classification accuracies are compared. The experimental results, presented for three hyperspectral airborne images, demonstrate that the proposed approach yields accurate segmentation and classification maps, and thus is attractive for remote sensing image analysis.

Tarabalka, Y.↗
DOE OSTI2025

Predictions for the Detectability of Milky Way Satellite Galaxies and Outer-Halo Star Clusters with the Vera C. Rubin Observatory

We predict the sensitivity of the Vera C. Rubin Observatory Legacy Survey of Space and Time (LSST) to faint, resolved Milky Way satellite galaxies and outer-halo star clusters. We characterize the expected sensitivity using simulated LSST data from the LSST Dark Energy Science Collaboration (DESC) Data Challenge 2 (DC2) accessed and analyzed with the Rubin Science Platform as part of the Rubin Early Science Program. We simulate resolved stellar populations of Milky Way satellite galaxies and outer-halo star clusters over a wide range of sizes, luminosities, and heliocentric distances, which are broadly consistent with expectations for the Milky Way satellite system. We inject simulated stars into the DC2 catalog with realistic photometric uncertainties and star/galaxy separation derived from the DC2 data itself. We assess the probability that each simulated system would be detected by LSST using a conventional isochrone matched-filter technique. We find that assuming perfect star/galaxy separation enables the detection of resolved stellar systems with $M_V$ = 0 mag and $r_{1/2}$ = 10 pc with >50% efficiency out to a heliocentric distance of ~250 kpc. Similar detection efficiency is possible with a simple star/galaxy separation criterion based on measured quantities, although the false positive rate is higher due to leakage of background galaxies into the stellar sample. When assuming perfect star/galaxy classification and a model for the galaxy-halo connection fit to current data, we predict that 89 +/- 20 Milky Way satellite galaxies will be detectable with a simple matched-filter algorithm applied to the LSST wide-fast-deep data set. Different assumptions about the performance of star/galaxy classification efficiency can decrease this estimate by ~7%-25%, which emphasizes the importance of high-quality star/galaxy separation for studies of the Milky Way satellite population with LSST.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

VoroClust

SAND2025-11465O VoroClust, also known as Voronoi Clustering, is a fast, density-based unsupervised clustering algorithm applicable to high-resolution and high-dimensional data. It operates as quickly as distance-based clustering methods while effectively capturing complex regional geometries, matching the performance of current density-based methods. VoroClust employs a data-centered sphere cover to reduce computational demands while preserving data topology. It propagates clusters outward from local density peaks. Although supervised machine learning is powerful for applications like image classification and segmentation, it requires comprehensive, consistent datasets, which many applications lack. Unsupervised clustering algorithms analyze the structure of each dataset rather than relying on similarities with other examples, making them well-suited for practical applications with insufficient or inappropriate data for supervised learning. 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.

Ebeida, Mohamed [Sandia National Lab. (SNL-CA), Li↗
NASA NTRS1977

Status report: Data management program algorithm evaluation activity at Marshall Space Flight Center

An algorithm evaluation activity was initiated to study the problems associated with image processing by assessing the independent and interdependent effects of registration, compression, and classification techniques on LANDSAT data for several discipline applications. The objective of the activity was to make recommendations on selected applicable image processing algorithms in terms of accuracy, cost, and timeliness or to propose alternative ways of processing the data. As a means of accomplishing this objective, an Image Coding Panel was established. The conduct of the algorithm evaluation is described.

Jayroe, R. R., Jr.↗
DOE OSTI2024

Robust Containment Queries over Collections of Rational Parametric Curves via Generalized Winding Numbers

Point containment queries for regions bound by watertight geometric surfaces, i.e., closed and without self-intersections, can be evaluated straightforwardly with a number of well-studied algorithms. When this assumption on domain geometry is not met, such methods are either unusable, or prone to misclassifications that can lead to cascading errors in downstream applications. More robust point classification schemes based on generalized winding numbers have been proposed, as they are indifferent to these imperfections. However, existing algorithms are limited to point clouds and collections of linear elements. We extend this methodology to encompass more general curved shapes with an algorithm that evaluates the winding number scalar field over unstructured collections of rational parametric curves. In particular, we evaluate the winding number for each curve independently, making the derived containment query robust to how the curves are arranged. We ensure geometric fidelity in our queries by treating each curve as equivalent to an adaptively constructed polyline that provably has the same generalized winding number at the point of interest. Our algorithm is numerically stable for points that are arbitrarily close to the model, and explicitly treats points that are coincident with curves. We demonstrate the improvements in computational performance granted by this method over conventional techniques as well as the robustness induced by its application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Improving the Accuracy of Nearest-Neighbor Classification Using Principled Construction and Stochastic Sampling of Training-Set Centroids

A conceptually simple way to classify images is to directly compare test-set data and training-set data. The accuracy of this approach is limited by the method of comparison used, and by the extent to which the training-set data cover configuration space. Here we show that this coverage can be substantially increased using coarse-graining (replacing groups of images by their centroids) and stochastic sampling (using distinct sets of centroids in combination). We use the MNIST and Fashion-MNIST data sets to show that a principled coarse-graining algorithm can convert training images into fewer image centroids without loss of accuracy of classification of test-set images by nearest-neighbor classification. Distinct batches of centroids can be used in combination as a means of stochastically sampling configuration space, and can classify test-set data more accurately than can the unaltered training set. On the MNIST and Fashion-MNIST data sets this approach converts nearest-neighbor classification from a mid-ranking- to an upper-ranking member of the set of classical machine-learning techniques.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

Characteristics of Vertical Profiles of Reflectivity and Doppler Derived From TRMM Field Campaigns

The TRMM Precipitation Radar (PR) measures the vertical profile of reflectivity from which the surface rain rate is estimated after attenuation corrections in the 2A21 algorithm. Characteristics of the vertical reflectivity profile is important for various reasons ranging from scientific to instrument algorithms. It is well known that different types of precipitation such as stratiform or convection, have different heating profiles. The vertical profile of reflectivity can provide information on precipitation classification. The vertical reflectivity structure also provides information on precipitation processes such as growth and aggregation. In terms of TRMM algorithms, an independent estimate of the vertical profiles are also extremely important since the PR returns can be attenuated in the rain layer near the surface. Corrections for attenuation are required in the lowest few kilometers, necessitating some assumptions about the rain size distributions and the reflectivity profile below the lowest measurement unaffected by the surface return. Furthermore, some assumptions about the vertical reflectivity profile are required for Ground Validation (GV) radars, since their lowest scan may be 1 or more kilometers above the surface. Statistics on the vertical reflectivity and Doppler structure are presented from the ER-2 Doppler Radar (EDOP) which participated in several TRMM field campaigns (TEFLUN-A, TEFLUN-B, and LBA) and CAMEX-3. The ER-2 aircraft overflew diverse precipitation types during these campaigns. EDOP is an X-band (9.6 GHz) radar for which returns are less attenuated than at the TRMM PR frequency. The EDOP profiles are first corrected for attenuation using the SRT method. The data from all the ER-2 campaigns are then classified by type (convection, stratiform, and other) and then statistics were performed on the vertical reflectivity and Doppler profiles in the form of CFAD's. These CFADs are compared and discussed. The computed CFAD's indicate significant differences as a function of precipitation type and location (hurricane versus non-hurricane, Brazil versus Florida). The implications of these profiles will be discussed.

Starr, David OC.↗
DOE OSTI2022

Comparison of Machine Learning and Deep Learning for View Identification from Cardiac Magnetic Resonance Images

Background: Artificial intelligence is increasingly utilized to aid in the interpretation of cardiac magnetic resonance (CMR) studies. One of the first steps is the identification of the imaging plane depicted, which can be achieved by both deep learning (DL) and classical machine learning (ML) techniques without user input. We aimed to compare the accuracy of ML and DL for CMR view classification and to identify potential pitfalls during training and testing of the algorithms. Methods: To train our DL and ML algorithms, we first established datasets by retrospectively selecting 200 CMR cases. The models were trained using two different cohorts (passively and actively curated) and applied data augmentation to enhance training. Once trained, the models were validated on an external dataset, consisting of 20 cases acquired at another center. We then compared accuracy metrics and applied class activation mapping (CAM) to visualize DL model performance. Results: The DL and ML models trained with the passively-curated CMR cohort were 99.1% and 99.3% accurate on the validation set, respectively. However, when tested on the CMR cases with complex anatomy, both models performed poorly. After training and testing our models again on all 200 cases (active cohort), validation on the external dataset resulted in 95% and 90% accuracy, respectively. The CAM analysis depicted heat maps that demonstrated the importance of carefully curating the datasets to be used for training. Conclusions: Both DL and ML models can accurately classify CMR images, but DL outperformed ML when classifying images with complex heart anatomy.

artificial intelligence↗
DOE OSTI2024

Semi-supervised Learning of Dynamical Systems with Neural Ordinary Differential Equations: A Teacher-Student Model Approach

Modeling dynamical systems is crucial for a wide range of tasks, but it remains challenging due to complex nonlinear dynamics, limited observations, or lack of prior knowledge. Recently, data-driven approaches such as Neural Ordinary Differential Equations (NODE) have shown promising results by leveraging the expressive power of neural networks to model unknown dynamics. However, these approaches often suffer from limited labeled training data, leading to poor generalization and suboptimal predictions. On the other hand, semi-supervised algorithms can utilize abundant unlabeled data and have demonstrated good performance in classification and regression tasks. We propose TS-NODE, the first semi-supervised approach to modeling dynamical systems with NODE. TS-NODE explores cheaply generated synthetic pseudo rollouts to broaden exploration in the state space and to tackle the challenges brought by lack of ground-truth system data under a teacher-student model. TS-NODE employs an unified optimization framework that corrects the teacher model based on the student's feedback while mitigating the potential false system dynamics present in pseudo rollouts. TS-NODE demonstrates significant performance improvements over a baseline Neural ODE model on multiple dynamical system modeling tasks.

Wang, Yu↗
NASA NTRS1975

A hybrid classifier using the parallelepiped and Bayesian techniques

A versatile classification scheme is developed which uses the best features of the parallelepiped algorithm and the Bayesian maximum likelihood algorithm. The parallelepiped technique has the advantage of being very fast, especially when implemented into a table look-up scheme; its disadvantage is its inability to distinguish and classify spectral signatures which are similar in nature. This disadvantage is eliminated by the Bayesian technique which is capable of distinguishing subtle differences very well. The hybrid algorithm developed reduces computer time by as much as 90%. A two- and n-dimensional description of the hybrid classifier is given.

Addington, J. D.↗
NASA NTRS1982

Computational modeling for the study of multispectral sensor systems and concepts

A computational model of the deterministic and stochastic processes involved in remote sensing is being developed as a tool for studying multispectral sensor systems and concepts. The goal is to improve the efficiency of sensor systems for routine worldwide monitoring of earth resources and the environment. Preliminary computational results are presented for simple models of the natural variability of atmospheric radiative transfer and surface reflectance. These results illustrate the dependence of classification accuracy on the selection of sensor spectral channels and data processing algorithms.

Huck, F. O.↗
NASA NTRS1997

Land Surface Temperature Measurements from EOS MODIS Data

We made modifications to the linear kernel bidirectional reflectance distribution function (BRDF) models from Roujean et al. and Wanner et al. that extend the spectral range into the thermal infrared (TIR). With these TIR BRDF models and the IGBP land-cover product, we developed a classification-based emissivity database for the EOS/MODIS land-surface temperature (LST) algorithm and used it in version V2.0 of the MODIS LST code. Two V2.0 LST codes have been delivered to the MODIS SDST, one for the daily L2 and L3 LST products, and another for the 8-day 1km L3 LST product. New TIR thermometers (broadband radiometer with a filter in the 10-13 micron window) and an IR camera have been purchased in order to reduce the uncertainty in LST field measurements due to the temporal and spatial variations in LST. New improvements have been made to the existing TIR spectrometer in order to increase its accuracy to 0.2 C that will be required in the vicarious calibration of the MODIS TIR bands.

Wan, Zhengming↗
NASA NTRS2000

Independent Component Analysis of Textures

A common method for texture representation is to use the marginal probability densities over the outputs of a set of multi-orientation, multi-scale filters as a description of the texture. We propose a technique, based on Independent Components Analysis, for choosing the set of filters that yield the most informative marginals, meaning that the product over the marginals most closely approximates the joint probability density function of the filter outputs. The algorithm is implemented using a steerable filter space. Experiments involving both texture classification and synthesis show that compared to Principal Components Analysis, ICA provides superior performance for modeling of natural and synthetic textures.

Manduchi, Roberto↗
NASA NTRS2021

Maya Forest Water Resources I: Using NASA Earth Observations to Map Forested Inundation in the Maya Forest

As climate change increases the severity and frequency of extreme weather events in the tropics, it is vital for the safety of local communities and the health of ecosystems to monitor seasonal inundation. Forested inundation affects the ability of forested wetlands to provide ecosystem services, such as flood mitigation, water filtration, carbon storage, and erosion mitigation. While ground-based monitoring has traditionally been used to map inundation extent, those methods are costly and time-intensive. The NASA DEVELOP team focused on seasonal inundation throughout 2008 in the Maya Forest, when changes in inundation were drastic. To monitor seasonal inundation, our team used in situ field data and Earth observations from Landsat 7 Enhanced Thematic Mapper (ETM+), Advanced Land Observing Satellite (ALOS) Phased Array type L-band Synthetic Aperture Radar (PALSAR) 1, Shuttle Radar Topography Mission (SRTM), and products from the Ice, Cloud, and Land Elevation Satellite (ICESat). The team applied a Random Forest algorithm to Landsat 7 imagery, generating an object-level land cover classification with an overall accuracy of 72.1% and forest class with 100% recall and 78% precision. The team applied L-band backscatter thresholds from existing literature to forest-masked ALOS imagery and refined the thresholds in an iterative process using field data and hydrology models to delineate seasonal inundation extent. These publicly available data products help end users from Belize’s Land Information Center (LIC) and Forest Department, Guatemala’s Center for Monitoring and Evaluation (CEMEC), and Mexico’s El Colegio de la Frontera Sur (ECOSUR) to inform land management and protect community infrastructure.

Madelyn Savan↗
DOE OSTI2018

Ambient occlusion – A powerful algorithm to segment shell and skeletal intrapores in computed tomography data

During the last decades, X-ray (micro-)computed tomography has gained increasing attention for the description of porous skeletal and shell structures of various organism groups. However, their quantitative analysis is often hampered by the difficulty to discriminate cavities and pores within the object from the surrounding region.Herein, we test the ambient occlusion (AO) algorithm and newly implemented optimisations for the segmentation of cavities (implemented in the software Amira). The segmentation accuracy is evaluated as a function of (i) changes in the ray length input variable, and (ii) the usage of AO (scalar) field and other AO-derived (scalar) fields. The results clearly indicate that the AO field itself outperforms all other AO-derived fields in terms of segmentation accuracy and robustness against variations in the ray length input variable. The newly implemented optimisations improved the AO field-based segmentation only slightly, while the segmentations based on the AO-derived fields improved considerably.Additionally, we evaluated the potential of the AO field and AO-derived fields for the separation and classification of cavities as well as skeletal structures by comparing them with commonly used distance-map-based segmentations. For this, we tested the zooid separation within a bryozoan colony, the stereom classification of an ophiuroid tooth, the separation of bioerosion traces within a marble block and the calice (central cavity)-pore separation within a dendrophyllid coral. The obtained results clearly indicate that the ideal input field depends on the three-dimensional morphology of the object of interest The segmentations based on the AO-derived fields often provided cavity separations and skeleton classifications that at were superior to or impossible to obtain with commonly used distance-map-based segmentations. The combined usage of various AO-derived fields by supervisd or unsupervised segmentation algorithms might provide a promising target for future research to further improve the results for this kind of high-end data segmentation and classification. Furthermore, the application of the developed segmentation algorithm is not restricted to X-ray (micro-)computed tomographic data but may potentially be useful for the segmentation of 3D volume data from other sources.

Computed tomography, Micro-computed tomography, Po↗