Search NASA⌕ Search

SEARCH · Search NASA

Results for “Pattern Recognition Algorithm”

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

A star pattern recognition algorithm for autonomous attitude determination

The star-pattern recognition algorithm presented allows the advanced Full-sky Autonomous Star Tracker (FAST) device, such as the projected ASTROS II system of the Mariner Mark II planetary spacecraft, to reliably ascertain attitude about all three axes. An ASTROS II-based FAST, possessing an 11.5 x 11.5 deg field of view and 8-arcsec accuracy, can when integrated with an all-sky data base of 4100 guide stars determine its attitude in about 1 sec, with a success rate close to 100 percent. The present recognition algorithm can also be used for automating the acquisition of celestial targets by astronomy telescopes, autonomously updating the attitude of gyro-based attitude control systems, and automating ground-based attitude reconstruction.

Van Bezooijen, R. W. H.↗

Pattern-Recognition Algorithm for Locking Laser Frequency

A computer program serves as part of a feedback control system that locks the frequency of a laser to one of the spectral peaks of cesium atoms in an optical absorption cell. The system analyzes a saturation absorption spectrum to find a target peak and commands a laser-frequency-control circuit to minimize an error signal representing the difference between the laser frequency and the target peak. The program implements an algorithm consisting of the following steps: Acquire a saturation absorption signal while scanning the laser through the frequency range of interest. Condition the signal by use of convolution filtering. Detect peaks. Match the peaks in the signal to a pattern of known spectral peaks by use of a pattern-recognition algorithm. Add missing peaks. Tune the laser to the desired peak and thereafter lock onto this peak. Finding and locking onto the desired peak is a challenging problem, given that the saturation absorption signal includes noise and other spurious signal components; the problem is further complicated by nonlinearity and shifting of the voltage-to-frequency correspondence. The pattern-recognition algorithm, which is based on Hausdorff distance, is what enables the program to meet these challenges.

Karayan, Vahag↗

Pattern recognition algorithm using temporal data

The value of a previously classified image is discussed with the use of spectral and temporal information. A probability theory is presented of a signal X, belonging to class pi sub i.

Source record↗

Pattern Recognition Algorithm for High-Sensitivity Odorant Detection in Unknown Environments

In a realistic odorant detection application environment, the collected sensory data is a mix of unknown chemicals with unknown concentrations and noise. The identification of the odorants among these mixtures is a challenge in data recognition. In addition, deriving their individual concentrations in the mix is also a challenge. A deterministic analytical model was developed to accurately identify odorants and calculate their concentrations in a mixture with noisy data.

Duong, Tuan A.↗

Pattern Recognition for a Flight Dynamics Monte Carlo Simulation

The design, analysis, and verification and validation of a spacecraft relies heavily on Monte Carlo simulations. Modern computational techniques are able to generate large amounts of Monte Carlo data but flight dynamics engineers lack the time and resources to analyze it all. The growing amounts of data combined with the diminished available time of engineers motivates the need to automate the analysis process. Pattern recognition algorithms are an innovative way of analyzing flight dynamics data efficiently. They can search large data sets for specific patterns and highlight critical variables so analysts can focus their analysis efforts. This work combines a few tractable pattern recognition algorithms with basic flight dynamics concepts to build a practical analysis tool for Monte Carlo simulations. Current results show that this tool can quickly and automatically identify individual design parameters, and most importantly, specific combinations of parameters that should be avoided in order to prevent specific system failures. The current version uses a kernel density estimation algorithm and a sequential feature selection algorithm combined with a k-nearest neighbor classifier to find and rank important design parameters. This provides an increased level of confidence in the analysis and saves a significant amount of time.

Restrepo, Carolina↗

The analysis of polar clouds from AVHRR satellite data using pattern recognition techniques

The cloud cover in a set of summertime and wintertime AVHRR data from the Arctic and Antarctic regions was analyzed using a pattern recognition algorithm. The data were collected by the NOAA-7 satellite on 6 to 13 Jan. and 1 to 7 Jul. 1984 between 60 deg and 90 deg north and south latitude in 5 spectral channels, at the Global Area Coverage (GAC) resolution of approximately 4 km. This data embodied a Polar Cloud Pilot Data Set which was analyzed by a number of research groups as part of a polar cloud algorithm intercomparison study. This study was intended to determine whether the additional information contained in the AVHRR channels (beyond the standard visible and infrared bands on geostationary satellites) could be effectively utilized in cloud algorithms to resolve some of the cloud detection problems caused by low visible and thermal contrasts in the polar regions. The analysis described makes use of a pattern recognition algorithm which estimates the surface and cloud classification, cloud fraction, and surface and cloudy visible (channel 1) albedo and infrared (channel 4) brightness temperatures on a 2.5 x 2.5 deg latitude-longitude grid. In each grid box several spectral and textural features were computed from the calibrated pixel values in the multispectral imagery, then used to classify the region into one of eighteen surface and/or cloud types using the maximum likelihood decision rule. A slightly different version of the algorithm was used for each season and hemisphere because of differences in categories and because of the lack of visible imagery during winter. The classification of the scene is used to specify the optimal AVHRR channel for separating clear and cloudy pixels using a hybrid histogram-spatial coherence method. This method estimates values for cloud fraction, clear and cloudy albedos and brightness temperatures in each grid box. The choice of a class-dependent AVHRR channel allows for better separation of clear and cloudy pixels than does a global choice of a visible and/or infrared threshold. The classification also prevents erroneous estimates of large fractional cloudiness in areas of cloudfree snow and sea ice. The hybrid histogram-spatial coherence technique and the advantages of first classifying a scene in the polar regions are detailed. The complete Polar Cloud Pilot Data Set was analyzed and the results are presented and discussed.

Smith, William L.↗

How Sample Completeness Affects Gamma-Ray Burst Classification

Unsupervised pattern recognition algorithms support the existence of three gamma-ray burst classes; class I (long, large fluence bursts of intermediate spectral hardness), Class II (short, small fluence, hard bursts), and class III (soft bursts of intermediate durations and fluences). The algorithms surprisingly assign larger membership to class III than to either of the other two classes. A known systematic bias has been previously used to explain the existence of class III in terms of class I; this bias allows the fluences and durations of some bursts to be underestimated. We show that this bias primarily affects only the longest bursts and cannot explain the bulk of the class III properties. We resolve the question of class III existence by demonstrating how samples obtained using standard trigger mechanisms fail to preserve the duration characteristics of small peak flux bursts: (Sample incompleteness is thus primarily responsible for the existence of class III.) In order to avoid this incompleteness, we show how a new dual timescale peak flux can be defined in terms of peak flux and fluence. The dual timescale peak flux reserves the duration distribution of faint bursts and correlates either with spectral hardness (and presumably redshift) than either peak flux or fluence. The techniques presented here are generic and have applicability to the studies of other transient events. The results also indicate that pattern recognition algorithms are sensitive to sample completeness; this can influence the study of large astronomical databases such as those found in a Virtual Observatory.

Hakkila, Jon↗

How Sample Completeness Affects Gamma-Ray Burst Classification

Unsupervised pattern-recognition algorithms support the existence of three gamma-ray burst classes: class 1 (long, large-fluence bursts of intermediate spectral hardness), class 2 (short, small-fluence, hard bursts), and class 3 (soft bursts of intermediate durations and fluences). The algorithms surprisingly assign larger membership to class 3 than to either of the other two classes. A known systematic bias has been previously used to explain the existence of class 3 in terms of class 1 ; this bias allows the fluences and durations of some bursts to be underestimated, as recently shown by Hakkila et al. We show that this bias primarily affects only the longest bursts and cannot explain the bulk of the class 3 properties. We resolve the question of class 3's existence by demonstrating how samples obtained using standard trigger mechanisms fail to preserve the duration characteristics of small-peak flux bursts. Sample incompleteness is thus primarily responsible for the existence of class 3. In order to avoid this incompleteness, we show how a new, dual-timescale peak flux can be defined in terms of peak flux and fluence. The dual-timescale peak flux preserves the duration distribution of faint bursts and correlates better with spectral hardness (and presumably redshift) than either peak flux or fluence. The techniques presented here are generic and have applicability to the studies of other transient events. The results also indicate that pattern recognition algorithms are sensitive to sample completeness; this can influence the study of large astronomical databases, such as those found in a virtual observatory.

Hakkila, Jon↗

TPSAS-NF1676L-21193-DND

Researchers at NASA Langley Research Center have been developing an automated pattern recognition algorithm to identify overshooting convective cloud tops (OTs) in support of the GOES-R satellite program. This algorithm identify regions of overshooting at the individual 1-4 km geostationary satellite pixel scale using visible (during daytime only) and infrared channel imagery and numerical weather analysis data. The algorithm has been developed based upon analysis of 0.25-1 km spatial resolution Aqua MODIS imagery, using a database of over 2000 manually identified OT features throughout the world in storms with varying intensity and morphology. The OT database includes storms ranging from small, warm topped cells in Alaska and Mongolia, tornadic supercells over the U.S. Central Plains and Europe, large tropical mesoscale convective systems, and overshooting in the eyewalls and spiral bands of category 5 tropical cyclones. This database is available for use by the research community. The algorithm is designed to operate on data from any current and historical satellite imager, allowing for development of a highly accurate global OT detection climatology that extends back into the 1990's at up to a 15-30 min temporal resolution throughout the diurnal cycle. As members of the McIDAS Users Group, NASA LaRC has immediate access to the full global archive of geostationary imager data which would allows rapid development of OT climatologies and short-term databases. This type of capability has never been available within the weather and climate research community. Regional geostationary OT databases have been already developed over CONUS during SEAC4RS, for 18-years over the Eastern U.S., and for 5-10 years over Australia, Europe, Southeast Asia, and East Africa among many other regions. Some of these datasets are being used by climate researchers and private industry to examine UTLS-penetrating storm spatial distributions and their temporal variability, in addition to weather hazards associated with these storms at unprecedented spatial detail. This presentation will describe the OT pattern recognition algorithm and highlight recent product applications.

Kristopher Bedka↗

An improved version of the table look-up algorithm for pattern recognition

The table look-up approach to pattern recognition has been used for 3 years at several research centers in a variety of applications. A new version has been developed which is faster, requires significantly less core memory, and retains full precision of the input data. The new version can be used on low-cost minicomputers having 32K words (16 bits each) of core memory and fixed-point arithmetic; no special-purpose hardware is required. An initial FORTRAN version of this system can classify an ERTS computer-compatible tape into 24 classes in less than 15 minutes.

Eppler, W. G.↗

Predicting thunderstorm evolution using ground-based lightning detection networks

Lightning measurements acquired principally by a ground-based network of magnetic direction finders are used to diagnose and predict the existence, temporal evolution, and decay of thunderstorms over a wide range of space and time scales extending over four orders of magnitude. The non-linear growth and decay of thunderstorms and their accompanying cloud-to-ground lightning activity is described by the three parameter logistic growth model. The growth rate is shown to be a function of the storm size and duration, and the limiting value of the total lightning activity is related to the available energy in the environment. A new technique is described for removing systematic bearing errors from direction finder data where radar echoes are used to constrain site error correction and optimization (best point estimate) algorithms. A nearest neighbor pattern recognition algorithm is employed to cluster the discrete lightning discharges into storm cells and the advantages and limitations of different clustering strategies for storm identification and tracking are examined.

Goodman, Steven J.↗

An improved architecture for video rate image transformations

Geometric image transformations are of interest to pattern recognition algorithms for their use in simplifying some aspects of the pattern recognition process. Examples include reducing sensitivity to rotation, scale, and perspective of the object being recognized. The NASA Programmable Remapper can perform a wide variety of geometric transforms at full video rate. An architecture is proposed that extends its abilities and alleviates many of the first version's shortcomings. The need for the improvements are discussed in the context of the initial Programmable Remapper and the benefits and limitations it has delivered. The implementation and capabilities of the proposed architecture are discussed.

Fisher, Timothy E.↗

Fidelity of Satellite Soundings

Two pattern recognition procedures to provide improvements to first guess fields for satellite temperature retrievals were developed. The first technique where a radiometer measurement is used to select one or more historical radiosonde temperature profiles as analog estimates of ambient thermal structure. Radiosondes are the vertical scales of the analogs. The vertical resolving power of the satellite radiometer is relevant only to a decision process. The analog selection process is much more effective if implemented in an orthogonalized space of measurement information. The second procedure partitions a priori dependent data into shape coherent pattern libraries using structure information inherent in the data itself. It is shown that the pattern recognition techniques are able to reduce first guess profile errors by nearly 50%. The impact of pattern recognition on temperature retrieval error is assessed by regression and physical iterative retrieval algorithms. The influence of improved first guess fields is markedly different on these two types of algorithm. Pattern recognition was a strong positive impact on the physical iterative method.

Thompson, O.↗

Possibility expectation and its decision making algorithm

The fuzzy integral has been shown to be an effective tool for the aggregation of evidence in decision making. Of primary importance in the development of a fuzzy integral pattern recognition algorithm is the choice (construction) of the measure which embodies the importance of subsets of sources of evidence. Sugeno fuzzy measures have received the most attention due to the recursive nature of the fabrication of the measure on nested sequences of subsets. Possibility measures exhibit an even simpler generation capability, but usually require that one of the sources of information possess complete credibility. In real applications, such normalization may not be possible, or even desirable. In this report, both the theory and a decision making algorithm for a variation of the fuzzy integral are presented. This integral is based on a possibility measure where it is not required that the measure of the universe be unity. A training algorithm for the possibility densities in a pattern recognition application is also presented with the results demonstrated on the shuttle-earth-space training and testing images.

Keller, James M.↗

4-D display of satellite cloud images

A technique has been developed to display GOES satellite cloud images in perspective over a topographical map. Cloud heights are estimated using temperatures from an infrared (IR) satellite image, surface temperature observations, and a climatological model of vertical temperature profiles. Cloud levels are discriminated from each other and from the ground using a pattern recognition algorithm based on the brightness variance technique of Coakley and Bretherton. The cloud regions found by the pattern recognizer are rendered in three-dimensional perspective over a topographical map by an efficient remap of the visible image. The visible shades are mixed with an artificial shade based on the geometry of the cloud-top surface, in order to enhance the texture of the cloud top.

Hibbard, William L.↗