Skip to main content
SpringerLink
Log in

Linear-Time Recognition of Connectivity of Binary Images on 1-bit Inter-Cell Communication Cellular Automata and Their Related Algorithms

  • Conference paper
Cellular Automata: Research Towards Industry

  • 117 Accesses

Abstract

In this paper we explore a class of two-dimensional cellular automata whose inter-cell communication is restricted to 1-bit and propose a linear-time two-amensional connected-pattern recognition algorithm. Precisely, it is shown that a set of two-dimensional connected binary images of size m x n can be recognized in 2 (m + n) steps by two-dimensional cellular automaton with 1-bit inter-cell communication.

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

Access this chapter

Log in via an institution
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. Mazoyer;“A minimal time solution to the firing squad synchronization problem with only one bit of information exchanged’, Ecole Normale Superieure de Lyon, Technical report No. 89–03, p.51, April, (1989).

    Google Scholar 

  2. W. T. Beyer;“Recognition of topological invariants by iterative arrays”, Ph.D. Thesis, MIT, (1969).

    Google Scholar 

  3. S. Levialdi;“On shrinking binary picture patterns”, Communications of ACM, Vol.15, No., pp. 7–10, (1972).

    Article  MATH  Google Scholar 

  4. H. Umeo and M. Inada;“Recognition of a class of languages by cellular automata with 1-bit inter-cell communications”, (in preparation).

    Google Scholar 

  5. H. Umeo;“A design of cellular algorithms for 1-bit inter-cell communications and related cellular algorithms(invited lecture)”, Proc. of 2nd International Colloquium on Universal Machines and Computations, Vol.l, pp. 210–227, (1998).

    Google Scholar 

  6. J. Mazoyer;“On optimal solutions to the firing squad synchronization problem”, Theoret. Comput. Sci., 168, pp. 367–404, (1996).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Engineering, Department of Informatics, Osaka Electro-Communication University, Neyagawa-shi, hatsu-cho, 18-8 Osaka, 572, Japan

    Hiroshi Umeo

Authors
  1. Hiroshi Umeo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartmento di Scienze dell’Informazione, Università di Milano, via Comelico 39, 20135, Milano, Italy

    S. Bandini

  2. Montecatini Environmental Research Center, Ravenna, Italy

    R. Serra

  3. Illycaffè S.p.A., Trieste, Italy

    F. Suggi Liverani

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag London Limited

About this paper

Cite this paper

Umeo, H. (1998). Linear-Time Recognition of Connectivity of Binary Images on 1-bit Inter-Cell Communication Cellular Automata and Their Related Algorithms. In: Bandini, S., Serra, R., Liverani, F.S. (eds) Cellular Automata: Research Towards Industry. Springer, London. https://doi.org/10.1007/978-1-4471-1281-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1281-5_13

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-048-4

  • Online ISBN: 978-1-4471-1281-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation