Modeling single length cycle nonlinear cellular automata for pattern recognition

Author

Das, Sukanta ; Mukherjee, Sukanya ; Naskar, Nazma ; Sikdar, Biplab K.

Author_Institution

Dept. of Inf. Technol., Bengal Eng. & Sci. Univ., Shibpur, India

fYear

2009

fDate

9-11 Dec. 2009

Firstpage

198

Lastpage

203

Abstract

This work proposes characterization of single-length cycle cellular automata (CA) attractors with the target to model this class of CA for designing efficient pattern recognizer. Identification of essential properties of a CA while forming multi-length cycles provides the basis of such characterization. A scheme has been developed that synthesizes the single-length cycle attractor CA, avoiding multi-length cycles, desired for a pattern recognizer.

Keywords

cellular automata; pattern classification; reachability analysis; trees (mathematics); 2-class classifier; pattern recognition; pseudo-exhaustive bit; reachability tree; single length cycle nonlinear cellular automata attractor; Automata; Character recognition; Classification tree analysis; Computer science; Design engineering; Information technology; Logic; Pattern recognition; Target recognition; Tin; cellular automata; classifier; pattern recognition; point state; pseudo-exhaustive bit; reachability tree;

fLanguage

English

Publisher

ieee

Conference_Titel

Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on

Conference_Location

Coimbatore

Print_ISBN

978-1-4244-5053-4

Type

conf

DOI

10.1109/NABIC.2009.5393685

Filename

5393685