𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast Image Compression by Quadtree Prediction

✍ Scribed by J. Teuhola

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
298 KB
Volume
4
Category
Article
ISSN
1077-2014

No coin nor oath required. For personal study only.

✦ Synopsis

Fast Image Compression by Quadtree Prediction*

fast and space-efficient lossy compression method for gray-scale images is presented. It is based on predicting the gray level of leaf blocks in a quadtee representation of the image.

AThe implementation is a tailored combination of decomposition, prediction, quantization, coding and smoothing techniques. Although distinct steps of the method are well-known in the literature, we adjust and assemble them in a new way. The results for test images show that, in terms of mean square of errors (MSE), our method is competitive with JPEG for a large range of bitrates. Speed was an important objective in developing the method: encoding is clearly faster than JPEG, except for very high bitrates. Decoding is always faster than JPEG, for lower bit-rates even twice as fast. Quadtree decomposition brings on a visual blocking effect, which is eliminated by applying interpolation to the boundaries of large blocks in decoding.

πŸ“œ SIMILAR VOLUMES

Lossless image compression using a simpl
Lossless image compression using a simple prediction method
✍ Kenneth M. Dawson-Howe πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 402 KB

This article describes a new straightforward technique for lossless image compression, entitled simple prediction method, which results in compression ratios similar to those achieved by the most powerful techniques described in the literature. The predictive model used by the method is one in which

Lossless Image Compression Using Predict
Lossless Image Compression Using Predictive Codebooks
✍ Giridhar Mandyam; Nasir Ahmed; Neeraj Magotra πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 366 KB

This paper describes a method for lossless image compression where relative pixel values of prediction regions in a set of training images are stored as a codebook. In order to achieve decorrelation of the pixels comprising an image, each pixel's prediction neighborhood is assigned to a neighborhood

Distortion Minimization with Fast Local
Distortion Minimization with Fast Local Search for Fractal Image Compression
✍ Raouf Hamzaoui; Dietmar Saupe; Michael Hiller πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 300 KB

Optimal fractal image coding is an NP-hard combinatorial optimization problem, which consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Current fractal image schemes are based on a greedy suboptimal algorithm known as col

Fast Computation of Moments on Compresse
Fast Computation of Moments on Compressed Grey Images using Block Representation
✍ Kuo-Liang Chung; Wen-Ming Yan; Zhi-Hor Liao πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 184 KB

Fast Computation of Moments on Compressed Grey Images using Block Representation I n image processing, moments are useful tools for analyzing shapes. Suppose that the input grey image with size N Γ‚ N has been compressed into the compressed image using the block representation, where the number of bl

Image compression by orthogonal decompos
Image compression by orthogonal decomposition using cellular neural network chips
✍ SzirΓ‘nyi, TamΓ‘a; CzΓΊni, LΓ‘szlΓ³ πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 961 KB

In the paper a new hardware architecture for the implementation of a high-speed, low bit-rate image coding system is outlined. Our proposed algorithm is based on the Cellular Neural/Nonlinear Network (CNN) chip-set. A simple and fast method is introduced to generate basis functions of two-dimensiona