{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T11:09:16Z","timestamp":1694603356332},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"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":[[1988,11]]},"DOI":"10.1016\/0262-8856(88)90011-x","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"215-224","source":"Crossref","is-referenced-by-count":2,"title":["Boundary matching algorithm for connected component labelling using linear quadtrees"],"prefix":"10.1016","volume":"6","author":[{"given":"Sudhakar","family":"Menon","sequence":"first","affiliation":[]},{"given":"Terence R","family":"Smith","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No 12","key":"10.1016\/0262-8856(88)90011-X_BIB1","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/358728.358741","article-title":"An effective way to represent quadtrees","volume":"Vol 25","author":"Gargantini","year":"1982","journal-title":"Commun. ACM"},{"key":"10.1016\/0262-8856(88)90011-X_BIB2","series-title":"Digital picture processing","author":"Rosenfeld","year":"1982"},{"issue":"No 2","key":"10.1016\/0262-8856(88)90011-X_BIB3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","article-title":"The quadtree and related hierarchical data structures","volume":"Vol 16","author":"Samet","year":"1984","journal-title":"ACM Comput. Surv."},{"issue":"No 1","key":"10.1016\/0262-8856(88)90011-X_BIB4","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0146-664X(80)90118-5","article-title":"Region representation: quadtrees from binary arrays","volume":"Vol 13","author":"Samet","year":"1980","journal-title":"Comput. Vision, Graph. Image Process"},{"issue":"No 1","key":"10.1016\/0262-8856(88)90011-X_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0734-189X(83)90017-8","article-title":"A data structure and algorithm based on a linear key for a rectangle retrieval problem","volume":"Vol 24","author":"Abel","year":"1983","journal-title":"Comput. Vision, Graph. Image Process"},{"issue":"No 1","key":"10.1016\/0262-8856(88)90011-X_BIB6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/TPAMI.1980.4766967","article-title":"On a method of binary picture representation and its application to data compression","volume":"Vol 2","author":"Kawaguchi","year":"1980","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0262-8856(88)90011-X_BIB7","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/322261.322267","article-title":"Connected component labeling using quadtrees","volume":"Vol 28","author":"Samet","year":"1981","journal-title":"J. ACM"},{"issue":"No 1","key":"10.1016\/0262-8856(88)90011-X_BIB8","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/TPAMI.1985.4767622","article-title":"A top-down quadtree traversal algorithm","volume":"Vol 7","author":"Samet","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"No 4","key":"10.1016\/0262-8856(88)90011-X_BIB9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0898-1221(82)90014-1","article-title":"Detection of connectivity for regions represented by linear quadtrees","volume":"Vol 8","author":"Gargantini","year":"1982","journal-title":"Comput. Math. Appl."},{"issue":"No 2","key":"10.1016\/0262-8856(88)90011-X_BIB10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/TPAMI.1985.4767646","article-title":"Computing geometric properties of images represented by linear quadtrees","volume":"Vol 7","author":"Samet","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"No 2","key":"10.1016\/0262-8856(88)90011-X_BIB11","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1093\/comjnl\/30.2.176","article-title":"Connected component labelling using quadtrees \u2014 a bottom-up approach","volume":"Vol 30","author":"Unnikrishnan","year":"1987","journal-title":"Comput. J."},{"issue":"No 2","key":"10.1016\/0262-8856(88)90011-X_BIB12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0898-1221(84)90046-4","article-title":"Comments on Detection of connectivity for regions represented by linear quadtrees","volume":"Vol 10","author":"Abel","year":"1984","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0262-8856(88)90011-X_BIB13","series-title":"Data structures and algorithms","author":"Aho","year":"1983"}],"container-title":["Image and Vision Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:026288568890011X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:026288568890011X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:24:17Z","timestamp":1552613057000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/026288568890011X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["026288568890011X"],"URL":"https:\/\/doi.org\/10.1016\/0262-8856(88)90011-x","relation":{},"ISSN":["0262-8856"],"issn-type":[{"value":"0262-8856","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}