SEARCH · Engineering Papers
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.
Volcanoes appearing in SAR images of the surface of Venus are reliably detected and located automatically by a system designed to handle general visual pattern recognition problems.
Automated pattern recognition devices using sonic signature data for detecting S3D and F-1 engine valve malfunctions
Pattern recognition techniques applied to process identification, examining capability of mode learning machines for on-line identification of both linear and nonlinear processes
Recent advancements in Artificial Intelligence (AI) have made Machine Learning (ML) techniques readily available for practical applications while using a fraction of time that was previously required. In particular, the use of Deep Learning (DL) algorithms has advanced the field of image and pattern recognition. With the use of Deep Learning algorithms, Micrometeoroid and Orbital Debris(MMOD) penetrations can be identified with high accuracy and give possibilities to new understandings of hypervelocity impacts.
The ATLAS Fast TracKer (FTK) was designed to provide full tracking for the ATLAS high-level trigger by using pattern recognition based on Associative Memory (AM) chips and fitting in high-speed field programmable gate arrays. The tracks found by the FTK are based on inputs from all modules of the pixel and silicon microstrip trackers. The as-built FTK system and components are described, as is the online software used to control them while running in the ATLAS data acquisition system. Also described is the simulation of the FTK hardware and the optimization of the AM pattern banks. An optimization for long-lived particles with large impact parameter values is included. A test of the FTK system with the data playback facility that allowed the FTK to be commissioned during the shutdown between Run 2 and Run 3 of the LHC is reported. The resulting tracks from part of the FTK system covering a limited $\eta$-$\phi$ region of the detector are compared with the output from the FTK simulation. It is shown that FTK performance is in good agreement with the simulation.
Arrays of broadly responsive vapor detectors can be used to detect, identify, and quantify vapors and vapor mixtures. One implementation of this strategy involves the use of arrays of chemically-sensitive resistors made from conducting polymer composites. Sorption of an analyte into the polymer composite detector leads to swelling of the film material. The swelling is in turn transduced into a change in electrical resistance because the detector films consist of polymers filled with conducting particles such as carbon black. The differential sorption, and thus differential swelling, of an analyte into each polymer composite in the array produces a unique pattern for each different analyte of interest, Pattern recognition algorithms are then used to analyze the multivariate data arising from the responses of such a detector array. Chiral detector films can provide differential detection of the presence of certain chiral organic vapor analytes. Aspects of the spaceflight qualification and deployment of such a detector array, along with its performance for certain analytes of interest in manned life support applications, are reviewed and summarized in this article.
We explore the use of machine learning, computer vision, and pattern recognition techniques to automatically identify volcanic ash plumes and plume shadows, in WorldView-2 imagery. Using information of the relative position of the sun and spacecraft and terrain information in the form of a digital elevation map, classification, the height of the ash plume can also be inferred. We present the results from applying this approach to six scenes acquired on two separate days in April and May of 2010 of the Eyjafjallajokull eruption in Iceland. These results show rough agreement with ash plume height estimates from visual and radar based measurements.
In pattern recognition and classification for spatio-temporal problems, one of the most challenging tasks is to provide a good and valid solution in real-time. Because of time constraints, software-based neural network approaches may not be suitable for practical use. Hardware solutions seem to be good candidates for this class of problems. Currently, the Three Dimensional Analog Neural Network (3-DANN) is an effective approach to solving spatio-temporal problems in three-dimensional hardware.
Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, we cast the clustering problem into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. We constructed an appropriate objective function whose minimum will characterize a good possibilistic partition of the data, and we derived the membership and prototype update equations from necessary conditions for minimization of our criterion function. In this paper, we show the ability of this approach to detect linear and quartic curves in the presence of considerable noise.
Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, the clustering problem was cast into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. An appropriate objective function whose minimum will characterize a good possibilistic partition of the data was constructed, and the membership and prototype update equations from necessary conditions for minimization of our criterion function were derived. The ability of this approach to detect linear and quartic curves in the presence of considerable noise is shown.
In this work, we present a software framework, SπRITROOT, which is capable of track reconstruction and analysis of heavy-ion collision events recorded with the SRIT time projection chamber. The track-fitting toolkit GENFIT and the vertex reconstruction toolkit RAVE are applied to a box-type detector system. A pattern recognition algorithm which performs helix track finding and handles overlapping pulses is described. The performance of the software is investigated using experimental data obtained at the Radioactive Isotope Beam Facility (RIBF) at RIKEN. This work focuses on data from 132 Sn + 124 Sn collision events with beam energy of 270 AMeV. Particle identification is established using < dE/dx >and magnetic rigidity, with pions, hydrogen isotopes, and helium isotopes.
An accurate and efficient event reconstruction is required to realize the full scientific capability of liquid argon time projection chambers (LArTPCs). The current and future neutrino experiments that rely on massive LArTPCs create a need for new ideas and reconstruction approaches. Wire-Cell, proposed in recent years, is a novel tomographic event reconstruction method for LArTPCs. The Wire-Cell 3D imaging approach capitalizes on charge, sparsity, time, and geometry information to reconstruct a topology-agnostic 3D image of the ionization electrons prior to pattern recognition. A second novel method, the many-to-many charge-light matching, then pairs the TPC charge activity to the detected scintillation light signal, thus enabling a powerful rejection of cosmic-ray muons in the MicroBooNE detector. A robust processing of the scintillation light signal and an appropriate clustering of the reconstructed 3D image are fundamental to this technique. In this paper, we describe the principles and algorithms of these techniques and their successful application in the MicroBooNE experiment. A quantitative evaluation of the performance of these techniques is presented. Using these techniques, a 95% efficient pre-selection of neutrino charged-current events is achieved with a 30-fold reduction of non-beam-coincident cosmic-ray muons, and about 80% of the selected neutrino charged-current events are reconstructed with at least 70% completeness and 80% purity.
The Pandora Software Development Kit and algorithm libraries provide pattern-recognition logic essential to the reconstruction of particle interactions in liquid argon time projection chamber detectors. Pandora is the primary event reconstruction software used at ProtoDUNE-SP, a prototype for the Deep Underground Neutrino Experiment far detector. ProtoDUNE-SP, located at CERN, is exposed to a charged-particle test beam. This paper gives an overview of the Pandora reconstruction algorithms and how they have been tailored for use at ProtoDUNE-SP. In complex events with numerous cosmic-ray and beam background particles, the simulated reconstruction and identification efficiency for triggered test-beam particles is above 80% for the majority of particle type and beam momentum combinations. Specifically, simulated 1 GeV/c charged pions and protons are correctly reconstructed and identified with efficiencies of 86.1$\pm 0.6$% and 84.1$\pm 0.6$%, respectively. The efficiencies measured for test-beam data are shown to be within 5% of those predicted by the simulation.
Limited speech recognition system /LISPER/ simplifies recognition by computer designed as research vehicle and pattern recognition system
A multidisciplinary team approach to pilot error-related U.S. air carrier jet aircraft accident investigation records successfully reclaimed hidden human error information not shown in statistical studies. New analytic techniques were developed and applied to the data to discover and identify multiple elements of commonality and shared characteristics within this group of accidents. Three techniques of analysis were used: Critical element analysis, which demonstrated the importance of a subjective qualitative approach to raw accident data and surfaced information heretofore unavailable. Cluster analysis, which was an exploratory research tool that will lead to increased understanding and improved organization of facts, the discovery of new meaning in large data sets, and the generation of explanatory hypotheses. Pattern recognition, by which accidents can be categorized by pattern conformity after critical element identification by cluster analysis.
Discussion of pattern recognition programs for input data preprocessing with simultaneous or subsequent characterization, or characterization into a 'recognition cone,' or description and naming, interrelated descriptions, and conversion. A computer program is described that transforms and characterizes the input through the successive layers of a recognition cone. The program can choose and put forth names of parts of the input scene. It combines pieces of a description into interrelated wholes by using n-tuple characterizers and conducts a simple and stylized conversation about what it has seen. The technique of combining recognition cones with preprocessing transformations and characterizations is expected to contribute to technology in this field.
Honeywell has developed algorithms for the detection of wind shear/microburst using airborne Doppler radar. The Honeywell algorithms use three dimensional pattern recognition techniques and the selection of an associated scanning pattern forward of the aircraft. This 'volumetric scan' approach acquires reflectivity, velocity, and spectral width from a three dimensional volume as opposed to the conventional use of a two dimensional azimuthal slice of data at a fixed elevation. The algorithm approach is based on detection and classification of velocity patterns which are indicative of microburst phenomenon while minimizing the false alarms due to ground clutter return. Simulation studies of microburst phenomenon and x-band radar interaction with the microburst have been performed and results of that study are presented. Algorithm performance indetection of both 'wet' and 'dry' microbursts is presented.
Four subjects compared successively presented pairs of line patterns for a match between any lines in the pattern (similarity) and for a match between all lines (identity). The encoding or study times for pattern recognition from immediate memory and the latency in responses to comparison stimuli were examined. Qualitative differences within and between subjects were most evident in study times.