[[abstract]]Based on some observations on quadtrees, this paper first presents two improved representations for the linear quadtree and DF expression.Then,we present three improved representations for the S tree, bincodes, and logical bincodes. Some experiments are carried out to evaluate the performance of the five proposed improved representations and the existing corresponding representations. Experimental results show that all the proposed improved representations have better compression ratios when compared to the existing ones.Especially, the improved representations for the linear quadtree, bincodes, and logical bincodes have some significant compression performance. Finally, a few image manipulations, such as area calculation, centr...
The issue of constructing a computer-searchable image encoding algorithm for complex images and the ...
Quadtrees that represent pictures composed of 2n × 2n pixels, may be economically implemented using ...
Quadtree representation of two-dimensional objects is performed with a tree that describes the recur...
There are numerous hierarchical data structuring techniques in use for representing spatial data. On...
Spatial data representation and compression has become a focus issue in computer graphics and image...
Image representation plays an important role in image processing applications, which usually. contai...
Quadtrees are well known data structures for handling images and image-like objects. They encode an ...
This article gives an overview of different approaches proposed for the storage and manipulation of ...
This chapter is a survey of quadtree uses in the image domain from image representation, to image st...
A forest of quadtrees is a refinement of a quadtree data structure that is used to represent planar ...
The quadtree and bintree data structures are two variants on the principle of hierarchical regular d...
The leaves of a quadtree can be specified by their colour, size, and position in one 32-bit word of ...
In this paper we extend previous work on using bintrees as an efficient representation for qualitati...
Development of quadtree as hierarchical data structuring technique for representing spatial data (li...
Quadtree one of data spatial structures that represents image. This representation is aimed to reduc...
The issue of constructing a computer-searchable image encoding algorithm for complex images and the ...
Quadtrees that represent pictures composed of 2n × 2n pixels, may be economically implemented using ...
Quadtree representation of two-dimensional objects is performed with a tree that describes the recur...
There are numerous hierarchical data structuring techniques in use for representing spatial data. On...
Spatial data representation and compression has become a focus issue in computer graphics and image...
Image representation plays an important role in image processing applications, which usually. contai...
Quadtrees are well known data structures for handling images and image-like objects. They encode an ...
This article gives an overview of different approaches proposed for the storage and manipulation of ...
This chapter is a survey of quadtree uses in the image domain from image representation, to image st...
A forest of quadtrees is a refinement of a quadtree data structure that is used to represent planar ...
The quadtree and bintree data structures are two variants on the principle of hierarchical regular d...
The leaves of a quadtree can be specified by their colour, size, and position in one 32-bit word of ...
In this paper we extend previous work on using bintrees as an efficient representation for qualitati...
Development of quadtree as hierarchical data structuring technique for representing spatial data (li...
Quadtree one of data spatial structures that represents image. This representation is aimed to reduc...
The issue of constructing a computer-searchable image encoding algorithm for complex images and the ...
Quadtrees that represent pictures composed of 2n × 2n pixels, may be economically implemented using ...
Quadtree representation of two-dimensional objects is performed with a tree that describes the recur...