完整后设资料纪录
DC 栏位语言
dc.contributor.authorChen, Zen_US
dc.contributor.authorChen, IPen_US
dc.date.accessioned2014-12-08T15:43:54Z-
dc.date.available2014-12-08T15:43:54Z-
dc.date.issued2001-05-01en_US
dc.identifier.issn0262-8856en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0262-8856(00)00080-9en_US
dc.identifier.urihttp://hdl.handle.net/11536/29679-
dc.description.abstractWe present a simple recursive method for converting a chain code into a quadtree. We generate the quadtree black nodes level by level, starting from the finest resolution (i.e. the bottom) level toward the coarsest resolution (i.e. the top) level. Meanwhile, at each resolution level a new object border is revealed after the removal of the black nodes. The chain code elements for this new object border can be easily generated. Thus, the quadtree black nodes and the chain code elements of the new object border are generated side by side and their generations constitute a basic cycle of the conversion process. We show the generations can be done with the aid of a lookup table. Finally, we compare our method with the existing two-phase methods exemplified by Samet's method in terms of the total numbers of major operations including node allocations, node color filling, and node pointer linking. It indicates that our method is conceptually simpler and runs faster. (C) 2001 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectchain codeen_US
dc.subjectquadtreeen_US
dc.subjectnode allocationen_US
dc.subjectnode linkingen_US
dc.subjectcolor fillingen_US
dc.subjecttable lookupen_US
dc.titleA simple recursive method for converting a chain code into a quadtree with a lookup tableen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0262-8856(00)00080-9en_US
dc.identifier.journalIMAGE AND VISION COMPUTINGen_US
dc.citation.volume19en_US
dc.citation.issue7en_US
dc.citation.spage413en_US
dc.citation.epage426en_US
dc.contributor.department资讯工程学系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000168228300001-
dc.citation.woscount5-
显示于类别:Articles


Files in This Item:

  1. 000168228300001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.