Paper
1 November 1991 Pattern recognition using ω-orbit finite automata
Ying Liu, Hede Ma
Author Affiliations +
Abstract
In this paper, a new pattern recognition scheme is proposed by the authors, which features compressing a huge input vector into a tiny one and catching the characteristics of the input vector efficiently. The development of this scheme is based on a theory of class 2 dynamical systems, where the class 2 dynamical system is defined by the authors. An approach using (omega) -Orbit Finite Automata developed by the authors is a special class of this method. This scheme has two stages, encoding and quantization. The encoding procedure stores an input vector in an attractor of a class 2 dynamical system. The quantization procedure divides the parameter space of the class 2 dynamical systems inferred at encoding stage. A retrieval algorithm for (omega) -OFA and several inference algorithms of class 2 dynamical system from a given input vector are introduced.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ying Liu and Hede Ma "Pattern recognition using ω-orbit finite automata", Proc. SPIE 1606, Visual Communications and Image Processing '91: Image Processing, (1 November 1991); https://doi.org/10.1117/12.50318
Lens.org Logo
CITATIONS
Cited by 9 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Dynamical systems

Image processing

Iterated function systems

Pattern recognition

Computer programming

Detection and tracking algorithms

Visual communications

Back to Top