{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:31Z","timestamp":1740122671285,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T00:00:00Z","timestamp":1561680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T00:00:00Z","timestamp":1561680000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001655","name":"Deutscher Akademischer Austauschdienst","doi-asserted-by":"publisher","award":["91510664"],"award-info":[{"award-number":["91510664"]}],"id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["SPP 1423"],"award-info":[{"award-number":["SPP 1423"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10851-019-00891-2","type":"journal-article","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T09:04:35Z","timestamp":1561712675000},"page":"1112-1134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Comparative Study and Proof of Single-Pass Connected Components Algorithms"],"prefix":"10.1007","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8286-7000","authenticated-orcid":false,"given":"Michael J.","family":"Klaiber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1025-3680","authenticated-orcid":false,"given":"Donald G.","family":"Bailey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,28]]},"reference":[{"key":"891_CR1","unstructured":"Bailey, D., Johnston, C.: Single pass connected components analysis. In: Image and Vision Computing New Zealand, pp. 282\u2013287 (2007)"},{"key":"891_CR2","unstructured":"Bailey, D.G.: Raster based region growing. In: 6th New Zealand Image Processing Workshop, pp. 21\u201326 (1991)"},{"key":"891_CR3","unstructured":"Cabaret, L., Lacassagne, L.: What is the world\u2019s fastest connected component labeling algorithm? In: International Workshop on Signal Processing Systems, pp. 1\u20136 (2014). 10.1109\/SiPS.2014.6986069"},{"key":"891_CR4","unstructured":"Cabaret, L., Lacassagne, L., Oudni, L.: A review of world\u2019s fastest connected component labeling algorithms: speed and energy estimation. In: Conference on Design and Architectures for Signal and Image Processing (DASIP), pp. 1\u20136 (2014). 10.1109\/DASIP.2014.7115641"},{"issue":"2","key":"891_CR5","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.cviu.2003.09.002","volume":"93","author":"F Chang","year":"2004","unstructured":"Chang, F., Chen, C.J., Lu, C.J.: A linear-time component-labeling algorithm using contour tracing technique. Comput. Vis. Image Underst. 93(2), 206\u2013220 (2004). \n                    https:\/\/doi.org\/10.1016\/j.cviu.2003.09.002","journal-title":"Comput. Vis. Image Underst."},{"issue":"12","key":"891_CR6","doi-asserted-by":"publisher","first-page":"3222","DOI":"10.1109\/TIP.2010.2052826","volume":"19","author":"J De Bock","year":"2010","unstructured":"De Bock, J., Philips, W.: Fast and memory efficient 2-D connected components using linked lists of line segments. IEEE Trans. Image Process. 19(12), 3222\u20133231 (2010). \n                    https:\/\/doi.org\/10.1109\/TIP.2010.2052826","journal-title":"IEEE Trans. Image Process."},{"key":"891_CR7","unstructured":"Di\u00a0Stefano, L., Bulgarelli, A.: A simple and efficient connected components labeling algorithm. In: International Conference on Image Analysis and Processing, pp. 322\u2013327 (1999). 10.1109\/ICIAP.1999.797615"},{"issue":"2","key":"891_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/128749.128750","volume":"39","author":"MB Dillencourt","year":"1992","unstructured":"Dillencourt, M.B., Samet, H., Tamminen, M.: A general approach to connected-component labeling for arbitrary image representations. J. ACM 39(2), 253\u2013280 (1992). \n                    https:\/\/doi.org\/10.1145\/128749.128750","journal-title":"J. ACM"},{"issue":"2","key":"891_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(94)00262-2","volume":"154","author":"C Fiorio","year":"1996","unstructured":"Fiorio, C., Gustedt, J.: Two linear time union-find strategies for image processing. Theor. Comput. Sci. 154(2), 165\u2013181 (1996). \n                    https:\/\/doi.org\/10.1016\/0304-3975(94)00262-2","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"891_CR10","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1109\/TIP.2010.2044963","volume":"19","author":"C Grana","year":"2010","unstructured":"Grana, C., Borghesani, D., Cucchiara, R.: Optimized block-based connected components labeling with decision trees. IEEE Trans. Image Process. 19(6), 1596\u20131609 (2010). \n                    https:\/\/doi.org\/10.1109\/TIP.2010.2044963","journal-title":"IEEE Trans. Image Process."},{"issue":"9","key":"891_CR11","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1109\/TIP.2015.2425540","volume":"24","author":"L He","year":"2015","unstructured":"He, L., Chao, Y.: A very fast algorithm for simultaneously performing connected-component labeling and Euler number computing. IEEE Trans. Image Process. 24(9), 2725\u20132735 (2015). \n                    https:\/\/doi.org\/10.1109\/TIP.2015.2425540","journal-title":"IEEE Trans. Image Process."},{"issue":"5","key":"891_CR12","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/TIP.2008.919369","volume":"17","author":"L He","year":"2008","unstructured":"He, L., Chao, Y., Suzuki, K.: A run-based two-scan labeling algorithm. IEEE Trans. Image Process. 17(5), 749\u2013756 (2008). \n                    https:\/\/doi.org\/10.1109\/TIP.2008.919369","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"891_CR13","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218001410008032","volume":"24","author":"L He","year":"2010","unstructured":"He, L., Chao, Y., Suzuki, K.: A run-based one-and-a-half-scan connected-component labeling algorithm. Int. J. Pattern Recognit. Artif. Intell. 24(4), 557\u2013579 (2010). \n                    https:\/\/doi.org\/10.1142\/S0218001410008032","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"9","key":"891_CR14","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1016\/j.patcog.2008.10.013","volume":"42","author":"L He","year":"2009","unstructured":"He, L., Chao, Y., Suzuki, K., Wu, K.: Fast connected-component labeling. Pattern Recognit. 42(9), 1977\u20131987 (2009). \n                    https:\/\/doi.org\/10.1016\/j.patcog.2008.10.013","journal-title":"Pattern Recognit."},{"issue":"4","key":"891_CR15","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1137\/0202024","volume":"2","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Ullman, J.: Set merging algorithms. SIAM J. Comput. 2(4), 294\u2013303 (1973). \n                    https:\/\/doi.org\/10.1137\/0202024","journal-title":"SIAM J. Comput."},{"issue":"2","key":"891_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11265-015-1048-7","volume":"84","author":"Jw Jeong","year":"2016","unstructured":"Jeong, Jw, Lee, Gb, Lee, Mj, Kim, J.G.: A single-pass connected component labeler without label merging period. J. Signal Process. Syst. 84(2), 211\u2013223 (2016). \n                    https:\/\/doi.org\/10.1007\/s11265-015-1048-7","journal-title":"J. Signal Process. Syst."},{"issue":"8","key":"891_CR17","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0262-8856(02)00044-6","volume":"20","author":"V Khanna","year":"2002","unstructured":"Khanna, V., Gupta, P., Hwang, C.: Finding connected components in digital images by aggressive reuse of labels. Image Vis. Comput. 20(8), 557\u2013568 (2002). \n                    https:\/\/doi.org\/10.1016\/S0262-8856(02)00044-6","journal-title":"Image Vis. Comput."},{"issue":"7","key":"891_CR18","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1109\/TCSVT.2015.2450371","volume":"26","author":"MJ Klaiber","year":"2016","unstructured":"Klaiber, M.J., Bailey, D.G., Baroud, Y.O., Simon, S.: A resource-efficient hardware architecture for connected components analysis. IEEE Trans. Circuits Syst. Video Technol. 26(7), 1334\u20131349 (2016). \n                    https:\/\/doi.org\/10.1109\/TCSVT.2015.2450371","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"issue":"2","key":"891_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s11554-009-0134-0","volume":"6","author":"L Lacassagne","year":"2011","unstructured":"Lacassagne, L., Zavidovique, B.: Light speed labeling: efficient connected component labeling on RISC architectures. J. Real Time Image Process. 6(2), 117\u2013135 (2011). \n                    https:\/\/doi.org\/10.1007\/s11554-009-0134-0","journal-title":"J. Real Time Image Process."},{"key":"891_CR20","unstructured":"Ling, L., Chen, Z., Li, S., Zhang, X.: FPGA-based connected components analysis algorithm without equivalence-tables. In: Huang, Y., Wu, H., Liu, H., Yin, Z. (eds.) 10th International Conference on Intelligent Robotics and Applications (ICIRA 2017), vol. LNAI 10463, Springer International Publishing, pp. 543\u2013553 (2017). 10.1007\/978-3-319-65292-4\\_47"},{"issue":"2","key":"891_CR21","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0734-189X(83)90071-3","volume":"22","author":"R Lumia","year":"1983","unstructured":"Lumia, R., Shapiro, L., Zuniga, O.: A new connected components algorithm for virtual memory computers. Comput. Vis. Gr. Image Process. 22(2), 287\u2013300 (1983). \n                    https:\/\/doi.org\/10.1016\/0734-189X(83)90071-3","journal-title":"Comput. Vis. Gr. Image Process."},{"key":"891_CR22","unstructured":"Ma, N., Bailey, D., Johnston, C.: Optimised single pass connected components analysis. In: International Conference on Field Programmable Technology, pp. 185\u2013192 (2008). 10.1109\/FPT.2008.4762382"},{"key":"891_CR23","unstructured":"Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: 8th International Conference on Computer Vision, vol.\u00a02, pp. 416\u2013423 (2001). 10.1109\/ICCV.2001.937655"},{"key":"891_CR24","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox, chap.\u00a02, Springer, p.\u00a052 (2008)"},{"issue":"1","key":"891_CR25","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/TSMC.1979.4310076","volume":"9","author":"N Otsu","year":"1979","unstructured":"Otsu, N.: A threshold selection method from gray-level histograms. IEEE Trans. Syst. Man Cybern. 9(1), 62\u201366 (1979). \n                    https:\/\/doi.org\/10.1109\/TSMC.1979.4310076","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"4","key":"891_CR26","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/321356.321357","volume":"13","author":"A Rosenfeld","year":"1966","unstructured":"Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. J. ACM 13(4), 471\u2013494 (1966). \n                    https:\/\/doi.org\/10.1145\/321356.321357","journal-title":"J. ACM"},{"key":"891_CR27","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick, R., Wayne, K.: Algorithms, 4th edn. Addison-Wesley, Boston (2011)","edition":"4"},{"issue":"1","key":"891_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1077-3142(02)00030-9","volume":"89","author":"K Suzuki","year":"2003","unstructured":"Suzuki, K., Horiba, I., Sugie, N.: Linear-time connected-component labeling based on sequential local operations. Comput. Vis. Image Underst. 89(1), 1\u201323 (2003). \n                    https:\/\/doi.org\/10.1016\/S1077-3142(02)00030-9","journal-title":"Comput. Vis. Image Underst."},{"key":"891_CR29","unstructured":"Tarjan, R.: Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (1983)"},{"issue":"2","key":"891_CR30","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R Tarjan","year":"1984","unstructured":"Tarjan, R., van Leeuwen, J.: Worst-case analysis of set union algorithms. J. ACM 31(2), 245\u2013281 (1984). \n                    https:\/\/doi.org\/10.1145\/62.2160","journal-title":"J. ACM"},{"issue":"2","key":"891_CR31","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215\u2013225 (1975). \n                    https:\/\/doi.org\/10.1145\/321879.321884","journal-title":"J. ACM"},{"key":"891_CR32","unstructured":"Trein, J., Schwarzbacher, A.T., Hoppe, B., Noffz, K.H., Trenschel, T.: Development of a FPGA based real-time blob analysis circuit. In: Irish Signals and Systems Conference, pp. 121\u2013126 (2007)"},{"key":"891_CR33","unstructured":"USC-SIPI: USC-SIPI image database. \n                    http:\/\/sipi.usc.edu\/database\/"},{"key":"891_CR34","unstructured":"Wu, K., Otoo, E., Shoshani, A.: Optimizing connected component labeling algorithms. In: Medical Imaging, vol. SPIE 5747, International Society for Optics and Photonics, pp. 1965\u20131976 (2005). 10.1117\/12.596105"},{"issue":"2","key":"891_CR35","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10044-008-0109-y","volume":"12","author":"K Wu","year":"2009","unstructured":"Wu, K., Otoo, E., Suzuki, K.: Optimizing two-pass connected-component labeling algorithms. Pattern Anal. Appl. 12(2), 117\u2013135 (2009). \n                    https:\/\/doi.org\/10.1007\/s10044-008-0109-y","journal-title":"Pattern Anal. Appl."}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-019-00891-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10851-019-00891-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-019-00891-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T02:47:59Z","timestamp":1593226079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10851-019-00891-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,28]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["891"],"URL":"https:\/\/doi.org\/10.1007\/s10851-019-00891-2","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"type":"print","value":"0924-9907"},{"type":"electronic","value":"1573-7683"}],"subject":[],"published":{"date-parts":[[2019,6,28]]},"assertion":[{"value":"15 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}