Pyramid data structures for on-line image progressive transmission

Pyramid data structures are considered to be an important class of such image representations. A pyramid consists of several levels of reduced-sized image each correspond to successive approximation of the original image. This structure is very suitable for progressive transmission and requires relatively low computations. The computation is local and the same procedure is iterated to build each pyramidal level from its predecessors. Progressive transmission will be achieved by sending the pyramid starting from top level (low resolution) to the bottom level (high resolution). In this paper, we introduce a new algorithm for pyramid data structure generation. This new algorithm is based on the subsampling approach rather than the averaging approach. The resulting structure requires minimal time to be generated. >