Optimal geometric algorithms for digitized images on arrays with reconfigurable optical buses

Abstract Geometric algorithms play an important role in computer graphics and digital image analysis. This paper makes an improvement of computing geometric properties of labelled images using arrays with reconfigurable optical buses (AROB). For an N  ×  N image, we first design two constant time algorithms for computing the leftmost one problem and for the component reallocation problem. Then, several geometric algorithms for the labelled images are derived. These include finding the border pixels, computing the perimeter and area, computing the convex hull, determining whether two figures are linearly separable, computing the smallest enclosing box, solving the nearest neighbor problems, and computing the width and diameter. The major contribution of this work is to design both time and cost optimal algorithms for these problems. To the best of our knowledge, the proposed algorithms are the first constant time algorithms for these problems on the labelled images.

[1]  Russ Miller,et al.  Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Shi-Jinn Horng,et al.  Run-length chain coding and scalable computation of a shape's moments using reconfigurable optical buses , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Hussein M. Alnuweiri.  Constant-Time Parallel Algorithms for Image Labeling on a Reconfigurable Network of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[4]  Shi-Jinn Horng,et al.  Optimal Parallel Algorithms for Computer Vision Problems , 2002, J. Parallel Distributed Comput..

[5]  J. E. Mesbahi.  Nearest neighbor problems on a mesh-connected computer , 1990 .

[6]  ScienceDirect.  Microprocessors and microsystems , 1978 .

[7]  Mary Mehrnoosh Eshaghian-Wilner,et al.  Parallel Algorithms for Image Processing on OMC , 1991, IEEE Trans. Computers.

[8]  Jelloul Elmesbahi.  Θ(1) algorithm for image component labeling in a mesh connected computer , 1991, IEEE Trans. Syst. Man Cybern..

[9]  Stephan Olariu,et al.  Fast component labelling and convex hull computation on reconfigurable meshes , 1993, Image Vis. Comput..

[10]  D M Chiarulli,et al.  Coincident pulse techniques for multiprocessor interconnection structures. , 1990, Applied optics.

[11]  Dionysios I. Reisis,et al.  Image Computations on Meshes with Multiple Broadcast , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

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

[13]  Stephan Olariu,et al.  The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry , 1999, IEEE Trans. Parallel Distributed Syst..

[14]  Jorge L. C. Sanz,et al.  An EREW PRAM Algorithm for Image Component Labeling , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Ivan Stojmenovic,et al.  Time-Optimal Digital Geometry Algorithms on Meshes with Multiple Broadcasting , 1995, Int. J. Pattern Recognit. Artif. Intell..

[16]  Selim G. Akl,et al.  Matrix Operations Using Arrays with Reconfigurable Optical Buses* , 1996, Parallel Algorithms Appl..

[17]  Guy E. Blelloch,et al.  Scans as Primitive Parallel Operations , 1989, ICPP.

[18]  Rami G. Melhem,et al.  Time-Division Optical Communications in Multiprocessor Arrays , 1993, IEEE Trans. Computers.

[19]  Selim G. Akl,et al.  Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses , 1998, Int. J. Found. Comput. Sci..

[20]  Sartaj Sahni,et al.  Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..

[21]  Shi-Jinn Horng,et al.  Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System , 2005, IEEE Trans. Parallel Distributed Syst..

[22]  Russ Miller,et al.  Data Movement Techniques for the Pyramid Computer , 1987, SIAM J. Comput..

[23]  Shi-Jinn Horng,et al.  Fast and Scalable Selection Algorithms with Applications to Median Filtering , 2003, IEEE Trans. Parallel Distributed Syst..

[24]  Jelloul Elmesbahi.  Nearest neighbor problems on a mesh-connected computer , 1990, IEEE Trans. Syst. Man Cybern..

[25]  J. El Mesbahi.  Theta (1) algorithm for image component labeling in a mesh connected computer , 1991 .

[26]  Ivan Stojmenovic,et al.  Constant Time Digital Geometry Algorithms on the Scan Model of Parallel Computation , 1994, Int. J. High Speed Comput..

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

[28]  Yi Pan,et al.  Linear Array with a Reconfigurable Pipelined Bus System - Concepts and Applications , 1998, Inf. Sci..

[29]  Rami G. Melhem,et al.  Pipelined Communications in Optically Interconnected Arrays , 1991, J. Parallel Distributed Comput..

[30]  Horst Bunke,et al.  SERIES IN MACHINE PERCEPTION AND ARTIFICIAL INTELLIGENCE , 2007 .