Search NASA⌕ Search

SEARCH · Search NASA

Results for “selective 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 91 records · Page 5

Artificial neural network classification using a minimal training set - Comparison to conventional supervised classification

Recent research has shown an artificial neural network (ANN) to be capable of pattern recognition and the classification of image data. This paper examines the potential for the application of neural network computing to satellite image processing. A second objective is to provide a preliminary comparison and ANN classification. An artificial neural network can be trained to do land-cover classification of satellite imagery using selected sites representative of each class in a manner similar to conventional supervised classification. One of the major problems associated with recognition and classifications of pattern from remotely sensed data is the time and cost of developing a set of training sites. This reseach compares the use of an ANN back propagation classification procedure with a conventional supervised maximum likelihood classification procedure using a minimal training set. When using a minimal training set, the neural network is able to provide a land-cover classification superior to the classification derived from the conventional classification procedure. This research is the foundation for developing application parameters for further prototyping of software and hardware implementations for artificial neural networks in satellite image and geographic information processing.

Hepner, George F.↗

Selecting optimum algorithms for image processing

Collection of registration, compression, and classification algorithms allows users to evaluate approaches and select best one for particular application. Program includes six registration algorithms, six compression algorithms, and two classification algorithms. Package also includes routines for evaluating effects of processing on image data. Collection is written in FORTRAN IV for batch execution.

Jaroe, R. R.↗

Support Vector Machines for Classification of Direct Energy Deposition Standoff Distance for Improved Process Control

A critical factor in the implementation of direct energy deposition is the ability to maintain the standoff distance between the nozzle and the build surface, as this influences powder capture efficiency and overall part quality. Due to process-related variations, layer height may vary, causing unintended variation in standoff distance and poor build quality. While prior work has utilized contact probing to qualify standoff distance during processing, in situ methods for qualification of standoff distance are of major interest. The present work seeks to understand efficacy of image-based methods for classifying standoff distance variation in real-time using support vector machines (SVMs). It was hypothesized that the size of the melt pool and the amount of spatter will have significant correlations with deviations in the standoff distance; thus, SVMs were used on a dataset that is comprised of morphological features of melt pool size and image entropy. The SVM model was used to classify melt pool images into categories according to standoff distance variation from nominal. K-folds cross validation was used to find the optimal hyperparameters for the SVM model. To understand the impact of the selected features on the classification performance and inference speed, multiple models were trained with differing numbers of included features. Results for classification score, inference time, and image preprocessing/feature extraction from these data are reported. The present results show that the SVM model was able to predict the standoff distance classification with an accuracy of 97 percent and a speed of 0.122 s per image, making it a viable solution for real-time control of standoff distance.

Klesmith, Zoe↗

Machine Learning Analysis of Direct Dynamics Trajectory Outcomes for Thermal Deazetization of 2,3-Diazabicyclo[2.2.1]hept-2-ene

Experimentally, the thermal gas-phase deazetization of 2,3-diazabicyclo[2.2.1]hept-2-ene (1) results in the loss of N2 and the formation of bicyclo products 3 (exo) and 4 (endo) in a nonstatistical ratio, with preference for the exo product. Here, we report unrestricted M06-2X quasiclassical trajectories initialized from the concerted N2 ejection transition state that were able to replicate the experimental preference to form 3. We found that the 3:4 ratio results from the relative amounts of very fast (ballistic) exotype trajectories versus trajectories that lead to the 1,3-diradical intermediate 2. These quasiclassical trajectories provided a set of transition-state vibrational, velocity, momenta, and geometric features for the machine learning analysis. Additionally, a selection of popular supervised classification algorithms (e.g., random forest) provided poor prediction of trajectory outcomes based on only transition-state vibrational quanta and energy features. However, these machine learning models provided more accurate predictions using atomic velocities and atomic positions, attaining ~70% accuracy using initial conditions and between 85 and 95% accuracy at later reaction time steps. This increased accuracy allowed the feature importance analysis to reveal that, at the later-time analysis, the methylene bridge out-of-plane bending is correlated with trajectory outcomes for the formation of either the exo product or toward the diradical intermediate. Possible reasons for the struggle of machine learning algorithms to classify trajectories based on transition-state features is the heavily overlapping feature values, the finite but very large possible vibrational mode combinations, and the possibility of chaos as trajectories propagate. We examined this chaos by comparing a set of nearly identical trajectories that differed by only a very small scaling of the kinetic energies resulting from the transition-state reaction coordinate.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum materials for energy-efficient neuromorphic computing: Opportunities and challenges

Neuromorphic computing approaches become increasingly important as we address future needs for efficiently processing massive amounts of data. The unique attributes of quantum materials can help address these needs by enabling new energy-efficient device concepts that implement neuromorphic ideas at the hardware level. In particular, strong correlations give rise to highly non-linear responses, such as conductive phase transitions that can be harnessed for short- and long-term plasticity. Similarly, magnetization dynamics are strongly non-linear and can be utilized for data classification. This Perspective discusses select examples of these approaches and provides an outlook on the current opportunities and challenges for assembling quantum-material-based devices for neuromorphic functionalities into larger emergent complex network systems.

36 MATERIALS SCIENCE↗

Target selection for the DESI Peculiar Velocity Survey

ABSTRACT We describe the target selection and characteristics of the DESI Peculiar Velocity Survey, the largest survey of peculiar velocities (PVs) using both the fundamental plane (FP) and the Tully–Fisher (TF) relationship planned to date. We detail how we identify suitable early-type galaxies (ETGs) for the FP and suitable late-type galaxies (LTGs) for the TF relation using the photometric data provided by the DESI Legacy Imaging Survey DR9. Subsequently, we provide targets for 373 533 ETGs and 118 637 LTGs within the Dark Energy Spectroscopic Instrument (DESI) 5-yr footprint. We validate these photometric selections using existing morphological classifications. Furthermore, we demonstrate using survey validation data that DESI is able to measure the spectroscopic properties to sufficient precision to obtain PVs for our targets. Based on realistic DESI fibre assignment simulations and spectroscopic success rates, we predict the final DESI PV Survey will obtain ∼133 000 FP-based and ∼53 000 TF-based PV measurements over an area of 14 000 deg2. We forecast the ability of using these data to measure the clustering of galaxy positions and PVs from the combined DESI PV and Bright Galaxy Surveys (BGS), which allows for cancellation of cosmic variance at low redshifts. With these forecasts, we anticipate a 4 per cent statistical measurement on the growth rate of structure at z < 0.15. This is over two times better than achievable with redshifts from the BGS alone. The combined DESI PV and BGS will enable the most precise tests to date of the time and scale dependence of large-scale structure growth at z < 0.15.

79 ASTRONOMY AND ASTROPHYSICS↗

IRIS-GNN: Leveraging Graph Neural Networks for Scheduling on Truly Heterogeneous Runtime Systems

The diversity of accelerators in computer systems poses significant challenges for software developers, such as managing vendor-specific compiler toolchains, code fragmentation requiring different kernel implementations, and performance portability issues. To address these, the Intelligent Runtime System (IRIS) was developed. IRIS works across various systems, from smartphones to supercomputers, enabling automatic performance scaling based on available accelerators. It introduces abstract tasks for seamless execution transitions between accelerators while ensuring memory consistency and task dependencies. Although IRIS simplifies system details, optimal dynamic scheduling still requires user input to understand workload structures. To address this, we introduce a new scheduling policy for IRIS, termed IRIS-GNN, which is the first IRIS hybrid policy that operates in conjunction with the dynamic policies. This policy employs a Graph-Neural Network (GNN) to conduct Graph Classification of any task graphs submitted to IRIS. This GNN analyzes the structure and attributes of the task graph, categorizing it as either locality, concurrency, or mixed. This classification subsequently guides the selection of the dynamic policy used by IRIS. We provide a comparison of the performance of IRIS-GNN against the complete spectrum of IRIS’s dynamic policies, assess the overhead introduced by the GNN within this scheduling framework, and ultimately explore its practical application in real-world scenarios.

Johnston, Beau↗

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.↗

Development and implementation of a low cost micro computer system for LANDSAT analysis and geographic data base applications

Since the implementation of the GRID and IMGRID computer programs for multivariate spatial analysis in the early 1970's, geographic data analysis subsequently moved from large computers to minicomputers and now to microcomputers with radical reduction in the costs associated with planning analyses. Programs designed to process LANDSAT data to be used as one element in a geographic data base were used once NIMGRID (new IMGRID), a raster oriented geographic information system, was implemented on the microcomputer. Programs for training field selection, supervised and unsupervised classification, and image enhancement were added. Enhancements to the color graphics capabilities of the microsystem allow display of three channels of LANDSAT data in color infrared format. The basic microcomputer hardware needed to perform NIMGRID and most LANDSAT analyses is listed as well as the software available for LANDSAT processing.

Faust, N.↗

Program for Analysis and Enhancement of Images

Land Analysis System (LAS) is collection of image-analysis computer programs designed to manipulate and analyze multispectral image data. Provides user with functions ingesting various sensor data, radiometric and geometric corrections, image registration, training site selection, supervised and unsupervised classification, Fourier domain filtering, and image enhancement. Sufficiently modular and includes extensive library of subroutines to permit inclusion of new algorithmic programs. Commercial package International Mathematical & Statistical Library (IMSL) required for full implementation of LAS. Written in VAX FORTRAN 77, C, and Macro assembler for DEC VAX operating under VMS 4.0.

Lu, Yun-Chi↗

EGRET sources at intermediate galactic latitude

This paper presents the abstracts of four papers (using ROSAT data) that are submitted to refereed journals during the current reporting period. The papers are: (1) Extreme x-ray variability in the narrow-line QSO PHL 1092; (2) The Geminga pulsar (soft x-ray variability and an EUVE observation); (3) a broad-band x-ray study of the geminga pulsar; and (4) Classification of IRAS-selected x-ray galaxies in the ROSAT all-sky survey. The abstracts of these papers are given in the next four sections of this report, and their status is given in the Appendix. Finally, two new projects (De-identifying a non-AGN and EGRET sources at intermediate galactic latitude) for which ROSAT data were recently received are currently being studied under this grant. A summary of work in progress on these new projects is given in the last two sections of this report.

Halpern, Jules P.↗

Photometric redshift-aided classification using ensemble learning

We present SHEEP, a new machine learning approach to the classic problem of astronomical source classification, which combines the outputs from the XGBoost, LightGBM, and CatBoost learning algorithms to create stronger classifiers. A novel step in our pipeline is that prior to performing the classification, SHEEP first estimates photometric redshifts, which are then placed into the data set as an additional feature for classification model training; this results in significant improvements in the subsequent classification performance. SHEEP contains two distinct classification methodologies: (i) Multi-class and (ii) one versus all with correction by a meta-learner. We demonstrate the performance of SHEEP for the classification of stars, galaxies, and quasars using a data set composed of SDSS and WISE photometry of 3.5 million astronomical sources. The resulting F1 -scores are as follows: 0.992 for galaxies; 0.967 for quasars; and 0.985 for stars. In terms of the F1-scores for the three classes, SHEEP is found to outperform a recent RandomForest-based classification approach using an essentially identical data set. Our methodology also facilitates model and data set explainability via feature importances; it also allows the selection of sources whose uncertain classifications may make them interesting sources for follow-up observations.

79 ASTRONOMY AND ASTROPHYSICS↗

A quantitative applications-oriented evaluation of Thematic Mapper design specifications

Simulated Thematic Mapper data sets were created from aircraft Multispectral Scanner data in order to predict the sensitivity of applications-oriented classification results to variations in selected sensor parameters. It was found that band-to-band misregistration as little as 0.3 pixel can have a pronounced effect on the classification of both field-center pixels and pixels associated with edges and small objects in the scene. It was also determined that a significant improvement in classification accuracy could be achieved if the resolution of the thermal band of the Thematic Mapper were comparable to the resolution of its other spectral bands.

Swain, P. H.↗

Response Classification Images in Vernier Acuity

Orientation selective and local sign mechanisms have been proposed as the basis for vernier acuity judgments. Linear image features contributing to discrimination can be determined for a two choice task by adding external noise to the images and then averaging the noises separately for the four types of stimulus/response trials. This method is applied to a vernier acuity task with different spatial separations to compare the predictions of the two theories. Three well-practiced observers were presented around 5000 trials of a vernier stimulus consisting of two dark horizontal lines (5 min by 0.3 min) within additive low-contrast white noise. Two spatial separations were tested, abutting and a 10 min horizontal separation. The task was to determine whether the target lines were aligned or vertically offset. The noises were averaged separately for the four stimulus/response trial types (e.g., stimulus = offset, response = aligned). The sum of the two 'not aligned' images was then subtracted from the sum of the 'aligned' images to obtain an overall image. Spatially smoothed images were quantized according to expected variability in the smoothed images to allow estimation of the statistical significance of image features. The response images from the 10 min separation condition are consistent with the local sign theory, having the appearance of two linear operators measuring vertical position with opposite sign. The images from the abutting stimulus have the same appearance with the two operators closer together. The image predicted by an oriented filter model is similar, but has its greatest weight in the abutting region, while the response images fall to nonsignificance there. The response correlation image method, previously demonstrated for letter discrimination, clarifies the features used in vernier acuity.

Ahumada, Albert J., Jr.↗

Efficient Active Learning for Gaussian Process Classification by Error Reduction

Active learning sequentially selects the best instance for labeling by optimizing an acquisition function to enhance data/label efficiency. The selection can be either from a discrete instance set (pool-based scenario) or a continuous instance space (query synthesis scenario). In this work, we study both active learning scenarios for Gaussian Process Classification (GPC). The existing active learning strategies that maximize the Estimated Error Reduction (EER) aim at reducing the classification error after training with the new acquired instance in a onestep-look-ahead manner. The computation of EER-based acquisition functions is typically prohibitive as it requires retraining the GPC with every new query. Moreover, as the EER is not smooth, it can not be combined with gradient-based optimization techniques to efficiently explore the continuous instance space for query synthesis. To overcome these critical limitations, we develop computationally efficient algorithms for EER-based active learning with GPC. Further, we derive the joint predictive distribution of label pairs as a one-dimensional integral, as a result of which the computation of the acquisition function avoids retraining the GPC for each query, remarkably reducing the computational overhead. We also derive the gradient chain rule to efficiently calculate the gradient of the acquisition function, which leads to the first query synthesis active learning algorithm implementing EER-based strategies. Our experiments clearly demonstrate the computational efficiency of the proposed algorithms. We also benchmark our algorithms on both synthetic and real-world datasets, which show superior performance in terms of sampling efficiency compared to the existing state-of-the-art algorithms.

97 MATHEMATICS AND COMPUTING↗