Skip to main content

Characterization of Non-linear Cellular Automata Model for Pattern Recognition

  • Conference paper
  • First Online:
Advances in Soft Computing — AFSS 2002 (AFSS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2275))

Included in the following conference series:

Abstract

This paper establishes the non-linear Cellular Automata (CA) as a powerful pattern recognizer. The special class of CA, referred to as GMACA (Generalized Multiple Attractor Cellular Automata), is employed for the design. The desired CA model, evolved through an efficient implementation of genetic algorithm, are found to be at the edge of chaos.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Hertz, A. Krogh and R. G. Palmer, “Introduction to the theory of Neural computation”, Santa Fe institute studies in the sciences of complexity, Addison Wesley, 1991.

    Google Scholar 

  2. M. Chady and R. Poli, “Evolution of Cellular-automaton-based Associative Memories”, Technical Report no. CSRP-97-15, May 1997.

    Google Scholar 

  3. J. J. Hopfield, “Pattern Recognition computation using action potential timings for stimulus representations”, Nature, 376: 33–36; 1995.

    Article  Google Scholar 

  4. E. Jen, “Invariant strings and Pattern Recognizing properties of 1D CA”, Journal of statistical physics, 43, 1986.

    Google Scholar 

  5. P. Pal Chaudhuri, D Roy Chowdhury, S. Nandi and S. Chatterjee, “Additive Cellular Automata, Theory and Applications, VOL. 1”, IEEE Computer Society Press, Los Alamitos, California.

    Google Scholar 

  6. M. Sipper, “Co-evolving Non-Uniform Cellular Automata to Perform Computations”, Complex Systems, 7: 89–130, 1993.

    Google Scholar 

  7. W. Li, N. H. Packard and C. G. Langton, “Transition Phenomena in Cellular Automata Rule Space”, PhysicaD, 45; 1990.

    Google Scholar 

  8. Wuensche, A., and M. J. Lesser, “The Global Dynamics of Cellular Automata”, Santa Fe Institute Studies in the Science of Complexity, Addison-Wesley, 1992.

    Google Scholar 

  9. M. Mitchell, P. T. Hraber and J. P. Crutchfield, “Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations”, Complex Systems, 7:89–130, 1993.

    MATH  Google Scholar 

  10. S. Wolfram, “Theory and application of Cellular Automata”, World Scientific, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganguly, N., Maji, P., Das, A., Sikdar, B.K., Chaudhuri, P.P. (2002). Characterization of Non-linear Cellular Automata Model for Pattern Recognition. In: Pal, N.R., Sugeno, M. (eds) Advances in Soft Computing — AFSS 2002. AFSS 2002. Lecture Notes in Computer Science(), vol 2275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45631-7_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45631-7_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43150-3

  • Online ISBN: 978-3-540-45631-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics