{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:27:25Z","timestamp":1769837245976,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Image and Vision Computing"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0262-8856(02)00044-6","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:09:27Z","timestamp":1034291367000},"page":"557-568","source":"Crossref","is-referenced-by-count":21,"title":["Finding connected components in digital images by aggressive reuse of labels"],"prefix":"10.1016","volume":"20","author":[{"given":"Vikrant","family":"Khanna","sequence":"first","affiliation":[]},{"given":"Phalguni","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"C.J.","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0262-8856(02)00044-6_BIB1","doi-asserted-by":"crossref","unstructured":"Guerra, C., Vision and Image Processing Algorithms and Theory of Computation Handbook, (edited by J.M. Atallah), CRC Press, Boca Raton, 1999.","DOI":"10.1201\/9781420049503-c23"},{"issue":"2","key":"10.1016\/S0262-8856(02)00044-6_BIB2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/128749.128750","article-title":"A general approach to connected-components labeling for arbitrary image representations","volume":"39","author":"Dillencourt","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/S0262-8856(02)00044-6_BIB3","series-title":"Digital Image Processing","author":"Gonzales","year":"1998"},{"key":"10.1016\/S0262-8856(02)00044-6_BIB4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0304-3975(94)00262-2","article-title":"Two linear time union-find strategies for image processing","volume":"154","author":"Gustedt","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0262-8856(02)00044-6_BIB5","article-title":"Volume segmentation of 3-dimensional images","author":"Gustedt","year":"1996","journal-title":"Technical Report 515\/1996"},{"issue":"2","key":"10.1016\/S0262-8856(02)00044-6_BIB6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","article-title":"Worst-case analysis of set union algorithms","volume":"31","author":"Leeuwen","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0262-8856(02)00044-6_BIB7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0734-189X(83)90113-5","article-title":"A new three-dimensional connected components algorithm","volume":"23","author":"Lumia","year":"1983","journal-title":"Computer Vision, Graphics and Image Processing"},{"issue":"4","key":"10.1016\/S0262-8856(02)00044-6_BIB8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/321356.321357","article-title":"Sequential operations in digital picture processing","volume":"12","author":"Pfaltz","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/S0262-8856(02)00044-6_BIB9","series-title":"Introduction to Algorithms","author":"Rivest","year":"1998"},{"key":"10.1016\/S0262-8856(02)00044-6_BIB10","series-title":"Connected Component in Binary Images","author":"Ronse","year":"1984"},{"issue":"3","key":"10.1016\/S0262-8856(02)00044-6_BIB11","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/322261.322267","article-title":"Connected component labeling using quadtrees,","volume":"23","author":"Samet","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0262-8856(02)00044-6_BIB12","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0734-189X(85)90153-7","article-title":"Survey: Image segmentation techniques","volume":"29","author":"Shapiro","year":"1985","journal-title":"Computer Vision, Graphics and Image Processing"},{"issue":"4","key":"10.1016\/S0262-8856(02)00044-6_BIB13","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1109\/34.3918","article-title":"Efficient component labeling of images of arbitrary dimension represented by linear bintrees","volume":"10","author":"Tamminen","year":"1988","journal-title":"IEEE Transaction on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0262-8856(02)00044-6_BIB14","series-title":"An Improved Algorithm for Labeling Connected Components in a Binary Image, CVIP","author":"Yang","year":"1992"},{"key":"10.1016\/S0262-8856(02)00044-6_BIB15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0734-189X(83)90071-3","article-title":"A new connected components algorithm for virtual memory computers","volume":"22","author":"Zuniga","year":"1983","journal-title":"Computer Vision, Graphics and Image Processing"}],"container-title":["Image and Vision Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0262885602000446?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0262885602000446?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:10:22Z","timestamp":1580875822000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0262885602000446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0262885602000446"],"URL":"https:\/\/doi.org\/10.1016\/s0262-8856(02)00044-6","relation":{},"ISSN":["0262-8856"],"issn-type":[{"value":"0262-8856","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}