Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discrimination Learning”

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

Breaking the barrier of human-annotated training data for machine learning-aided plant research using aerial imagery

Machine learning (ML) can accelerate biological research. However, the adoption of such tools to facilitate phenotyping based on sensor data has been limited by (i) the need for a large amount of human-annotated training data for each context in which the tool is used and (ii) phenotypes varying across contexts defined in terms of genetics and environment. This is a major bottleneck because acquiring training data is generally costly and time-consuming. This study demonstrates how a ML approach can address these challenges by minimizing the amount of human supervision needed for tool building. A case study was performed to compare ML approaches that examine images collected by an uncrewed aerial vehicle to determine the presence/absence of panicles (i.e. “heading”) across thousands of field plots containing genetically diverse breeding populations of 2 Miscanthus species. Automated analysis of aerial imagery enabled the identification of heading approximately 9 times faster than in-field visual inspection by humans. Leveraging an Efficiently Supervised Generative Adversarial Network (ESGAN) learning strategy reduced the requirement for human-annotated data by 1 to 2 orders of magnitude compared to traditional, fully supervised learning approaches. The ESGAN model learned the salient features of the data set by using thousands of unlabeled images to inform the discriminative ability of a classifier so that it required minimal human-labeled training data. This method can accelerate the phenotyping of heading date as a measure of flowering time in Miscanthus across diverse contexts (e.g. in multistate trials) and opens avenues to promote the broad adoption of ML tools.

59 BASIC BIOLOGICAL SCIENCES↗

pixelvar79/ESGAN-Flowering-Detection-paper

Machine learning (ML) can accelerate biological research. However, the adoption of such tools to facilitate phenotyping based on sensor data has been limited by (i) the need for a large amount of human-annotated training data for each context in which the tool is used and (ii) phenotypes varying across contexts defined in terms of genetics and environment. This is a major bottleneck because acquiring training data is generally costly and time-consuming. This study demonstrates how a ML approach can address these challenges by minimizing the amount of human supervision needed for tool building. A case study was performed to compare ML approaches that examine images collected by an uncrewed aerial vehicle to determine the presence/absence of panicles (i.e. “heading”) across thousands of field plots containing genetically diverse breeding populations of 2 Miscanthus species. Automated analysis of aerial imagery enabled the identification of heading approximately 9 times faster than in-field visual inspection by humans. Leveraging an Efficiently Supervised Generative Adversarial Network (ESGAN) learning strategy reduced the requirement for human-annotated data by 1 to 2 orders of magnitude compared to traditional, fully supervised learning approaches. The ESGAN model learned the salient features of the data set by using thousands of unlabeled images to inform the discriminative ability of a classifier so that it required minimal human-labeled training data. This method can accelerate the phenotyping of heading date as a measure of flowering time in Miscanthus across diverse contexts (e.g. in multistate trials) and opens avenues to promote the broad adoption of ML tools.

Varela, Sebastian↗

The evaluation of display symbology - A chronometric study of visual search

Three single-target visual search tasks were used to evaluate a set of CRT symbols for a helicopter traffic display. The search tasks were representative of the kinds of information extraction required in practice, and reaction time was used to measure the efficiency with which symbols could be located and identified. The results show that familiar numeric symbols were responded to more quickly than graphic symbols. The addition of modifier symbols such as a nearby flashing dot or surrounding square had a greater disruptive effect on the graphic symbols than the alphanumeric characters. The results suggest that a symbol set is like a list that must be learned. Factors that affect the time to respond to items in a list, such as familiarity and visual discriminability, and the division of list items into categories, also affect the time to identify symbols.

Remington, R.↗

On the selection and evaluation of visual display symbology Factors influencing search and identification times

Three single-target visual search tasks were used to evaluate a set of cathode-ray tube (CRT) symbols for a helicopter situation display. The search tasks were representative of the information extraction required in practice, and reaction time was used to measure the efficiency with which symbols could be located and identified. Familiar numeric symbols were responded to more quickly than graphic symbols. The addition of modifier symbols, such as a nearby flashing dot or surrounding square, had a greater disruptive effect on the graphic symbols than did the numeric characters. The results suggest that a symbol set is, in some respects, like a list that must be learned. Factors that affect the time to identify items in a memory task, such as familiarity and visual discriminability, also affect the time to identify symbols. This analogy has broad implications for the design of symbol sets. An attempt was made to model information access with this class of display.

Remington, Roger↗

Leveraging intermediate resonances to probe CP violation at colliders

We explore the phenomenological impact of interference in tree-level contributions to three-body final states in $2\rightarrow 3$ scattering processes. This work introduces a novel search strategy leveraging asymmetries to enable sensitivity to CP-violating effects in less well-explored regions of phase space. Analytically, we demonstrate the effectiveness of this observable in probing interference between Standard Model charged-current decays and effective left-handed vector interactions, illustrated in a toy model featuring a scalar leptoquark, $S_1 \sim (3, 1, -\,1/3)$. Numerically, we apply this framework to studying the process $pp\rightarrow b \tau \nu $; unlike traditional high-$p_T$ searches or “bump hunts”, this approach utilizes an intermediate energy regime – where new physics is neither light enough to be produced on shell or heavy enough to justify an effective field theory treatment. A proof-of-principle analysis at parton level demonstrates a percent-level asymmetry, with sensitivity also to BSM weak-CP phase. While the specific phase sensitivity is diminished at particle level due to showering and detector effects, a machine learning classifier can recover sensitively to the presence of SM-BSM interference, significantly outperforming standard analysis methods. Notably discrimination between BSM signal and SM background could be achieved at the 2$\sigma $ level for the current LHC dataset and 8$\sigma $ at the High-Luminosity LHC. Moreover, this asymmetry observable as defined can also be more broadly applied to other searches for CP-violation in $2\rightarrow 3$ processes in present and future collider environments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Inferring vegetation characteristics using a knowledge-based system

A knowledge-based system for inferring physical and biological surface properties of vegetation using nadir and/or directional reflectance data as input is developed. A portion of this system has been developed to discriminate between user-defined vegetation classes using spectral and directional reflectance relationships. This discrimination program was used to classify targets into user-defined ground cover and plant height classes. The program learns class descriptors from samples (both positive and negative) of spectral, directional reflectance data of natural surfaces (bare soils, natural vegetation, and agricultural vegetation). The system is designed to handle any combination of directional view angles. The explicit relationships used in the class descriptions include greater-than relationships between combinations of two view angles and maximum and minimum value relationships. The class descriptions are used to classify an unknown target using the same directional views. The program was tested by learning class descriptions of various categories of percent ground cover and vegetation height.

Kimes, D. S.↗

Deep Learning Models for Planetary Seismicity Detection

Research in planetary seismology is fundamentally constrained by a lack of data. Seismo-logical science products of future missions can typically only be informed by theoretical signal/noise characteristics of the environment or likely Earth-analogues. Although objectives can be re-assessed after some initial data-collection upon lander arrival, transfer of high-resolution data back to Earth is costly on lander power usage. Over the last several years, development of GPU computing techniques and open-source high-level APIs have led to rapid advances in deep learning within the fields of computer vision, natural language processing, and collaborative filtering. These techniques are actively being adapted in seismology for a variety of tasks, including: earthquake detection, seismic phase discrimination, and ground-motion prediction. Until the recent detection of mars quakes during the Mars InSight mission, the only other measurements of seismicity recorded outside of Earth was on the Moon during the Apollo missions between 1969 to 1977. These unique data sets have been periodically revisited using new seismological methods, including ambient noise interferometry and Hidden Markov Models. Our objective is to develop a deep learning seismic detector and use it to catalog moonquakes from the Apollo 17 Lunar Seismic Profiling Experiment (LSPE) and compare the results with those obtained by other methods. Additionally, we will assess the accuracy tradeoff between using a training set of lunar data and one composed of Earth seismicity. In this document, we present preliminary results using a prototype classifier trained on a small set of earthquakes that was able to obtain detections for LSPE moonquakes with a greater accuracy than a recent study using Hidden Markov Models.

Civilini, F.↗

Phase Function Determination in Support of Orbital Debris Size Estimation

To recover the size of a space debris object from photometric measurements, it is necessary to determine its albedo and basic shape: if the albedo is known, the reflective area can be calculated; and if the shape is known, the shape and area taken together can be used to estimate a characteristic dimension. Albedo is typically determined by inferring the object s material type from filter photometry or spectroscopy and is not the subject of the present study. Object shape, on the other hand, can be revealed from a time-history of the object s brightness response. The most data-rich presentation is a continuous light-curve that records the object s brightness for an entire sensor pass, which could last for tens of minutes to several hours: from this one can see both short-term periodic behavior as well as brightness variations with phase angle. Light-curve interpretation, however, is more art than science and does not lend itself easily to automation; and the collection method, which requires single-object telescope dedication for long periods of time, is not well suited to debris survey conditions. So one is led to investigate how easily an object s brightness phase function, which can be constructed from the more survey-friendly point photometry, can be used to recover object shape. Such a recovery is usually attempted by comparing a phase-function curve constructed from an object s empirical brightness measurements to analytically-derived curves for basic shapes or shape combinations. There are two ways to accomplish this: a simple averaged brightness-versus phase curve assembled from the empirical data, or a more elaborate approach in which one is essentially calculating a brightness PDF for each phase angle bin (a technique explored in unpublished AFRL/RV research and in Ojakangas 2011); in each case the empirical curve is compared to analytical results for shapes of interest. The latter technique promises more discrimination power but requires more data; the former can be assembled in its essentials from fewer measurements but will be less definitive in its assignments. The goal of the present study is to evaluate both techniques under debris survey conditions to determine their relative performance and, additionally, to learn precisely how a survey should be conducted in order to maximize their performance. Because the distendedness of objects has more of an effect than their precise shape in calculating a characteristic dimension, one is interested in the techniques discrimination ability to distinguish between an elongated rectangular prism and a short rectangular prism or cube, or an elongated cylinder from a squat cylinder or sphere. Sensitivity studies using simulated data will be conducted to determine discrimination power for both techniques as a function of amount of data collected and range (and specific region) of phase angles sampled. Empirical GEODSS photometry data for distended objects (dead payloads with solar panels, rocket bodies) and compact objects (cubesats, calibration spheres, squat payloads) will also be used to test this discrimination ability. The result will be a recommended technique and data collection paradigm for debris surveys in order to maximize this type of discrimination.

Hejduk, M. D.↗

Rapid Coal-Ash Characterization using Geophysical Methods & Machine Learning

Coal combustion products (CCP) are challenging to delineate in heterogeneous field settings. Conventional methods (test pits, coring, and laboratory analyses) are labor-intensive, slow, invasive, and provide sparse spatial coverage. This study evaluates whether rapid non-invasive geophysical screening methods—induced polarization (IP), magnetic susceptibility, and nuclear magnetic resonance (NMR) —combined with surface colorimetry (RGB_24), can discriminate CCP-soil mixtures and provide reliable estimates of CCP content. Laboratory measurements were collected on five CCP-soil mixtures (series) and modeled using (i) a linear baseline, (ii) a calibrated non-linear (power-mean) model, and (iii) a machine-learning (ML) Random Forest approach, with validation via leave-one-series-out and site-specific tests. Across the five series, individual signals—particularly IP and magnetic susceptibility—were strongly predictive of ash content but were consistently outperformed by combined models. The pooled calibrated non-linear and ML models captured the observed non-linearity and achieved high accuracy and precision, improving on linear fits. Colorimetry showed the weakest direct relationship with ash content for the tested samples but improved performance when included in multi-signal models. At pre-selected 3.5% decision threshold, calibrated and ML approaches yielded near-perfect classification (Matthews correlation coefficient ˜ 1), suggesting strong practical operability for field screening. Additionally, field-analog tests highlighted the role of endmembers—accuracy declined without access to end-member measurements but was largely recovered by collecting a minimal labeled pair for local recalibration. With end members, accuracy remained high. Globally trained models performed well on three operational unknowns; however, series-specific refits provided the most accurate predictions. Overall, these results highlight the potential of combining rapid geophysics and minimal local calibration for improved coal-ash delineation.

Peshtani, Klaudio↗

DASEventNet: AI‐Based Microseismic Detection on Distributed Acoustic Sensing Data From the Utah FORGE Well 16A (78)‐32 Hydraulic Stimulation

Abstract Distributed acoustic sensing (DAS) has emerged as a promising seismic technology for monitoring microearthquakes (MEQs) with high spatial resolution. Efficient algorithms are needed for processing large DAS data volumes. This study introduces a deep learning (DL) model based on a Residual Convolutional Neural Network (ResNet) for detecting MEQs using DAS data, named as DASEventNet. The test data were collected from the Utah FORGE 16A (78)‐32 hydraulic stimulation experiments conducted in April 2022. The DASEventNet model achieves a remarkable accuracy of 100% when discriminating MEQs from noise in the raw test set of 260 examples. Surprisingly, the model identified weak MEQ signatures that have been manually categorized as noise. The decision‐making process with the model is decoded by the classic activation map, which illuminates learning features of the DASEventNet model. These features provide clear illustrations of weak MEQs and varied noise types. Finally, we apply the trained model to the entire period (∼7 days) of continuous DAS recordings and find that it discovers >5,700 new MEQs, previously unregistered in the public Silixa DAS catalog. The DASEventNet model significantly outperforms the traditional seismic method Short‐Term Average/Long‐Term Average (STA/LTA), which detected only 1,307 MEQs. The DASEventNet detection threshold is M w −1.80 compared to the minimum magnitude of M w −1.14 detected by STA/LTA. The spatiotemporal distribution of the newly identified MEQs defines an extensive stimulation zone and more accurately characterizes fracture geometry. Our results highlight the potential of DL for long‐term, real‐time microseismic monitoring that can improve enhanced geothermal systems and other activities that include subsurface hydraulic fracturing.

15 GEOTHERMAL ENERGY↗

A two-stage optical fusion framework for wildfire severity mapping across the conterminous United States

Accurate wildfire severity mapping (WSM) is essential for post-fire recovery planning, erosion risk assessment, ecosystem monitoring, and disaster risk reduction. Although Landsat and Sentinel optical imagery have been widely used for burn severity assessment, the added value of fusing multiple optical sensors has not been sufficiently quantified across diverse fire events, particularly since the launch of Landsat-9. This study evaluates whether multisensor optical fusion improves wildfire severity mapping relative to single-sensor baselines using Sentinel-2, Landsat-8, and Landsat-9 imagery across 40 wildfire events in the conterminous United States. We tested a two-stage fusion framework that combines feature-level fusion with pixel-level dimensionality reduction. First, feature-level fused datasets were created through early fusion by combining standardized post-fire bands from each sensor into a single predictor stack. Both raw reflectance bands and pairwise spectral transforms were retained to capture within- and cross-sensor spectral interactions. Second, Linear Discriminant Analysis was applied to both single-sensor and fused datasets to produce comparable low-dimensional feature spaces. Six machine-learning classifiers were then used to benchmark model performance with repeated spatially buffered train–test splits. Results show that Landsat-9 was the strongest single-sensor baseline. Among the fusion strategies, Sentinel-2 + Landsat-9 produced the most consistent improvement and reduced performance variability. Landscape-condition analysis further showed that this fusion was most beneficial in shrubland-dominated and high-terrain fires, where it achieved the highest overall mean accuracy and the fewest failures. In contrast, its benefits were less reliable in evergreen forests, mixed vegetation, and low- to moderate-elevation terrain. In operational settings, the Sentinel-2 + Landsat-9 configuration offers a practical solution for post-fire recovery planning, erosion-risk assessment, watershed management, and ecological monitoring when field observations are available and timely satellite-based information is needed.

Landsat↗

Investigation of design principles for metal-binding and conductive protein assemblies

Throughout the lifetime of this initiative, including renewals, we focused on understanding the fundamental principles of protein-protein interface design that enable predictable and modular spatial and kinetic control of multi-component protein self-assembly in 1D, 2D, and 3D, including the interface with inorganic materials, small molecules, and metal ions. We designed individual protein components that bind specific metal ions, including REEs and transport ions across lipid membranes. We created helical 1D filaments of repeating units with programmed periodicity, pitch, and multi-component environmentally responsive self-assembling protein fibers. We showed that these filaments reversibly assemble and disassemble under specific pH conditions and created end-specific caps that independently tune the balance of attachment and detachment rates at each terminus of the filament. Using similar filaments, we succeeded in binding arrays of heme and chlorophyll molecules and assembling patterned helical coatings around carbon nanotubes in efforts to create de novo conductive nanowires. By arraying REE binding sites in a large circular tandem array with a repeat protein-based cyclic oligomer, we created a molecular scaffold for superradiance and paramagnetic quantum sensing. We created a range of one-component and two-component self-assembling 2D arrays and showed that when designed to engage cell receptors, these arrays can control cell behavior from outside the cell signal to inside the cell. We designed helical repeat proteins with variable lengths displaying charged residues in a pattern matched to the cation lattice of mica. achieved a range of ordered states with an epitaxial match to the underlying crystal lattice. We further applied the learned principles of protein-induced biomineralization to design proteins with an interface lattice matching CaCO 3 and guide the formation of specific crystal forms of CaCO 3 from solution, a significant advance toward the global need to manage carbon. In all cases of mineral lattice matching and biomineralization, we followed assembly using molecularly resolved in situ AFM imaging and extracted information about assembly pathways and energetics, applying deep learning to quantify the dynamics of protein self-organization. We developed techniques for using dynamic metal-dependent interfaces on protein nanopores for discriminatively sensing dilute REEs in solution and demonstrated the use of strong metal-binding interfaces to drive nanocage disassembly for conditional nanocompartmentalization applications. This grant supported 11 people, including Asim Bera, Evans Brackenbrough, Andrew Borst, Nikita Hanikel, Timothy Huddy, Emily Joyce, Alex Young-Seug Kang, Ryan Kibler, Joshua Morris Lubner, Harley Pyles, and Shuai Zhang. The research effort culminated in the production of published papers and theses. Electronic Thesis/Dissertation are distributed by ProQuest/UMI Dissertation Publishing and made available on an open access basis through UW Libraries ResearchWorks Service.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Is infrared-collinear safe information all you need for jet classification?

Machine learning-based jet classifiers are able to achieve impressive tagging performance in a variety of applications in high-energy and nuclear physics. However, it remains unclear in many cases which aspects of jets give rise to this discriminating power, and whether jet observables that are tractable in perturbative QCD such as those obeying infrared-collinear (IRC) safety serve as sufficient inputs. In this article, we introduce a new classifier, Jet Flow Networks (JFNs), in an effort to address the question of whether IRC unsafe information provides additional discriminating power in jet classification. JFNs are permutation-invariant neural networks (deep sets) that take as input the kinematic information of reconstructed subjets. The subjet radius and a cut on the subjet’s transverse momenta serve as tunable hyperparameters enabling a controllable sensitivity to soft emissions and nonperturbative effects. We demonstrate the performance of JFNs for quark vs. gluon and Z vs. QCD jet tagging. For small subjet radii and transverse momentum cuts, the performance of JFNs is equivalent to the IRC-unsafe Particle Flow Networks (PFNs), demonstrating that infrared-collinear unsafe information is not necessary to achieve strong discrimination for both cases. As the subjet radius is increased, the performance of the JFNs remains essentially unchanged until physical thresholds that we identify are crossed. For relatively large subjet radii, we show that the JFNs may offer an increased model independence with a modest tradeoff in performance compared to classifiers that use the full particle information of the jet. These results shed new light on how machines learn patterns in high-energy physics data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

Approximation Of Multi-Valued Inverse Functions Using Clustering And Sugeno Fuzzy Inference

Finding the inverse of a continuous function can be challenging and computationally expensive when the inverse function is multi-valued. Difficulties may be compounded when the function itself is difficult to evaluate. We show that we can use fuzzy-logic approximators such as Sugeno inference systems to compute the inverse on-line. To do so, a fuzzy clustering algorithm can be used in conjunction with a discriminating function to split the function data into branches for the different values of the forward function. These data sets are then fed into a recursive least-squares learning algorithm that finds the proper coefficients of the Sugeno approximators; each Sugeno approximator finds one value of the inverse function. Discussions about the accuracy of the approximation will be included.

Walden, Maria A.↗

Aerosol and Cloud Detection Using Machine Learning Algorithms and Space-Based Lidar Data

Clouds and aerosols play a significant role in determining the overall atmospheric radiation budget, yet remain a key uncertainty in understanding and predicting the future climate system. In addition to their impact on the Earth’s climate system, aerosols from volcanic eruptions, wildfires, man-made pollution events, and dust storms are hazardous to aviation safety and human health. Space-based lidar systems provide critical information about the vertical distributions of clouds and aerosols that greatly improve our understanding of the climate system. However, daytime data from backscatter lidars, such as the Cloud-Aerosol Transport System (CATS) on the International Space Station (ISS), must be averaged during science processing at the expense of spatial resolution to obtain sufficient signal-to-noise ratio (SNR) for accurately detecting atmospheric features. For example, 50% of all atmospheric features reported in daytime operational CATS data products require averaging to 60 km for detection. Furthermore, the single-wavelength nature of the CATS primary operation mode makes accurately typing these features challenging in complex scenes. This paper presents machine learning (ML) techniques that, when applied to CATS data, enable detection of atmospheric features during daytime operations with a horizontal resolution of 5 km compared to the 60 km horizontal resolution often required for daytime CATS data. A Convolutional Neural Network (CNN) trained using CATS standard data products also demonstrated the potential for improved cloud-aerosol discrimination compared to the operational CATS algorithms for cloud edges and complex near-surface scenes during daytime.

lidar↗