{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:39:13Z","timestamp":1775281153409,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":[[1997,11]]},"DOI":"10.1016\/s0262-8856(97)00031-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:19:26Z","timestamp":1027606766000},"page":"833-843","source":"Crossref","is-referenced-by-count":20,"title":["Compressed quadtree representations for storing similar images"],"prefix":"10.1016","volume":"15","author":[{"given":"Tsong-Wuu","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0262-8856(97)00031-0_BIB1","series-title":"Applications of Spatial Data Structures","author":"Samet","year":"1990"},{"issue":"12","key":"10.1016\/S0262-8856(97)00031-0_BIB2","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/358728.358741","article-title":"An effective way to represent quadtrees","volume":"25","author":"Gargantini","year":"1982","journal-title":"Comm. ACM"},{"issue":"5","key":"10.1016\/S0262-8856(97)00031-0_BIB3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0262-8856(93)90002-X","article-title":"Overlapping quadtrees for the representation of similar images","volume":"11","author":"Vassilakopoulos","year":"1993","journal-title":"Image and Vision Computing"},{"key":"10.1016\/S0262-8856(97)00031-0_BIB4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"Journal of Computer and System Sciences"},{"issue":"7","key":"10.1016\/S0262-8856(97)00031-0_BIB5","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1016\/S0031-3203(97)83108-1","article-title":"Set operations on constant bit-length linear quadtrees","volume":"30","author":"Lin","year":"1997","journal-title":"Pattern Recognition"},{"issue":"4","key":"10.1016\/S0262-8856(97)00031-0_BIB6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0098-3004(92)90077-5","article-title":"SPANS: a quadtree-based GIS","volume":"18","author":"Ebdon","year":"1992","journal-title":"Computer and Geosciences"},{"issue":"2","key":"10.1016\/S0262-8856(97)00031-0_BIB7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","article-title":"The quadtree and related hierarchical data structures","volume":"16","author":"Samet","year":"1984","journal-title":"Computing Survey"},{"key":"10.1016\/S0262-8856(97)00031-0_BIB8","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1093\/comjnl\/29.1.60","article-title":"Quadtrees: storage and scan conversion","volume":"29","author":"Stewart","year":"1986","journal-title":"Computer Journal"},{"key":"10.1016\/S0262-8856(97)00031-0_BIB9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02243773","article-title":"Determination of the 3D border by repeated elimination of internal surfaces","volume":"32","author":"Atkinson","year":"1984","journal-title":"Computing"},{"issue":"1","key":"10.1016\/S0262-8856(97)00031-0_BIB10","first-page":"70","article-title":"Efficiency analysis of overlapped quadtrees","volume":"2","author":"Vassilakopoulos","year":"1995","journal-title":"Nordic Journal of Computing"},{"issue":"4","key":"10.1016\/S0262-8856(97)00031-0_BIB11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1093\/comjnl\/24.4.367","article-title":"Change area B-trees: a technique to aid error recovery","volume":"24","author":"Mullin","year":"1981","journal-title":"Computer Journal"},{"issue":"4","key":"10.1016\/S0262-8856(97)00031-0_BIB12","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1093\/comjnl\/28.4.414","article-title":"Multiple generation text files using overlapping tree structures","volume":"28","author":"Burton","year":"1985","journal-title":"Computer Journal"},{"issue":"3","key":"10.1016\/S0262-8856(97)00031-0_BIB13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1093\/comjnl\/33.3.279","article-title":"Implementation of overlapping B-trees for time and space efficient representation of collections of similar files","volume":"33","author":"Burton","year":"1990","journal-title":"Computer Journal"},{"key":"10.1016\/S0262-8856(97)00031-0_BIB14","series-title":"8th IPPR Confernce on Computer Vision, Graphics and Image Processing","first-page":"122","article-title":"Overlapping representation of similar images using linear quadtree codes","author":"Chang","year":"1995"}],"container-title":["Image and Vision Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0262885697000310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0262885697000310?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T19:27:16Z","timestamp":1556047636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0262885697000310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":14,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0262885697000310"],"URL":"https:\/\/doi.org\/10.1016\/s0262-8856(97)00031-0","relation":{},"ISSN":["0262-8856"],"issn-type":[{"value":"0262-8856","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}