chapter 7, Lossless Predictive Coding

In III Lossless Compression Techniques from: Digital Image Compression Techniques
Author(s): Majid Rabbani , Paul W. Jones
TT07 Cover Image

Chapter Contents

  • 7.1 DPCM Predictor
  • 7.2 Huffman Encoding of Differential Images
  • 7.3 Arithmetic Encoding of Differential Images

Excerpt

For typical images, the values of adjacent pixels are highly correlated; that is, a great deal of information about a pixel value can be obtained by inspecting its neighboring pixel values. This property is exploited in predictive coding techniques where an attempt is made to predict the value of a given pixel based on the values of the surrounding pixels. We first describe a general, but impractical, predictive coding scheme and then discuss modifications that yield a practical scheme.

Consider an image modeled as an mth-order Markov source, where each pixel is represented by k bits and can thus take any one of K( = 2k) possible values. In this model, the value of a given pixel xm depends only on the values of the m previous pixels, x0,x1,…,xm−1. The number of possible combinations of the m previous pixel values is Km, and each combination defines a state of the Markov source. For each state, there is an associated set of K conditional probabilities for the value of the pixel xm, i.e., p(xmxm−1,…,x0), for xm = 0,…,K−1. If these conditional probabilities, along with the stationary state probabilities, are known, the entropy of the mth-order Markov source can be calculated according to Eq. (2.5).

In theory, a lossless predictive coding scheme is capable of encoding an image at a bit rate close to this entropy by employing the following strategy. Given the m previous pixel values, the state of the Markov source is defined and the conditional probabilities for the current pixel value p(xmxm−1,…,x0) for xm = 0,…,K−1 are known. The numbers 0 through K − 1 form a set of K predictions (estimates) for the value of xm given the current state. The prediction that matches the actual value xm is identified and encoded using a variable-length code optimized for the set of conditional probabilities within that state. Since the decoder also has access to the m previous pixels, it can track the state of the Markov source and hence the corresponding codebook. This allows the decoder to decode the encoded information and identify the actual pixel value xm.



©1991 Society of Photo-Optical Instrumentation Engineers
SPIE eBooks are new and may not be included in your library’s collection.

PURCHASE CHAPTER (US$12)

Download PDF
View Items in Cart

BOOK DATA

Print ISBN:

9780819406484

Print ISBN:

0819406481

eISBN:

9780819478528

Publisher:



close