Search NASASearch

SEARCH · Search NASA

Results for “Algorithm Classification”

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 199 records · Page 11

Fast Neutron Spectroscopy with Organic Scintillation Detectors in a High-Radiation Environment

Organic scintillators with pulse shape discrimination capability are widely used in both research and practical applications of neutron detection. The neutron and gamma-ray identification performance of the detector depends on the classification algorithms, noise filters and pileup rejection criteria in a high-flux bremsstrahlung radiation environment. In this paper, a technique has been developed and implemented for the neutron detection with multiple filter and discrimination steps, which to a high confidence level eliminates counting of gamma-ray pulses. Such a technique is merited when making measurements in a high flux bremsstrahlung and secondary fluorescence environment. The EJ-309 and stilbene detectors coupled to the digital data acquisition system were used for the calibration assessments with standard gamma-ray and neutron sources such as 137Cs, 60Co, 252Cf, and Am-Be. The MCNPX-PoliMi and GEANT4 toolkits were used to simulate the light output and the optical photon transport in the scintillators and create detector response functions for each type of detector. The neutron spectrum unfolding algorithm, GRAVELW, was used to recreate and calibrate with the Am-Be as final step before applying the neutron detection system to extract fusion neutron spectra generated in an intense bremsstrahlung radiation environment. This new technique described offers the user the ability to measure neutron spectra in a high-flux gamma-ray field and tune the parameters to meet required filtering needs.

Neutron Detector, Organic Scintillator, PulseShape

Estimating Soil Moisture in a Boreal Old Jack Pine Forest

Polarimetric L- and P-band AIRSAR data, corresponding model simulations, and classification algorithms have shown that in a boreal old jack pine (OJP) stand, the principal scattering mechanism responsible for radar backscatter is the double-bounce mechanism between the tree trunks and the ground.

Soil

Augmenting Landsat time series with Harmonized Landsat Sentinel-2 data products: Assessment of spectral correspondence

An increase in the temporal revisit of satellite data is often sought to increase the likelihood of obtaining cloud- and shadow-free observations as well as to improve mapping of rapidly- or seasonally-changing features. Currently, as a tandem, Landsat-7 Enhanced Thematic Mapper Plus (ETM+) and −8 Operational Land Imager (OLI) provide an acquisition opportunity on an 8-day revisit interval. Sentinel-2A and -2B MultiSpectral Instrument (MSI), with a wider swath, have a 5-day revisit interval at the equator. Due to robust pre- and post-launch cross-calibration, it has been possible for NASA to produce the Harmonized Landsat Sentinel-2 (HLS) data product from Landsat-8 OLI and Sentinel-2 MSI: L30 and S30, respectively. Knowledge of the agreement of HLS outputs (especially S30) with historic Landsat surface reflectance products will inform the ability to integrate historic time-series information with new and more frequent measures as delivered by HLS. In this research, we control for acquisition date and data source to cross-compare the HLS data (L30, S30) with established Landsat-8 OLI surface-reflectance measures as delivered by the USGS (hereafter BAP, Best Available Pixel). S30 and L30 were found to have high agreement (R = 0.87–0.96) for spectral channels and an r = 0.99 for Normalized Burn Ratio (NBR) with low relative root-mean-square difference values (1.7%–3.3%). Agreement between L30 and BAP was lower, with R values ranging from 0.85 to 0.92 for spectral channels and R = 0.94 for NBR. S30 and BAP had the lowest agreement, with R values ranging from 0.71 to 0.85 for spectral channels and r = 0.90 for NBR. Comparisons indicated a stronger agreement at latitudes above 55° N. Some dependency between spectral agreement and land cover was found, with stronger correspondence for non-vegetated cover types. The level of agreement between S30 and BAP reported herein would enable integration of HLS outputs with historic Landsat data. The resulting increased temporal frequency of data allows for improvements to current cloud screening practices and increases data density and the likelihood of temporal proximity to target date for pixel compositing approaches. Furthermore, additional within-year observations will enable change products with a higher temporal fidelity and allow for the incorporation of phenological trends into land cover classification algorithms.

Michael A. Wulder

Harmonized Sentinel-1 SAR Global River Geometry and Inundation Database

Satellite-based observations on river geometries are sporadic in time, space, or both. Most satellite-based surface water maps, river widths, water surface elevations (WSE), slopes, and bathymetry are asynchronized in time and space. The current configuration of satellites such as Sentinel-6 measured the WSE but is missing the river width, slopes, and depths. To advance hydrological sciences research, there is a need to produce a harmonized time series of river geometry data of non-SWOT satellites in partnership with the upcoming SWOT mission. The SWOT satellite will measure river width, height, and slope but missing river depth measurements in space and time. Further, none of these current satellites measure the WSE, river width, and slopes synchronously. In this work, we use the Sentinel-1 SAR satellite data archive from 2015 to the present to create a global river width and surface water database at the reach scale. A modified version of the Sentinel SAR surface water classification algorithm from ASF is used to quantify the surface water extent on the stream approximately every six days (at the equator) at 10m spatial resolution globally. This 10m water mask is fed into a workflow to quantify the river widths, surface water inundations, slopes, and synthetic bathymetry in SWORD (SWOT River Database) stream networks. A Satellite HAND is used to address the cloud obscured surface water observations using a trained machine learning algorithm. We use WSE derived from the Global Water Monitor from NASA GSFC, Hydroweb from LEGOS, and ICESat-2 to harmonize the WSE observation. And Landsat-8/9 and Sentinel-2 water observations to fill the gaps in the Sentinel-1 SAR database. We use Congo River Basin as a test case where we have more than 500 radar altimetry-based WSE, continuous series of Sentinel-1, ICESat-2, Landsat-8/9, and Sentinel-2 observations. A Congo River hydrologic model is used to generate the streamflow discharge. The satellite observed river reaches are assimilated with the stream flows computed by the routing models. And the downstream reaches in the river network without satellite observations get optimized for discharge/river geometry at each observation cycle. Our final product is a harmonized river geometry dataset (reach's water extent, WSE, slope, synthetic bathymetry) for Congo Basin's SWORD reaches.

Chandana Gangodagamage

Maldives Climate II: Evaluating the Potential Impacts of Sea Level Rise on Human Development and Coastal Infrastructure

The Republic of the Maldives is a low-lying island nation in the Indian Ocean which has experienced rapid urbanization, landcover changes, and sea level rise over recent years. The growth of tourism, coastal erosion, and urbanization have all driven land reclamation efforts across many islands. As in-situ landcover change monitoring has proven difficult across the vast archipelago, the NASA DEVELOP team collaborated with the Maldives Ministry of Environment, Climate Change, and Technology; USAID; and the U.S. Department of State, to utilize Earth observations to predict sea level rise impacts on coastal infrastructure. The team used a supervised classification algorithm within Google Earth Engine to create land use maps and time series analyses of nine islands and atolls using imagery from Landsat 7 Enhanced Thematic Mapper Plus, Landsat 8 Operational Land Imager, Sentinel-2 Multispectral Instrument, and PlanetScope, covering a combined period of 2000 through 2023. Additionally, the team projected coastal inundation with a modified deterministic Bathtub model utilizing elevation data from CoastalDEM and 2050-2100 Shared Socioeconomic Pathway scenarios identified in the NASA Sea Level Rise Projection Tool. The team found that islands undergoing urban growth experienced a 23% decrease in vegetation between 2014 and 2022. Furthermore, the model predicted that 51–57% of the study area’s-built environment has a chance of inundation by 2100 under the low and high sea level scenarios. These analyses demonstrate how remote sensing can be used to both track land use changes over time and project how coastlines will be affected by sea level rise.

remote sensing

Bandelier Ecological Conservation: Mapping Invasive Species Along the Rio Grande Corridor in Bandelier National Monument

The Southwest U.S. has experienced a growth of invasive riparian species, specifically Elaeagnus angustifolia (Russian olive), Tamarix ramosissima (saltcedar), and Ulmus pumila (Siberian elm), which alter local soil chemistry and outcompete native species. Locating these exotic species is critical for ecological conservation; however, field identification can be resource intensive. NASA DEVELOP partnered with the National Park Service (NPS) at Bandelier National Monument (BAND) to assess the feasibility of using Earth observation data to map invasive species along the Rio Grande corridor of the park. The team used Landsat 8 OLI, Sentinel-2 MSI, and ISS DESIS imagery to compute principal components based on spectral bands, vegetation indices, and terrain indices. Using the first five principal components, the team created classification maps using both a k-means classification algorithm and a random forest algorithm to differentiate between native and non-native species. The team derived maps for the three invasive riparian species in the region for the last five years. The team found that invasive species covered 33% of the park's river corridor in 2023, and the invasive species extent has increased by 5.7% from 2019 to 2023. The methods will serve as a guide for aiding historic and present invasive species identification in riparian regions, and the NPS staff at BAND will use the results to inform local mitigation practices and advocate for invasive species removal.

Evan Barrett

The Emerging Issue-3 Revision of the Ccsds-123.0-B Low-Complexity Lossless and Near-Lossless Multispectral and Hyperspectral Image Compression Standard

The CCSDS-123.0-B Low-Complexity Lossless and Near-Lossless Multispectral & Hyperspectral Image Compression standard provides state-of-the-art compression for imaging spectrometer data. Issue 1 of this standard, published in 2012, provides only lossless compression capability. In 2019, Issue 2 was published, adding new features and in particular augmenting the compressor to provide also near-lossless compression, i.e., compression with a user-specified error limit in each spectral band. This presentation will describe the Issue 3 revision currently under development by the CCSDS Data Compression working group. This revision will provide region-of-interest compression capability. That is, a user-provided spatial classification map can be used to specify different data fidelity parameters in different image regions. This would, for example, allow an onboard classification algorithm to identify the most important regions of an image, or regions obscured by clouds, and adjust compression fidelity accordingly in each region to maximize value of imaging spectrometer data returned over constrained space communication links. The revision also aims to add an option that is unrelated to region-of-interest compression but can improve compression effectiveness in some cases.

CCSDS Hyperspectral

EVI-LOCATE: One Stop Solution for Estimating Cost of Installing EV Charging Stations

EVI-LOCATE (Electric Vehicle Infrastructure-Locally Optimized Cost Assessment Tool and Estimator) is a site assessment tool to estimate costs to install EV charging stations. EVI-LOCATE enables users to generate site-specific, user-specific, and location-specific EV charging station installation designs and cost estimates. The tool integrates National Electrical Code, deep-learning pixel classification algorithm, and component-level costs to estimate the costs.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC

Task-specific sensor optical designs

A method and system architecture for designing a compressive sensing matrix for machine learning includes receiving an image associated with a classification task and; generating a sensing matrix. The sensing matrix includes an array of nonzero elements of the image. A prism array of prism elements is in communication with the sensing matrix. A row of values corresponding with an input angle of the prism array is mapped to a respective column corresponding with a detector. Then the detector detects light refracted at an output angle dictated by the physical shape of the prism element. A physical model of the detector is fabricated and generates a compressed representation of the image. A machine learning classification algorithm is applied to the compressed representation of the image and generates an optimized non-invertible final determination of the image.

Birch, Gabriel Carlisle

An Automated Algorithm to Screen Massive Training Samples for a Global Impervious Surface Classification

An algorithm is developed to automatically screen the outliers from massive training samples for Global Land Survey - Imperviousness Mapping Project (GLS-IMP). GLS-IMP is to produce a global 30 m spatial resolution impervious cover data set for years 2000 and 2010 based on the Landsat Global Land Survey (GLS) data set. This unprecedented high resolution impervious cover data set is not only significant to the urbanization studies but also desired by the global carbon, hydrology, and energy balance researches. A supervised classification method, regression tree, is applied in this project. A set of accurate training samples is the key to the supervised classifications. Here we developed the global scale training samples from 1 m or so resolution fine resolution satellite data (Quickbird and Worldview2), and then aggregate the fine resolution impervious cover map to 30 m resolution. In order to improve the classification accuracy, the training samples should be screened before used to train the regression tree. It is impossible to manually screen 30 m resolution training samples collected globally. For example, in Europe only, there are 174 training sites. The size of the sites ranges from 4.5 km by 4.5 km to 8.1 km by 3.6 km. The amount training samples are over six millions. Therefore, we develop this automated statistic based algorithm to screen the training samples in two levels: site and scene level. At the site level, all the training samples are divided to 10 groups according to the percentage of the impervious surface within a sample pixel. The samples following in each 10% forms one group. For each group, both univariate and multivariate outliers are detected and removed. Then the screen process escalates to the scene level. A similar screen process but with a looser threshold is applied on the scene level considering the possible variance due to the site difference. We do not perform the screen process across the scenes because the scenes might vary due to the phenology, solar-view geometry, and atmospheric condition etc. factors but not actual landcover difference. Finally, we will compare the classification results from screened and unscreened training samples to assess the improvement achieved by cleaning up the training samples. Keywords:

Tan, Bin

An evaluation of ISOCLS and CLASSY clustering algorithms for forest classification in northern Idaho

Both the iterative self-organizing clustering system (ISOCLS) and the CLASSY algorithms were applied to forest and nonforest classes for one 1:24,000 quadrangle map of northern Idaho and the classification and mapping accuracies were evaluated with 1:30,000 color infrared aerial photography. Confusion matrices for the two clustering algorithms were generated and studied to determine which is most applicable to forest and rangeland inventories in future projects. In an unsupervised mode, ISOCLS requires many trial-and-error runs to find the proper parameters to separate desired information classes. CLASSY tells more in a single run concerning the classes that can be separated, shows more promise for forest stratification than ISOCLS, and shows more promise for consistency. One major drawback to CLASSY is that important forest and range classes that are smaller than a minimum cluster size will be combined with other classes. The algorithm requires so much computer storage that only data sets as small as a quadrangle can be used at one time.

Werth, L. F.

Development of visible/infrared/microwave agriculture classification and biomass estimation algorithms, volume 2

Agricultural crop classification models using two or more spectral regions (visible through microwave) were developed and tested and biomass was estimated by including microwave with visible and infrared data. The study was conducted at Guymon, Oklahoma and Dalhart, Texas utilizing aircraft multispectral data and ground truth soil moisture and biomass information. Results indicate that inclusion of C, L, and P band active microwave data from look angles greater than 35 deg from nadir with visible and infrared data improved crop discrimination and biomass estimates compared to results using only visible and infrared data. The active microwave frequencies were sensitive to different biomass levels. In addition, two indices, one using only active microwave data and the other using data from the middle and near infrared bands, were well correlated to total biomass.

Rosenthal, W. D.

The Impact of Void-finding Algorithms on Galaxy Classification

We explore how the definition of a void influences the conclusions drawn about the impact of the void environment on galactic properties using two void-finding algorithms in the Void Analysis Software Toolkit: Voronoi Voids (V 2 ), a Python implementation of ZOnes Bordering On Voidness (ZOBOV); and VoidFinder, an algorithm that grows and merges spherical void regions. Using the Sloan Digital Sky Survey Data Release 7, we find that galaxies found in VoidFinder voids tend to be bluer and fainter and to have higher (specific) star formation rates than galaxies in denser regions. Conversely, galaxies found in V 2 voids show less significant differences when compared to galaxies in denser regions, less consistent with the large-scale environmental effects on galaxy properties expected from both simulations and previous observations. These results align with previous simulation results that show V 2 -identified voids “leak” into the dense walls between voids because their boundaries extend up to the density maxima in the walls. As a result, when using ZOBOV-based void-finders, galaxies likely to be part of wall regions are instead classified as void galaxies, a misclassification that can be critical to our understanding of galaxy evolution.

cosmic web

Evaluating algorithmic bias on biomarker classification of breast cancer pathology reports

Objectives: This work evaluated algorithmic bias in biomarkers classification using electronic pathology reports from female breast cancer cases. Bias was assessed across 5 subgroups: cancer registry, race, Hispanic ethnicity, age at diagnosis, and socioeconomic status. Materials and Methods: We utilized 594 875 electronic pathology reports from 178 121 tumors diagnosed in Kentucky, Louisiana, New Jersey, New Mexico, Seattle, and Utah to train 2 deep-learning algorithms to classify breast cancer patients using their biomarkers test results. We used balanced error rate (BER), demographic parity (DP), equalized odds (EOD), and equal opportunity (EOP) to assess bias. Results: We found differences in predictive accuracy between registries, with the highest accuracy in the registry that contributed the most data (Seattle Registry, BER ratios for all registries >1.25). BER showed no significant algorithmic bias in extracting biomarkers (estrogen receptor, progesterone receptor, human epidermal growth factor receptor 2) for race, Hispanic ethnicity, age at diagnosis, or socioeconomic subgroups (BER ratio <1.25). DP, EOD, and EOP all showed insignificant results. Discussion: We observed significant differences in BER by registry, but no significant bias using the DP, EOD, and EOP metrics for socio-demographic or racial categories. This highlights the importance of employing a diverse set of metrics for a comprehensive evaluation of model fairness. Conclusion: A thorough evaluation of algorithmic biases that may affect equality in clinical care is a critical step before deploying algorithms in the real world. We found little evidence of algorithmic bias in our biomarker classification tool. Artificial intelligence tools to expedite information extraction from clinical records could accelerate clinical trial matching and improve care.

60 APPLIED LIFE SCIENCES

Nearest Neighbor Algorithms for Pattern Classification

A solution of the discrimination problem is considered by means of the minimum distance classifier, commonly referred to as the nearest neighbor (NN) rule. The NN rule is nonparametric, or distribution free, in the sense that it does not depend on any assumptions about the underlying statistics for its application. The k-NN rule is a procedure that assigns an observation vector z to a category F if most of the k nearby observations x sub i are elements of F. The condensed nearest neighbor (CNN) rule may be used to reduce the size of the training set required categorize The Bayes risk serves merely as a reference-the limit of excellence beyond which it is not possible to go. The NN rule is bounded below by the Bayes risk and above by twice the Bayes risk.

Barrios, J. O.

Fast Solution in Sparse LDA for Binary Classification

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic form along with the inherent sequential nature of greedy search itself. Together this enables the use of highly-efficient partitioned-matrix-inverse techniques that result in large speedups of computation in both the forward-selection and backward-elimination stages of greedy algorithms in general.

Moghaddam, Baback

A simulation of remote sensor systems and data processing algorithms for spectral feature classification

A computational model of the deterministic and stochastic processes involved in multispectral remote sensing was designed to evaluate the performance of sensor systems and data processing algorithms for spectral feature classification. Accuracy in distinguishing between categories of surfaces or between specific types is developed as a means to compare sensor systems and data processing algorithms. The model allows studies to be made of the effects of variability of the atmosphere and of surface reflectance, as well as the effects of channel selection and sensor noise. Examples of these effects are shown.

Arduini, R. F.