Methods of Confusion in a Pattern Matching Task
Pattern degradation influence on human responses in pattern perception studies
PSYCHOPHYSIOLOGY↗
SEARCH · Engineering Papers
Results for “Pattern matching”
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.
A Simplified Pattern Match Algorithm for Star Identification
A true pattern matching star algorithm similar in concept to the Van Bezooijen algorithm is implemented using an iterative approach. This approach allows for a more compact and simple implementation which can be easily adapted to be either an all-sky, no a priori algorithm or a follow on to a direct match algorithm to distinguish between ambiguous matches. Some simple analysis is shown to indicate the likelihood of mis-identifications. The performance of the algorithm for the all-sky, no a priori situation is detailed assuming he SKYMAP star catalog describes the true sky. The impact of errors and omissions in the SKYMAP catalog on performance are investigated. In addition, differing levels of noise in the star observations are assumed and results shown. The implications for possible implementation on-board spacecraft are discussed.
Lee, Michael H.↗
Systems, methods and apparatus for pattern matching in procedure development and verification
Systems, methods and apparatus are provided through which, in some embodiments, a formal specification is pattern-matched from scenarios, the formal specification is analyzed, and flaws in the formal specification are corrected. The systems, methods and apparatus may include pattern-matching an equivalent formal model from an informal specification. Such a model can be analyzed for contradictions, conflicts, use of resources before the resources are available, competition for resources, and so forth. From such a formal model, an implementation can be automatically generated in a variety of notations. The approach can improve the resulting implementation, which, in some embodiments, is provably equivalent to the procedures described at the outset, which in turn can improve confidence that the system reflects the requirements, and in turn reduces system development time and reduces the amount of testing required of a new system. Moreover, in some embodiments, two or more implementations can be "reversed" to appropriate formal models, the models can be combined, and the resulting combination checked for conflicts. Then, the combined, error-free model can be used to generate a new (single) implementation that combines the functionality of the original separate implementations, and may be more likely to be correct.
Hinchey, Michael G.↗
A pattern-matching algorithm for two-dimensional coordinate lists
A pattern-matching algorithm for two-dimensional coordinate lists is described. The algorithm matches pairs of coordinates in two lists based on the triangles that can be formed from triplets of points in each list. The algorithm is insensitive to coordinate translation, rotation, magnification, or inversion and can tolerate random errors or distortions.
Groth, E. J.↗
Array-Pattern-Match Compiler for Opportunistic Data Analysis
A computer program has been written to facilitate real-time sifting of scientific data as they are acquired to find data patterns deemed to warrant further analysis. The patterns in question are of a type denoted array patterns, which are specified by nested parenthetical expressions. [One example of an array pattern is ((>3) 0 (not=1)): this pattern matches a vector of at least three elements, the first of which exceeds 3, the second of which is 0, and the third of which does not equal 1.] This program accepts a high-level description of a static array pattern and compiles a highly optimal and compact other program to determine whether any given instance of any data array matches that pattern. The compiler implemented by this program is independent of the target language, so that as new languages are used to write code that processes scientific data, they can easily be adapted to this compiler. This program runs on a variety of different computing platforms. It must be run in conjunction with any one of a number of Lisp compilers that are available commercially or as shareware.
James, Mark↗
Application of star identification using pattern matching to space ground systems at GSFC
This paper reports the application of pattern recognition techniques for star identification based on those proposed by Van Bezooijen to space ground systems for near-real-time attitude determination. A prototype was developed using these algorithms, which was used to assess the suitability of these techniques for support of the X-Ray Timing Explorer (XTE), Submillimeter Wave Astronomy Satellite (SWAS), and the Solar and Heliospheric Observatory (SOHO) missions. Experience with the prototype was used to refine specifications for the operational system. Different geometry tests appropriate to the mission requirements of XTE, SWAS, and SOHO were adopted. The applications of these techniques to upcoming mission support of XTE, SWAS, and SOHO are discussed.
Fink, D.↗
Fuzzy automata and pattern matching
A wide-ranging search for articles and books concerned with fuzzy automata and syntactic pattern recognition is presented. A number of survey articles on image processing and feature detection were included. Hough's algorithm is presented to illustrate the way in which knowledge about an image can be used to interpret the details of the image. It was found that in hand generated pictures, the algorithm worked well on following the straight lines, but had great difficulty turning corners. An algorithm was developed which produces a minimal finite automaton recognizing a given finite set of strings. One difficulty of the construction is that, in some cases, this minimal automaton is not unique for a given set of strings and a given maximum length. This algorithm compares favorably with other inference algorithms. More importantly, the algorithm produces an automaton with a rigorously described relationship to the original set of strings that does not depend on the algorithm itself.
Setzer, C. B.↗
Dynamic compensatory pattern matching in a fuzzy rule-based control system
A dynamic compensatory matching procedure is suggested as a method to generate an aggregated measure for evaluating the appropriateness of rules for control systems. It is a dynamic weighted matching technique which takes into account incomplete information under real-time requirements. The initial weights of importance of variables are generated with a generalized neural network architecture and a gradient descent algorithm. An intuitive compensatory scheme based on correlations among input variables of training data is adopted so that the system is coherent to a noisy environment.
Sun, Chuen-Tsai↗
An Astronomical Pattern-Matching Algorithm for Automated Identification of Whale Sharks
The largest shark species alive today, whale sharks (Rhincodon typus) are rare and poorly studied. Directed fisheries, high value in international trade, a highly migratory nature, and generally low abundance make this species vulnerable to exploitation. Mark- and-recapture studies have provided our current understanding of whale shark demographics and life history, but conventional tagging has met with limited success. To aid in conservation and management efforts, and to further our knowledge of whale shark biology, an identification technology that maximizes the scientific value of individual sighting is needed.
Arzoumanian, Z.↗
Radio-Frequency Tank Eigenmode Sensor for Propellant Quantity Gauging
Although there are several methods for determining liquid level in a tank, there are no proven methods to quickly gauge the amount of propellant in a tank while it is in low gravity or under low-settling thrust conditions where propellant sloshing is an issue. Having the ability to quickly and accurately gauge propellant tanks in low-gravity is an enabling technology that would allow a spacecraft crew or mission control to always know the amount of propellant onboard, thus increasing the chances for a successful mission. The Radio Frequency Mass Gauge (RFMG) technique measures the electromagnetic eigenmodes, or natural resonant frequencies, of a tank containing a dielectric fluid. The essential hardware components consist of an RF network analyzer that measures the reflected power from an antenna probe mounted internal to the tank. At a resonant frequency, there is a drop in the reflected power, and these inverted peaks in the reflected power spectrum are identified as the tank eigenmode frequencies using a peak-detection software algorithm. This information is passed to a pattern-matching algorithm, which compares the measured eigenmode frequencies with a database of simulated eigenmode frequencies at various fill levels. A best match between the simulated and measured frequency values occurs at some fill level, which is then reported as the gauged fill level. The database of simulated eigenmode frequencies is created by using RF simulation software to calculate the tank eigenmodes at various fill levels. The input to the simulations consists of a fairly high-fidelity tank model with proper dimensions and including internal tank hardware, the dielectric properties of the fluid, and a defined liquid/vapor interface. Because of small discrepancies between the model and actual hardware, the measured empty tank spectra and simulations are used to create a set of correction factors for each mode (typically in the range of 0.999 1.001), which effectively accounts for the small discrepancies. These correction factors are multiplied to the modes at all fill levels. By comparing several measured modes with the simulations, it is possible to accurately gauge the amount of propellant in the tank. An advantage of the RFMG approach of applying computer simulations and a pattern-matching algorithm is that the Although there are several methods for determining liquid level in a tank, there are no proven methods to quickly gauge the amount of propellant in a tank while it is in low gravity or under low-settling thrust conditions where propellant sloshing is an issue. Having the ability to quickly and accurately gauge propellant tanks in low-gravity is an enabling technology that would allow a spacecraft crew or mission control to always know the amount of propellant onboard, thus increasing the chances for a successful mission. The Radio Frequency Mass Gauge (RFMG) technique measures the electromagnetic eigenmodes, or natural resonant frequencies, of a tank containing a dielectric fluid. The essential hardware components consist of an RF network analyzer that measures the reflected power from an antenna probe mounted internal to the tank. At a resonant frequency, there is a drop in the reflected power, and these inverted peaks in the reflected power spectrum are identified as the tank eigenmode frequencies using a peak-detection software algorithm. This information is passed to a pattern-matching algorithm, which compares the measured eigenmode frequencies with a database of simulated eigenmode frequencies at various fill levels. A best match between the simulated and measured frequency values occurs at some fill level, which is then reported as the gauged fill level. The database of simulated eigenmode frequencies is created by using RF simulation software to calculate the tank eigenmodes at various fill levels. The input to the simulations consists of a fairly high-fidelity tank model with proper dimensions and including internal tank harare, the dielectric properties of the fluid, and a defined liquid/vapor interface. Because of small discrepancies between the model and actual hardware, the measured empty tank spectra and simulations are used to create a set of correction factors for each mode (typically in the range of 0.999 1.001), which effectively accounts for the small discrepancies. These correction factors are multiplied to the modes at all fill levels. By comparing several measured modes with the simulations, it is possible to accurately gauge the amount of propellant in the tank. An advantage of the RFMG approach of applying computer simulations and a pattern-matching algorithm is that the
Zimmerli, Gregory A.↗
Analog parallel processor hardware for high speed pattern recognition
A VLSI-based analog processor for fully parallel, associative, high-speed pattern matching is reported. The processor consists of two main components: an analog memory matrix for storage of a library of patterns, and a winner-take-all (WTA) circuit for selection of the stored pattern that best matches an input pattern. An inner product is generated between the input vector and each of the stored memories. The resulting values are applied to a WTA network for determination of the closest match. Patterns with up to 22 percent overlap are successfully classified with a WTA settling time of less than 10 microsec. Applications such as star pattern recognition and mineral classification with bounded overlap patterns have been successfully demonstrated. This architecture has a potential for an overall pattern matching speed in excess of 10 exp 9 bits per second for a large memory.
Daud, T.↗
QPA-CLIPS: A language and representation for process control
QPA-CLIPS is an extension of CLIPS oriented towards process control applications. Its constructs define a dependency network of process actions driven by sensor information. The language consists of three basic constructs: TASK, SENSOR, and FILTER. TASK's define the dependency network describing alternative state transitions for a process. SENSOR's and FILTER's define sensor information sources used to activate state transitions within the network. Deftemplate's define these constructs and their run-time environment is an interpreter knowledge base, performing pattern matching on sensor information and so activating TASK's in the dependency network. The pattern matching technique is based on the repeatable occurrence of a sensor data pattern. QPA-CIPS has been successfully tested on a SPARCStation providing supervisory control to an Allen-Bradley PLC 5 controller driving molding equipment.
Freund, Thomas G.↗
Dynamic pattern matcher using incomplete data
This invention relates generally to pattern matching systems, and more particularly to a method for dynamically adapting the system to enhance the effectiveness of a pattern match. Apparatus and methods for calculating the similarity between patterns are known. There is considerable interest, however, in the storage and retrieval of data, particularly, when the search is called or initiated by incomplete information. For many search algorithms, a query initiating a data search requires exact information, and the data file is searched for an exact match. Inability to find an exact match thus results in a failure of the system or method.
Johnson, Gordon G.↗
Object/rule integration in CLIPS
This paper gives a brief overview of the C Language Integrated Production System (CLIPS) with a focus on the object-oriented features. The advantages of an object data representation over the traditional working memory element (WME), i.e., facts, are discussed, and the implementation of the Rete inference algorithm in CLIPS is presented in detail. A few methods for achieving pattern-matching on objects with the current inference engine are given, and finally, the paper examines the modifications necessary to the Rete algorithm to allow direct object pattern-matching.
Donnell, Brian L.↗
Integrating an object system into CLIPS: Language design and implementation issues
This paper describes the reasons why an object system with integrated pattern-matching and object-oriented programming facilities is desirable for CLIPS and how it is possible to integrate such a system into CLIPS while maintaining the run-time performance and the low memory usage for which CLIPS is known. The requirements for an object system in CLIPS that includes object-oriented programming and integrated pattern-matching are discussed and various techniques for optimizing the object system and its integration with the pattern-matcher are presented.
Auburn, Mark↗
A study of a multi-pinned phase CCD detector for use as a star tracker
This grant has supported studies of the use of charge coupled devices (CCD's) in star trackers in a number of different areas. Among the tasks we have pursued are the following: (1) radiation modeling and the increase in noise equivalent angle as a result of exposure to protons and bremsstrahlung gamma rays; (2) the development of pattern matching software to identify field locations from a CCD image and a pre-existing map of the local area; (3) observations of various stellar fields from the 24 inch telescope at the Offit Observatory at JHU, primarily to test the pattern matching software (these included crowded fields as well as moving objects, like comets); and (4) tracking of very faint objects to determine the faint limit of the CCD system.
Friedman, Scott D.↗
QA4, a language for artificial intelligence.
Introduction of a language for problem solving and specifically robot planning, program verification, and synthesis and theorem proving. This language, called question-answerer 4 (QA4), embodies many features that have been found useful for constructing problem solvers but have to be programmed explicitly by the user of a conventional language. The most important features of QA4 are described, and examples are provided for most of the material introduced. Language features include backtracking, parallel processing, pattern matching, set manipulation, and pattern-triggered function activation. The language is most convenient for use in an interactive way and has extensive trace and edit facilities.
Derksen, J. A. C.↗
Embedding CLIPS in a database-oriented diagnostic system
This paper describes the integration of C Language Production Systems (CLIPS) into a powerful portable maintenance aid (PMA) system used for flightline diagnostics. The current diagnostic target of the system is the Garrett GTCP85-180L, a gas turbine engine used as an Auxiliary Power Unit (APU) on some C-130 military transport aircraft. This project is a database oriented approach to a generic diagnostic system. CLIPS is used for 'many-to-many' pattern matching within the diagnostics process. Patterns are stored in database format, and CLIPS code is generated by a 'compilation' process on the database. Multiple CLIPS rule sets and working memories (in sequence) are supported and communication between the rule sets is achieved via the export and import commands. Work is continuing on using CLIPS in other portions of the diagnostic system and in re-implementing the diagnostic system in the Ada language.
Conway, Tim↗