BY: B.

Ashish Eshan Shailendra Hans Mohan

.

The influence and impact of digital images on modern society, science and technology is tremendous. Hence, image processing systems have become such a critical component in contemporary science that many tasks would be incomplete or unattainable without it.
2

Introduction to Digital Image processing:

DIP refers to science of processing digital images by means of a digital computer. It consists of a collection of techniques for the manipulation of digital images by computers. From computer science perspective, image processing is any form of signal processing for which: The input is an image, such as a photograph or video frame; The output of image processing may be either an image or, a set of characteristics or parameters related to the image.

BLOCK DIAGRAM OF A SIMPLE IMAGE PROCESSING SYSTEM

INPUT IMAGES

OPTICAL
SIGNALS

GARBAGE IN IMAGING DEVICE

BINARY SIGNAL 0s&1s PROCESSED IMAGE GOLD OUT

USER

COMPUTER + IMAGE PROCESSING SOFTWARE

Need for processing of images:

Improvement of pictorial interpretation for human interpretation. Processing of image data for storage and transmission. Representation for autonomous machines. perception.

Images

But life is short and information endless.. Abbreviation is a necessary evil and the abbreviators business Is to make the best of a job which, Although intrinsically bad , is still better than nothing. - Aldous Huxley
6

NEED FOR IMAGE COMPRESSION

Efficient Data storage and data transmission..
1 second uncompressed video(CIR601 format) needs 20MB. Imagine memory required for storing a movie!!!!!

2minutes of uncompressed CD quality music (44100 samples per second) requires 84 million bits. Think of the time required to download songs from websites at these rates!!!!

FUZZY TRANSFORM (FTR) APPROACH FOR IMAGE COMPRESSION/DECOMPRESSION

m n
8

FUZZY TRANSFORMS(mathematical preliminaries)

If [a,b] be a closed interval and n u 2; , then x1 , x2 , - , xn [a, b], be points of [a,b], called nodes, such that x1 ! a x2 xn ! b ; We say that an assigned family of fuzzy sets

A1 , A2 ,- , An : [a, b] p [0,1] is a fuzzy partition of [a,b].

Ai ( xi ) ! 1  i ! 1, 2,K , n; Ai ( x) ! 0 , if x0 ! x1 ! a, and xn 1 ! xn ! b;
Fuzzy Partition A1 , A2 , - , An : [a, b] p [0,1] Fuzzy Partition B1 , B2 ,K , Bm :[c, d ] p [0,1]
9

ALGORITHM USED FOR COMPRESSION/RECONSTRUCTION OF IMAGE

INPUT IMAGE
FUZZY MATRIX DIVIDED INTO SUBMATRICES (square blocks)

VALUE OF PIXELS NORMALIZED

BLOCKS RECOMPOSED FOR RECONSTRUCTION OF IMAGE

BLOCKS DECOMPRESSED BY INVERSE FUZZY TRANSFORMS

EACH BLOCK COMPRESSED BY DISCREET FUZZY TRANSFORM (2 variables)

CALCCULATIO N OF ERRORS

OUTPUT IMAGE

10

MATHEMATICAL ACTUATION
STEP 1: If R be a grey image of (N XM) pixels. It is seen as a fuzzy relation R(i,j) R(i,j) : {1, . . . ,N} X{1, . . . ,M} [0, 1], 1],

R(i, j) being the normalized value of the pixel P(i, j), R(i P(i j)/255 ie. R(i, j) = P(i, j)/255 STEP 2 : The image R of sizes (N X M) pixels is divided in sub matrices R of sizes N(B) X M(B) pixels, called as blocks.
11

MATHEMATICAL ACTUATION (contd) contd)

STEP 3 : Each block is compressed to a size of n(B) X m(B) using the formula for discreet fuzzy transform.
M N i j

f ( p , q
Fkl
j 1 i 1 M N k j 1 i 1

) Ak ( pi ) Bl (q j )
i l j

A ( p ) B (q
k ! 1, 2,K , n,
l ! 1, 2,K , m.
Size of compressed image = (n X m)

12

MATHEMATICAL ACTUATION (contd) contd)

STEP 4 : Decompression of the blocks using inverse discreet fuzzy transform using the given formula.
n m kl

Rij

F
k 1 l 1

A k (i) Bl ( j )

i ! 1,K , N and j ! 1, K , M . Size of decompressed image ( N v M Pixels)

STEP 5 : The reconstructed image is obtained from the recomposition of the individual blocks .
13

RMSE , PSNR AND COMPRESSION RATIO

The Root Mean Squared Error is the mean of the squares of the differences between the values of pixels in two images.
N M

( R (i, j )  R RMSE
i 1 j 1

F NM

(i, j ))

N vM

Peak Signal to Noise Ratio (PSNR)

PSNR ! 20 log10 (b / RMSE )

b = peak value for a pixel, typically 255 (8 bit pixels). Compression Rate (CR) is the ratio of the size of matrix, of compressed image (n x m) to size of the matrix of original image (N x M), ie:- (n v m) / ( N v M )
14

Examples - RGB Image (Mandrill)

Original Image : Mandrill 256 x 256 Pixels

15

Compressed Mandrill 180 x 180 pixels C.R.:0.49438

Reconstructed Mandrill 256 x 256 pixels RMSE: 8.6921 PSNR: 29.3483

16

Compressed Mandrill 120 x 120 pixels C.R.= Rate:- 0.21972

Reconstructed Mandrill 256 x 256 pixels RMSE: 11.5267 PSNR: 26.8967

17

Compressed Mandrill 100 x 100 pixels C.R.= Rate:0.1526

Reconstructed Mandrill 256 x 256 pixels RMSE: 17.7250 PSNR: 23.1591

18

Compressed Mandrill 50 x 50 pixels C.R.= Rate:0.0381

Reconstructed Mandrill 256 x 256 pixels RMSE: 21.4868 PSNR: 21.4874

19

GRAPHS

RMSE vs C.R.

PSNR vs C.R.

20

CONCLUSION AND FUTURE CHALLANGES

There is generalized information theory which is a hybrid of possibility and probability theory. Information is defined and measured by reduction in uncertainty. -Chairman, Advisory committee on Education, Dayalbagh
21

22