Parallel algorithms for image histogramming and connected components with an experimental study

Journal of Parallel and Distributed Computing

Volumn 35, Issue 2, 1996, Pages 173-190

  Bader, David A ^a   Jájá, Joseph ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (40)

1. 1. Alexandrov, A., Ionescu, M., Schauser, K., and Scheiman, C. LogGP: Incorporating long messages into the LogP Model - One step closer towards a realistic model for parallel computation. 7th Annual ACM Symposium on Parallel Algorithms and Architectures, Santa Barbara, CA, 1995, pp. 95-105.
2. 2. Alnuweiri, H., and Prasanna, V. Parallel architectures and algorithms for image component labeling. IEEE Trans. Pattern Anal. Mach. Intell. 14 (1992), 1014-1034.
3. 3. Apostolakis, J., Coddington, P., and Marinari, E. New SIMD algorithms for cluster labeling on parallel computers, Int. J. Mod. Phys. C 4 (1993), 749.
4. 4. Bader, D. A., and JáJá, J. Parallel algorithms for image histogramming and connected components with an experimental study. Technical Report CS-TR-3384 and UMIACS-TR-94-133, UMIACS and Electrical Engineering, University of Maryland, College Park, MD, December 1994. J. Parallel Distrib. Comput., to appear.
5. 5. Bader, D. A., and JáJá, J. Parallel algorithms for image histogramming and connected components with an experimental study. Fifth ACM SIGPLAN Symposium of Principles and Practice of Parallel Programming, Santa Barbara, CA, 1995, pp. 123-133.
6. 6. Bader, D. A., JáJá, J., Harwood, D., and Davis, L. S. Parallel algorithms for image enhancement and segmentation by region growing with an experimental study. Technical Report CS-TR-3449 and UMIACS-TR-95-44, Institute for Advanced Computer Studies (UMIACS), University of Maryland, College Park, MD, 1995. Presented at the 10th International Parallel Processing Symposium, Honolulu, 1996, pp. 414-423.
7. 7. Baillie, C. F., and Coddington, P. D. Cluster identification algorithms for spin models - Sequential and parallel. Concurrency: Practice Experience 3, 2 (1991), 129-144.
8. 8. Brower, R. C., Tamayo, P., and York, B. A parallel multigrid algorithm for percolation clusters. J. Statist. Phys. 63 (1991), 73.
9. 9. Chin, F. Y., Lam, J., and Chen, I-N. Efficient parallel algorithms for some graph problems. Comm. ACM, 25, 9 (1982), 659-665.
10. 10. Choudhary, A., and Thakur, R. Evaluation of connected component labeling algorithms on shared and distributed memory multiprocessors. Proceedings of the 6th International Parallel Processing Symposium, 1992, pp. 362-365.
11. 11. Choudhary, A., and Thakur, R. Connected component labeling on coarse grain parallel computers: An experimental study. J. Parallel Distrib. Comput. 20, 1 (Jan. 1994), 78-83.
12. 12. Copty, N., Ranka, S., Fox, G., and Shankar, R. V. A data parallel algorithm for solving the region growing problem on the Connection Machine. J. Parallel Distrib. Comput. 21, 1 (Apr. 1994), 160-168.
13. 13. Culler, D. E., Dusseau, A., Goldstein, S. C, Krishnamurthy, A., Lumetta, S., Luna, S., von Eicken, T., and Yelick, K. Introduction to Split-C, version 1.0 edition. Computer Science Division - EECS, University of California, Berkeley, CA, 1994.
14. 14. Culler, D. E., Karp, R. M., Patterson, D. A., Sahay, A., Schauser, K. E., San tos, E., Subramonian, R., and von Eicken, T. LogP: Towards a realistic model of parallel computation. Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1993.
15. 15. Dillencourt, M. B., Samet, H., and Tamminen, M. Connected component labeling of binary images. Technical Report CS-TR-2303, Computer Science Department, University of Maryland, 1989.
16. 16. Grinberg, J., Nudd, G. R., and Etchells, R. D. A cellular VLSI architecture. IEEE Comput. 17, 1 (1984), 69-81.
17. 17. Han, Y., and Wagner, R. A. An efficient and fast parallel-connected component algorithm. J. Assoc. Comput. Mach. 37, 3 (1990), 626-642.
18. 18. Hirschberg, D. S., Chandra, A. K., and Sarwate, D. V. Computing connected components on parallel computers. Comm. ACM, 22, 8 (1979), 461-464.
19. 19. Ibrahim, H. A., Kender, J. R., and Shaw, D. E. Low-level image analysis tasks on fine-grained tree-structured SIMD machines. J. Parallel Distrib. Comput. 4 (1987), 546-574.
20. 20. JáJá, J. An Introduction to Parallel Algorithms. Addison-Wesley, New York, 1992.
21. 21. JáJá, J., and Ryu, K. W. The block distributed memory model. Technical Report CS-TR-3207, Computer Science Department, University of Maryland, College Park, January 1994. IEEE Trans. Parallel Distrib. Systems, to appear.
22. 22. JáJá, J. F., and Ryu, K. W. The block distributed memory model for shared memory multiprocessors. Proceedings of the 8th International Parallel Processing Symposium, Cancún, Mexico, 1994, pp. 752-756. [Extended abstract]
23. 23. Jesshope, C. R. Parallel computers - Architectures and programming. In Vaughan, R. A. (Ed.), Pattern Recognition and Image Processing in Physics. Scottish Universities Summer School in Physics, New York, 1990, pp. 205-234.
24. 24. Kanade, T., and Webb, J. A. Parallel vision algorithm design and implementation 1988 end of year report. Technical Report CMU-RI-TR-89-23, The Robotics Institute, Carnegie Mellon University, 1989.
25. 25. Kuzela, J. M. IBM POWERparallel System - SP2 Performance Measurements. Power Parallel Systems, IBM, 1994.
26. 26. Leiserson, C. E., Abuhamdeh, Z. S., Douglas, D. C, Feynman, C. R., Ganmukhi, M. N., Hill, J. V., Hillis, W. D., Kuszmaul, B. C., St. Pierre, M. A., Wells, D. S., Wong, M. C., Yang, S.-W., and Zak, R. The network architecture of the Connection Machine CM-5. 1992. [Extended abstract]
27. 27. Liu, L. T. Personal communication. 1994.
28. 28. Marks, P. Low-level vision using an array processor. Comput. Graphics Image Process. 14 (1980), 281-292.
29. 29. Meiko. Computing Surface - Communications Network Overview, Manual 84-cb041 edition. Meiko World Inc., Concord, MA, 1993.
30. 30. Nudd, G. R., Atherton, T. J., Francis, N. D., Howarth, R. M., Kerbyson, D. J., Packwood, R. A., and Vaudin, G. J. A hierarchical multiple-SIMD architecture for image analysis. Proceedings of the 10th International Conference on Pattern Recognition. Atlantic City, NJ, 1990, pp. 642-647.
31. 31. Potter, J. L. Image processing on the Massively Parallel Processor. IEEE Comput. 16, 1 (1983), 62-67.
32. 32. Rosenfeld, A. A report on the DARPA image understanding architectures workshop. Proceedings of the 1987 Image Understanding Workshop. 1987, pp. 298-302.
33. 33. Samet, H., and Tamminen, M. A general approach to connected component labeling of images. Technical Report CS-TR-1649, Computer Science Department, University of Maryland, 1986.
34. 34. Sokal, A. D. New numerical algorithms for critical phenomena (multigrid methods and all that). In Landau, D. P., Mon, K. K., and Schuttler, H.-B. (Eds.), Computer Simulation Studies in Condensed Matter Physics: Recent Developments. Springer-Verlag, Berlin, 1988.
35. 35. Stauffer, D. Introduction to Percolation Theory. Taylor & Francis, Philadelphia, 1985.
36. 36. Stout, Q. F. Supporting divide-and-conquer algorithms for image processing. J. Parallel Distrib. Comput. 4 (1987), 95-115.
37. 37. Valiant, L. G., A bridging model for parallel computation. Comm. ACM 33, 8 (1990), 103-111.
38. 38. Wang, J.-C., Lin, T.-H., and Ranka, S. Distributed scheduling of unstructured collective communication on the CM-5. Personal communication, 1994.
39. 39. Weems, C., Riseman, E., Hanson, A., and Rosenfeld, A. A report on the results of the DARPA integrated image understanding benchmark exercise. Image Understanding Workshop. 1989, pp. 165-192.
40. 40. Weems, C, Riseman, E., Hanson, A., and Rosenfeld, A. The DARPA image understanding benchmark for parallel computers. J. Parallel Distrib. Comput. 11 (1991), 1-24.