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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1975

Pattern recognition of soils and crops from space

An evaluation is conducted of the relative effectiveness of the computer analysis techniques which are commonly employed to extract land use (crop identification) information from digitized aerial photographs. It is found that the minimum distance to the mean (MDM) algorithm and the maximum likelihood ratio (MLR) can both be used for the successful recognition of land-use patterns. The MDM algorithm is slightly more accurate in cases involving the use of three or more variables. The use of the MLR algorithm, however, is preferable in cases in which less than three variables are employed.

Leamer, R. W.↗
DOE OSTI2015

Line broadening interference for high-resolution nuclear magnetic resonance spectra under inhomogeneous magnetic fields

Nuclear magnetic resonance spectroscopy serves as an important tool for analyzing chemicals and biological metabolites. However, its performance is subject to the magnetic-field homogeneity. Under inhomogeneous fields, peaks are broadened to overlap each other, introducing difficulties for assignments. Here, we propose a method termed as line broadening interference (LBI) to provide high-resolution information under inhomogeneous magnetic fields by employing certain gradients in the indirect dimension to interfere the magnetic-field inhomogeneity. The conventional spectral-line broadening is thus interfered to be non-diagonal, avoiding the overlapping among adjacent resonances. Furthermore, an inhomogeneity correction algorithm is developed based on pattern recognition to recover the high-resolution information from LBI spectra. Theoretical deductions are performed to offer systematic and detailed analyses on the proposed method. Moreover, experiments are conducted to prove the feasibility of the proposed method for yielding high-resolution spectra in inhomogeneous magnetic fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

Partial homogeneity based high-resolution nuclear magnetic resonance spectra under inhomogeneous magnetic fields

In nuclear magnetic resonance (NMR) technique, it is of great necessity and importance to obtain high-resolution spectra, especially under inhomogeneous magnetic fields. In this study, a method based on partial homogeneity is proposed for retrieving high-resolution one-dimensional NMR spectra under inhomogeneous fields. Signals from series of small voxels, which characterize high resolution due to small sizes, are recorded simultaneously. Then, an inhomogeneity correction algorithm is developed based on pattern recognition to correct the influence brought by field inhomogeneity automatically, thus yielding high-resolution information. Experiments on chemical solutions and fish spawn were carried out to demonstrate the performance of the proposed method. The proposed method serves as a single radiofrequency pulse high-resolution NMR spectroscopy under inhomogeneous fields and may provide an alternative of obtaining high-resolution spectra of in vivo living systems or chemical-reaction systems, where performances of conventional techniques are usually degenerated by field inhomogeneity.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1988

Function minimization with partially correct data via simulated annealing

The simulated annealing technique has been applied successfully to the problem of estimating the coefficients of a function in cases where only a portion of the data being fitted to the function is truly representative of the function, the rest being erroneous. Two examples are given, one in photometric function fitting and the other in pattern recognition. A schematic of the algorithm is provided.

Lorre, Jean J.↗
NASA NTRS1993

Fast parallel algorithms that compute transitive closure of a fuzzy relation

The notion of a transitive closure of a fuzzy relation is very useful for clustering in pattern recognition, for fuzzy databases, etc. The original algorithm proposed by L. Zadeh (1971) requires the computation time O(n(sup 4)), where n is the number of elements in the relation. In 1974, J. C. Dunn proposed a O(n(sup 2)) algorithm. Since we must compute n(n-1)/2 different values s(a, b) (a not equal to b) that represent the fuzzy relation, and we need at least one computational step to compute each of these values, we cannot compute all of them in less than O(n(sup 2)) steps. So, Dunn's algorithm is in this sense optimal. For small n, it is ok. However, for big n (e.g., for big databases), it is still a lot, so it would be desirable to decrease the computation time (this problem was formulated by J. Bezdek). Since this decrease cannot be done on a sequential computer, the only way to do it is to use a computer with several processors working in parallel. We show that on a parallel computer, transitive closure can be computed in time O((log(sub 2)(n))2).

Kreinovich, Vladik YA.↗
NASA NTRS1989

Automatic voice recognition using traditional and artificial neural network approaches

The main objective of this research is to develop an algorithm for isolated-word recognition. This research is focused on digital signal analysis rather than linguistic analysis of speech. Features extraction is carried out by applying a Linear Predictive Coding (LPC) algorithm with order of 10. Continuous-word and speaker independent recognition will be considered in future study after accomplishing this isolated word research. To examine the similarity between the reference and the training sets, two approaches are explored. The first is implementing traditional pattern recognition techniques where a dynamic time warping algorithm is applied to align the two sets and calculate the probability of matching by measuring the Euclidean distance between the two sets. The second is implementing a backpropagation artificial neural net model with three layers as the pattern classifier. The adaptation rule implemented in this network is the generalized least mean square (LMS) rule. The first approach has been accomplished. A vocabulary of 50 words was selected and tested. The accuracy of the algorithm was found to be around 85 percent. The second approach is in progress at the present time.

Botros, Nazeih M.↗
NASA NTRS1991

Decision boundary feature selection for non-parametric classifier

Feature selection has been one of the most important topics in pattern recognition. Although many authors have studied feature selection for parametric classifiers, few algorithms are available for feature selection for nonparametric classifiers. In this paper we propose a new feature selection algorithm based on decision boundaries for nonparametric classifiers. We first note that feature selection for pattern recognition is equivalent to retaining 'discriminantly informative features', and a discriminantly informative feature is related to the decision boundary. A procedure to extract discriminantly informative features based on a decision boundary for nonparametric classification is proposed. Experiments show that the proposed algorithm finds effective features for the nonparametric classifier with Parzen density estimation.

Lee, Chulhee↗
NASA NTRS1987

Determine precipitation rates from visible and infrared satellite images of clouds by pattern recognition technique

A more advanced cloud pattern analysis algorithm was subsequently developed to take the shape and brightness of the various clouds into account in a manner that is more consistent with the human analyst's perception of GOES cloud imagery. The results of that classification scheme were compared with precipitation probabilities observed from ships of opportunity off the U.S. east coast to derive empirical regressions between cloud types and precipitation probability. The cloud morphology was then quantitatively and objectively used to map precipitation probabilities during two winter months during which severe cold air outbreaks were observed over the northwest Atlantic. Precipitation probabilities associated with various cloud types are summarized. Maps of precipitation probability derived from the cloud morphology analysis program for two months and the precipitation probability derived from thirty years of ship observation were observed.

Weinman, James A.↗
DOE OSTI2025

Modelling detector-specific reconstruction uncertainties in LAr-TPC

The Short-Baseline Neutrino (SBN) program features three Liquid Argon Time Projection Chamber (LAr-TPC) detectors positioned along the Booster Neutrino Beam (BNB) axis: the Short Baseline Neutrino Near Detector, MicroBooNE, and the ICARUS T600. As the largest operational LAr-TPC, ICARUS T600 serves as the far detector, located 600 m from the BNB target. While its primary goal is to record neutrino events, it also detects other ionizing events, including cosmic rays. This work focuses on analyzing and modeling detector-specific reconstruction uncertainties in LAr-TPC. These inefficiencies, identified during the Pattern Recognition phase handled by the PANDORA algorithm, impact subsequent Particle Fits and Offline Analysis. Specifically, inaccuracies in track reconstruction can lead to significant physical consequences, such as erroneous particle energy estimates and poor Particle Identification (PID), reducing the efficiency of neutrino event characterization. A key issue addressed is split tracks, caused by missing hits or incomplete track stitching by PANDORA. The aim of this internship is to characterize, model, and quantify the impact of split tracks on track reconstruction.

43 PARTICLE ACCELERATORS↗
NASA NTRS1992

A fuzzy clustering algorithm to detect planar and quadric shapes

In this paper, we introduce a new fuzzy clustering algorithm to detect an unknown number of planar and quadric shapes in noisy data. The proposed algorithm is computationally and implementationally simple, and it overcomes many of the drawbacks of the existing algorithms that have been proposed for similar tasks. Since the clustering is performed in the original image space, and since no features need to be computed, this approach is particularly suited for sparse data. The algorithm may also be used in pattern recognition applications.

Krishnapuram, Raghu↗
NASA NTRS2013

Self Diagnostic Accelerometer Ground Testing on a C-17 Aircraft Engine

The self diagnostic accelerometer (SDA) developed by the NASA Glenn Research Center was tested for the first time in an aircraft engine environment as part of the Vehicle Integrated Propulsion Research (VIPR) program. The VIPR program includes testing multiple critical flight sensor technologies. One such sensor, the accelerometer, measures vibrations to detect faults in the engine. In order to rely upon the accelerometer, the health of the accelerometer must be ensured. Sensor system malfunction is a significant contributor to propulsion in flight shutdowns (IFSD) which can lead to aircraft accidents when the issue is compounded with an inappropriate crew response. The development of the SDA is important for both reducing the IFSD rate, and hence reducing the rate at which this component failure type can put an aircraft in jeopardy, and also as a critical enabling technology for future automated malfunction diagnostic systems. The SDA is a sensor system designed to actively determine the accelerometer structural health and attachment condition, in addition to making vibration measurements. The SDA uses a signal conditioning unit that sends an electrical chirp to the accelerometer and recognizes changes in the response due to changes in the accelerometer health and attachment condition. In an effort toward demonstrating the SDAs flight worthiness and robustness, multiple SDAs were mounted and tested on a C-17 aircraft engine. The engine test conditions varied from engine off, to idle, to maximum power. The two SDA attachment conditions used were fully tight and loose. The newly developed SDA health algorithm described herein uses cross correlation pattern recognition to discriminate a healthy from a faulty SDA. The VIPR test results demonstrate for the first time the robustness of the SDA in an engine environment characterized by high vibration levels.

Tokars, Roger P.↗
NASA NTRS2013

Self Diagnostic Accelerometer Testing on the C-17 Aircraft

The self diagnostic accelerometer (SDA) developed by the NASA Glenn Research Center was tested for the first time in an aircraft engine environment as part of the Vehicle Integrated Propulsion Research (VIPR) program. The VIPR program includes testing multiple critical flight sensor technologies. One such sensor, the accelerometer, measures vibrations to detect faults in the engine. In order to rely upon the accelerometer, the health of the accelerometer must be ensured. The SDA is a sensor system designed to actively determine the accelerometer structural health and attachment condition, in addition to vibration measurements. The SDA uses a signal conditioning unit that sends an electrical chirp to the accelerometer and recognizes changes in the response due to changes in the accelerometer health and attachment condition. To demonstrate the SDAs flight worthiness and robustness, multiple SDAs were mounted and tested on a C-17 aircraft engine. The engine test conditions varied from engine off, to idle, to maximum power. The SDA attachment conditions were varied from fully tight to loose. The newly developed SDA health algorithm described herein uses cross correlation pattern recognition to discriminate a healthy from a faulty SDA. The VIPR test results demonstrate for the first.

Tokars, Roger P.↗
NASA NTRS1993

Decision Boundary Feature Extraction for Nonparametric Classification

Feature extraction has long been an important topic in pattern recognition. Although many authors have studied feature extraction for parametric classifiers, relatively few feature extraction algorithms are available for nonparametric classifiers. A new feature extraction algorithm based on decision boundaries for nonparametric classifiers is proposed. It is noted that feature extraction for pattern recognition is equivalent to retaining 'discriminantly informative features' and a discriminantly informative feature is related to the decision boundary. Since nonparametric classifiers do not define decision boundaries in analytic form, the decision boundary and normal vectors must be estimated numerically. A procedure to extract discriminantly informative features based on a decision boundary for non-parametric classification is proposed. Experiments show that the proposed algorithm finds effective features for the nonparametric classifier with Parzen density estimation.

Lee, Chulhee↗
NASA NTRS1979

LACIE/ERIPS software system summary

The Earth resources interactive processing system (ERIPS) supports LACIE by classifying LANDSAT sensed data on the basis of the statistical similarity to those portions which were identified by analysts. The development and capabilities of the ERIPS software system are described with emphasis on (1) system requirements; (2) LACIE/ERIPS hardware; (3) system functions; (4) pattern recognition concept; and (5) LACIE/ERIPS data bases. Algorithms used in LACIE/ERIPS for statistics, divergence, feature selection, classification, registration, adaptive clustering, iterative clustering, clustering report functions, Sun angle correction, mean level adjustment, and bias correction are appended.

Johnson, C. L.↗