A number of data structures for representing images by quadtrees without pointers are discussed. The image is treated as a collection of leaf nodes. Each leaf node is represented by use of a locational code corresponding to a sequence of directional codes that locate the leaf along a path from the root of the tree. Somewhat related is the concept of a forest which is a representation that consi...

With the rapid advancement of simultaneous localization and mapping (SLAM) technology, collaboration several autonomous underwater vehicles (AUVs) in large-scale seafloor imaging has become a trending topic. Electromagnetic waves are difficult to transfer underwater, only viable method communication is acoustic transmission, but its bandwidth limited. Therefore, how compress process multibeam b...

It is shown that the depth of the last node inserted in a random quad tree constructed from independent uniform [Q, 11d random vectors is in probability asymptotic to (2/d) log n, where log denotes the natural logarithm. In addition, for d =2, exact values are obtained for all the moments of the depth of the last node .

We propose a large scale terrain adaptive compression method with high compression rate in this paper by using integer wavelet transform combined with restricted quadtree triangulation based on the terrain variation characteristic. By taking advantage of the efficient computing and multi-resolution attributes of our algorithm, we can decompress the wavelet coefficients which indicate the terrai...

A novel image coding scheme using wavelet transform is presented. The developed coding scheme prevents undesirable classifications of wavelet coefficients which arise from conventional quadtree based image coding. This is accomplished by pre-processing the wavelet coefficients. This pre-processing is based statistical distributions of the wavelet coefficients in subbands and the human visual sy...

Mean shape-gain vector quantization (MSGVQ) is extended to include negative gains and square isometries. Square isometries together with a classi cation technique based on average block intensities enable us to enlarge the MSGVQ codebook size without any additional storage requirements while keeping the complexity of both the codebook generation and the encoding manageable. Variable rate codes ...

Dynamic attributes are attributes that change continuously over time making it impractical to issue explicit updates for every change. In this paper, we adapt a variant of the quadtree structure to solve the problem of indexing dynamic attributes. The approach is based on the key idea of using a linear function of time for each dynamic attribute that allows us to predict its value in the future...