Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer

Journal of Parallel and Distributed Computing

Volumn 20, Issue 1, 1994, Pages 56-68

  Hambrusch, Susanne ^a   He, Xin ^b   Miller, Russ ^b  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003562136     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1994.1005     Document Type: Article

References (20)

1. Atallah, M. J., Dehne, F., Miller, R., Rau-Chaplin, A., and Tsay, J.-J. Multisearch techniques for implementing data structures on a mesh-connected computer. Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures. 1991, pp. 204-214.
2. Atallah, M. J. and Hambrusch, S. E. Solving tree problems on a mesh-connected processor array. Inform, and Control 69, 103 (1986) 168-187.
3. Bondy, J. A., and Murty, U. S. R. Graph Theory with Applications. North-Holland, Amsterdam, 1976.
4. Chiba, N., Nashizeki, T., and Saito, N. A linear 5-coloring algorithm of planar graphs, J. Algorithms 2 (1981), 28-35.
5. Dehne, F., and Hambrusch, S. E. Parallel algorithms for determining c-width-connectivity in binary images, J. Parallel Distrib. Corn-put. 12, 1 (1991), 12-23.
6. Goldberg, A. V., Plotkin, S. A., and Shannon, G. E. Parallel symmetry-breaking in sparse graphs. In Proc. 19th ACM Symposium on Theory of Computing. 1987, pp. 315-324.
7. Hagerup, T., Chrobak, M., and Diks, K. Optimal parallel 5-coloring of planar graphs. SIAM J. Comput. 18, 2 (1989), 288-300.
8. He, X., and Miller, R. Optimal mesh algorithms for maximal independent subset and 5-coloring. Tech. Rept. 90-27, Department of Computer Science, State University of New York at Buffalo, Oct. 1990.
9. Karp, R. M., and Ramachandran, V. Parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity. MIT Press, Cambridge, MA, 1990, pp. 869-942.
10. Leighton, F. T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes, Morgan Kaufmann, 1992.
11. Miller, R., and Stout, Q. F. Parallel Algorithms for Regular Architectures. MIT Press, Cambridge, MA, to appear.
12. Nassimi, D., and Sahni, S. Finding connected components and connected ones on a mesh-connected parallel computer. SIAM J. Comput. 9 (1980), 744-757.
13. Nassimi, D., and Sahni, S. Bitonic sort on a mesh-connected parallel computer. IEEE Trans. Comput. C-27, 1 (Jan. 1979), 2-7.
14. Nassimi, D., and Sahni, S. Data broadcasting in S1MD computers. IEEE Trans. Comput. C-30, 2 (Feb. 1981), 101-107.
15. Montanvert, A., Meer, P., and Rosenfeld, A. Hierarchical image analysis using irregular tessellations. Tech. Rept. CAR-TR-464, University of Maryland, Sept. 1989.
16. Pavlidis, T. Algorithms for Graphics and Image Processing. CSP, 1982.
17. Reif, J., and Stout, Q. F. Optimal component labeling algorithms for mesh computers and VLSI. Private Communication.
18. Rosenfeld, A., and Kak, A. Digital Picture Processing. Academic Press, New York, 1982.
19. Stout, Q. F. Tree-based graph algorithms for some parallel computers. Proc. of the 1985 International Conference on Parallel Processing. 1985, pp. 727-730.
20. Thompson, C. D., and Kung, H. T. Sorting on a mesh-connected parallel computer. Comm. ACM 20, 4 (Apr. 1977), 263-271.