@article {15008,
	title = {Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study},
	volume = {UMIACS-TR-94-133},
	year = {1998},
	month = {1998/10/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This paper presents efficient and portable implementations of two   useful primitives in image processing algorithms, histogramming and
   connected components.  Our general framework is a single-address
   space, distributed memory programming model.  We use efficient
   techniques for distributing and coalescing data as well as efficient
   combinations of task and data parallelism.  Our connected components
   algorithm uses a novel approach for parallel merging which performs
   drastically limited updating during iterative steps, and concludes
   with a total consistency update at the final step. The algorithms have
   been coded in Split-C and run on a variety of platforms.  Our
   experimental results are consistent with the theoretical analysis and
   provide the best known execution times for these two primitives, even
   when compared with machine specific implementations.  More efficient
   implementations of Split-C will likely result in even faster
   execution times. 
(Also cross-referenced as UMIACS-TR-94-133.)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/681},
	author = {Bader,David A. and JaJa, Joseph F.}
}
