Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Theses/Dissertations

1998

Pattern recognition systems.

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

Implementation Of A Geometric Hashing Technique And It's Application To 3d Molecular Structure Search, Jennifer Lynn Cerequas May 1998

Implementation Of A Geometric Hashing Technique And It's Application To 3d Molecular Structure Search, Jennifer Lynn Cerequas

Theses

This paper proposes the application of a geometric hash technique to the searching of 3D chemical structures. Chemical structures are represented in global XYZ coordinate format. An algorithm is applied to the substructures within the existing chemical structures to hash them into hash tables on disk. A query substructure is then hashed to find matches (hits) of the existing hash tables. The entries in the matching hash tables are compared to the query substructure to find the existing substructures that are an "approximate" match.

The result is a technique which allows existing substructures to be compared to a (new) query …


Flag : The Fault-Line Analytic Graph And Fingerprint Classification, Ching-Yu Huang Jan 1998

Flag : The Fault-Line Analytic Graph And Fingerprint Classification, Ching-Yu Huang

Dissertations

Fingerprints can be classified into millions of groups by quantitative measurements of their new representations - Fault-Line Analytic Graphs (FLAG), which describe the relationship between ridge flows and singular points. This new model is highly mathematical, therefore, human interpretation can be reduced to a minimum and the time of identification can be significantly reduced.

There are some well known features on fingerprints such as singular points, cores and deltas, which are global features which characterize the fingerprint pattern class, and minutiae which are the local features which characterize an individual fingerprint image. Singular points are more important than minutiae when …


A Simple Neural Agent Communicating Through Sets, James P. Stanski Jan 1998

A Simple Neural Agent Communicating Through Sets, James P. Stanski

Theses

Networked agents of the simplest kind offer the power of cooperative problem solving through parallel operation along with tight packaging potential. Such agents are self-contained analog machines capable of only a few primitive intelligent operations. In this thesis, a design will be developed for a simple agent capable of sending, receiving, and processing information in a environment where agents are coupled together. This environment imposes unorchestrated simultaneous input while expecting a useful timely response. Successful collaboration in these conditions is accomplished through sets encoded within pulse ensembles. The simplicity of the set definition is an inviting candidate for message communication …