Abstract
This article focuses on the (unweighted) graph-based mathematical morphology operators presented in Cousty et al. (CVIU 117(4):370–385, 2013). These operators depend on a size parameter that specifies the number of iterations of elementary dilations/erosions. Thus, the associated running times increase with the size parameter, the algorithms running in \(O(\lambda .n)\) time, where n is the size of the underlying graph and \(\lambda \) is the size parameter. In this article, we present distance maps that allow us to recover (by thresholding) all considered dilations and erosions. The algorithms based on distance maps allow the operators to be computed with a single linear O(n) time iteration, without any dependence to the size parameter. Then, we investigate a parallelization strategy to compute these distance maps. The idea is to build iteratively the successive level-sets of the distance maps, each level-set being traversed in parallel. Under some reasonable assumptions about the graph and sets to be dilated, our parallel algorithm runs in \(O(n/p + K \log _2 p)\) where n, p, and K are the size of the graph, the number of available processors, and the number of distinct level-sets of the distance map, respectively. Then, implementations of the proposed algorithm on a shared-memory multicore architecture are described and assessed on datasets of 45 images and 6 textured three-dimensional meshes, showing a reduction of the processing time by a factor up to 55 over the previously available implementations on a 8-core architecture.
Similar content being viewed by others
References
Alecu, F.: Performance analysis of parallel algorithms. J. Appl. Quant. Methods 129 (2007)
Bloch, I., Bretto, A.: Mathematical morphology on hypergraphs, application to similarity and positive kernel. Comput. Vis. Image Underst. 117(4), 342–354 (2013)
Butenhof, D.R.: Programming with POSIX Threads. Addison-Wesley, Reading (1997)
Chia, T.L., Wang, K.B., Chen, Z., Lou, D.C.: Parallel distance transforms on a linear array architecture. IPL 82(2), 73–81 (2002)
Coeurjolly, D.: 2D subquadratic separable distance transformation for path-based norms. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds.) Discrete Geometry for Computer Imagery. DGCI 2014. Lecture Notes in Computer Science, vol. 8668, Springer, Cham (2014)
Cormen, T.H.: Introduction to Algorithms. MIT Press, Cambridge (2009)
Couprie, M., Bertrand, G.: New characterizations of simple points in 2D, 3D, and 4D discrete spaces. IEEE Trans. Pattern Anal. Mach. Intell. 31(4), 637–648 (2009)
Cousty, J., Bertrand, G., Couprie, M., Najman, L.: Collapses and watersheds in pseudomanifolds of arbitrary dimension. J. Math. Imaging Vis. 50(3), 261–285 (2014)
Cousty, J., Najman, L., Dias, F., Serra, J.: Morphological filtering on graphs. Comput. Vis. Image. Underst. Volume 117(4), 370–385 (2013). doi:10.1016/j.cviu.2012.08.016
Cousty, J., Najman, L., Serra, J.: Some morphological operators in graph spaces. In: Wilkinson, M.H.F., Roerdink, J.B.T.M., (eds.) Mathematical Morphology and Its Application to Signal and Image Processing. ISMM 2009. Lecture Notes in Computer Science, vol. 5720. Springer, Berlin, Heidelberg (2009)
Delgado-Friedrichs, O., Robins, V., Sheppard, A.: Skeletonization and partitioning of digital images using discrete morse theory. IEEE Trans. Pattern Anal. Mach. Intell. 37(3), 654–666 (2015)
Dias, F., Cousty, J., Najman, L.: Dimensional operators for mathematical morphology on simplicial complexes. Pattern Recogn. Lett. 47, 111–119 (2014)
Grama, A.: Introduction to Parallel Computing. Pearson Education, Upper Saddle River (2003)
Heijmans, H.J.: Advances in electronics and electron physics, supplement. In: Morphological Image Operators. Academic Press, Boston (1994)
Heijmans, H.J., Ronse, C.: The algebraic basis of mathematical morphology I. Dilations and erosions. Comput. Vis. Graph. Image Process. 50(3), 245–295 (1990)
Kasim, H., March, V., Zhang, R., See, S.: Survey on parallel programming model. In: Cao, J., Li, M., Wu, MY., Chen, J. (eds.) Network and Parallel Computing. NPC 2008. Lecture Notes in Computer Science, vol. 5245. Springer, Berlin, Heidelberg (2008)
Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM 27(4), 831–838 (1980)
Lerallut, R., Decencière, É., Meyer, F.: Image filtering using morphological amoebas. Image Vis. Comput. 25(4), 395–404 (2007)
Level Otsu, N.: A threshold selection method from gray-level histogram. IEEE Trans. Syst. Man Cybern. 9(1), 62–66 (1979)
Man, D., Uda, K., Ueyama, H., Ito, Y., Nakano, K.: Implementations of parallel computation of Euclidean distance map in multicore processors and GPUs. In: 2010 First International Conference on Networking and Computing, Higashi-Hiroshima, pp. 120–127 (2010)
Man, D., Uda, K., Ueyama, H., Ito, Y., Nakano, K.: Implementations of a parallel algorithm for computing euclidean distance map in multicore processors and GPUs. Int. J. Netw. Comput. 1(2), 260–276 (2011)
Mennillo, L., Cousty, J., Najman, L.: A comparison of some morphological filters for improving OCR performance. In: Benediktsson, J., Chanussot, J., Najman, L., Talbot, H. (eds.) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2015. Lecture Notes in Computer Science, vol. 9082. Springer, Cham (2015)
Meyer, F., Angulo, J.: Micro-viscous morphological operators. In: Banon, GJF., Barrera, J., de Mendonça Braga-Neto, U. (eds.) Mathematical Morphology and its Application to Signal and Image Processing - Proceedings of the 8th International Symposium on Mathematical Morphology, pp. 165–176 (2007)
Najman, L., Cousty, J.: A graph-based mathematical morphology reader. Pattern Recogn. Lett. 47, 3–17 (2014)
Pham, T.Q.: Parallel implementation of geodesic distance transform with application in superpixel segmentation. In: 2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA), Hobart, TAS, pp. 1–8. (2013). doi:10.1109/DICTA.2013.6691508
Ronse, C., Serra, J.: Algebraic foundations of morphology. In: Najman, L., Talbot, H. (eds.) Mathematical Morphology: from Theory to Applications, John Wiley & Sons, Inc., Hoboken, NJ, USA (2013). doi:10.1002/9781118600788.ch2
Rosenfeld, A., Pfaltz, J.L.: Distance functions on digital pictures. PR 1(1), 33–61 (1968)
Saito, T., Toriwaki, J.I.: New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applications. Pattern Recogn. 27(11), 1551–1565 (1994)
Serra, J.: Image Analysis and Mathematical Morphology, vol. 1. Academic Press, New York (1982)
Shyu, S.J., Chou, T., Chia, T.L.: Distance transformation in parallel. In: Proceedings of Workshop Combinatorial Mathematics and Computation Theory, pp. 298–304 (2006)
Soille, P., Breen, E.J., Jones, R.: Recursive implementation of erosions and dilations along discrete lines at arbitrary angles. PAMI 18(5), 562–567 (1996)
Svolos, A.I., Konstantopoulos, C.G., Kaklamanis, C.: Efficient binary morphological algorithms on a massively parallel processor. In: Proceedings of the 14th International Parallel and Distributed Processing Symposium. IPDPS 2000, Cancun, pp. 281–286 (2000). doi:10.1109/IPDPS.2000.845997
Vincent, L.: Graphs and mathematical morphology. Signal Process. 16(4), 365–388 (1989)
Youkana, I., Cousty, J., Saouli, R., Akil, M.: Parallelization strategy for elementary morphological operators on graphs. In: International Conference on Discrete Geometry for Computer Imagery, pp. 311–322. Springer (2016)
Acknowledgements
We warmly thank the consortium of the RECOVER3D project funded by the French 1st Programme d’Investissements d’Avenir (PIA) including, in particular, Ludovic Blache and Laurent Lucas, for providing us with the textured meshes processed in the work presented in this article.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Youkana, I., Cousty, J., Saouli, R. et al. Parallelization Strategy for Elementary Morphological Operators on Graphs: Distance-Based Algorithms and Implementation on Multicore Shared-Memory Architecture. J Math Imaging Vis 59, 136–160 (2017). https://doi.org/10.1007/s10851-017-0737-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10851-017-0737-1