This code provides efficient and portable implementations of useful image processing algorithms, histogramming, connected components, image enhancement, and segmentation, as well parallel codes for combinatorial problems such as routing h-relations, sorting and selection. The algorithms have been coded in Split-C and provide the best known execution times for these approaches, even when compared with machine specific implementations.
References:
D.A. Bader and J. Já Já . "Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study," Journal of Parallel and Distributed Computing, 35(2)173-190, June 1996.
D.A. Bader, J. Já Já , D. Harwood, and L.S. Davis. "Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study," The Journal of Supercomputing, 10(2):141-168, 1996.
D.R. Helman, D.A. Bader, and J. Já Já . "Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study," presented at the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, Padua, Italy, pp. 211-220, June 1996.
D.A. Bader, D.R. Helman, and J. Já Já . "Practical Parallel Algorithms for Personalized Communication and Integer Sorting," ACM Journal of Experimental Algorithmics, 1(3):1-42, 1996.