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
Lossless image compression using a simple prediction method
โ Scribed by Kenneth M. Dawson-Howe
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 402 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0899-9457
No coin nor oath required. For personal study only.
โฆ Synopsis
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 the current point is predicted as a weighted average of the preceding neighbouring points. The weights for this mask are encoded within the compressed image. The difference between this prediction and the actual value is generally small with a symmetric exponential distribution, and this difference is represented using arithmetic encoding.
๐ SIMILAR VOLUMES
The DCT has long been used as a method for image two-dimensional images based on the discrete cosine transform (DCT) is proposed. This method quantizes the high-energy coding and has now become the standard for video coding DCT coefficients in each block, finds an inverse DCT from [2]. Its energy co
digital image compression method based on a VQ coding technique is presented in this paper. Genetic algorithm is used to generate a good global optimal codebook. In the genetic algorithm, it is proposed that movable genes be used to improve the computing eect of the algorithm. Both the encoding and