SEARCH · Search NASA
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.
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.
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).
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.
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.
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.
Algorithm concept for information processing and pattern recognition involving incomplete or uncertain data
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.
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.
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.
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.
Generalized iterative inverse algorithm for linear inequalities set involved in pattern recognition and threshold logic requiring decision functions determination
Image detection in pattern recognition through bipolar correlation, discussing reference generating algorithms and digital simulation results
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.
The performance of a star tracker equipped with a focal plane detector was evaluated. The CID board is an array of 256 x 256 pixels which are 20 x 20 micrometers in dimension. The tracker used for test was a breadboard tracker system developed by BASD. Unique acquisition and tracking algorithms are employed to enhance performance. A pattern recognition process is used to test for proper image spread function and to avoid false acquisition on noise. A very linear, high gain, interpixel transfer function is derived for interpolating star position. The lens used in the tracker has an EFL of 100 mm. The tracker has an FOV of 2.93 degrees resulting in a pixel angular subtense of 41.253 arc sec in each axis. The test procedure used for the program presented a star to the tracker in a circular pattern of positions; the pattern was formed by projecting a simulated star through a rotatable deviation wedge. Further tests determined readout noise, Noise Equivalent Displacement during track, and spatial noise during acquisition by taking related data and reducing it.
A pattern recognition system is presented for determining the thickness of coal remaining on the roof and floor of a coal seam. The system was developed to recognize reflected pulse echo signals that are generated by an acoustical transducer and reflected from the coal seam interface. The flexibility of the system, however, should enable it to identify pulse-echo signals generated by radar or other techniques. The main difference being the specific features extracted from the recorded data as a basis for pattern recognition.
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.
The problem of data compression is very important in digital photogrammetry, computer assisted cartography, and GIS/LIS. In addition, it is also applicable in many other fields such as computer vision, image processing, pattern recognition, and artificial intelligence. Consequently, there are many algorithms available to solve this problem but none of them are considered to be satisfactory. In this paper, a new method of finding critical points in a digitized curve is explained. This technique, based on the normalized symmetric scattered matrix, is good for both critical points detection and data compression. In addition, the critical points detected by this algorithm are compared with those by zero-crossings.
Two weighted adaptive algorithms are proposed for updating the estimates of the mean vector and the covariance matrix, respectively, in a multispectral pattern recognition system. To achieve computational efficiency, the auxiliary matrices have been utilized in the algorithm for covariance matrix updating. Enhancements in the performance accuracy of a multispectral processing system and extensions of the Gaussian maximum likelihood classification capabilities to larger scale surveys are the motivations in developing the algorithms presented herein.