Skip to main content

Generation of TPMACA for Pattern Classification

  • Conference paper
Cellular Automata (ACRI 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8751))

Included in the following conference series:

Abstract

The important prerequisites of designing pattern classifier are high throughput and low cost hardware implementation. The simple, regular, modular and cascadable local neighborhood sparse network of Cellular Automata (CA) suits ideally for low cost VLSI implementation. Thus the multiple attractor CA is adapted for use as a pattern classifier. By concatenating two predecessor multiple attractor CA (TPMACA) we can construct a pattern classifier. In this paper we propose a method for finding dependency vector by using a 0-basic path. Also we propose various methods for generating TPMACA corresponding to a given dependency vector.

This work was supported by the National Research Foundation of Korea Grant funded by the Korean Government (NRF-2013S1A5B6053791).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Von Neumann, J.: The theory of self-reproducing automata. University of Illinois Press, Urban (1966), Burks, A.W. (ed.)

    Google Scholar 

  2. Das, A.K., Pal Chaudhuri, P.: Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation. IEEE Trans. Comput. 42, 340–352 (1993)

    Article  MathSciNet  Google Scholar 

  3. Pal Chaudhuri, P., Chowdhury, D.R., Nandy, S., Chattopadhyay, C.: Additive cellular automata theory and applications, vol. 1. IEEE Computer Society Press, California (1997)

    MATH  Google Scholar 

  4. Cho, S.J., Choi, U.S., Kim, H.D., Hwang, Y.H., Kim, J.G., Heo, S.H.: New synthesis of one-dimensional 90/150 linear hybrid group cellular automata. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 26(9), 1720–1724 (2007)

    Article  Google Scholar 

  5. Ponkaew, J., Wongthanavasu, S., Lursinsap, C.: A nonlinear classifier using an evolution of Cellular Automata. In: International Symposium on ISPACS, pp. 1–5 (2011)

    Google Scholar 

  6. Ponkaew, J., Wongthanavasu, S., Lursinsap, C.: Two-class classifier cellular automata. In: IEEE Symposium on ISIEA, pp. 354–359 (2011)

    Google Scholar 

  7. Bandini, S., Vanneschi, L., Wuensche, A., Shehata, A.B.: Cellular automata pattern recognition and rule evolution through a neuro-genetic approach. Journal of Cellular Automata 4(3), 171–181 (2009)

    MATH  Google Scholar 

  8. Das, S., Mukherjee, S., Naskar, N., Sikdar, B.: Characterization of single cycle CA and its application in pattern classification. Electronic Notes in Theoretical Computer Science 252, 181–203 (2009)

    Article  MathSciNet  Google Scholar 

  9. Naskar, N., Das, S., Sikdar, B.: Characterization of nonlinear cellular automata having only single length cycle attractors. Journal of Cellular Automata 7, 431–453 (2013)

    MathSciNet  Google Scholar 

  10. Maji, P., Pal Chaudhuri, P.: Theory and application of cellular automata for pattern classification. Fundamenta Informaticae 58, 321–353 (2003)

    MATH  MathSciNet  Google Scholar 

  11. Maji, P., Shaw, C., Ganguly, N., Sikdar, B.K., Pal Chaudhuri, P.: Theory and application of cellular automata for pattern classification. Fundamenta Informaticae 58, 321–354 (2003)

    MATH  MathSciNet  Google Scholar 

  12. Ganguly, N.: Cellular Automata Evolution: Theory and Applications in Pattern Recognition and Classification, Ph. D. thesis CST Dept. BECDU India (2003)

    Google Scholar 

  13. Ganguly, N., Maji, P., Dhar, S., Sikdar, B.K., Pal Chaudhuri, P.: Evolving cellular automata as pattern classifier. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 56–68. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Ganguly, N., Maji, P., Sikdar, B.K., Pal Chaudhuri, P.: Design and characterization of cellular automata based associative memory for pattern recognition. IEEE Trans. on Systems, Man, and Cybernetics - Part B: Cybernetics 34(1), 672–679 (2004)

    Article  Google Scholar 

  15. Horn, R.A., Johnson, C.R.: Matrix analysis. Cambridge University Press (1985)

    Google Scholar 

  16. Cho, S.J., Choi, U.S., Kim, H.D.: Analysis of complemented CA derived from a linear TPMACA. Computers and Mathematics with Applications 45, 680–698 (2003)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Cho, SJ. et al. (2014). Generation of TPMACA for Pattern Classification. In: WÄ…s, J., Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2014. Lecture Notes in Computer Science, vol 8751. Springer, Cham. https://doi.org/10.1007/978-3-319-11520-7_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11520-7_42

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11519-1

  • Online ISBN: 978-3-319-11520-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics