Abstract
In Chaps. 5 and 6 we presented our general algorithm for the recognition of patterns. This algorithm exploited strong analogies between pattern formation and pattern recognition as unearthed by synergetics. In this chapter we wish to show how this algorithm can be also implemented on a network which acts in a highly parallel manner.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography and Comments
references>H. Haken: In Pattern Formation by Dynamical Systems and Pattern Recognition,ed. by H. Haken, Springer Ser. Syn. Vol. 5 (Springer, Berlin, Heidelberg 1979)
H. Haken: In Computational Systems, Natural and Artificial, ed. by H. Haken, Springer Ser. Syn. Vol. 38 ( Springer, Berlin, Heidelberg 1987 )
H. Haken: In Neural and Synergetic Computers, Proceedings of the International Symposium, Schloss Elmau, ed. by H. Haken, Springer Ser. Syn. Vol. 42 ( Springer, Berlin, Heidelberg 1988 )
H. Haken: Synergetics. An Introduction, 3rd. ed Springer Ser. Syn. Vol. 1 ( Springer, Berlin, Heidelberg 1983 )
H. Haken: In Computational Systems, Natural and Artificial, ed. by H. Haken, Springer Ser. Syn. Vol. 38 ( Springer, Berlin, Heidelberg 1987 )
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Haken, H. (1991). Possible Realizations by Networks. In: Synergetic Computers and Cognition. Springer Series in Synergetics, vol 50. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-22450-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-22450-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-22452-6
Online ISBN: 978-3-662-22450-2
eBook Packages: Springer Book Archive