Search NASASearch

SEARCH · Search NASA

Results for “Algorithm 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

Parallel sorting algorithm classification: is manual instrumentation necessary?

Understanding parallel algorithms is crucial for accelerating scientific simulations on complex, distributed memory, high-performance computers. Modern algorithm classification approaches learn semantics directly from source code to differentiate between algorithms, however, accessing source code is not always possible. We can learn about parallel algorithms from observing their performance, as programs running the same algorithms and using the same hardware should exhibit similar performance characteristics. We present an approach to learn algorithm classes from parallel performance data directly in order to classify algorithms without access to the source code. We extend previous work to enable classifying parallel sorting algorithms using automatic instrumentation instead of requiring manual region annotations in the source code. In this work, we design and demonstrate a study for classification of parallel sorting algorithms using parallel performance data collected from automatic instrumentation, and evaluate the performance of our new methodology on classification. We leverage Caliper to collect the performance data, Thicket for our exploratory data analysis (EDA), and PyTorch and Scikit-learn to evaluate the effectiveness of random forests, support vector machines (SVMs), decision trees, neural networks, and logistic regressions on parallel performance data. Additionally, we study noise in parallel performance data, whether the removal of noise and pre-processing of the data is necessary to accurately classify parallel sorting algorithms, and determine the effectiveness of features created from performance data. In conclusion, we demonstrate classification accuracy for these five different models of up to 97.7% across four different parallel algorithm classes.

Algorithm Classification

Fanning - A classification algorithm for mixture landscapes applied to Landsat data of Maine forests

It is pointed out that typical landscapes include a relatively small number of 'pure' land cover types which combine in various proportions to form a myriad of mixture types. Most Landsat classifications algorithms used today require a separate user specification for each category, including mixture categories. Attention is given to a simpler approach, which would require the user to specify only the 'pure' types. Mixture pixels would be classified on the basis of the proportion of the area covered by each pure type within the pixel. The 'fanning' algorithm quantifies varying proportions of two 'pure' land cover types in selected mixture pixels. This algorithm was applied to 200,000 ha of forest land in Maine, taking into account a comparison with standard inventory information. Results compared well with a discrete categories classification of the same area.

Ungar, S. G.

A sequential nonparametric pattern classification algorithm based on the Wald SPRT

A sequential nonparametric pattern classification procedure is presented. The method presented is an estimated version of the Wald sequential probability ratio test (SPRT). This method utilizes density function estimates, and the density estimate used is discussed, including a proof of convergence in probability of the estimate to the true density function. The classification procedure proposed makes use of the theory of order statistics, and estimates of the probabilities of misclassification are given. The procedure was tested on discriminating between two classes of Gaussian samples and on discriminating between two kinds of electroencephalogram (EEG) responses.

Poage, J. L.

Algorithms for pattern classification.

Deterministic pattern classification algorithms, discussing abstraction problem, stochastic algorithms, minimum error scheme and modified least squares scheme

Kashyap, R. L.

Neuromorphic ionic computing in droplet interface synapses

Ionic devices with memory capabilities can emulate neural functionality, enabling neuromorphic computing and biomedical applications. In this study, we report an ionic spiking synapse based on aqueous droplet interface bilayer assembly. Under stepwise triangular voltages, the device displays coupled memcapacitive-memristive behavior, showing noncrossing pinched hysteretic I-V loops. This hysteretic ion dynamics can be regulated by modifying bilayer components, reconstituting protein channels, or adjusting droplet assembly configuration. Droplet interface synapses (DIS) exhibit fundamental neuromorphic behaviors such as paired-pulse facilitation/depression, spike rate–dependent plasticity, Hebbian learning, and short-term associative learning under classical conditioning. We also used reservoir computing with DIS to implement two learning algorithms: a classification algorithm that recognizes handwritten digits and a reinforcement learning algorithm that learns to play a board game of tic-tac-toe.

Li, Zhongwu [Lawrence Livermore National Laborator

Application of LANDSAT system for improving methodology for inventory and classification of wetlands

The author has identified the following significant results. A newly developed software system for generating statistics on surface water features was tested using LANDSAT data acquired previous to 1975. This software test provided a satisfactory evaluation of the system and also allowed expansion of data base on prairie water features. The software system recognizes water on the basis of a classification algorithm. This classification is accomplished by level thresholding a single near infrared data channel. After each pixel is classified as water or nonwater, the software system then recognizes ponds or lakes as sets of contiguous pixels or as single isolated pixels in the case of very small ponds. Pixels are considered to be contiguous if they are adjacent between successive scan lines. After delineating each water feature, the software system then assigns the feature a position based upon a geographic grid system and calculates the feature's planimetric area, its perimeter, and a parameter known as the shape factor.

Gilmer, D. S.

VTOL shipboard letdown guidance system analysis

Alternative letdown guidance strategies are examined for landing of a VTOL aircraft onboard a small aviation ship under adverse environmental conditions. Off line computer simulation of shipboard landing task is utilized for assessing the relative merits of the proposed guidance schemes. The touchdown performance of a nominal constant rate of descent (CROD) letdown strategy serves as a benchmark for ranking the performance of the alternative letdown schemes. Analysis of ship motion time histories indicates the existence of an alternating sequence of quiescent and rough motions called lulls and swells. A real time algorithms lull/swell classification based upon ship motion pattern features is developed. The classification algorithm is used to command a go/no go signal to indicate the initiation and termination of an acceptable landing window. Simulation results show that such a go/no go pattern based letdown guidance strategy improves touchdown performance.

Phatak, A. V.

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.

Applications of feature selection

The use of satellite-acquired (LANDSAT) multispectral scanner (MSS) data to conduct an inventory of some crop of economic interest such as wheat over a large geographical area is considered in relation to the development of accurate and efficient algorithms for data classification. The dimension of the measurement space and the computational load for a classification algorithm is increased by the use of multitemporal measurements. Feature selection/combination techniques used to reduce the dimensionality of the problem are described.

Guseman, L. F., Jr.

Context distribution estimation for contextual classification of multispectral image data

A classification algorithm incorporating contextual information in a general, statistical manner is presented. Methods are investigated for obtaining adequate estimates of the context distribution (a statistical characterization of context) upon which the classification algorithm depends. Finally, a method of estimating optimal algorithm parameters prior to performing preliminary classifications is explored.

Tilton, J. C.

Combined spectral and spatial processing of ERTS imagery data

A procedure for extracting a set of textural features for ERTS-1 MSS data is presented. The textural features were combined with a set of spectral features and were used to develop a classification algorithm for identifying the land use categories of blocks of digital MSS data. The classification algorithm was derived from a training set of 314 blocks and tested on a set of 310 blocks. The overall accuracy of the classifier was found to be 83.5% on seven land use categories.

Haralick, R. M.