Skip to main content
SpringerLink
Log in

The development of fast cellular pattern transformation algorithms using virtual boundaries

  • Cellular Algorithms And Their Verifications
  • Conference paper
  • First Online:
Conpar 81 (CONPAR 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 111))

Included in the following conference series:

  • 109 Accesses

Abstract

In [1,2,4] it is shown that the development of (fast) d-dimensional cellular pattern transformation algorithms can be done by reducing the pattern transformation problem to an appropriate language recognition problem where a new type of d-dimensional words and languages with an appropriate recognition process is introduced. Unfortunately, the resulting languages often are not very well suited to the application of well known and (meanwhile) standardized cellular techniques. Here we present a systematic method, how additional information can be added to the words to be recognized in order to facilitate the application of these techniques. The with-additional-information recognizing process can be converted algorithmically into a without-additional-information recognizing one.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. Pecht, J.G.: Ein weiterer Ansatz zur Mustertransformation und-erkennung in zellularen Räumen, Dissertation, TU Braunschweig, 1980.

    Google Scholar 

  2. Pecht, J.G.: A new heuristic concept to develop fast cellular pattern transformation algorithms, in: Kunt, M., and de Coulon, F. (editors): Signal Processing Theories and Applications, North-Holland, 1980, 207–212; Errata: p. 793.

    Google Scholar 

  3. Pecht, J.G.: T-recognition of T-languages, a new approach to describe and exploit the parallel capabilities of d-dimensional tesselation structures, submitted for publication.

    Google Scholar 

  4. Pecht, J.G.: The reduction of d-dimensional pattern transformations by d-dimensional tesselation structures to the T-recognition of T-languages, in preparation.

    Google Scholar 

  5. Smith III, A.R.: Two-dimensional formal languages and pattern recognition by cellular automata, Conference Record of the 12th Annual IEEE Symposium on Switching and Automata Theory 12 (1971), 144–152.

    Google Scholar 

  6. Vollmar, R.: Cellular spaces and parallel algorithms — an introductory survey —, in: Feilmeier, M. (editor): Parallel Computers — Parallel Mathematics. IMACS, Amsterdam, 1977, 49–58.

    Google Scholar 

  7. Vollmar, R.: Algorithmen in Zellularautomaten, Teubner, Stuttgart, 1979.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl C für Informatik der TU Braunschweig, Gaußstr. 11, D-3300, Braunschweig, West-Germany

    Josef Pecht

Authors
  1. Josef Pecht
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegmüller J. Stoer N. Wirth Wolfgang Händler

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pecht, J. (1981). The development of fast cellular pattern transformation algorithms using virtual boundaries. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105118

Download citation

  • DOI: https://doi.org/10.1007/BFb0105118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10827-6

  • Online ISBN: 978-3-540-38715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation