<p>This book highlights both theoretical and applied advances in cellular learning automata (CLA), a type of hybrid computational model that has been successfully employed in various areas to solve complex problems and to model, learn, or simulate complicated patterns of behavior. Owing to CLAβs par
Modern Cellular Automata: Theory and Applications
β Scribed by Kendall Preston Jr., Michael J. B. Duff (auth.)
- Publisher
- Springer US
- Year
- 1984
- Tongue
- English
- Leaves
- 354
- Series
- Advanced Applications in Pattern Recognition
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
It is with great pleasure that I present this fourth volΒ ume in the series "Advanced Applications in Pattern Recognition." It would be difficult to find two authors better versed in the design and application of parallel image processing systems, due to both their own many years of pioneering in the field and their encyclopedic knowledge of what is going on in uniΒ versity and industrial laboratories around the world. The monograph is unique in its parallel presentation of orthogonal and hexagonal dissections, and the wealth of graphic illustration of algorithmic procedures for processing and analyzΒ ing images in the various known implementations of parallel imΒ age-processing architectures. This volume should find a place on the bookshelf of every practitioner of pattern recognition, image processing, and compuΒ ter graphics. Morton Nadler General Editor vii PREFACE This book endeavors to introduce the reader to the subject of cellular logic and cellular automata and is devoted particuΒ larly to those parts dealing with the manipulation of pictorial data. The study of cellular automata owes much to the pioneerΒ ing work of John von Neumann during the 1950s. Von Neumann was interested in general problems in the behavior of computing structures and was immensely impressed by the complexity and performance of the human brain, which he felt must point toΒ wards successful designs for automatic computing machines.
β¦ Table of Contents
Front Matter....Pages i-xviii
Introduction....Pages 1-15
Two-Dimensional Logical Transforms....Pages 17-48
Cellular Logic Operations in N-Space....Pages 49-72
Numerical Operations....Pages 73-101
Segmentation....Pages 103-116
Skeletonization....Pages 117-136
Cellular Filtering....Pages 137-172
Scientific Applications....Pages 173-192
Biomedical Applications....Pages 193-222
Cellular Logic Machines....Pages 223-257
Array Automata....Pages 259-274
Patterns of Growth....Pages 275-288
Programming Methods....Pages 289-306
Fabrication Methods....Pages 307-316
Back Matter....Pages 317-340
β¦ Subjects
Computer Science, general;Electrical Engineering
π SIMILAR VOLUMES
Cellular automata are regular uniform networks of locally-connected finite-state machines. They are discrete systems with non-trivial behaviour. Cellular automata are ubiquitous: they are mathematical models of computation and computer models of natural systems. The book presents results of cutt
<p><p>This book explores Probabilistic Cellular Automata (PCA) from the perspectives of statistical mechanics, probability theory, computational biology and computer science. PCA are extensions of the well-known Cellular Automata models of complex systems, characterized by random updating rules. Tha
<p>This book provides an overview of the main approaches used to analyze the dynamics of cellular automata. Cellular automata are an indispensable tool in mathematical modeling. In contrast to classical modeling approaches like partial differential equations, cellular automata are relatively easy to