This paper presents a new hybrid scheme for image data compression using quadtree decomposition and parametric line fitting. In the first phase of encoding, the input image is partitioned into quadrants using quadtree decomposition. To prevent from very small quadrants, a constraint of minimal block size is imposed during quadtree decomposition. Homogeneous quadrants are separated from non-homo...

Digital elevation models (DEM) are an essential component of many geographic information systems (GIS), especially in natural resources applications. Recently, a number of prototype geographic information systems based on quadtrees have been developed. Digital elevation data create special problems for quadtree systems, since neighboring grid cells seldom have identical values. In this paper, w...

This paper presents a motion estimation algorithm based on a new multiresolution representation, the quadtree spline. This representation describes the motion field as a collection of smoothly connected patches of varying size, where the patch size is automatically adapted to the complexity of the underlying motion. The topology of the patches is determined by a quadtree data structure, and bot...

We give a closed-form expression for the average number of n-dimensional quadtree nodes (`pieces' or`blocks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula includes as special cases the formulae of previous eeorts for 2-dimensional spaces 8]. It also agrees with theoretical and empirical results that the number of blocks depends on the hyper-surface of the hype...

We give a closed-form expression for the average number of n-dimensional quadtree nodes (`pieces' or`blocks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula includes as special cases the formulae of previous eeorts for 2-dimensional spaces 8]. It also agrees with theoretical and empirical results that the number of blocks depends on the hyper-surface of the hype...

The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in which each node has four descendants. Since most algorithms based on quadtrees require complex navigation between nodes, efficient traversal methods as well as efficient storage techniques are of great interest. In this pa...

A hybrid of wavelet and quadtree image coding is introduced. It uses a recently developed quadtree predictive coding technique, having good rate/fidelity performance and very low complexity, to encode the baseband wavelet coefficients. The resulting quadtree decomposition of the baseband is then used to guide the encoding of higher frequency subbands, by indicating which of their coefficients r...

This paper presents a motion estimation algorithm based on a new multiresolution representation, the quadtree spline. This representation describes the motion field as a collection of smoothly connected patches of varying size, where the patch size is automatically adapted to the complexity of the underlying motion. The topology of the patches is determined by a quadtree data structure, and bot...

We give a closed-form expression for the average number of n-dimensional quadtree nodes (`pieces' or`blocks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula includes as special cases the formulae of previous eeorts for 2-dimensional spaces 8]. It also agrees with theoretical and empirical results that the number of blocks depends on the hyper-surface of the hype...

This paper presents the hardware architecture for fractal image compression (FIC) with quadtree partitioning. Fractal image coding with quadtree partitioning allows one to produce higher quality of image. Processing image areas of different complexity with image blocks of varying size enables proper exploration of image details. Additionally, exploiting parallelism present within the algorithm ...