Search NASA⌕ Search

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS2000

Real Time Intelligent Target Detection and Analysis with Machine Vision

We present an algorithm for detecting a specified set of targets for an Automatic Target Recognition (ATR) application. ATR involves processing images for detecting, classifying, and tracking targets embedded in a background scene. We address the problem of discriminating between targets and nontarget objects in a scene by evaluating 40x40 image blocks belonging to an image. Each image block is first projected onto a set of templates specifically designed to separate images of targets embedded in a typical background scene from those background images without targets. These filters are found using directed principal component analysis which maximally separates the two groups. The projected images are then clustered into one of n classes based on a minimum distance to a set of n cluster prototypes. These cluster prototypes have previously been identified using a modified clustering algorithm based on prior sensed data. Each projected image pattern is then fed into the associated cluster's trained neural network for classification. A detailed description of our algorithm will be given in this paper. We outline our methodology for designing the templates, describe our modified clustering algorithm, and provide details on the neural network classifiers. Evaluation of the overall algorithm demonstrates that our detection rates approach 96% with a false positive rate of less than 0.03%.

Howard, Ayanna↗
NASA NTRS2012

Mapping Impervious Surface Expansion using Medium-resolution Satellite Image Time Series: A Case Study in the Yangtze River Delta, China

Cities have been expanding rapidly worldwide, especially over the past few decades. Mapping the dynamic expansion of impervious surface in both space and time is essential for an improved understanding of the urbanization process, land-cover and land-use change, and their impacts on the environment. Landsat and other medium-resolution satellites provide the necessary spatial details and temporal frequency for mapping impervious surface expansion over the past four decades. Since the US Geological Survey opened the historical record of the Landsat image archive for free access in 2008, the decades-old bottleneck of data limitation has gone. Remote-sensing scientists are now rich with data, and the challenge is how to make best use of this precious resource. In this article, we develop an efficient algorithm to map the continuous expansion of impervious surface using a time series of four decades of medium-resolution satellite images. The algorithm is based on a supervised classification of the time-series image stack using a decision tree. Each imerpervious class represents urbanization starting in a different image. The algorithm also allows us to remove inconsistent training samples because impervious expansion is not reversible during the study period. The objective is to extract a time series of complete and consistent impervious surface maps from a corresponding times series of images collected from multiple sensors, and with a minimal amount of image preprocessing effort. The approach was tested in the lower Yangtze River Delta region, one of the fastest urban growth areas in China. Results from nearly four decades of medium-resolution satellite data from the Landsat Multispectral Scanner (MSS), Thematic Mapper (TM), Enhanced Thematic Mapper plus (ETM+) and China-Brazil Earth Resources Satellite (CBERS) show a consistent urbanization process that is consistent with economic development plans and policies. The time-series impervious spatial extent maps derived from this study agree well with an existing urban extent polygon data set that was previously developed independently. The overall mapping accuracy was estimated at about 92.5% with 3% commission error and 12% omission error for the impervious type from all images regardless of image quality and initial spatial resolution.

Gao, Feng↗
NASA NTRS2011

Marker-Based Hierarchical Segmentation and Classification Approach for Hyperspectral Imagery

The Hierarchical SEGmentation (HSEG) algorithm, which is a combination of hierarchical step-wise optimization and spectral clustering, has given good performances for hyperspectral image analysis. This technique produces at its output a hierarchical set of image segmentations. The automated selection of a single segmentation level is often necessary. We propose and investigate the use of automatically selected markers for this purpose. In this paper, a novel Marker-based HSEG (M-HSEG) method for spectral-spatial classification of hyperspectral images is proposed. First, pixelwise classification is performed and the most reliably classified pixels are selected as markers, with the corresponding class labels. Then, a novel constrained marker-based HSEG algorithm is applied, resulting in a spectral-spatial classification map. The experimental results show that the proposed approach yields accurate segmentation and classification maps, and thus is attractive for hyperspectral image analysis.

Tarabalka, Yuliya↗
NASA NTRS2015

A High Performance Computing Approach to Tree Cover Delineation in 1-m NAIP Imagery Using a Probabilistic Learning Framework

Tree cover delineation is a useful instrument in deriving Above Ground Biomass (AGB) density estimates from Very High Resolution (VHR) airborne imagery data. Numerous algorithms have been designed to address this problem, but most of them do not scale to these datasets, which are of the order of terabytes. In this paper, we present a semi-automated probabilistic framework for the segmentation and classification of 1-m National Agriculture Imagery Program (NAIP) for tree-cover delineation for the whole of Continental United States, using a High Performance Computing Architecture. Classification is performed using a multi-layer Feedforward Backpropagation Neural Network and segmentation is performed using a Statistical Region Merging algorithm. The results from the classification and segmentation algorithms are then consolidated into a structured prediction framework using a discriminative undirected probabilistic graphical model based on Conditional Random Field, which helps in capturing the higher order contextual dependencies between neighboring pixels. Once the final probability maps are generated, the framework is updated and re-trained by relabeling misclassified image patches. This leads to a significant improvement in the true positive rates and reduction in false positive rates. The tree cover maps were generated for the whole state of California, spanning a total of 11,095 NAIP tiles covering a total geographical area of 163,696 sq. miles. The framework produced true positive rates of around 88% for fragmented forests and 74% for urban tree cover areas, with false positive rates lower than 2% for both landscapes. Comparative studies with the National Land Cover Data (NLCD) algorithm and the LiDAR canopy height model (CHM) showed the effectiveness of our framework for generating accurate high-resolution tree-cover maps.

Segments↗
NASA NTRS1997

Analysis of Texture Using the Fractal Model

Properties such as the fractal dimension (FD) can be used for feature extraction and classification of regions within an image. The FD measures the degree of roughness of a surface, so this number is used to characterize a particular region, in order to differentiate it from another. There are two basic approaches discussed in the literature to measure FD: the blanket method, and the box counting method. Both attempt to measure FD by estimating the change in surface area with respect to the change in resolution. We tested both methods but box counting resulted computationally faster and gave better results. Differential Box Counting (DBC) was used to segment a collage containing three textures. The FD is independent of directionality and brightness so five features were used derived from the original image to account for directionality and gray level biases. FD can not be measured on a point, so we use a window that slides across the image giving values of FD to the pixel on the center of the window. Windowing blurs the boundaries of adjacent classes, so an edge-preserving, feature-smoothing algorithm is used to improve classification within segments and to make the boundaries sharper. Segmentation using DBC was 90.8910 accurate.

Navas, William↗
NASA NTRS2011

Testing of the Support Vector Machine for Binary-Class Classification

The Support Vector Machine is a powerful algorithm, useful in classifying data in to species. The Support Vector Machines implemented in this research were used as classifiers for the final stage in a Multistage Autonomous Target Recognition system. A single kernel SVM known as SVMlight, and a modified version known as a Support Vector Machine with K-Means Clustering were used. These SVM algorithms were tested as classifiers under varying conditions. Image noise levels varied, and the orientation of the targets changed. The classifiers were then optimized to demonstrate their maximum potential as classifiers. Results demonstrate the reliability of SMV as a method for classification. From trial to trial, SVM produces consistent results

autonomous target recognition systemr↗
NASA NTRS1973

An objective technique to estimate percentage of an ERTS-1 water boundary resolution element covered by water

The author has identified the following significant results. An objective technique was developed to measure the surface area of water bodies. Nineteen water bodies in the Houston and Galveston, Texas area were selected as a basis for the technique development. The actual surface area of each body was determined from rectified and enlarged NASA aircraft photography. A clustering algorithm was used to produce classification maps of the region from ERTS-1 data. Certain classes were identified as being 100% water. Other classes were identified as being mixtures of water with land or vegetation. The number of picture elements falling on each water body and its boundary were counted. A linear regression analysis was performed to relate the total number of picture elements and boundary elements counted to the actual surface area. The standard error of the estimate was 6.7 acres. The absolute error was not a function of the actual surface area of the water body.

Erb, R. B.↗
NASA NTRS1980

Decision making and problem solving with computer assistance

In modern guidance and control systems, the human as manager, supervisor, decision maker, problem solver and trouble shooter, often has to cope with a marginal mental workload. To improve this situation, computers should be used to reduce the operator from mental stress. This should not solely be done by increased automation, but by a reasonable sharing of tasks in a human-computer team, where the computer supports the human intelligence. Recent developments in this area are summarized. It is shown that interactive support of operator by intelligent computer is feasible during information evaluation, decision making and problem solving. The applied artificial intelligence algorithms comprehend pattern recognition and classification, adaptation and machine learning as well as dynamic and heuristic programming. Elementary examples are presented to explain basic principles.

Kraiss, F.↗
NASA NTRS1979

Multiclass Bayes error estimation by a feature space sampling technique

A general Gaussian M-class N-feature classification problem is defined. An algorithm is developed that requires the class statistics as its only input and computes the minimum probability of error through use of a combined analytical and numerical integration over a sequence simplifying transformations of the feature space. The results are compared with those obtained by conventional techniques applied to a 2-class 4-feature discrimination problem with results previously reported and 4-class 4-feature multispectral scanner Landsat data classified by training and testing of the available data.

Mobasseri, B. G.↗
NASA NTRS1979

The suitability of the ILLIAC IV architecture for image processing

The major architectural features of the ILLIAC IV large scale, array processor are summarized along with their applicability to image processing. Several image processing algorithms are considered, including multispectral classification, texture feature extraction, two-dimensional Fourier transform, and synthetic aperture radar processing. The basic parallelism of the ILLIAC IV (64 processing elements acting in lock-step) is usually fully utilized by the image processing applications. The major architectural aspect of the system with respect to image processing is the relatively small local scratch-pad memory and the long latency time to access the main storage device. The major precision used for the image processing applications is the 32-bit floating point, given a choice of 8-bit integers and 64-bit floating point.

Stevenson, D. K.↗
NASA NTRS1997

Improving the MODIS Global Snow-Mapping Algorithm

An algorithm (Snowmap) is under development to produce global snow maps at 500 meter resolution on a daily basis using data from the NASA MODIS instrument. MODIS, the Moderate Resolution Imaging Spectroradiometer, will be launched as part of the first Earth Observing System (EOS) platform in 1998. Snowmap is a fully automated, computationally frugal algorithm that will be ready to implement at launch. Forests represent a major limitation to the global mapping of snow cover as a forest canopy both obscures and shadows the snow underneath. Landsat Thematic Mapper (TM) and MODIS Airborne Simulator (MAS) data are used to investigate the changes in reflectance that occur as a forest stand becomes snow covered and to propose changes to the Snowmap algorithm that will improve snow classification accuracy forested areas.

Klein, Andrew G.↗
NASA NTRS2001

Characteristics of AVIRIS Band Measurements in Desert Agroecosystems in the Area of Blythe, California: Studies of Cotton Spectra - 1

Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) data from Blythe, California, were acquired in June 1997 to study agricultural spectra from different crops and to identify crops in other areas with similar environmental factors and similar spectral properties. The main objectives of this study are: (1) to compare the spectral and radiometric characteristics of AVIRIS data from agriculture crops with ground spectra measured by a FieldSpec ASD spectrometer; (2) to explore the use of AVIRIS spectral images for identifying agricultural crops; (3) to study the spectral expression of environmental factors on selected crops; and (4) to build a spectral library for the crops that were studied. A long-term goal is to extend the spectral library for different vegetation or crops in different stages of growth. To support our study, on July 18 and 19, 2000, we collected spectra using the FieldSpec spectrometer from selected fields with different crops in the Blythe area of California (longitude 114 deg 33.28 W and latitude 33 deg 25.42 N to longitude 1140 44.53 W and latitude 33 deg 39.77 N). These crops were cotton in different stages of growth, varieties of grass pure or mixed, Sudan grass, Bermuda grass, Teff grass, and alfalfa. Some of the fields were treated with different types of irrigation (i.e., wet to dry conditions). Additional parameters were studied such as the soil water content (WC), pH, and organic matter (OM). The results of this study showed that for crops known to be similar, there is a significant correlation between the spectra that were collected by AVIRIS in 1997 and spectra measured by the FieldSpec (registered) spectrometer in 2000. This correlation allowed development of a spectral library to be used in ENVI-IDL analysis software. This library was used successfully to identify different crops. Furthermore, using IDL algorithms of Spectral Angle Mapper classification (SAM), spectral feature fitting (SFF) and spectral binary encoding (SPE) showed that there is excellent agreement between the predicted and the actual crop type (i.e., the correlation is between 85-90% match). Further use of the AVIRIS images can be of a value to crop identification or crop yield for commercial use.

Hanna, Safwat H. Shakir↗
NASA NTRS1973

Extraction and classification of objects in multispectral images

Presented here is an algorithm that partitions a digitized multispectral image into parts that correspond to objects in the scene being sensed. The algorithm partitions an image into successively smaller rectangles and produces a partition that tends to minimize a criterion function. Supervised and unsupervised classification techniques can be applied to partitioned images. This partition-then-classify approach is used to process images sensed from aircraft and the ERTS-1 satellite, and the method is shown to give relatively accurate results in classifying agricultural areas and extracting urban areas.

Robertson, T. V.↗
NASA NTRS2012

Optimization of Support Vector Machine (SVM) for Object Classification

The Support Vector Machine (SVM) is a powerful algorithm, useful in classifying data into species. The SVMs implemented in this research were used as classifiers for the final stage in a Multistage Automatic Target Recognition (ATR) system. A single kernel SVM known as SVMlight, and a modified version known as a SVM with K-Means Clustering were used. These SVM algorithms were tested as classifiers under varying conditions. Image noise levels varied, and the orientation of the targets changed. The classifiers were then optimized to demonstrate their maximum potential as classifiers. Results demonstrate the reliability of SVM as a method for classification. From trial to trial, SVM produces consistent results.

support vector machice (SVM)↗
NASA NTRS2014

Drop Size Distribution - Based Separation of Stratiform and Convective Rain

For applications in hydrology and meteorology, it is often desirable to separate regions of stratiform and convective rain from meteorological radar observations, both from ground-based polarimetric radars and from space-based dual frequency radars. In a previous study by Bringi et al. (2009), dual frequency profiler and dual polarization radar (C-POL) observations in Darwin, Australia, had shown that stratiform and convective rain could be separated in the log10(Nw) versus Do domain, where Do is the mean volume diameter and Nw is the scaling parameter which is proportional to the ratio of water content to the mass weighted mean diameter. Note, Nw and Do are two of the main drop size distribution (DSD) parameters. In a later study, Thurai et al (2010) confirmed that both the dual-frequency profiler based stratiform-convective rain separation and the C-POL radar based separation were consistent with each other. In this paper, we test this separation method using DSD measurements from a ground based 2D video disdrometer (2DVD), along with simultaneous observations from a collocated, vertically-pointing, X-band profiling radar (XPR). The measurements were made in Huntsville, Alabama. One-minute DSDs from 2DVD are used as input to an appropriate gamma fitting procedure to determine Nw and Do. The fitted parameters - after averaging over 3-minutes - are plotted against each other and compared with a predefined separation line. An index is used to determine how far the points lie from the separation line (as described in Thurai et al. 2010). Negative index values indicate stratiform rain and positive index indicate convective rain, and, moreover, points which lie somewhat close to the separation line are considered 'mixed' or 'transition' type precipitation. The XPR observations are used to evaluate/test the 2DVD data-based classification. A 'bright-band' detection algorithm was used to classify each vertical reflectivity profile as either stratiform or convective, depending on whether or not a clearly-defined melting layer is present at an expected height, and if present, maximum reflectivity within the melting layer as well as the corresponding height are determined. We will present results of quantitative comparisons between the XPR observations-based classifications and the simultaneous 2DVD data-based classifications. Time series comparisons will be presented for thirteen events in Huntsville.

Thurai, Merhala↗
NASA NTRSDate not supplied

Aerial Object Trajectory Classification by Training on Flight Controller Data and Testing on RADAR Generated Tracks

Onboard collision avoidance is needed to enable safe, autonomous flight operations for NASA projects such as Advanced Air Mobility (AAM), as well as many commercial applications. Real-time aerial object classification will improve onboard collision avoidance algorithm decision making and may reduce unnecessary activation of avoidance systems. This work trains an aircraft trajectory classifier using trajectories from flight controller logs and tests the classifier using RADAR collected trajectories during air to air experiments and ground to air experiments. In contrast to RADAR data, these flight controller logs are relatively abundant, which makes the possibility of substituting flight data for RADAR data an attractive, cost-effective option. The SVM model developed in this work achieved a 79.7% classification accuracy on the first second of radar trajectories of GA, multirotor sUAS, and fixed wing sUAS. Findings from this work indicate that it is feasible to classify sensor collected trajectories using a classifier trained on flight controller data.

Henry Holbrook↗
NASA NTRS2022

DataSet: Aerial Object Trajectory Classification by Training on Flight Controller Data and Testing on RADAR Generated

Onboard collision avoidance is needed to enable safe, autonomous flight operations for NASA projects such as Advanced Air Mobility (AAM), as well as many commercial applications. Real-time aerial object classification will improve onboard collision avoidance algorithm decision making and may reduce unnecessary activation of avoidance systems. This work trains an aircraft trajectory classifier using trajectories from flight controller logs and tests the classifier using RADAR collected trajectories during air to air experiments and ground to air experiments. In contrast to RADAR data, these flight controller logs are relatively abundant, which makes the possibility of substituting flight data for RADAR data an attractive, cost-effective option. The SVM model developed in this work achieved a 79.7% classification accuracy on the first second of radar trajectories of GA, multirotor sUAS, and fixed wing sUAS. Findings from this e that it is feasible to classify sensor collected trajectories using a classifier trained flight controller data.

Chester V Dolph↗
NASA NTRS2005

Experiments on Supervised Learning Algorithms for Text Categorization

Modern information society is facing the challenge of handling massive volume of online documents, news, intelligence reports, and so on. How to use the information accurately and in a timely manner becomes a major concern in many areas. While the general information may also include images and voice, we focus on the categorization of text data in this paper. We provide a brief overview of the information processing flow for text categorization, and discuss two supervised learning algorithms, viz., support vector machines (SVM) and partial least squares (PLS), which have been successfully applied in other domains, e.g., fault diagnosis [9]. While SVM has been well explored for binary classification and was reported as an efficient algorithm for text categorization, PLS has not yet been applied to text categorization. Our experiments are conducted on three data sets: Reuter's- 21578 dataset about corporate mergers and data acquisitions (ACQ), WebKB and the 20-Newsgroups. Results show that the performance of PLS is comparable to SVM in text categorization. A major drawback of SVM for multi-class categorization is that it requires a voting scheme based on the results of pair-wise classification. PLS does not have this drawback and could be a better candidate for multi-class text categorization.

Namburu, Setu Madhavi↗