Histogramming on a reconfigurable mesh computer

The authors develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N*N image is computed by an N*N RMESH in O( square root B log /sub square root B/(N/ square root B) for B<N, O( square root N) for B=N, and O( square root B) for N<B<or=N/sup 2/. B is the number of gray scale values. Histogram modification is done in O( square root N) time by an N*N RMESH.<<ETX>>

[1]  Viktor K. Prasanna,et al.  An optimal sorting algorithm on reconfigurable mesh , 1992, Proceedings Sixth International Parallel Processing Symposium.

[2]  Dionysios I. Reisis,et al.  Image computations on reconfigurable VLSI arrays , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[3]  David Peleg,et al.  The Power of Reconfiguration , 1991, J. Parallel Distributed Comput..

[4]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[5]  Sartaj Sahni,et al.  Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components , 1991, ICPP.

[6]  Massimo Maresca,et al.  Polymorphic-Torus Architecture for Computer Vision , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

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

[8]  Dionysios I. Reisis,et al.  Data Movement Operations and Applications on Reconfigurable VLSI Arrays , 1988, ICPP.

[9]  S. L. Tanimoto,et al.  Sorting, Histogramming, and Other Statistical Operations on a Pyramid Machine , 1984 .

[10]  Larry S. Davis,et al.  On Computing Complete Histograms of Images in Log (n) Steps Using Hypercubes , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Gen-Huey Chen,et al.  Constant Time Sorting on a Processor Array with a Reconfigurable Bus System , 1990, Inf. Process. Lett..

[12]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[13]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[14]  Jae S. Lim.  1 – Image Enhancemen , 1984 .

[15]  Graham R. Nudd,et al.  A Cellular VLSI Architecture , 1984, Computer.

[16]  Russ Miller,et al.  Meshes with reconfigurable buses , 1988 .

[17]  Johan Håstad,et al.  Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.

[18]  Sartaj Sahni,et al.  Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[19]  Massimo Maresca,et al.  Polymorphic-Torus Network , 1989, IEEE Trans. Computers.

[20]  Gen-Huey Chen,et al.  Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[21]  Howard Jay Siegel,et al.  PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition , 1981, IEEE Transactions on Computers.