www.jntuworld.

com

LCE/7.5.1/RC 01

TEACHING NOTES
Department: ELECTRONICS & COMMUNICATION ENGINEERING Unit: VIII Date: Topic name: Image Compression No. of marks allotted by JNTUK JNTUK: Books referred: 01. Digital Image Processing by R C Gonzalez and R E Woods : 02. www.wikipedia.org 03. www.google.com Image Compression: It is a process that reduces the amount of data required to represent a given quantity of information. The size of the image data files are reduced, while retaining necessary image age information. Various amounts of data can be used to represent the same amount of information. Representations with irrelevant or repeated information contain redundant data. Compression is measured in compression ratio. Denoted by,

For example if the original image is 256 256 pixels, 8-bits per pixel grayscale. This file is 8 bits 65,536 bytes in size. After compression the image file is 6,554 bytes. The compression ratio is, is

This can also be written as 10:1 Relative Data Redundancy: The relative data redundancy, R can be determined as,

This indicates that 90% of its data is redundant. The higher the R value, the more data is redundant and will be compressed. . Compression Methods: There are two types of compression methods. They are Lossless Compression and Lossy Compression. The key in image compression algorithm development is to determine the minimal data required to retain the necessary information. Types of Redundancy: Compression algorithms are developed by taking advantage of the redundancy that is inherent in image data. There are three primary types of redundancy. They are Coding Redundancy Redundancy, Inter-pixel Redundancy and Psycho-visual redundancy. Coding Redundancy: A code is a system of symbols ( (letters, numbers and bits) used to represent a ) body of information. Each piece of information or event is assigned a sequence of code symbols, called a code word. The number of symbols in each code word is its lengt length. Inter-pixel Redundancy: This is also called spatial or geometric or inter-frame redundancy. This lso frame redundancy results from structural or geometric relationships between objects and the image. The adjacent esults pixels are usually highly correlated ( (pixel similar or very close to neighboring pixels), thus information ), is unnecessarily replicated in the representations. Faculty/Date: Page 1 of 4 HOD/Date:

www.jntuworld.com

LCE/7.5.1/RC 01

TEACHING NOTES
Department: ELECTRONICS & COMMUNICATION ENGINEERING Unit: VIII Date: Topic name: Fidelity Criteria No. of marks allotted by JNTUK: JNTUK Books referred: 01. Digital Image Processing by R C Gonzalez and R E Woods : 02. www.wikipedia.org 03. www.google.com Psycho-visual Redundancy: Most intensity arrays contain information that is ignored by the human visual system (which has its limitations) and/or extraneous to the intended use of the image. which limitations) Therefore, they are redundant. This can be eliminated without significant quality loss, lossy significant compression, irreversible compression and quantization. General Image Compression System System: This consists of two parts. They are Compressor and the Decompressor.

Fidelity Criteria: To determine exactly what information is important, and to be able to measure image quality, we need to define image fidelity criteria. The information required is application specific, so the imaging specialist needs to be knowledgeable of the various types and approaches to measu measuring image quality. Fidelity criteria can be divided into two classes. They are objective fidelity criteria and subjective fidelity criteria. The objective fidelity criteria are borrowed from digital signal processing and information theory, and provide us with equations that can be used to measure the amount of error in a processed image by comparison to a known image. We will refer to the processed image as a reconstructed image typically, one that can be created from a compressed data file or by using a usin restoration method. Thus, these measures are only applicable if an original or standard image is available for comparison. Subjective fidelity criteria require the definition of a qualitative scale to assess image quality. This scale can then be used by human test subjects to determine image fidelity. In order to provide y unbiased results, evaluation with subjective measures requires careful selection of the test subjects and carefully designed evaluation experiments. Faculty/Date: Page 2 of 4 HOD/Date:

www.jntuworld.com

LCE/7.5.1/RC 01

TEACHING NOTES
Department: ELECTRONICS & COMMUNICATION ENGINEERING Unit: VIII Date: Topic name: Image Compression Models No. of marks allotted by JNTUK: Error Free Compression Books referred: 01. Digital Image Processing by R C Gonzalez and R E Woods 02. www.wikipedia.org 03. www.google.com Image Compression Models: A general image compression model consists of a source encoder, a channel encoder, the storage or transmission media (also referred to as channel), a channel decoder, and a source decoder. The source encoder reduces or eliminates any redundancies in the input image, which usually leads to bit savings. Source encoding techniques are the primary focus of this discussion. The channel encoder increase noise immunity of source encoders output, usually adding extra bits to achieve its goals. If the channel is noise-free, the channel encoder and decoder may be omitted. At the receivers side, the channel and source decoder perform the opposite functions and ultimately recover (an approximation of) the original image. The main components are: Mapper: It transforms the input data into a (usually non-visual) format designed to reduce inter-pixel redundancies in the input image. This operation is generally reversible and may or may not directly reduce the amount of data required to represent the image. Quantizer: It reduces the accuracy of the mappers output in accordance with some pre-established fidelity criterion. Reduces the psychovisual redundancies of the input image. This operation is not reversible and must be omitted if lossless compression is desired. Symbol (entropy) encoder: Creates a fixed or variable length code to represent the quantizers output and maps the output in accordance with the code. In most cases, a variable-length code is used. This operation is reversible. Error Free Compression: Error-free compression techniques usually rely on entropy-based encoding algorithms. The concept of entropy is mathematically described in the following equation, H(z) = - P(ai) logr P(ai)z Where aj is a symbol produced by the information source P (aj) is the probability of that symbol J is the total number of different symbols H (z) is the entropy of the source. The concept of entropy provides an upper bound on how much compression can be achieved, given the probability distribution of the source. In other words, it establishes a theoretical limit on the amount of lossless compression that can be achieved using entropy encoding techniques alone. Faculty/Date: Page 3 of 4 HOD/Date:

www.jntuworld.com

LCE/7.5.1/RC 01

TEACHING NOTES
Department: ELECTRONICS & COMMUNICATION ENGINEERING Unit: VIII Date: Topic name: Lossy Compression No. of marks allotted by JNTUK: Books referred: 01. Digital Image Processing by R C Gonzalez and R E Woods 02. www.wikipedia.org 03. www.google.com Lossy Compression: A lossy compression method is one where compressing data and then decompressing it retrieves data that is different from the original, but is close enough to be useful in some way. Lossy compression is most commonly used to compress multimedia data (audio, video, still images), especially in applications such as streaming media and internet telephony. By contrast, lossless compression is required for text and data files, such as bank records, text articles, etc. In many cases it is advantageous to make a master lossless file which can then be used to produce compressed files for different purposes; for example a multi-megabyte file can be used at full size to produce a fullpage advertisement in a glossy magazine, and a 10 kilobyte lossy copy made for a small image on a web page.

Faculty/Date: Page 4 of 4

HOD/Date: