Potential functions in pattern classification algorithms
Pattern classification algorithms using potential functions to construct discriminant functions from sample points set
Meisel, W. S.↗
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.
Gaussian maximum likelihood and contextual classification algorithms for multicrop classification
The paper reviews some of the ways in which context has been handled in the remote-sensing literature, and additional possibilities are introduced. The problem of computing exhaustive and normalized class-membership probabilities from the likelihoods provided by the Gaussian maximum likelihood classifier (to be used as initial probability estimates to start relaxation) is discussed. An efficient implementation of probabilistic relaxation is proposed, suiting the needs of actual remote-sensing applications. A modified fuzzy-relaxation algorithm using generalized operations between fuzzy sets is presented. Combined use of the two relaxation algorithms is proposed to exploit context in multispectral classification of remotely sensed data. Results on both one artificially created image and one MSS data set are reported.
Di Zenzo, Silvano↗
Gaussian maximum likelihood and contextual classification algorithms for multicrop classification experiments using thematic mapper and multispectral scanner sensor data
The paper presents the results of a four-factor two-level analysis of a variance experiment designed to evaluate the combined effect of the improved quality of remote-sensor data and the use of context by the classifier on classification accuracy. The improvement achievable by using the context via relaxation techniques is significantly smaller than that provided by an increase of the radiometric resolution of the sensor from 6 to 8 bits per sample (the relative increase in radiometric resolution of TM relative to MSS). It is almost equal to that achievable by an increase in the spectral coverage as provided by TM relative to MSS.
Di Zenzo, Silvano↗
On pattern classification algorithms - Introduction and survey.
Pattern classification algorithms classified according to type of input information required
Agrawala, A. K.↗
On pattern classification algorithms - Introduction and survey.
Pattern classification algorithms classified according to type of input information required
Agrawala, A. K.↗
Feature extraction and classification algorithms for high dimensional data
Feature extraction and classification algorithms for high dimensional data are investigated. Developments with regard to sensors for Earth observation are moving in the direction of providing much higher dimensional multispectral imagery than is now possible. In analyzing such high dimensional data, processing time becomes an important factor. With large increases in dimensionality and the number of classes, processing time will increase significantly. To address this problem, a multistage classification scheme is proposed which reduces the processing time substantially by eliminating unlikely classes from further consideration at each stage. Several truncation criteria are developed and the relationship between thresholds and the error caused by the truncation is investigated. Next an approach to feature extraction for classification is proposed based directly on the decision boundaries. It is shown that all the features needed for classification can be extracted from decision boundaries. A characteristic of the proposed method arises by noting that only a portion of the decision boundary is effective in discriminating between classes, and the concept of the effective decision boundary is introduced. The proposed feature extraction algorithm has several desirable properties: it predicts the minimum number of features necessary to achieve the same classification accuracy as in the original space for a given pattern recognition problem; and it finds the necessary feature vectors. The proposed algorithm does not deteriorate under the circumstances of equal means or equal covariances as some previous algorithms do. In addition, the decision boundary feature extraction algorithm can be used both for parametric and non-parametric classifiers. Finally, some problems encountered in analyzing high dimensional data are studied and possible solutions are proposed. First, the increased importance of the second order statistics in analyzing high dimensional data is recognized. By investigating the characteristics of high dimensional data, the reason why the second order statistics must be taken into account in high dimensional data is suggested. Recognizing the importance of the second order statistics, there is a need to represent the second order statistics. A method to visualize statistics using a color code is proposed. By representing statistics using color coding, one can easily extract and compare the first and the second statistics.
Lee, Chulhee↗
Evaluation of registration, compression and classification algorithms. Volume 1: Results
The registration, compression, and classification algorithms were selected on the basis that such a group would include most of the different and commonly used approaches. The results of the investigation indicate clearcut, cost effective choices for registering, compressing, and classifying multispectral imagery.
Jayroe, R.↗
The Optimization of Trained and Untrained Image Classification Algorithms for Use on Large Spatial Datasets
The HARVIST project seeks to automatically provide an accurate, interactive interface to predict crop yield over the entire United States. In order to accomplish this goal, large images must be quickly and automatically classified by crop type. Current trained and untrained classification algorithms, while accurate, are highly inefficient when operating on large datasets. This project sought to develop new variants of two standard trained and untrained classification algorithms that are optimized to take advantage of the spatial nature of image data. The first algorithm, harvist-cluster, utilizes divide-and-conquer techniques to precluster an image in the hopes of increasing overall clustering speed. The second algorithm, harvistSVM, utilizes support vector machines (SVMs), a type of trained classifier. It seeks to increase classification speed by applying a "meta-SVM" to a quick (but inaccurate) SVM to approximate a slower, yet more accurate, SVM. Speedups were achieved by tuning the algorithm to quickly identify when the quick SVM was incorrect, and then reclassifying low-confidence pixels as necessary. Comparing the classification speeds of both algorithms to known baselines showed a slight speedup for large values of k (the number of clusters) for harvist-cluster, and a significant speedup for harvistSVM. Future work aims to automate the parameter tuning process required for harvistSVM, and further improve classification accuracy and speed. Additionally, this research will move documents created in Canvas into ArcGIS. The launch of the Mars Reconnaissance Orbiter (MRO) will provide a wealth of image data such as global maps of Martian weather and high resolution global images of Mars. The ability to store this new data in a georeferenced format will support future Mars missions by providing data for landing site selection and the search for water on Mars.
Kocurek, Michael J.↗
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.↗
Level 2 Cloud Detection and Classification Algorithm Theoretical Basis
This Algorithm Theoretical Basis (ATB) document describes the algorithms used to retrieve the cloud classification parameters of the MISR Level 2 Top-of-Atmosphere (TOA)/Cloud Product.
detection cloud classification algorithm↗
Preliminary results from the ASF/GPS ice classification algorithm
The European Space Agency Remote Sensing Satellite (ERS-1) satellite carried a C-band synthetic aperture radar (SAR) to study the earth's polar regions. The radar returns from sea ice can be used to infer properties of ice, including ice type. An algorithm has been developed for the Alaska SAR facility (ASF)/Geophysical Processor System (GPS) to infer ice type from the SAR observations over sea ice and open water. The algorithm utilizes look-up tables containing expected backscatter values from various ice types. An analysis has been made of two overlapping strips with 14 SAR images. The backscatter values of specific ice regions were sampled to study the backscatter characteristics of the ice in time and space. Results show both stability of the backscatter values in time and a good separation of multiyear and first-year ice signals, verifying the approach used in the classification algorithm.
Cunningham, G.↗
Comparison of GOES Cloud Classification Algorithms Employing Explicit and Implicit Physics
Cloud-type classification based on multispectral satellite imagery data has been widely researched and demonstrated to be useful for distinguishing a variety of classes using a wide range of methods. The research described here is a comparison of the classifier output from two very different algorithms applied to Geostationary Operational Environmental Satellite (GOES) data over the course of one year. The first algorithm employs spectral channel thresholding and additional physically based tests. The second algorithm was developed through a supervised learning method with characteristic features of expertly labeled image samples used as training data for a 1-nearest-neighbor classification. The latter's ability to identify classes is also based in physics, but those relationships are embedded implicitly within the algorithm. A pixel-to-pixel comparison analysis was done for hourly daytime scenes within a region in the northeastern Pacific Ocean. Considerable agreement was found in this analysis, with many of the mismatches or disagreements providing insight to the strengths and limitations of each classifier. Depending upon user needs, a rule-based or other postprocessing system that combines the output from the two algorithms could provide the most reliable cloud-type classification.
EXPLICIT PHYSICS ALGORITHMS↗
Ice classification algorithm development and verification for the Alaska SAR Facility using aircraft imagery
The Alaska SAR Facility (ASF) at the University of Alaska, Fairbanks is a NASA program designed to receive, process, and archive SAR data from ERS-1 and to support investigations that will use this regional data. As part of ASF, specialized subsystems and algorithms to produce certain geophysical products from the SAR data are under development. Of particular interest are ice motion, ice classification, and ice concentration. This work focuses on the algorithm under development for ice classification, and the verification of the algorithm using C-band aircraft SAR imagery recently acquired over the Alaskan arctic.
Holt, Benjamin↗
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.↗
On pattern classification algorithms - Introduction and survey
Pattern recognition algorithms, and mathematical techniques of estimation, decision making, and optimization theory
Agrawala, A. K.↗
Evaluation of registration, compression, and classification algorithms. Volume 2: Documentation
There are no author-identified significant results in this report.
Jayroe, R.↗
Modifications to the three-component classification algorithm for SAR data
Previously, a scattering model was used to classify SAR data as due to three mechanisms: surface or odd-bounce scattering; double-bounce scattering; and volume scattering. A Bragg rough-surface model was used for odd-bounce scattering, and two reflecting surfaces, as in a dihedral corner reflector, represented the double-bounce scattering mechanism. A random collection of infinitely thin cylinders was used to model the volume scattering contribution. It was assumed that the cylinders are uniformly oriented in all directions. In this work, modifications are made to the above model, which include specifying a preferred orientation for the cylinders representing branches and using thin cylinders of finite thickness as opposed to infinitely thin ones. In the first case, the preferred orientation is represented by a probability density function in the form of a dirac delta function. For the second case, small argument asymptotic expansions of Bessel functions are used to express the volume scattering contributions in terms of quantities containing the average radius of the cylinders. Since in each case the number of unknowns exceeds that of equations, simplifying assumptions are made. The solutions are applied to multifrequency polarimetric SAR data to obtain the new unknowns in addition to the relative contributions of each scattering mechanism. Several results are presented. It is found that the calculated percentage of each mechanism does not change significantly compared to the original model; however, additional information is gained about the scatterers.
Moghaddam, M.↗
GLAST Burst Monitor Trigger Classification Algorithm
The Gamma Ray Large Area Space Telescope (GLAST), currently set for launch in the first quarter of 2007, will consist of two instruments, the GLAST Burst Monitor (GBM) and the Large Area Telescope (LAT). One of the goals of the GBM is to identify and locate gamma-ray bursts using on-board software. The GLAST observatory can then be re-oriented to allow observations by the LAT. A Bayesian analysis will be used to distinguish gamma-ray bursts from other triggering events, such as solar flares, magnetospheric particle precipitation, soft gamma repeaters (SGRs), and Cygnus X-1 flaring. The trigger parameters used in the analysis are the burst celestial coordinates, angle from the Earth's horizon, spectral hardness, and the spacecraft geomagnetic latitude. The algorithm will be described and the results of testing will be presented.
Perrin, D. J.↗