Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “binary 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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

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↗
DOE OSTI2024

Quantifying Epistemic Uncertainty in Binary Classification via Accuracy Gain

ABSTRACT Recently, a surge of interest has been given to quantifying epistemic uncertainty (EU), the reducible portion of uncertainty due to lack of data. We propose a novel EU estimator in the binary classification setting, as the posterior expected value of the empirical gain in accuracy between the current prediction and the optimal prediction. In order to validate the performance of our EU estimator, we introduce an experimental procedure where we take an existing dataset, remove a set of points, and compare the estimated EU with the observed change in accuracy. Through real and simulated data experiments, we demonstrate the effectiveness of our proposed EU estimator.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Safe and Robust Binary Classification and Fault Detection Using Reinforcement Learning

In this paper, we propose a learning-based method utilizing the Soft Actor-Critic (SAC) algorithm to train a binary Support Vector Machine (SVM) classifier. This classifier is designed to identify valid input spaces in high-dimensional, highly constrained systems while minimizing the total runtime of offline simulations. The simulations adapt their runtime based on the likelihood that a given training input will be informative to the classifier. Furthermore, we introduce a method for using the trained SAC model to predict whether a desired system input is likely to violate constraints, along with a technique to adjust the input as necessary. Additionally, we explore the potential of this model to detect faults or adversarial attacks within the system. The effectiveness of our approach is demonstrated through various simulations of challenging classification problems and a constrained quadrotor model.

Netter, Josh [Georgia Institute of Technology, Atl↗
NASA NTRS1979

Binary classification of real sequences by discrete-time systems

This paper considers a novel approach to coding or classifying sequences of real numbers through the use of (generally nonlinear) finite-dimensional discrete-time systems. This approach involves a finite-dimensional discrete-time system (which we call a real acceptor) in cascade with a threshold type device (which we call a discriminator). The proposed classification scheme and the exact nature of the classification problem are described, along with two examples illustrating its applicability. Suggested approaches for further research are given.

Kaliski, M. E.↗
NASA NTRS1987

Binary image classification

Motivated by the LANDSAT problem of estimating the probability of crop or geological types based on multi-channel satellite imagery data, Morris and Kostal (1983), Hill, Hinkley, Kostal, and Morris (1984), and Morris, Hinkley, and Johnston (1985) developed an empirical Bayes approach to this problem. Here, researchers return to those developments, making certain improvements and extensions, but restricting attention to the binary case of only two attributes.

Morris, Carl N.↗
NASA NTRS2011

Testing of the Support Vector Machine for Binary-Class Classification

The Support Vector Machine is a powerful algorithm, useful in classifying data in to species. The Support Vector Machines implemented in this research were used as classifiers for the final stage in a Multistage Autonomous Target Recognition system. A single kernel SVM known as SVMlight, and a modified version known as a Support Vector Machine with K-Means Clustering were used. These SVM algorithms were tested as classifiers under varying conditions. Image noise levels varied, and the orientation of the targets changed. The classifiers were then optimized to demonstrate their maximum potential as classifiers. Results demonstrate the reliability of SMV as a method for classification. From trial to trial, SVM produces consistent results

autonomous target recognition systemr↗
NASA NTRS2019

Predictive Modeling for Differential Diagnosis and Mortality Risk Assessment

The prevalence of electronic health record (EHR) systems has brought prodigious biomedical informatics opportunity. Automated machine learning methods can effectively utilize such data and have become common tools for healthcare predictive modeling. Researches in medical informatics have explored the potential of deep learning and classical models in emergent care scenarios. In particular, predicting differential diagnoses for admissions have proven useful in decreasing unnecessary lab tests and improving inpatient triage decision-making. Moreover, identification of high-risk patients for in-hospital mortality is vitally important to maximize allocation of medical resources.The Medical Information Mart for Intensive Care (MIMIC-III) database, containing de-identified critical care inpatient was used in our study. This data set captures hospital patient laboratory measurements, pharmacologic prescriptions, diagnostic data and procedure event recordings. When considering adult patients and discounting admissions with ICU length of stay less than 24 hours, there were 37,787 unique admissions and 30,414 total patients. We examined the top 25 most prevalent ICD-9 group-level disease specificities in MIMIC-III using a multi-label classification model. In-hospital mortality was modeled as binary classification with 4,155 (13%) adult patients that expired, of which 3,138 (75.5%) were in the ICU setting. The metrics AUC, F1 score, sensitivity and specificity values calculated for each disease label measured prediction performance.The usage of ICD-9 group codes reduced feature dimension from 14,567 to 942 and greatly improved distribution of patient diagnostic categories. Disease temporal patterns were captured by considering the most frequently sampled 6 vital signs and 13 laboratory values. Missing data were imputed at each time-stamp. Time-series raw hourly average values were converted into 5 summary features (mean, standard deviation, number of observations, min & max values). Patient demographic variables such as age, gender, marital status and ethnicity were also factored into the modeling. Choi et al showed that contextual embedding of medical data, diagnostic and procedural codes alone can predict future diagnoses with sensitivity as high as 0.79. We utilized an embedding technique called word2vec which allowed sparse representations of medical history to be transformed into dense word vectors. The mappings captured contextual information by treating each admission as a sentence and learning the most likely neighboring words in a sliding window fashion. Binary and multi-label classification was achieved via collapse models, which do not consider temporal information, as well as recurrent neural networks with regularization, Softmax output layer activation together with categorical cross-entropy as the loss function.

US Army collaboration↗
DOE OSTI2024

Enhancing Electron Microscopy Image Classification Using Data Augmentation

Manual labeling for machine learning tasks such as image classification is tedious and labor-intensive; as a result, scientific datasets suitable for deep learning applications are scarce and limited. While data augmentation techniques have shown promise for extending image datasets, very little work has been done to understand the impact of combining multiple augmentation methods sequentially or the limits of their effectiveness when combined. Our work addresses this gap by examining how standard and combinatorial data augmentation affects the performance of machine learning models when trained on small datasets for label classification tasks. For our analysis, we generate single, double and quadruple-augmented datasets for a microscopy image classification task using six standard augmentation methods, and compare the resultant improvements observed in binary classification accuracy with three standard image classification models (DenseNet169, MobileNetV2, ResNet101V2). Our experiments show a non-monotonic relationship between the number of simultaneous augmentation methods and classification accuracy, indicating that there is a trade-off between the degree of augmentation and the model performance. These findings suggest that the optimal number of augmentation methods will vary by domain and use case. We also find that the order in which augmentation methods are applied to a limited dataset matters when combining augmentation schemes, with our use case showing performance differences up to 2.6% when the augmentation order is reversed for double-augmented datasets. Our work offers insights to the limits of data augmentation when working on image classification tasks with limited datasets.

Welsman, Jordan A↗
DOE OSTI2026

In-situ sensor monitoring of multi-class gas porosity formation in laser powder bed fusion using convolutional neural network

In-situ monitoring of defect formation remains a significant challenge in the laser powder bed fusion (LPBF) process. Recent advances have enabled real-time defect detection with machine learning and in-situ sensing technologies; however, most studies focus on binary classification of keyhole pores, limiting nuanced multi-class pore differentiation and formation mechanisms. This work introduces a multi-class pore detection framework (no pore, small pores < 15 µm, and large pores > 15 µm) by leveraging photodiode sensor data alongside high-fidelity synchrotron X-ray imaging. The 15 µm threshold is selected to distinguish between two fundamentally different defect mechanisms, following the physical size-mechanism boundary established by prior high-resolution synchrotron X-ray characterization of Al6061 LPBF. Distinguishing these classes is critical because large keyhole pores are structurally detrimental, whereas small gas pores are often benign, requiring different process control strategies. Thermal emission monitoring data collected simultaneously with high-speed X-ray imaging at the Stanford Synchrotron Radiation Lightsource (SSRL), are correlated with subsurface melt pool dynamics to establish ground truth. Continuous Wavelet Transform (CWT) with optimized parameters converts the photodiode time-series signals into time–frequency images, facilitating feature extraction. Convolutional Neural Networks (CNN) are then applied for real-time multi-class pore classification in an average inference time of 1 ms per signal window. It achieves 79% accuracy and an Area Under the Receiver Operating Characteristic curve (AUC ROC) score of 0.89 with five-fold cross-validation. The results demonstrate that coupling CWT-based feature engineering with CNN architecture enables reliable multi-class pore detection in Al6061 builds using affordable in-situ sensors. This approach advances scalable and affordable quality assurance in additive manufacturing by moving beyond binary defect detection toward more nuanced classification of porosity mechanisms with in-situ sensors and machine learning.

Laser powder bed fusion, Multi-class pores, In-sit↗
DOE OSTI2025

Comparative Analysis of DNA LLM Classification Techniques Using Intra-Layer Feature Extraction with Autoencoder Stacks [Poster]

This project conducts a comparative analysis of DNA LLM classification techniques using Evo2, Grover, and UTRML, focusing on intra-layer feature extraction in Evo2. By extracting features from multiple layers of Evo2 and integrating them into an autoencoder stack with a binary classification head, we evaluate its effectiveness in classifying genomic sequences compared to smaller DNA language models. My findings demonstrate that Evo2 outperforms Grover and UTRML in classification accuracy on a dataset provided by department 08625, CAO2021, while UTRML offers competitive performance with lower computational costs. This study highlights the potential of advanced embedding techniques in enhancing genomic data analysis and informs future research in bioinformatics.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2014

Spectral and Timing Nature of the Symbiotic X-Ray Binary 4U 1954+319: The Slowest Rotating Neutron Star in AN X-Ray Binary System

The symbiotic X-ray binary (SyXB) 4U 1954+319 is a rare system hosting a peculiar neutron star (NS) and an M-type optical companion. Its approx. 5.4 hr NS spin period is the longest among all known accretion-powered pulsars and exhibited large (is approx. 7%) fluctuations over 8 yr. A spin trend transition was detected with Swift/BAT around an X-ray brightening in 2012. The source was in quiescent and bright states before and after this outburst based on 60 ks Suzaku observations in 2011 and 2012. The observed continuum is well described by a Comptonized model with the addition of a narrow 6.4 keV Fe-K alpha line during the outburst. Spectral similarities to slowly rotating pulsars in high-mass X-ray binaries, its high pulsed fraction (approx. 60%-80%), and the location in the Corbet diagram favor high B-field (approx. greater than 10(exp12) G) over a weak field as in low-mass X-ray binaries. The observed low X-ray luminosity (10(exp33)-10(exp35) erg s(exp−1)), probable wide orbit, and a slow stellar wind of this SyXB make quasi-spherical accretion in the subsonic settling regime a plausible model. Assuming a approx. 10(exp13) G NS, this scheme can explain the approx. 5.4 hr equilibrium rotation without employing the magnetar-like field (approx. 10(exp16) G) required in the disk accretion case. The timescales of multiple irregular flares (approx. 50 s) can also be attributed to the free-fall time from the Alfv´en shell for a approx. 10(exp13) G field. A physical interpretation of SyXBs beyond the canonical binary classifications is discussed.

accretion disks aEuro" binaries: symbiotic aEuro" ↗
DOE OSTI2025

Differential Seismic Phase Detection Probability as a Potential Discriminant of Explosions and Earthquakes

Deep learning models trained to estimate the probability of seismic P and S phases are rapidly expanding the scale of local event detections. Here, we evaluate the potential for deep learning model output phase detection probabilities to contribute to event‐type classification, particularly discrimination of single‐fired borehole explosions and earthquakes at local distances (<300 km). Motivated by the empirical success of P/S amplitude ratios, we consider the difference between P and S pick probability output from previously developed phase detection models, P prob −S prob ⁠, as a discriminant. Test data include M L ∼1–4 earthquakes and explosions observed by common seismographs in ten geologically diverse localities. Depending on the picking model and training data, binary classification using P prob −S prob with at least three stations can achieve approximately equivalent classification accuracy as P/S amplitude ratios without requiring any customization. Joint classification with P/S and P prob −S prob improves accuracy for most quality control scenarios. Pick probabilities are an efficient attribute to consider in explosion discrimination because they can be automated byproducts of event detection. They avoid the binary choice of picking or not picking weakly visible S waves common to explosions.

Duan, Chenglong [Rice Univ., Houston, TX (United S↗
DOE OSTI2024

Decentralized Microgrid Protection Through Relative Fault Direction Classification: Preprint

Protection in inverter-based resources (IBRs) dominated microgrids generally face significant challenges due to the low fault current and inconsistent fault behaviors from IBRs. Recently, machine learning-based approaches have attracted considerable attention to address these challenges. This paper introduces a novel decentralized protection strategy for microgrids. The proposed method decomposes the protection challenge into several distributed learning tasks, enabling individual relays to autonomously determine the direction of faults using a binary classification framework based on support vector machine (SVM) algorithms. Following the distributed fault direction estimation, classifier outcomes are shared among neighboring relays, facilitating a local decision-making process to ascertain the presence of faults within the neighborhood. Finally, a tripping signal is generated based on the classifier results of each relay to operate the circuit breaker. To test and validate this approach, a 100% renewable microgrid model is simulated in MATLAB/Simulink. In the numerical analysis, the application of SVM classifiers in our approach yields impressive results: an average relay classification accuracy of 98%, and a 96% accuracy in circuit breaker control. These findings highlight the potential of machine-learning-based approaches in enhancing the efficiency and reliability of microgrid protection systems.

decentralized algorithm↗
NASA NTRS1997

The Gaseous Content of the Universe at Zeta less than 1.6

Together with graduate student Hsiao-Wen Chen, I have measured and analyzed structural and morphological parameters of 38 galaxies in eight fields for which sensitive measurements of corresponding Ly(alpha) absorption toward background QSOs are available. These measurements are based on Wide Field Planetary Camera 2 (WFPC2) observations obtained with the Hubble Space Telescope (HST) and provide a first look at how the incidence and extent of tenuous gas around galaxies depends on galaxy luminosity, size, and morphological type and on geometry of the impact. The primary result of the analysis is that the amount of gas encountered along the line of sight depends on the galaxy impact parameter and B-band luminosity but does not depend strongly on the galaxy average surface brightness, disk-to-bulge ratio, or redshift. This result confirms and improves upon an anti-correlation between Ly(alpha) absorption equivalent width and galaxy impact parameter found previously. More importantly, this result provides the first quantitative means of relating statistics of faint galaxies to statistics of Ly(alpha) absorption systems. which we plan to exploit to constrain the luminosity function of galaxies beyond the realm of current surveys. Results have been submitted for publication and will greatly improve our statistical conclusions . Together with graduate student Noriaki Yahata. I have measured and classified spectral properties of over 1000 faint galaxies and stars obtained in our low-resolution spectroscopic survey. The goal of this project is two-fold: (1) to exhaustively characterize the spectral properties of all faint galaxies that comprise our current survey, and (2) to gain experience with our measurement and classification code. which ultimately will be used on a data base of 20,000 galaxies to be obtained with the Two-Degree Field (2df) spectrograph at the Anglo-Australian Telescope (AAT). The results will ultimately be used for many goals, but so far we have concentrated on using the results to make a binary classification of the galaxies (i.e. early type versus late type) and to then exploit the density-morphology relationship to obtain a crude density indicator. The primary result of the analysis is that the incidence and extent of tenuous gas around galaxies shows no strong preference for local galaxy environment, at least over the range of densities spanned by the current observations. Along similar lines, two instances of Ly(alpha) absorption lines that arise in groups or clusters were examined. Analysis demonstrates that some can produce corresponding absorption lines and that LY(alpha) absorption lines do not avoid a high-density environment. A new measure of the galaxy-absorber cross-correlation function defines the statistical criterion by which galaxies and absorber pairs are to be matched. I have identified a damped Ly(alpha) absorption system at redshift z equals approximately 0.16, the lowest redshift confirmed to date. The most important results of the analysis are learning that the metal abundances of the absorption system are less than 10 percent of the solar metal abundance and that the absorbing gas is not rotating with the galaxy disk.

Source record↗
DOE OSTI2025

Quantum optical classifier with superexponential speedup

Abstract Classification is a central task in deep learning algorithms. Usually, images are first captured and then processed by a sequence of operations, of which the artificial neuron represents one of the fundamental units. This paradigm requires significant resources that scale (at least) linearly in the image resolution, both in terms of photons and computational operations. Here, we present a quantum optical pattern recognition method for binary classification tasks. It classifies objects without reconstructing their images, using the rate of two-photon coincidences at the output of a Hong-Ou-Mandel interferometer, where both the input and the classifier parameters are encoded into single-photon states. Our method exhibits the behaviour of a classical neuron of unit depth. Once trained, it shows a constant $${{\mathcal{O}}}(1)$$ O ( 1 ) complexity in the number of computational operations and photons required by a single classification. This is a superexponential advantage over a classical artificial neuron.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Citation network datasets for benchmarking spiking graph neural networks on experimental neuromorphic hardware

Spiking neural networks (SNNs) running on neuromorphic computers offer an energy-efficient alternative for AI tasks. Recently, spiking graph neural networks (S-GNNs) have been shown to produce encouraging results on benchmark citation network datasets such as Cora, CiteSeer, and PubMed for node classification tasks. These S-GNNs were run on SNN simulators only because they contain up to tens of thousands of neurons and up to millions of synapses, translating poorly to neuromorphic hardware. Therefore, in this paper, we create a suite of benchmark datasets from the CiteSeer dataset that can be accommodated on current neuromorphic hardware platforms. Our contribution consists of a collection of three datasets. First, we have an induced subgraph of CiteSeer, which we call MiniSeer, containing 2110 papers, 3604 binary features, and 6 topics. Second, MicroSeer is a very small dataset consisting of 84 papers, 1227 features, and 6 topics. Lastly, BiteSeer is a collection of 15 binary classification datasets. We present creation of these datasets along with accuracies, running times, and spike counts when simulated. We believe that our results in this paper will be used by the neuromorphic community to benchmark, test, and develop neuromorphic hardware and simulators.

Zhu, Kevin [George Mason University, Virginia]↗
NASA NTRS2019

State Predictor of Classification Cognitive Engine Applied to Channel Fading

This study presents the application of machine learning (ML) to a space-to-ground communication link, showing how ML can be used to detect the presence of detrimental channel fading. Using this channel state information, the communication link can be used more efficiently by reducing the amount of lost data during fading. The motivation for this work is based on channel fading observed during on-orbit operations with NASA's Space Communication and Navigation (SCaN) testbed on the International Space Station (ISS). This paper presents the process to extract a target concept (fading and not-fading) from the raw data. The pre-processing and data exploration effort is explained in detail, with a list of assumptions made for parsing and labelling the dataset. The model selection process is explained, specifically emphasizing the benefits of using an ensemble of algorithms with majority voting for binary classification of the channel state. Experimental results are shown, highlighting how an end-to-end communication system can utilize knowledge of the channel fading status to identity fading and take appropriate action. With a laboratory testbed to emulate channel fading, the overall performance is compared to standard adaptive methods without fading knowledge, such as adaptive coding and modulation.

Fading↗
NASA NTRS2018

Automated Pneumothorax Diagnosis using Deep Neural Networks

Thoracic ultrasound can provide information leading to rapid diagnosis of pneumothorax with improved accuracy over the standard physical examination and with higher sensitivity than anteroposterior chest radiography. However, the clinical We have Furthermore, remote environments, such as the battlefield or deep-space exploration, may lack expertise for diagnosing developed an automated image interpretation pipeline for the analysis of thoracic ultrasound data and the classification of pneumothorax events to provide decision support in such situations. Our pipeline consists of image preprocessing, data augmentation, and deep learning architectures for medical diagnosis. In this work, we demonstrate that robust, accurate interpretation of chest images and video can be achieved using deep neural networks. A number of novel image processing techniques were employed to achieve this result. Affine transformations were applied for data augmentation. Hyperparameters were optimized for learning rate, dropout regularization, batch size, and epoch iteration by a sequential model-based Bayesian approach. In addition, we utilized pretrained architecturesinterpretation of a patient medical image is highly operator dependent. certain pathologies., applying transfer learning and fine-tuning techniques to fully connected layers. Our pipeline yielded binary classification validation accuracies of 98.3% for M-mode images and 99.8% with B-mode video frames.

US Army collaboration↗