0
2.7kviews
Explain the principle of the following image data compression schemes with suitable examples:

(i) Run length coding (ii) Linear predictive coding

1 Answer
0
28views

(i) Run-length coding (RLC) is effective when long sequences of the same symbol occur. Run-length coding exploits the spatial redundancy by coding the number of symbols in a run. The term run is used to indicate the repetition of a symbol, while the term run-length is used to represent the no of repeated symbols. Run-length coding maps a sequence of numbers into a sequence of symbol pairs. Images with large areas of constant shade are good candidates for this kind of compression. Run-length coding can be classified into (i) 1D run-length coding and (ii) 2D run-length coding.

enter image description here<\center>

The first row of the image has 15 grey values.

enter image description here<\center>

The first code specifies the grey value, followed by the length of the run. Hence the RLE of the first row is simply.

2 3 5 8 6 4

As is evident, run length encoding achieves considerable compaction in images which have a fairly constant background. The RLE eliminates Interpixel redundancies. The runlength encoding also has a serious problem. At times, the RLE doubles the size of file.

(ii) Linear predictive coding :

enter image description here<\center>

A strong correlation exists between pixels spatially located in proximity in any given image. Predictive coding exploits this correlation by trying to predict the pixel to be encoded. This predictive is made on the basis of previously transmitted pixel values in the encoded form. Once nit is done, only the prediction error is transmitted. Predictive coding is also called Differential Pulse Code Modulation (DPCM). The philosophy underlying predictive coding is to remove mutual redundancies between successive pixels and encode only the new information. Consider the image fn and let fn be the values of the reproduced image. When fn arrives a quantity fn1, an estimate of fn is predicted from the decoded samples fn-1,fn-2............i.e.

Fn=Ψ{ fn-1,fn-2.....................}

Where Ψ is the prediction rule which is set right in the beginning. From the above diagram,

En ▲ fn - fn

The coding process continues in a recursive manner. This is what Differential Pulse Code Modulation (DPCM) is all about. In this, the coder has to calculate teh replaced sequence fn. The decoder is imply the predictive loop from the coder.

Rewriting the equation as,

Fn= fn + en

Subtracting equation we get,

δ fn= fn- fn = en – en = qn

This simply means that the error in the input sequence is equal to the quantized error in en i.e. qn.

Please log in to add an answer.