A Parallel Recursive Shortest Spanning Tree Algorithm for Image Segmentation in Distributed Computing Environment

The recursive shortest spanning tree (RSST) algorithm has been used for various image and video coding systems. The speed is very demanding for such applications. However, the RSST algorithm is too complex to perform in a reasonable time. This motivates the present work. A distributed algorithm that constructs a recursive shortest spanning tree for image segmentation with a fixed number of processors is presented in this paper. Using a tailored data partition strategy to assign jobs to processors in our proposed parallel recursive shortest spanning tree (PRSST) algorithm, we derive a new lower bound ofO(n) for one processor with ann-pixel image. The complexity of the proposed algorithm is cost-optimal and the total number of messages required isO(c) for images of any size, wherecis a small constant. The objective quality of segmented images produced by our PRSST has maximum 1.5 dB difference from those generated by Morris's RSST algorithm for images of the size of 128 by 128 and 150 by 150 pixels.

[1]  Francis Suraweera.  A fast algorithm for the minimum spanning tree , 1989 .

[2]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[3]  Sajal K. Das,et al.  Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems , 1991, Parallel Comput..

[4]  Anthony G. Constantinides,et al.  Segmented video coding , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[5]  Vito Cappellini,et al.  Digital Signal Processing-91: Proceedings of the International Conference Florence, Italy, 4-6 September, 1991 , 1991 .

[6]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[7]  Andrew Chi-Chih Yao,et al.  An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

[8]  Yao-Nan Lien.  A new node-join-tree distributed algorithm for minimum weight spanning trees , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[9]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[10]  Prabir Bhattacharya,et al.  An O(log m) Parallel Algorithm for the Minimum Spanning Tree Problem , 1993, Inf. Process. Lett..

[11]  Lisa Higham,et al.  Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm , 1996, SWAT.

[12]  Claude Berge,et al.  Programming, games and transportation networks , 1966 .

[13]  Jon Louis Bentley,et al.  A Parallel Algorithm for Constructing Minimum Spanning Trees , 1980, J. Algorithms.

[14]  Seymour E. Goodman,et al.  Introduction to the Design and Analysis of Algorithms , 1977 .

[15]  Anthony G. Constantinides,et al.  A fast recursive shortest spanning tree for image segmentation and edge detection , 1997, IEEE Trans. Image Process..

[16]  Michael J. Quinn,et al.  Parallel graph algorithms , 1984, CSUR.

[17]  A. Constantinides,et al.  A unified method for segmentation and edge detection using graph theory , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[18]  Myungcheol Lee,et al.  Graph theory for image analysis: an approach based on the shortest spanning tree , 1986 .

[19]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[21]  Jeffery L. Kennington,et al.  Minimal spanning trees: an empirical investigation of parallel algorithms , 1989, Parallel Comput..

[22]  A. G. Constantinides,et al.  Progressive image Coding from a spanning tree image representation , 1987 .

[23]  R. V. Slyke,et al.  Computing minimum spanning trees efficiently , 1972, ACM Annual Conference.

[24]  O. J. Morris,et al.  Segmented-image coding: Performance comparison with the discrete cosine transform , 1988 .

[25]  Ivan Lavallée,et al.  A Fully Distributed (Minimal) Spanning Tree Algorithm , 1986, Inf. Process. Lett..

[26]  Sajal K. Das,et al.  Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model' , 1988 .