{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T08:06:25Z","timestamp":1745395585463,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540884576"},{"type":"electronic","value":"9783540884583"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88458-3_21","type":"book-chapter","created":{"date-parts":[[2008,10,4]],"date-time":"2008-10-04T11:19:44Z","timestamp":1223119184000},"page":"230-241","source":"Crossref","is-referenced-by-count":14,"title":["Parallel Algorithm for Concurrent Computation of Connected Component Tree"],"prefix":"10.1007","author":[{"given":"P.","family":"Matas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Dokl\u00e1dalov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Akil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Grandpierre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Najman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Poupa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Georgiev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/83.663500","volume":"7","author":"P. Salembier","year":"1998","unstructured":"Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE Trans. on Image Proc.\u00a07(4), 555\u2013570 (1998)","journal-title":"IEEE Trans. on Image Proc."},{"issue":"11","key":"21_CR2","doi-asserted-by":"publisher","first-page":"3531","DOI":"10.1109\/TIP.2006.877518","volume":"15","author":"L. Najman","year":"2006","unstructured":"Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Transactions on Image Processing\u00a015(11), 3531\u20133539 (2006)","journal-title":"IEEE Transactions on Image Processing"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Berger, C., G\u00e9raud, T., Levillain, R., Widynski, N., Baillard, A., Bertin, E.: Effective component tree computation with application to pattern recognition in astronomical imaging. In: ICIP 2007 (2007)","DOI":"10.1109\/ICIP.2007.4379949"},{"key":"21_CR4","unstructured":"Menotti, D., Najman, L., de Albuquerque Ara\u00fajo, A.: 1D Component Tree in Linear Time and Space and its Application to Gray-Level Image Multithresholding. In: Proceedings of the 8th International Symposium on Mathematical Morphology, Rio de Janeiro, Brazil, October 10\u201313, MCT\/INPE, vol.\u00a01, pp. 437\u2013448 (2007)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Wilkinson, M.H.F., Gao, H., Hesselink, W.H., Jonker, J.-E., Meijster, A.: Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines. Transactions on Pattern Analysis and Machine Intelligence (submitted, 2007)","DOI":"10.1109\/TPAMI.2007.70836"},{"issue":"2-3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10851-005-4892-4","volume":"22","author":"M. Couprie","year":"2005","unstructured":"Couprie, M., Najman, L., Bertrand, G.: Quasi-linear algorithms for the topological watershed. Journal of Mathematical Imaging and Vision\u00a022(2-3), 231\u2013249 (2005)","journal-title":"Journal of Mathematical Imaging and Vision"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. Journal of the ACM\u00a022, 215\u2013225 (1975)","journal-title":"Journal of the ACM"},{"key":"21_CR8","unstructured":"Ngan, N., Contou-Carr\u00e8re, F., Marcon, B., Gu\u00e9rin, S., Dokl\u00e1dalov\u00e1, E., Akil, M.: Efficient hardware implementation of connected component tree algorithm. In: Workshop on Design and Architectures for Signal and Image Processing, DASIP 2007, Grenoble, France (2007)"},{"key":"21_CR9","unstructured":"Berger, C., Widynsky, N.: Using connected operators to manipulate image components. Report, LRDE Seminar (July 2005)"},{"key":"21_CR10","unstructured":"Meijster, A.: Efficient Sequential and Parallel Algorithms for Morphological Image Processing. PhD thesis, Rijksuniversiteit Groningen"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Berger, C., Geraud, T., Levillain, R., Widynski, N., Baillard, A., Bertin, E.: Image Processing. In: IEEE International Conference on ICIP 2007, September 16 -October 19, vol.\u00a04, IV - 41\u2013 IV - 44 (2007)","DOI":"10.1109\/ICIP.2007.4379949"},{"key":"21_CR12","unstructured":"Deloison, B.: Recherche et d\u00e9veloppement en traitement d\u2019image: Utilisation de l\u2019arbre des composantes pour la fusion d\u2019images. Report from graduate project, ESIEE Paris (June 2007)"},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.comgeo.2004.05.002","volume":"30","author":"Y.-J. Chiang","year":"2005","unstructured":"Chiang, Y.-J., Lenz, T., Lu, X., Rote, G.: Simple and optimal output sensitive construction of contour trees using monotone paths. Comp. Geometry: Theory and Applications\u00a030(2), 165\u2013195 (2005)","journal-title":"Comp. Geometry: Theory and Applications"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-44438-6_32","volume-title":"Discrete Geometry for Computer Imagery","author":"J. Mattes","year":"2000","unstructured":"Mattes, J., Demongeot, J.: Efficient algorithms to implement the confinement tree. In: Nystr\u00f6m, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol.\u00a01953, pp. 392\u2013405. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Advanced Concepts for Intelligent Vision Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88458-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T11:01:56Z","timestamp":1738407716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88458-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540884576","9783540884583"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88458-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}