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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Risk-Informed Approach for Event Selection and Component Classification

Develop a report summarizing a structured approach for the incorporation of risk insights when making facility safety assessments and regulatory decisions is proposed to supplement the deterministic approach, with the following expected benefits: Increased confidence that key safety issues have been fully identified and addressed Better understanding of safety margins Facilitates more structured dialogue among international regulators Reduced reliance on “expert judgement” through a rigorous, pre-defined process with more predictable outcomes Proposed outcome is development of a report summarizing the structure and key considerations for applying this approach that: Is inclusive of advanced reactor technologies Provides for flexible implementation recognizing unique and varying sovereign regulatory structures Builds upon existing/current GIF safety approaches (e.g., GIF Basic Safety Approach, Integrated Safety Assessment Methodology)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS1973

Phase 1 of the earth resources data analysis program

Research completed in the Earth Resources Data Analysis Program is discussed along with recommendations for future study. Projects discussed include use of the Cholesky decomposition in feature selection and classification algorithms; optimal feature selection and extraction, probability density estimation and nonparametric classifiers; use of spatial information in classification; and model for crop row reflectance. The installation of LARSYS on the ICSA's IBM 370/155 is discussed, and a list of technical reports is included.

Source record↗
NASA NTRS1976

Canonical analysis for increased classification speed and channel selection

The quadratic form can be expressed as a monotonically increasing sum of squares when the inverse covariance matrix is represented in canonical form. This formulation has the advantage that, in testing a particular class hypothesis, computations can be discontinued when the partial sum exceeds the smallest value obtained for other classes already tested. A method for channel selection is presented which arranges the original input measurements in that order which minimizes the expected number of computations. The classification algorithm was tested on data from LARS Flight Line C1 and found to reduce the sum-of-products operations by a factor of 6.7 in comparison with the conventional approach. In effect, the accuracy of a twelve-channel classification was achieved using only that CPU time required for a conventional four-channel classification.

Eppler, W.↗
NASA NTRS1976

Selecting class weights to minimize classification bias in acreage estimation

Preliminary results of experiments being performed to select optimal class weights for use with the maximum likelihood classifier in acreage estimation using remote sensor imagery are presented. These weights will be optimal in the sense that the bias will be minimized in the proportion estimate obtained from the classification results by sample counting. The procedure was tested using Landsat MSS data from an 8 by 9.6 km area of ground truth in Finney County, Kansas.

Belcher, W. M.↗
DOE OSTI2023

The miniJPAS survey quasar selection – II. Machine learning classification with photometric measurements and uncertainties

Astrophysical surveys rely heavily on the classification of sources as stars, galaxies, or quasars from multiband photometry. Surveys in narrow-band filters allow for greater discriminatory power, but the variety of different types and redshifts of the objects present a challenge to standard template-based methods. In this work, which is part of a larger effort that aims at building a catalogue of quasars from the miniJPAS survey, we present a machine learning-based method that employs convolutional neural networks (CNNs) to classify point-like sources including the information in the measurement errors. We validate our methods using data from the miniJPAS survey, a proof-of-concept project of the Javalambre Physics of the Accelerating Universe Astrophysical Survey (J-PAS) collaboration covering ∼1 deg 2 of the northern sky using the 56 narrow-band filters of the J-PAS survey. Due to the scarcity of real data, we trained our algorithms using mocks that were purpose-built to reproduce the distributions of different types of objects that we expect to find in the miniJPAS survey, as well as the properties of the real observations in terms of signal and noise. We compare the performance of the CNNs with other well-established machine learning classification methods based on decision trees, finding that the CNNs improve the classification when the measurement errors are provided as inputs. The predicted distribution of objects in miniJPAS is consistent with the putative luminosity functions of stars, quasars, and unresolved galaxies. Our results are a proof of concept for the idea that the J-PAS survey will be able to detect unprecedented numbers of quasars with high confidence.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1973

The use of the modified Cholesky decomposition in divergence and classification calculations

The use of the Cholesky decomposition technique is analyzed as applied to the feature selection and classification algorithms used in the analysis of remote sensing data (e.g. as in LARSYS). This technique is approximately 30% faster in classification and a factor of 2-3 faster in divergence, as compared with LARSYS. Also numerical stability and accuracy are slightly improved. Other methods necessary to deal with numerical stablity problems are briefly discussed.

Vanroony, D. L.↗
NASA NTRS1994

Recursive heuristic classification

The author will describe a new problem-solving approach called recursive heuristic classification, whereby a subproblem of heuristic classification is itself formulated and solved by heuristic classification. This allows the construction of more knowledge-intensive classification programs in a way that yields a clean organization. Further, standard knowledge acquisition and learning techniques for heuristic classification can be used to create, refine, and maintain the knowledge base associated with the recursively called classification expert system. The method of recursive heuristic classification was used in the Minerva blackboard shell for heuristic classification. Minerva recursively calls itself every problem-solving cycle to solve the important blackboard scheduler task, which involves assigning a desirability rating to alternative problem-solving actions. Knowing these ratings is critical to the use of an expert system as a component of a critiquing or apprenticeship tutoring system. One innovation of this research is a method called dynamic heuristic classification, which allows selection among dynamically generated classification categories instead of requiring them to be prenumerated.

Wilkins, David C.↗
NASA NTRS1973

The use of the modified Cholesky decomposition in divergence and classification calculations

This report analyzes the use of the modified Cholesky decomposition technique as applied to the feature selection and classification algorithms used in the analysis of remote sensing data (e.g., as in LARSYS). This technique is approximately 30% faster in classification and a factor of 2-3 faster in divergence, as compared with LARSYS. Also numerical stability and accuracy are slightly improved. Other methods necessary to deal with numerical stability problems are briefly discussed.

Van Rooy, D. L.↗
NASA NTRS1989

HIRIS performance study

The remote sensing system simulation is used to study a proposed sensor concept. An overview of the instrument and its parameters is presented, along with the model of the instrument as implemented in the simulation. Signal-to-noise levels of the instrument under a variety of system configurations are presented and discussed. Classification performance under these varying configurations is also shown, along with relationships between signal-to-noise ratios, feature selection, and classification performance.

Kerekes, John P.↗
NASA NTRS1974

Results on the two population feature selection problem using probability of correct classification as a criterion

Variational equations are presented for maximizing the probability of correct classification as a function of a 1xn feature selection matrix B for the two-population problem. For the special case of equal covariance matrices the optimal B is unique up to scalar multiples and rank one sufficient. For equal population means, the best 1xn B is an eigenvector corresponding either to the largest or smallest eigenvalue of sigma sub 2 to the minus 1 power sigma sub 1 where sigma sub 1 and sigma sub 2 are the nxn covariance matrices of the two populations. The transformed probability of correct classification depends only on the eigenvalue. Finally, a procedure is proposed for constructing an optimal or nearly optimal kxn matrix of rank k without solving the k-dimensional variational equation.

Peters, B. C.↗
DOE OSTI2020

Selective Sampling for Sensor Type Classification in Buildings

A key barrier to applying any smart technology to a building is the requirement of locating and connecting to the necessary resources among the thousands of sensing and control points, i.e., the metadata mapping problem. Existing solutions depend on exhaustive manual annotation of sensor metadata --- a laborious, costly, and hardly scalable process. To reduce the amount of manual effort required, this paper presents a multi-oracle selective sampling framework to leverage noisy labels from information sources with unknown reliability such as existing buildings, which we refer to as weak oracles, for metadata mapping. This framework involves an interactive process, where a small set of sensor instances are progressively selected and labeled for it to learn how to aggregate the noisy labels as well as to predict sensor types. Two key challenges arise in designing the framework, namely, weak oracle reliability estimation and instance selection for querying. To address the first challenge, we develop a clustering-based approach for weak oracle reliability estimation to capitalize on the observation that weak oracles perform differently in different groups of instances. For the second challenge, we propose a disagreement-based query selection strategy to combine the potential effect of a labeled instance on both reducing classifier uncertainty and improving the quality of label aggregation. We evaluate our solution on a large collection of real-world building sensor data from 5 buildings with more than 11,000 sensors of 18 different types. The experiment results validate the effectiveness of our solution, which outperforms a set of state-of-the-art baselines.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
NASA NTRS1996

Cloud Classification in Polar and Desert Regions and Smoke Classification from Biomass Burning Using a Hierarchical Neural Network

This research focuses on a new neural network scene classification technique. The task is to identify scene elements in Advanced Very High Resolution Radiometry (AVHRR) data from three scene types: polar, desert and smoke from biomass burning in South America (smoke). The ultimate goal of this research is to design and implement a computer system which will identify the clouds present on a whole-Earth satellite view as a means of tracking global climate changes. Previous research has reported results for rule-based systems (Tovinkere et at 1992, 1993) for standard back propagation (Watters et at. 1993) and for a hierarchical approach (Corwin et al 1994) for polar data. This research uses a hierarchical neural network with don't care conditions and applies this technique to complex scenes. A hierarchical neural network consists of a switching network and a collection of leaf networks. The idea of the hierarchical neural network is that it is a simpler task to classify a certain pattern from a subset of patterns than it is to classify a pattern from the entire set. Therefore, the first task is to cluster the classes into groups. The switching, or decision network, performs an initial classification by selecting a leaf network. The leaf networks contain a reduced set of similar classes, and it is in the various leaf networks that the actual classification takes place. The grouping of classes in the various leaf networks is determined by applying an iterative clustering algorithm. Several clustering algorithms were investigated, but due to the size of the data sets, the exhaustive search algorithms were eliminated. A heuristic approach using a confusion matrix from a lightly trained neural network provided the basis for the clustering algorithm. Once the clusters have been identified, the hierarchical network can be trained. The approach of using don't care nodes results from the difficulty in generating extremely complex surfaces in order to separate one class from all of the others. This approach finds pairwise separating surfaces and forms the more complex separating surface from combinations of simpler surfaces. This technique both reduces training time and improves accuracy over the previously reported results. Accuracies of 97.47%, 95.70%, and 99.05% were achieved for the polar, desert and smoke data sets.

Alexander, June↗
NASA NTRS1973

Multispectral scanner imagery for plant community classification.

Optimum channel selection among 12 channels of multispectral scanner imagery identified six as providing the best information for computerized classification of 11 plant communities and two nonvegetation classes. Intensive preprocessing of the spectral data was required to eliminate bidirectional reflectance effects of the spectral imagery caused by scanner view angle and varying geometry of the plant canopy. Generalized plant community types - forest, grassland, and hydrophytic systems - were acceptably classified based on ecological analysis. Serious, but soluble, errors occurred with attempts to classify specific community types within the grassland system. However, special clustering analyses provided for improved classification of specific grassland communities.

Driscoll, R. S.↗
DOE OSTI2024

Data-driven search for promising intercalating ions and layered materials for metal-ion batteries

The rise in demand for lithium-ion batteries has led to a large-scale search for electrode materials and intercalating ion species to meet the demands of next-generation energy technologies. Recent efforts largely focus on searching for cathodes that can accommodate large amounts of intercalating ions, but similar work on anodes is relatively limited. This study utilizes machine learning methods to find alternative two-dimensional (2D) materials and intercalating ions beyond Li for metal-ion batteries with high-power efficiencies. The approach first uses density functional theory (DFT) calculations to estimate the theoretical capacities and voltages of various metal ions on 2D materials. The DFT-generated data also provide insights into the local structural accommodation upon ion intercalation on various 2D materials. Significant changes to the lattice can result in irreversible changes to the bonding environments in the anode material, resulting in poor cycling stability. Next, this study develops a binding energy and structural accommodation-based classification model to screen anode materials for next-generation batteries. The classification model selects intercalating ions and 2D material pairs suitable for batteries based on the calculated voltage and volumetric changes in the 2D material upon intercalation. Finally, this study builds a regression model to accurately predict the binding energies of the various intercalating ions on 2D materials. The approach highlights the importance of different elemental and structural features for classification and regression tasks. In conclusion, the insights gained from this study on the role of involved features, such as electronegativities of the constituent ions and the presence of unfilled electronic levels, will help to streamline further studies towards the search for future layered battery materials.

36 MATERIALS SCIENCE↗
NASA NTRS2020

Automated Cardiovascular Pathology Assessment using Semantic Segmentation and Ensemble Learning

Cardiac magnetic resonance imaging provides high spatial resolution, enabling improved extraction of important functional and morphological features for cardiovascular disease staging. Segmentation of ventricular cavities and myocardium in cardiac cine sequencing provides a basis to quantify cardiac measures such as ejection fraction. A method is presented that curtails the expense and observer bias of manual cardiac evaluation by combining semantic segmentation and disease classification into a fully automatic processing pipeline. The initial processing element consists of a robust dilated convolutional neural network architecture for voxel-wise segmentation of the myocardium and ventricular cavities. The resulting comprehensive volumetric feature matrix captures diagnostic clinical procedure data and is utilized by the final processing element to model a cardiac pathology classifier. Our approach evaluated anonymized cardiac images from a training data set of 100 patients (4 pathology groups, 1 healthy group, 20 patients per group) examined at the University Hospital of Dijon. The top average Dice index scores achieved were 0.940, 0.886, 0.849 for structure segmentation of the left ventricle (LV), myocardium and right ventricle (RV) respectively. A 5-ary pathology classification accuracy of 90% was recorded on an independent test set using the trained model. Performance results demonstrate potential for advanced machine learning methods to deliver accurate, efficient and reproducible cardiac pathological assessment.

Semantic Segmentation↗
NASA NTRS1983

Autonomous earth feature classification - Shuttle and aircraft flight test results

The Feature Identification and Location Experiment (FILE) flown on the Shuttle STS-2 mission November 12-14, 1981, tested a technique for autonomous real-time classification of selected earth features, i.e., water; bare land; vegetation; and clouds, snow, and ice. A second instrument, designed for aircraft flights, flew over regions of the west and east coasts of the United States and across the country. In each instrument, two bore-sighted CCD cameras image earth scenes in two spectral bands. Each camera includes a 100-element by 100-element detector array, and classification circuits. A simple algorithm and logic circuit provides classification decisions within a few microseconds. The experiment records the number of picture elements (pixels) representing each feature and the reflected solar radiation for each band. After flight, pixel-by-pixel classification images are constructed and compared with 70-mm color photographs taken simultaneously with the CCD-camera data.

Sivertson, W. E., Jr.↗
DOE OSTI2022

Using ensembles and distillation to optimize the deployment of deep learning models for the classification of electronic cancer pathology reports

One of the goals of the Surveillance, Epidemiology, and End Results (SEER) program is to estimate incidence, prevalence, and mortality of all cancers. To that end, cancer registries across the country maintain a massive database of cancer pathology reports which contain rich information to understand cancer trends. However, these reports are stored in the form of unstructured text, and human annotators are required to read and extract relevant information. In this article, we show that existing deep learning models for automating information extraction from cancer pathology reports can be significantly improved by using ensemble model distillation. We found that by training multiple predictive models and transferring their knowledge to a single, low-resource model, we can reduce the number of highly confident wrong predictions. Our results show that our implemented methods could save 1000s of manual annotation hours.

60 APPLIED LIFE SCIENCES↗