{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T06:10:07Z","timestamp":1760249407916},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T00:00:00Z","timestamp":1531872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T00:00:00Z","timestamp":1531872000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Real-Time Image Proc"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11554-018-0804-x","type":"journal-article","created":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T18:53:44Z","timestamp":1531940024000},"page":"527-542","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel computation of Watershed Transform in weighted graphs on shared memory machines"],"prefix":"10.1007","volume":"17","author":[{"given":"Yosra","family":"Braham","sequence":"first","affiliation":[]},{"given":"Yaroub","family":"Elloumi","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Akil","sequence":"additional","affiliation":[]},{"given":"Mohamed Hedi","family":"Bedoui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"804_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10851-005-4891-5","volume":"22","author":"G Bertrand","year":"2005","unstructured":"Bertrand, G.: On topological watersheds. J. Math. Imag. Vis. 22, 217\u2013230 (2005)","journal-title":"J. Math. Imag. Vis."},{"key":"804_CR2","unstructured":"Beucher, S., Lantu\u00e9joul, C.: Use of watersheds in contour detection. In: Dans Proc. of the international workshop on image processing: real-time edge and motion detection\/estimation, Renne France, 17\u201321 September 1979"},{"key":"804_CR3","doi-asserted-by":"crossref","unstructured":"Cabaret, L., Lacassagne, L., Etiemble, D.: Parallel light speed labeling: an efficient connected component labeling algorithm for multi-core processors. In: ICIP 2015, pp. 3486\u20133489. IEEE, Quebec City, Canada (2015)","DOI":"10.1109\/ICIP.2015.7351452"},{"issue":"1","key":"804_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11554-016-0574-2","volume":"15","author":"L Cabaret","year":"2018","unstructured":"Cabaret, L., Lacassagne, L., Etiemble, D.: Parallel light speed labeling: an efficient connected component algorithm for labeling and analysis on multi-core processors. J. Real-Time Image Process. 15(1), 173\u2013196 (2018)","journal-title":"J. Real-Time Image Process."},{"issue":"6","key":"804_CR5","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1145\/355541.355562","volume":"47","author":"B Chazelle","year":"2000","unstructured":"Chazelle, B.: A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM, 47(6), 1028\u20131047 (2000)","journal-title":"J. ACM"},{"key":"804_CR6","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C., Rivest, R.: Introduction to algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"5","key":"804_CR7","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1117\/12.292778","volume":"3168","author":"M Couprie","year":"1997","unstructured":"Couprie, M., Bertrand, G.: Topological grayscale watershed transform. SPIE Vis. Geomet. 3168(5), 136\u2013146 (1997)","journal-title":"SPIE Vis. Geomet."},{"key":"804_CR8","unstructured":"Cousty, J.: Lignes de partage des eaux discr\u00e8tes: th\u00e9orie et application \u00e0 la segmentation d\u2019images cardiaques. Marne-la-Vall\u00e9e University, Thesis in Computer science (2007)"},{"key":"804_CR9","doi-asserted-by":"crossref","unstructured":"Cousty, J., Bertrand, G., Najman, L., Couprie, M.: On watershed cuts and thinnings. In: Coeurjolly, D., et al. (eds.) Discrete Geometry for Computer Imagery, vol. 499, no 1, pp. 434\u2013445, France. Springer (2008)","DOI":"10.1007\/978-3-540-79126-3_39"},{"issue":"8","key":"804_CR10","first-page":"1362","volume":"31","author":"J Cousty","year":"2009","unstructured":"Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: minimum spanning forests and the drop of water principle. IEEE Trans. Pattern Anal. Mach. Intell. Inst. Electr. Electr. Eng. 31(8), 1362\u20131374 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. Inst. Electr. Electr. Eng."},{"issue":"5","key":"804_CR11","first-page":"925","volume":"32","author":"J Cousty","year":"2010","unstructured":"Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: thinnings, shortest path forests, and topological watersheds. IEEE Trans. Pattern Anal. Machine Intell. Inst. Electr. Electr. Eng. 32(5), 925\u2013939 (2010)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell. Inst. Electr. Electr. Eng."},{"key":"804_CR12","unstructured":"Enficiaud, R.: Algorithmes multidimensionnels et multi spectraux en Morphologie Math\u00e9matique: Approche par m\u00e9ta-programmation. Thesis in mathematical morphology (2007)"},{"issue":"1","key":"804_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"RL Graham","year":"1985","unstructured":"Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Ann. History Comput. 7(1), 43\u201357 (1985)","journal-title":"Ann. History Comput."},{"key":"804_CR14","volume-title":"Introduction to parallel computing","author":"A Grama","year":"2003","unstructured":"Grama, A.: Introduction to parallel computing. Pearson Education, Upper Saddle River, Bergen (2003)"},{"key":"804_CR15","volume-title":"Network and Parallel. Computing Lecture Notes in Computer Science","author":"H Kasim","year":"2008","unstructured":"Kasim, H., March, V., Zhang, R., See, S.: Survey on parallel programming model. In: Cao, J., Li, M., Wu, M.Y., Chen, J. (eds.) Network and Parallel. Computing Lecture Notes in Computer Science, vol. 5245. Springer, Berlin, Heidelberg (2008)"},{"key":"804_CR16","unstructured":"K\u00f4rbes, A., Giovani, B.V., Janito,V.F., Lotufo, R.A.: A Proposal for a Parallel Watershed Transform Algorithm for Real-Time Segmentation. Proceedings of Workshop de Visao Computacional WVC (2009)"},{"key":"804_CR17","first-page":"521","volume":"5","author":"R Mahmoudi","year":"2011","unstructured":"Mahmoudi, R., Akil, M.: Analyses of the watershed transform. Int. J. Image Process. 5, 521\u2013541 (2011)","journal-title":"Int. J. Image Process."},{"key":"804_CR18","unstructured":"Meyer, F.: Un algorithme optimal de ligne de partage des eaux. Dans Actes du 8\u00e8me Congr\u00e8s AFCET, pp. 847\u2013859, Lyon-Villeurbanne, France (1991)"},{"key":"804_CR19","first-page":"113","volume":"38","author":"F Meyer","year":"1993","unstructured":"Meyer, F.: Topographic distance and watershed lines. Sig. Process. J. Spec. Issue Math. Morphol. Appl. Sig. Process 38, 113\u2013125 (1993)","journal-title":"Sig. Process. J. Spec. Issue Math. Morphol. Appl. Sig. Process"},{"issue":"2\u20133","key":"804_CR20","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.dam.2004.09.017","volume":"147","author":"L Najman","year":"2005","unstructured":"Najman, L., Couprie, M., Bertrand, G.: Watersheds, mosaics and the emergence paradigm. Discr. Appl. Math. 147(2\u20133), 301\u2013324 (2005)","journal-title":"Discr. Appl. Math."},{"key":"804_CR21","unstructured":"Park, J.M., Looney, C.G., Chen, H.C.: Fast connected component labeling algorithm using a divide and conquer technique. In: The 15th international conference on computers and their applications, New Orleans, Louisiana, USA, 29\u201331 March 2000"},{"issue":"1\u20132","key":"804_CR22","first-page":"187","volume":"41","author":"JBTM Roerdink","year":"2001","unstructured":"Roerdink, J.B.T.M., Meijster, A.: The watershed transform: definitions, algorithms and parallelization strategies. Fundam. Inform. 41(1\u20132), 187\u2013228 (2001)","journal-title":"Fundam. Inform."},{"key":"804_CR23","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-62359-7_12","volume-title":"Soft computing for sustainability science","author":"R Romero-Zaliz","year":"2018","unstructured":"Romero-Zaliz, R., Reinoso-Gordo, J.F.: An updated review on watershed algorithms. In: Cruz Corona, C. (ed.) Soft computing for sustainability science, vol. 358, pp. 235\u2013258. Springer, Cham (2018)"},{"key":"804_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03939-7","volume-title":"Morphological Image Analysis","author":"P Soille","year":"1999","unstructured":"Soille, P.: Morphological Image Analysis. Springer-Verlag, New York, Inc., Secaucus (1999)"},{"issue":"6","key":"804_CR25","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/34.87344","volume":"13","author":"L Vincent","year":"1991","unstructured":"Vincent, L., Soille, P.: Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Trans. Pattern Anal. Mach. Intell. 13(6), 583\u2013598 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"804_CR26","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/1932409","volume":"26","author":"R Lee","year":"1945","unstructured":"Lee, R.: Dice: Measures of the amount of ecologic association between species. Ecology 26(3), 297\u2013302 (1945)","journal-title":"Ecology"},{"key":"804_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","volume":"11","author":"Paul Jaccard","year":"1912","unstructured":"Jaccard, Paul: The distribution of the flora in the alpine zone. New Phytol. 11, 37\u201350 (1912)","journal-title":"New Phytol."},{"key":"804_CR28","volume-title":"Introduction to algorithms","author":"H Thomas","year":"2009","unstructured":"Thomas, H., Charles, E., Ronald, L., Clifford, S.: Introduction to algorithms, 3rd edn. The MIT Press, Cambridge, Massachusetts (2009)","edition":"3"}],"container-title":["Journal of Real-Time Image Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11554-018-0804-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11554-018-0804-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11554-018-0804-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,8]],"date-time":"2020-06-08T05:12:02Z","timestamp":1591593122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11554-018-0804-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,18]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["804"],"URL":"https:\/\/doi.org\/10.1007\/s11554-018-0804-x","relation":{},"ISSN":["1861-8200","1861-8219"],"issn-type":[{"value":"1861-8200","type":"print"},{"value":"1861-8219","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,18]]},"assertion":[{"value":"13 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}