SPIEDL Logo

chapter 6, Bit Plane Encoding

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

Chapter Contents

  • Introduction
  • 6.1 Gray Code
  • 6.2 Runlength Encoding of Bit Planes
  • 6.3 Arithmetic Encoding of Bit Planes

Excerpt

Consider an N × N image in which each pixel value is represented by k bits. By selecting a single bit from the same position in the binary representation of each pixel, an N × N binary image called a bit plane can be formed [6]. For example, we can select the most significant bit of each pixel value to generate an N × N binary image representing the most significant bit plane. Repeating this process for the other bit positions, the original image can be decomposed into a set of k, N × N bit planes (numbered 0 for the least significant bit (LSB) plane through k − 1 for the most significant bit (MSB) plane). The motivation for this decomposition is that each bit plane can then be encoded efficiently using a lossless binary compression technique. Furthermore, in certain applications, the user may desire a low bit rate approximation to the original image before making the decision to proceed to a lossless mode. Since the more significant bit planes generally contain major structural information and are highly compressible, progressively reconstructing an image using the bit planes can be a viable technique for this purpose. This technique of progressive transmission is discussed in more detail in Chapter 14: Hierarchical Coding under Lossy Compression Techniques.



©1991 Society of Photo-Optical Instrumentation Engineers
Your library does not subscribe to the eBooks portion of the SPIE Digital Library.

PURCHASE CHAPTER ($US12)

Download PDF
View Items in Cart

BOOK DATA

Print ISBN:

9780819406484

Print ISBN:

0819406481

eISBN:

9780819478528

Publisher:



close