Show simple item record

dc.contributor.authorShaffer, Clifford A.en_US
dc.contributor.authorJuvvadi, Ramanaen_US
dc.contributor.authorHeath, Lenwood S.en_US
dc.date.accessioned2013-06-19T14:36:07Z
dc.date.available2013-06-19T14:36:07Z
dc.date.issued1989
dc.identifierhttp://eprints.cs.vt.edu/archive/00000160/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19550
dc.description.abstractThe quadtree and bintree data structures are two variants on the principle of hierarchical regular decomposition applied to image representation. A comparison of the storage requirements for images represented by these two methods is presented. The relative storage efficiency of quadtrees and bintrees is determined by two factors: the relative mode size for the two representations as determined by the data structure implementation, and the number of quadtree leaf node pairs that merge to form a single leaf node after conversion to the bintree representation. The merging probability is analyzed, and found to be close to 0.5 for most images. The resulting storage efficiency for a number for representative implementations is discussed. Each of the data structures has implementations (and associated applications) for which it is more space efficient.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleA Generalized Comparison of Quadtree and Bintree Storage Requirementsen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-89-23en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000160/01/TR-89-23.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record