Digital Repository

Quadtree representation and compression of spatial data

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Yin, Xiang en_US
dc.date.accessioned 2010-03-09T20:23:04Z
dc.date.available 2010-03-09T20:23:04Z
dc.date.issued 2010-03-09T20:23:04Z
dc.identifier.uri http://hdl.handle.net/10464/2952
dc.description.abstract Spatial data representation and compression has become a focus issue in computer graphics and image processing applications. Quadtrees, as one of hierarchical data structures, basing on the principle of recursive decomposition of space, always offer a compact and efficient representation of an image. For a given image, the choice of quadtree root node plays an important role in its quadtree representation and final data compression. The goal of this thesis is to present a heuristic algorithm for finding a root node of a region quadtree, which is able to reduce the number of leaf nodes when compared with the standard quadtree decomposition. The empirical results indicate that, this proposed algorithm has quadtree representation and data compression improvement when in comparison with the traditional method. en_US
dc.language.iso eng en_US
dc.publisher Brock University en_US
dc.subject Spatial data infrastructures en_US
dc.subject Computer algorithms en_US
dc.title Quadtree representation and compression of spatial data en_US
dc.type Electronic Thesis or Dissertation en_US
dc.degree.name M.Sc. Computer Science en_US
dc.degree.level Masters en_US
dc.contributor.department Department of Computer Science en_US
dc.degree.discipline Faculty of Mathematics and Science en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search The Repository


Browse

My Account

Statistics


About the Digital Repository