Orthogonal multiprocessor sharing memory with an enhanced mesh for integrated image understanding

Abstract This paper proposes a new parallel architecture, which has the potential to support low-level image processing as well as intermediate and high-level vision analysis tasks efficiently. The integrated architecture consists of an SIMD mesh of processors enhanced with multiple broadcast buses, and MIMD multiprocessor with orthogonal access buses, and a two-dimensional shared memory array. Low-level image processing is performed on the mesh processor, while intermediate and high-level vision analysis is performed on the orthogonal multiprocessor. The interaction between the two levels is supported by a common shared memory. Concurrent computations and I/O are made possible by partitioning the memory into disjoint spaces so that each processor system can access a different memory space. To illustrate the power of such a two-level system, we present efficient parallel algorithms for a variety of problems from low-level image processing to high-level vision. Representative problems include matrix based computations, histogramming and key counting operations, image component labeling, pyramid computations, Hough transform, pattern clustering, and scene labeling. Through computational complexity analysis, we show that the integrated architecture meets the processing requirements of most image understanding tasks.

[1]  Viktor K. Prasanna,et al.  A VLSI-Based Multiprocessor Architecture for Implementing Parallel Algorithms , 1985, International Conference on Parallel Processing.

[2]  Steven L. Tanimoto,et al.  A pyramidal approach to parallel processing , 1983, ISCA '83.

[3]  Viktor K. Prasanna,et al.  Fast Image Labeling Using Local Operators on Mesh-Connected Computers , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Allan L. Fisher Scan line array processors for image computation , 1986, ISCA 1986.

[5]  Jun Gu,et al.  A Parallel Architecture for Discrete Relaxation Algorithm , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[7]  Kai Hwang,et al.  Parallel Pattern ClusterIng on a Multiprocessor with Orthogonally Shared Memory , 1987, ICPP.

[8]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[9]  Kai Hwang,et al.  An Orthogonal Multiprocessor for Parallel Scientific Computations , 1989, IEEE Trans. Computers.

[10]  Anil K. Jain,et al.  Clustering Methodologies in Exploratory Data Analysis , 1980, Adv. Comput..

[11]  Leonard Uhr,et al.  Layered "Recognition Cone" Networks That Preprocess, Classify, and Describe , 1972, IEEE Transactions on Computers.

[12]  Anil K. Jain,et al.  A VLSI Systolic Architecture for Pattern Clustering , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.