scispace - formally typeset
Journal ArticleDOI

Parallel Image Processing Using Cellular Arrays

Rosenfeld
- 01 Jan 1983 - 
- Vol. 16, Iss: 1, pp 14-20
Reads0
Chats0
TLDR
The basic techniques of image processing using two-dimensional arrays of processors, or cellular arrays, are reviewed and various extensions and generalizations of the cellular array concept are discussed and their possible implementations and applications are discussed.
Abstract
array computers are not new to image processing, but more refined techniques have led to broader implementations. We can now construct arrays with up to 128 x 128 processors. Nearly 25 years ago, Ungerl\"2 suggested a two-dimensional array of processing elements as a natural computer architecture for image processing and recognition. Ideally, in this approach, each processor is responsible for one pixel, or one element of the image, with neighboring processors responsible for neighboring pix-els. Thus, using hardwired communication between neighboring processors, local operations can be performed on the image, or local image features can be detected in parallel, with every processor simultaneously accessing its neighbors and computing the appropriate function for its neighborhood. Over the last two decades, several machines embodying this concept have been constructed. The Illiac 1113 used a 36 x 36 processor array (the Illiac IV used only an 8 x 8 array) to analyze \"events\" in nuclear bubble-chamber images by examining 36 x 36 \"windows\" of the images. In later machines, such as the CLIP,4 DAP,5 and Mpp,6 arrays of up to 128 x 128 processors were used and were applied blockwise to larger images. This article reviews the basic techniques of image processing using two-dimensional arrays of processors, or cellular arrays. It also discusses various extensions and generalizations of the cellular array concept and their possible implementations and applications. The term cellular array is used because these machines can be regarded as generalizations of bounded cellular automata, which have been studied extensively on a theoretical level. The relative merits of cellular arrays for image processing as compared to other architectures* are not discussed here; but they have been studied extensively for such purposes, on levels from theory to hardware. A cellular array (Figure 1) is a two-dimensional array of processors, or cells, usually rectangular, each of which can directly communicate with its neighbors in the array. Here, for simplicity, I assume that each cell is connected to its four horizontal and vertical neighbors. Each cell on the borders of the array then has only three neighbors, and each cell in the four corners of the array has only two. I also assume that a cell can distinguish its neighbors; i.e., it can send a different message to each neighbor, and when it receives messages from them, it knows which message came from which neighbor. To use a cellular array for image processing, we give …

read more

Citations
More filters
Journal ArticleDOI

A survey of shape analysis techniques

TL;DR: This paper provides a review of shape analysis methods, which play an important role in systems for object recognition, matching, registration, and analysis.
Journal Article

Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations

TL;DR: Mitchell et al. as discussed by the authors presented results from an experiment similar to one performed by Packard (1988), in which a genetic algorithm is used to evolve cellular automata (CA) to perform a particular computational task.
Journal ArticleDOI

Evolving cellular automata to perform computations: mechanisms and impediments

TL;DR: The extent to which symmetry breaking and other impediments are general phenomena in any GA search is discussed, and four “epochs of innovation” in which new CA strategies for solving the problem are discovered by the GA are identified.
Journal ArticleDOI

Cellular automata as a paradigm for ecological modeling

TL;DR: Some shortcomings of the cellular-automaton formalism are discussed and some extensions and generalizations which may remedy these shortcomings are mentioned.
Book

Digital geometry

TL;DR: Questions of particular interest include how images and image subsets are digitized; how geometric properties are defined for digitized sets; the computational complexity of computing them--in particular, whether they can be computed using simple (e.g., local) operations; characterizing image operations that preserve them; and characterizing digital objects that could be the digitizations of real objects that have given geometric properties.
References
More filters
Journal ArticleDOI

Parallel Image Processing by Memory-Augmented Cellular Automata

TL;DR: This paper introduces a generalization of cellular automata in which each celi is a tape-bounded Turing machine rather than a finite-state machine, suggesting that this model of parallel computation is a very suitable one for studying the advantages of parallelism in this domain.
Journal ArticleDOI

Cellular graph automata. I. basic concepts, graph property measurement, closure properties*

TL;DR: This paper discusses how a class of generalized cellular automata in which the intercell connections define a graph of bounded degree can measure various properties of its underlying graph, including the radius and the number of nodes, in time proportional to the diameter.
Journal ArticleDOI

Parallel⧸sequential array automata

TL;DR: To consider more conf defining a Selkow-type parallel/ machine, and to compare the power e with that of an allhim, it should be pointed out that tial machines may well be of consideral picture processing, since they pr#ide a corn li:2 between purely se.
Journal ArticleDOI

Low-level vision using an array processor

TL;DR: The application of the ICL Distributed Array Processor to region finding, edge finding, and line finding operations is described, with run times measurable in milliseconds.