Search NASA⌕ Search

SEARCH · Search NASA

Results for “Classifier”

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

Robust Combining of Disparate Classifiers Through Order Statistics

Integrating the outputs of multiple classifiers via combiners or meta-learners has led to substantial improvements in several difficult pattern recognition problems. In this article we investigate a family of combiners based on order statistics, for robust handling of situations where there are large discrepancies in performance of individual classifiers. Based on a mathematical modeling of how the decision boundaries are affected by order statistic combiners, we derive expressions for the reductions in error expected when simple output combination methods based on the the median, the maximum and in general, the ith order statistic, are used. Furthermore, we analyze the trim and spread combiners, both based on linear combinations of the ordered classifier outputs, and show that in the presence of uneven classifier performance, they often provide substantial gains over both linear and simple order statistics combiners. Experimental results on both real world data and standard public domain data sets corroborate these findings.

Tumer, Kagan↗

E-Nose Vapor Identification Based on Dempster-Shafer Fusion of Multiple Classifiers

Electronic nose (e-nose) vapor identification is an efficient approach to monitor air contaminants in space stations and shuttles in order to ensure the health and safety of astronauts. Data preprocessing (measurement denoising and feature extraction) and pattern classification are important components of an e-nose system. In this paper, a wavelet-based denoising method is applied to filter the noisy sensor measurements. Transient-state features are then extracted from the denoised sensor measurements, and are used to train multiple classifiers such as multi-layer perceptions (MLP), support vector machines (SVM), k nearest neighbor (KNN), and Parzen classifier. The Dempster-Shafer (DS) technique is used at the end to fuse the results of the multiple classifiers to get the final classification. Experimental analysis based on real vapor data shows that the wavelet denoising method can remove both random noise and outliers successfully, and the classification rate can be improved by using classifier fusion.

Li, Winston↗

Classifying Agnostic Biosignatures using Raman, VNIR, and Elemental Data

How can we use our current wealth of terrestrial data, encompassing biogenic and abiogenic systems, to determine the distinguishing properties of life? SCOBI (Statistical Classification of Biosignature Information) uses machine learning techniques to algorithmically identify combinations of measurements that are “indicative of life”. A set of ~1000 observations, comprising elemental abundance, isotopic fractionation, VNIR reflectance, and (in progress) Raman spectra, have been assembled from existing literature and databases. The observations cover systems classified as “indicative alive” (e.g., cells, vegetation), “indicative non-alive” (e.g., fossils, teeth), “mixed indicative” (e.g., soil, pond water), or “non-indicative” (e.g., rocks, meteorites). VNIR data was preprocessed by linear interpolation from 400-2100 nm and smoothed with a Savitzky-Golay filter. To limit the amount of Earth-biochemistry-specific (non-agnostic) information included, the first five spectral features extracted were number of peaks, number of troughs, mean reflectance, mean peak width, and broadest peak width. To help further emphasize agnostic biosignatures, Earth-specific features such as chlorophylls have been manually flagged so that feature importance with and without them can be compared. Classifiers including k-nearest neighbors (KNN), Gaussian Naïve Bayes (GNB), logistic regression (LR), random forest (RF), and support vector machine (SVM) were implemented, as was a combination voting classifier. Performance metrics included false positive rates, false negative rates, and AUC with 50-50 test/train splits (Monte Carlo simulations). Key takeaways from this stage, prior to the inclusion of Raman spectra, are (1) the overall success rate of 0.933 AUC was most heavily influenced by the elemental abundance data; and (2) VNIR reflectance had the lowest classification performance with 0.52 AUC (58% of objects correctly classified). The next steps are to complete integration of Raman spectral data and to improve the approach to pre-processing and feature extraction for both types of spectral data, such as automated baseline removal, whole spectrum matching, and dimensionality reduction.

Biosignatures↗

Classifying Aircraft using Velocity Data with Support Vector Machines and Likelihood Ratio Tests

Timely classification of aircraft is important for small unmanned aerial system (sUAS) technologies, such as onboard collision avoidance systems, and aerial perimeter security for prisons and sports venues. This work uses velocity-based metrics to classify multi-rotor sUAS, fixed wings UAS, and general aviation planes using two classification methods: Support Vector Machines (SVM), and Likelihood Ratio (LR) tests. We found that a 96% classification accuracy is achieved when either classifier is trained using average speed derived from flight controller data or radar data and tested with one second of radar data. Further, we show that LR tests perform similarly to SVM for single metric classification. In addition, we present two novel metrics for classifying aircraft: log variance of absolute change in speed, and log variance of relative change in speed. Finally, we discuss challenges associated with training classifiers with flight controller data but testing on radar data.

Logan T Dihel↗

A method for classifying multispectral remote sensing data using context

The paper describes a method of classifying multispectral remote sensing data using a context classifier. Because the computational requirements of the context classifier are very large, its implementation on parallel/pipelined multiprocessor systems is being investigated, so that the types of computations can be efficiently implemented. Special considerations necessary for such implementations are discussed, with particular reference to implementation on an array of Control Data Corporation Flexible Processors.

Swain, P. H.↗

The development of a spectral-spatial classifier for earth observational data

Over the last several years a classifier for earth observational image data has been under development intended to achieve improved performance by utilizing spatial characteristics of the data as an adjunct to multispectral properties. The paper provides an overview of the conception, development, evaluation and documentation of this spectral-spatial classifier. The research program leading to this classifier is described, the algorithms of the current implementation called ECHO are outlined, and results on its performance are summarized. These results show improved accuracy, with greater computation efficiency, and only slightly increased operator complexity.

Landgrebe, D. A.↗

Comparison of wheat classification accuracy using different classifiers of the image-100 system

Classification results using single-cell and multi-cell signature acquisition options, a point-by-point Gaussian maximum-likelihood classifier, and K-means clustering of the Image-100 system are presented. Conclusions reached are that: a better indication of correct classification can be provided by using a test area which contains various cover types of the study area; classification accuracy should be evaluated considering both the percentages of correct classification and error of commission; supervised classification approaches are better than K-means clustering; Gaussian distribution maximum likelihood classifier is better than Single-cell and Multi-cell Signature Acquisition Options of the Image-100 system; and in order to obtain a high classification accuracy in a large and heterogeneous crop area, using Gaussian maximum-likelihood classifier, homogeneous spectral subclasses of the study crop should be created to derive training statistics.

Dejesusparada, N.↗

Parallel processing implementations of a contextual classifier for multispectral remote sensing data

Contextual classifiers are being developed as a method to exploit the spatial/spectral context of a pixel to achieve accurate classification. Classification algorithms such as the contextual classifier typically require large amounts of computation time. One way to reduce the execution time of these tasks is through the use of parallelism. The applicability of the CDC flexible processor system and of a proposed multimicroprocessor system (PASM) for implementing contextual classifiers is examined.

Siegel, H. J.↗

A PC-based hardware implementation of the maximum-likelihood classifier for the Shuttle Ice Detection System

A PC-based near-real time implementation of a two-channel maximum-likelihood classifier is described. The statistical distribution of the reflectance characteristics of ice, frost, and water formation on spray-on-foam-insulation, which covers the External Tank surface of the Space Shuttle, is acquired. The classification technique is based on these statistics. The computer, set in either a training or a classifying mode, learns the statistics of the various classes, or produces a color-coded image denoting the respective categories of classification. The classified results are memory-mapped for efficiency. The speed of the classification process is only limited by the speed of the digital frame grabber and the software that interfaces the frame grabber to the monitor. The process took 4 seconds for a 512 x 480 pixel image.

Jaggi, S.↗

Design of partially supervised classifiers for multispectral image data

A partially supervised classification problem is addressed, especially when the class definition and corresponding training samples are provided a priori only for just one particular class. In practical applications of pattern classification techniques, a frequently observed characteristic is the heavy, often nearly impossible requirements on representative prior statistical class characteristics of all classes in a given data set. Considering the effort in both time and man-power required to have a well-defined, exhaustive list of classes with a corresponding representative set of training samples, this 'partially' supervised capability would be very desirable, assuming adequate classifier performance can be obtained. Two different classification algorithms are developed to achieve simplicity in classifier design by reducing the requirement of prior statistical information without sacrificing significant classifying capability. The first one is based on optimal significance testing, where the optimal acceptance probability is estimated directly from the data set. In the second approach, the partially supervised classification is considered as a problem of unsupervised clustering with initially one known cluster or class. A weighted unsupervised clustering procedure is developed to automatically define other classes and estimate their class statistics. The operational simplicity thus realized should make these partially supervised classification schemes very viable tools in pattern classification.

Jeon, Byeungwoo↗

A Spatial Classifier for Multispectral Data Using Contextual Information

Connectivity describes the spatial relationship among pixels. A spatial classifier which employs the sigma probability concept of the Gaussian distribution and a type of contextual information connectivity of the pixels, is studied in this paper. This spatial classifier attempts to replicate the kind of spatial synthesis done by the human analyst during visual interpretation or to capture the spatial relationships inherent in an aerial photograph. Several classification results of the Landsat TM data using this classifier with different window sizes for capturing the contextual information are illustrated and compared.

Hung, Chih-Cheng↗

Urban Image Classification: Per-Pixel Classifiers, Sub-Pixel Analysis, Object-Based Image Analysis, and Geospatial Methods: Chapter - 10

Remote sensing methods used to generate base maps to analyze the urban environment rely predominantly on digital sensor data from space-borne platforms. This is due in part from new sources of high spatial resolution data covering the globe, a variety of multispectral and multitemporal sources, sophisticated statistical and geospatial methods, and compatibility with GIS data sources and methods. The goal of this chapter is to review the four groups of classification methods for digital sensor data from space-borne platforms; per-pixel, sub-pixel, object-based (spatial-based), and geospatial methods. Per-pixel methods are widely used methods that classify pixels into distinct categories based solely on the spectral and ancillary information within that pixel. They are used for simple calculations of environmental indices (e.g., NDVI) to sophisticated expert systems to assign urban land covers. Researchers recognize however, that even with the smallest pixel size the spectral information within a pixel is really a combination of multiple urban surfaces. Sub-pixel classification methods therefore aim to statistically quantify the mixture of surfaces to improve overall classification accuracy. While within pixel variations exist, there is also significant evidence that groups of nearby pixels have similar spectral information and therefore belong to the same classification category. Object-oriented methods have emerged that group pixels prior to classification based on spectral similarity and spatial proximity. Classification accuracy using object-based methods show significant success and promise for numerous urban 3 applications. Like the object-oriented methods that recognize the importance of spatial proximity, geospatial methods for urban mapping also utilize neighboring pixels in the classification process. The primary difference though is that geostatistical methods (e.g., spatial autocorrelation methods) are utilized during both the pre- and post-classification steps. Within this chapter, each of the four approaches is described in terms of scale and accuracy classifying urban land use and urban land cover; and for its range of urban applications. We demonstrate the overview of four main classification groups in Figure 1 while Table 1 details the approaches with respect to classification requirements and procedures (e.g., reflectance conversion, steps before training sample selection, training samples, spatial approaches commonly used, classifiers, primary inputs for classification, output structures, number of output layers, and accuracy assessment). The chapter concludes with a brief summary of the methods reviewed and the challenges that remain in developing new classification methods for improving the efficiency and accuracy of mapping urban areas.

Myint, Soe W.↗

Interpretable Convolutional Learning Classifier System (C-LCS) for Higher Dimensional Datasets

The purpose of this paper is to devise an interpretable hybrid classification model for Convolutional Neural Networks (CNN) and a Learning Classifier System (LCS). The presented hybrid system integrates the fundamental attributes from both types of these classifiers. In the proposed hybrid model CNN works as an automatic feature extractor, and LCS works to provide interpretable rule-based classification results. Although LCS has limitations working on higher dimensional datasets, we resolve this limitation by using CNN as a feature extractor. The other concept of the non-interpretability of CNN is addressed by using the LCS rule. Furthermore, our experiment with higher dimensional datasets like CIFAR-10 and Fashion-MNIST shows that extended LCS provides comparable performance to the standard neural network model while also providing interpretable results. We named this extended LCS method Convolutional Learning Classifier Cystem (C-LCS).

Jelani Owens↗

Classifying Microwave Radiometer Observations Over the Netherlands Into Dry, Shallow-, and Non-Shallow Precipitation Using A Random Forest Model

Spaceborne microwave radiometers represent an important component of the Global Precipitation Measurement (GPM) mission due to their frequent sampling of rain systems. Microwave radiometers measure microwave radiation (brightness temperatures, Tb), which can be converted into precipitation estimates with appropriate assumptions. However, detecting shallow precipitation systems using space-borne radiometers is challenging, especially over land, as their weak signals are hard to differentiate from those associated with dry conditions. This study uses a random forest model (RF) to classify microwave radiometer observations as dry, shallow, or nonshallow over the Netherlands - a region with varying surface conditions and frequent occurrence of shallow precipitation. The RF is trained on five years of data (2016-2020) and tested with two independent years (2015, 2021). The observations are classified using ground-based weather radar echo top heights. Various RF models are assessed, such as using only GPM’s Microwave Imager (GMI) Tb values as input features or including spatially aligned ERA-5 2-meter temperature and freezing level reanalysis and/or Dual Precipitation Radar (DPR) observations. Independent of the input features, the model performs best in summer and worst in winter. The model classifies observations from high-frequency channels (≥85 GHz) with lower Tb-values as non-shallow, higher values as dry, and those in between as shallow. Misclassified footprints exhibit radiometric characteristics corresponding to their assigned class. Case studies reveal dry observations misclassified as shallow are associated with lower Tb-values, likely resulting from the presence of ice particles in non-precipitating clouds. Shallow footprints misclassified as dry are likely related to the absence of ice particles.

Linda Bogerd↗

Stellar spectrum classifier

Stellar classification is accomplished by correlating holograms of classified spectra with the Fourier transform of the spectral images to be classified.

Reid, J. H.↗

Layered 'recognition cone' networks that pre-process, classify, and describe.

A sequence of six types of pattern recognition system is examined. A program is described to illustrate some of the features developed. The first type (similar to many of the programs currently used) preprocesses by applying layers of local averaging and differencing transforms to smooth, fill in gaps and heighten contours, curves, and angles. It then applies a set of characterizers, each of which implies a set of names. The program chooses the single most high implied name. The second type combines the preprocessing transforms and the characterizers into a single operation of general type. Transforms build up a next representation of the input, while the characterizers imply the output name. The third type erases the distinction between a transform and an implication. Now all outputs are stored in the next transform layer. As the program averages information, its layers shrink, so that the system builds a cone of layers. When the program reaches the apex (a layer of only one cell that contains all the information), it chooses the single name with which it classifies the input. The fourth type is capable of choosing more than one name and, therefore, can both describe and classify the scene. The fifth type examines the interrelations among the set of names chosen. The sixth step can be taken to converse about the scene, developing an appropriate description in response to suggestions and queries. This allows the program to perform more computations and to look again on demand.

Uhr, L.↗

A hybrid classifier using the parallelepiped and Bayesian techniques

A versatile classification scheme is developed which uses the best features of the parallelepiped algorithm and the Bayesian maximum likelihood algorithm. The parallelepiped technique has the advantage of being very fast, especially when implemented into a table look-up scheme; its disadvantage is its inability to distinguish and classify spectral signatures which are similar in nature. This disadvantage is eliminated by the Bayesian technique which is capable of distinguishing subtle differences very well. The hybrid algorithm developed reduces computer time by as much as 90%. A two- and n-dimensional description of the hybrid classifier is given.

Addington, J. D.↗

Adaptive Bayes classifiers for remotely sensed data

An algorithm is developed for a learning, adaptive, statistical pattern classifier for remotely sensed data. The estimation procedure consists of two steps: (1) an optimal stochastic approximation of the parameters of interest, and (2) a projection of the parameters in time and space. The results reported are for Gaussian data in which the mean vector of each class may vary with time or position after the classifier is trained.

Raulston, H. S.↗