ADCT-based Robust Methodology for Image Steganography

Figure1 The process of hiding data

• II.    LITERATURE SURVEY

J.R.Krenn explained steganography and its implementation techniques [1]. Deshpande Neeta, et. al. proposed the Least Significant Bit embedding technique suggests that data can be hidden in the least significant bits of the cover image and the human eye would be unable to notice the hidden image in the cover file. This paper explains the LSB embedding technique and presents the evaluation results for 2, 4, 6 Least significant bits for a .png file and a .bmp file [2].

• III.    METHODS OF CONCEALING DATAIN DIGITAL IMAGE

• 3.1    Least significant bit substitution technique (LSB):

Steganography is used for covert communication. The secret image which is communicated to the destination is embedded into the cover image to derive the stego image. In this section evaluation parameters and proposed embedding and retrieval techniques are discussed.

In LSB steganography, the least significant bits of the cover media’s digital data are used to conceal the message. The simplest of the LSB steganography techniques is LSB replacement. LSB replacement steganography flips the last bit of each of the data values to reflect the message that needs to be hidden. Consider an 8-bitgrayscale bitmap image where each pixel is stored as a byte representing a gray scale value. Suppose the first eight pixels of the original image have the following gray scale values [4]:

11010010 01001010 10010111

To hide the letter C whose binary value is 10000011, we would replace the LSBs of these pixels to have the following new gray scale values:

0101011 0 0010011 1 0100001 1

Note that, on average, only half the LSBs need to change. The difference between the cover (i.e. original) image and the stego image will be hardly noticeable to the human eye.

However, one of its major limitations is small size of data which can be embedded in such type of images using only LSB. LSB is extremely vulnerable to attacks. LSB techniques implemented to 24 bit formats are difficult to detect contrary to 8 bit format [8].

Another example of LSB technique is: Consider a grid for 3 pixels of a 24-bit image and the number 300 is to be embedded using LSB technique. The resulting grid is as follows:

PIXELS: (01010101 01011100 11011000) (10110110 11111100 00110100) (11011110 10110010 10110101)

C:    10000011

(0101010 1 0101110 0 1101100 0) (1011011 0 1111110 0 0011010 0) (1101111 1 10110011 1011010 1)

Here the number C was embedded into the first 8 bytes of the grid, only the 2 bits needed to be changed according to the embedded message .On average, only half of the bits in an image will need to be modified to hide a secret message using the maximum cover size.

• 3.2    Discrete Cosine Transform technique (DCT):

DCT coefficients are used for JPEG compression [10][12]. It separates the image into parts of differing importance. It transforms a signal or image from the spatial domain to the frequency domain. It can separate the image into high, middle and low frequency components.

In low frequency sub-band, much of the signal energy lies at low frequency which contains most important visual parts of the image while in high frequency sub-band, high frequency components of the image are usually removed through compression and noise attacks [13]. So the secret message is embedded by modifying the coefficients of the middle frequency sub-band, so that the visibility of the image will not be affected. The general equation for a 1D (N data items) DCT is defined by the following equation: [12]

Figure2 Discrete Cosine Transform of an Image

N-1         .

2 Xi cos I ■ i=0        '

С (и) = а (и)

(2i+ 1)ия

)

where u= 0, 1, 2….. N-1

The general equation for a 2D ( N by M image) DCT is defined by the following equation: [12]

С(и, v

--

• = ^a(v) ^ [ а⁽и) ^ X i cos f ^(2t ^^ l i=0         i=0                         ’

• 3.3    Discrete Wavelet Transform technique (DWT) [5]:

((2i + 1)гя\

^{X C0S} ( 2N )

where u , v = 0,1,2….N-1

Here, the input image is of size N X M. c (i, j) is the intensity of the pixel in row i and column j; C (u, v) is the DCT coefficient in row u and column v of the DCT matrix.DCT is used in steganography as [10]- Image is broken into 8×8 blocks of pixels.Working from left to right, top to bottom, DCT is applied to each block.

Each block is compressed through quantization table to scale the DCT coefficients and message is embedded in DCT coefficients.

The frequency domain transform we applied in this research is Haar-DWT, the simplest DWT [18][19]. A 2-dimensional Haar-DWT consists of two operations: One is the horizontal operation and the other is the vertical one. Detailed procedures of a 2-D Haar-DWT are described as follows:

Step 1: At first, scan the pixels from left to right in horizontal direction. Then, perform the addition and subtraction operations on neighboring pixels. Store the sum on the leftand the difference on the right as illustrated in Figure 3. Repeat this operation until all the rows are processed. The pixel sums represent the low frequency part (denoted as symbol L) while the pixel differences represent the high frequency part of the original image (denoted as symbol H).

Figure3The horizontal operation on first row

A+B C+D A – B C - D
L	H

Step 2: Secondly, scan the pixels from top to bottom in vertical direction. Perform the addition and subtraction operations on neighboring pixels and then store the sum on the top and the difference on the bottom as illustrated in Figure 4. Repeat this operation until all the columns are processed. Finally we will obtain 4 sub-bands denoted as LL, HL, LH, and HH respectively. The LL sub-band is the low frequency portion and hence looks very similar to the original image. The whole procedure described is called the first-order 2-D Haar-DWT.

Figure 4The vertical operation

• 3.4    DCT-Based Robust Image Steganography:

The Steganography has to guarantee these four requirements i.e. robustness, undetectability, perceptual transparency and security.. From literature review, it is revealed that the LSB based technique provides good picture quality for all types of images like gray scale or color image as compare to the frequency domain techniques. DCT based Steganography scheme works perfectly with minimal distortion of the image quality in comparison to LSB based Steganography. Even though the amount of secret data that can be hidden by using this technique is smaller as compared to LSB based Steganography, DCT based Steganography scheme is being recommended by us as it ensures minimum distortion of image quality. LSB insertion is more vulnerable to even the most harmless and usual transformations whereas, In DWT Based Steganography, coefficients in the low frequency subband could be preserved unaltered for improving the image quality. This is due to the different characteristics of DWT coefficients in different subbands. Since the most essential portion (the low frequency part) remains unchanged, when the secret messages are embedded in the high frequency subbands corresponding to the edges portion of the original image, PSNR is being recommended.

Therefore we are looking for a robust embedding method .In order to find one; a measure of robustness must be defined. An embedding method may be considered robust if the embedded message can be extracted after an image has been manipulated without being distorted.The embedding algorithm must be tested against the different types of attacks (Gaussian noise have been used in this dissertation) in order to determine how much an image can be manipulated before the message is destroyed. If we want to hide a large message inside an image, we cannot ensure at the same time absolute undetectability and large robustness. On the other hand, if robustness to large distortion is an issue, the message that can be reliably hidden should not be too long. Based on the same embedding capacity, our proposed method improves both image quality in terms of PSNR and CER (Character Error Rate.)

• IV. ALGORITHM OF STEGANOGRAPHY

• 4.1    LSB Based Steganography:

Algorithm to embed text message:-

Step 1: Read the cover image and text message which is to be hidden in the cover image.

Step 2: Convert text message in binary.

Step 3: Calculate LSB of each pixels of cover image.

Step 4: Replace LSB of cover image with each bit of secret message one by one.

Step 5: Write stego image

Step 6: Calculate the Mean square Error (MSE), Peak signal to noise ratio (PSNR) of the stego image.

Algorithm to retrieve text message:-

Step 1: Read the stego image.

Step 2: Calculate LSB of each pixels of stego image.

Step 3: Retrieve bits and convert each 8 bit into character.

• 4.2    DCT Based Steganography:

Algorithm to embed text message:-

Step 1: Read cover image.

Step 2: Read secret message and convert it in binary.

Step 3: The cover image is broken into 8×8 block of pixels.

Step 4: Working from left to right, top to bottom subtract 128 in each block of pixels.

Step 5: DCT is applied to each block.

Step 6: Each block is compressed through quantization table.

Step 7: Calculate LSB of each DC coefficient and replace with each bit of secret message.

Step 8: Write stego image.

Step 9: Calculate the Mean square Error (MSE), Peak signal to noise ratio (PSNR) of the stego image.

Algorithm to retrieve text message:-

Step 1: Read stego image.

Step 2: Stego image is broken into 8×8 block of pixels.

Step 3: Working from left to right, top to bottom subtract 128 in each block of pixels.

Step 4: DCT is applied to each block.

Step 5: Each block is compressed through quantization table.

Step 6: Calculate LSB of each DC coefficient.

Step 7: Retrieve and convert each 8 bit into character.

• 4.3    DWT Based Steganography:

Algorithm to embed text message:-

Step 1: Read the cover image and text message which is to be hidden in the cover image.

Step 2: Convert the text message into binary. Apply 2D-Haar transform on the cover image.

Step 3: Obtain the horizontal and vertical filtering coefficients of the cover image. Cover image is added with data bits for DWT coefficients.

Step 4: Obtain stego image.

Step 5: Calculate the Mean square Error (MSE), Peak signal to noise ratio (PSNR) of the stego image.

Algorithm to retrieve text message:-

Step 1: Read the stego image.

Step 2: Obtain the horizontal and vertical filtering coefficients of the cover image. Extract the message bit by bit and recomposing the cover image.

Step 4: Convert the data into message vector. Compare it with original message.

• 4.4    Proposed Robust Image Based Steganography:

Algorithm to embed text message:-

Step 1: Read the cover image and text message which is to be hidden in the cover image.

Step 2: Convert text message in binary.

Step 3: Obtain a block from the image and check either block_Num is equal to zero 0 or Tot_Bit is equal to 1.

Step 4: Now if block_Num is not equal to zero and Tot_Bit is not equal to one. Compute the DCT of 8*8 blocks and as per data bit i.e. 0 and 1.

Step 5: Select two strength random variables K 1 and K_2. Add the value of main diagonal of DCT’s AC co-efficient with either K 1 or K 2 depending upon data bits.

Step 6: Read next data bit and obtain next block from the image.

Step 7: If Block_Num=M*N/8*8 or Tot_Bit=1, then Message has been Embedded successfully.

Step 8: Obtain the Stego Image.

Step 9: Calculate the Mean Square Error and Peak Signal to Noise Ratio (PSNR) of the Stego image and Calculatepercentage of the error occurred in the recovered data in terms of CER.

Step 10: Calculate the effect of noise (such as Gaussian noise) by varying the variance on the recovered data in terms of CER.

Algorithm to retrieve text message:-

Step 1: Obtain Stego Image and random variables K 1 and K 2.

Step 2: Read a block from the Stego Image and obtain its 8*8 DCT. Compute the Correlation between the off main diagonal DCT’s with both K₁ and K 2 .

Step 3: If Correlation (off main diagonal DCT, K 1 of the blocks is greater than Correlation (off main diagonal DCT, K 2 of the block, then the message bit is 1 or else 0.Similarly get the data bits of all the 8*8 blocks of stego image. Convert the data bits to message vector ‘M’. Compare it with the original message vector ‘M’. The Average value of PSNR in the proposed system of Steganography algorithm is 50dB and its CER is 100 percent. This is more Robust than the Spatial and Frequency domain Steganography techniques.

• V. EVALUATION OF IMAGE QUALITY

• 5.1    Mean-Squared Error:

• 5.2    Peak Signal-to-Noise Ratio:

For comparing stego image with cover results requires a measure of image quality, commonly used measures are Mean-Squared Error, Peak Signal-to-Noise Ratio and capacity.

The mean-squared error (MSE) between two images I1(m, n) and I2(m, n) is[2]:

Z m,n [/1 (m,n) - /2⁽M,N^)]2

MSE = —^,----- Г,—«-------

M * N

M and N are the number of rows and columns in the input images, respectively.

Peak Signal-to-Noise Ratio (PSNR) avoids this problem by scaling the MSE according to the image range [5]:

PSNR = 10log i₀ —

MSE

PSNR is measured in decibels (dB). PSNR is a good measure for comparing restoration results for the same image.

• 5.3    Capacity:

• 5.4    Domain Type (DOM):

• 5.5    Normalized Coefficient (NC):

DOM is either Spatial(S) or Transform (T). The techniques that use transform domain hide information in significant areas of the cover images and may be more complex for attackers.

Correlation is one of the best methods to evaluate the degree of closeness between the two functions. This measure can be used to determine the extent to which the original image and stego image remain close to each other, even after embedding the data.

• VI.    RESULTS AND DISCUSSION

  In this section, experimental results are discussed and presented for the evaluation of steganography robustness.Comparative analysis of LSB based, DCT based & DWT based steganography has been done on basis of parameters like PSNR, MSE, CER, NC, Robustness & Capacity on different images and the results are evaluated. Gaussian noise attacks are applied on the three steganography algorithm discussed previously. Figure 5 shows the three sample images which are used in the comparison. These are: “LENA” (552120 bytes), “VIEW” (1440000 bytes) and “STUTI” (337689 bytes). The Results of the “STUTI” (337689 bytes) image is shown for all the Steganography algorithms.

• 6.1    LSB Based Steganography

(a)LENA     (b) VIEW(C)          STUTI

Figure 5 Three Cover Images

The text hidden inside the Data Base Images is “hello how are u my name is stuti” (32 characters). The Original image and the corresponding Histograms are as shown in Figure 6(a) and (b) and Stego-image and corresponding Histograms are as shown in the Figure 6(c) and (d).

original Image

(a)Original Image

(b)Original Image Histogram

Stego Image

(c)Stego Image

(d)Stego image Histogram

Figure. 6 LSB Based Steganography Algorithm

The average PSNR and MSE values of test images versus LSB Steganography algorithm used in our experiments have been given in Table 1. The value of the PSNR, MSE, CER, time Elapsed in the implementation of algorithm and Correlation coefficient are as shown in the Table. This algorithm is easy for detection/extraction. There is no theoretical outstanding mark of LSB insertion, until little increase in background noise is done. For the images with different capacity, the average value of PSNR in LSB Based Steganography algorithm has been found to be 80 dB with correlation coefficient as 1 and CER as 100 percent. Figure 7 shows the PSNR and MSE versus Data Base Images.

Table 1 Performance Evalutation of LSB Based Steganography Algorithm

Image Name	Image Size (Bytes)	%age Of Recove data	MSE	PSNR (in db)	Correlati coefficie
LENA	552120	100	0.000507	81.077	1
VIEW	1440000	100	0.000289	83.513	1
STUTI	337689	100	0.001128	77.606	1

PSXR and MSE vs. Images

	Lena	View	Stuti
—♦—PSNR	81.077	83.513	77.606
-■- MSE	0.00050735	0.00028958	0.0011283

Figure 7 PSNR and MSE versus Data Base Images

Robustness

SinceLSB insertion has been found to be very vulnerable to a lot of transformations, even to the most harmless and usual ones. First of all, image has been passed through the Noisy channel or Gaussian noise has been applied on the stego image with varying noise variance. Next efforts are done to extract the data and to compute the amount of damage done. The analysis has been done in terms of PSNR (in dB) and CER. The stego image and its histogram with noise variance of 0.6 are being shown below.

Stego Image

(a) Stego Image (b) Histogram of the Stego Image Figure. 8 Image Attack: Gaussian Noise

When we increased the noise density in Gaussian noise, as has been shown in Figure 9 the PSNR and CER are decreased and consequently the image quality. This shows that PSNR decreases as noise density of Gaussian noise is increased.

Figure. 9 Effect of Gaussian noise on PSNR and CER

The average PSNR and MSE values of test images versus DCT Steganography Algorithm that has been detected as shown in the Table 2.The value of the PSNR, MSE, CER, time Elapsed in the implementation of algorithm and Correlation coefficient found by us have been shown into the Table 2. The greater is the value of PSNR, the more will be the image quality. Mean square error is used to measure the distortion in the image by performing byte by byte comparison between the original image and stego image. The DCT based image steganography doesn’t support high capacity to hide data. For the images with different capacity, the average value of PSNR in DCT Based Steganography Algorithm that we got 71dB and CER as 100 percent. The Average value of Correlation coefficient in DCT based Steganography Algorithm is 0.9352.The value of Correlation coefficient is approximately equal to unity.

Table 2 Performance Evalutation of DCT Based Steganography Algorithm

Image Name	Image Size (Bytes)	%age Of Recovere data	MSE	PSNR (in db)	Correlation coefficient
LENA	552120	100	0.00107	77.815	1
VIEW	1440000	100	0.04700	61.409	1
STUTI	337689	100	0.00124	77.177	1

6.2 DCT Based Image Steganography

The text hidden inside the Data Base Images is “hello how are u my name is stuti” (32 characters). The Original image and the corresponding Histograms are as shown in Figure 10(a) and (b) and Stego-image and corresponding Histograms are as shown in the Figure 10(c) and (d).

original Image

(a)Original Image

(b)Original Image Histogram

Figure. 11 PSNR and MSE versus Data Base Images

Stego Image

(c)Stego Image

(d)Stego Image Histogram

Robustness

First of all, the image is passed through the Noisy channel or Gaussian noise. It was applied on the Stego image with varying noise densities. Next efforts are done to extract the data. The analysis has been done in terms of PSNR (in db) and CER. The Stego image and its Histogram are as have been shown in Figure 12. When the noise variance of Gaussian noise is increased, it is found that the PSNR and CER have decreased as shown in Figure 13, and hence the image quality declined.

Figure. 10 DCT Based Steganography Algorithm

Stego Image

Stego Image Histogram 5000 4500 4000 3500 3000 2500 2000 1500 1000 500 0

0    0.1    0.2    0.3    0.4    0.5    0.6    0.7    0.8    0.9     1

(a) Stego Image (b) Histogram of the Stego Image

Figure. 12 Image Attack: Gaussian Noise

Figure. 13 Effect of Gaussian noise on PSNR and CER

6.3 DWT Based Image Steganography

The text hidden inside the Data Base Images is “hello how are u my name is stuti” (32 characters).. The Original image and Corresponding Histograms were found to be as shown in Figure 14 (a) and (b) and Stego-image and Corresponding Histograms are given in the Figure 14 (c) and (d). The average PSNR and MSE values of test images versus DWT Steganography algorithm used in our experiments have been given in Table 3The value of the PSNR, MSE, CER, time Elapsed in the implementation of algorithm and Correlation coefficient found by us have been shown into the Table 3.

Original Image

0           50          100         150         200         250

(a)Original Image (b)OriginalImage Histogram

(c)Stego Image (d)Stego Image Histogram

Figure. 14 DWT Based Steganography Algorithm

For the images with different capacity, the average value of PSNR that we got is 21dB with correlation coefficient as 1 and CER as 100 percent. Figure 15 shows the PSNR and MSE versus Data Base Images.

Table 3 Performance Evalutation of DWT Based Steganography Algorihtm

Image Name	Image Size (Bytes)	%age Of Recovere data	MSE	PSNR (in db)	Correlation coefficient
LENA	552120	100	446.319	21.6343	1
VIEW	1440000	100	446.319	21.6343	1
STUTI	337689	100	446.319	21.6343	1

MSE vs Images

lena	View	Stuti
21.6343	21.6343	21.6343
446.3196	446.3196	446.3196

Figure. 15 PSNR and MSE versus Data Base Images

n-th level wave Decompose Original                                   n-th level wave Decompose stego

Figure. 16 Nth level Haar Transform

Robustness

First of all, the image was passed through the Noisy channel or the Gaussian noise and is applied on the Stego Image having different values of noise variance. Next efforts are done to extract the data. The analysis has been done in terms of PSNR (in db) and CER. The Stego image and its Histogram have been shown in Figure 17. When we increase the noise variance of Gaussian Noise, PSNR is average i.e. 22dB, CER decreased, and hence the image quality.

Figure.17 Image Attack: Gaussian Noise

Stego Image

(c)Stego Image

(d) Stego image Histogram

Figure. 19 Proposed Robust Steganography Algorithm

Figure 18 shows that when an image attack was applied to the DWT based image Steganography PSNRremained constant but the data recovery rate was decreased. The Stego image quality ( in terms of PSNR) remained good but the method was not found to be robust.

The average PSNR and MSE values of test images versus DCT Steganography algorithm used in our experiments have been given in Table 4 The value of the PSNR, MSE, CER, time Elapsed in the implementation of algorithm and Correlation coefficient are as shown in the Table 4. For the images with different capacity, the average value of PSNR in the proposed method Steganography Algorithm is 50db and the CER is 100 percent. The greater is the value of PSNR, the more will be the image quality. Mean square error is used to measure the distortion in the image by performing byte by byte comparison between the original image and stego image.

This has been found to be more robust than Spatial and Frequency Domain Steganography Algorithm. The Correlation coefficient, the degree of closeness between the Original image and the Stego image has been traced as nearly equal to one. An embedding method may be considered robust if the embedded message can be extracted after an image has been manipulated without being distorted. On visual inspection no difference could be observed between the Original image and Stego images.

• 6.4    Proposed Robust Image Steganography Algorithm

The text hidden inside the Data Base Images is “hello how are u my name is stuti” (32 characters). The Original image and the corresponding Histograms are as shown in Figure 19(a) and (b) and Stego-image and corresponding Histograms are as shown in the Figure 19(c) and (d).

Cover Image

(a)Original Image(b) Original Image Histogram

Table 4 Performance Evalutation of Proposed robust Based Steganography Algorithm

Image Name	Image Size (Bytes)	%age Of Recovere data	MSE	PSNR (in db)	Correlation coefficient
LENA	552120	100	0.8248	48.967	1
VIEW	1440000	100	0.6502	50.000	1
STUTI	337689	100	0.3246	53.016	1

Figure. 20 PSNR and MSE for the Data Based Images

Robustness

First of all, the image was passed through the Noisy channel or Gaussian noise was applied to the Stego image with different values of noise variance. Next efforts are done to extract the data. The analysis has been done in terms of PSNR (in db) and CER. The Stego image and its Histogram were found to be as shown in Figure 21. When we increased the percentage of noise in Gaussian noise, PSNR average traced as 50dB and the Percentage of recovered data as 100, hence the image quality was remained maintained as has been, shown in Figure 22.

Noisy Stego Image

(a)Stego image (b) Histogram of the Stego image Figure.21 Image Attack: Gaussian Noise

Figure.22 Effect of Gauusian Noise On Proposed Robust Steganography

Now the comparison of the proposed method with spatial and frequency domain methods is performed. It is observed from the results that the proposed system is more robust and it gives good image quality( in terms of PSNR). The effect in PSNR with and without image attacks is being shown in Figure 23. The results have been shown for the Gaussain noise ( with noise variance=0.3).

Figure. 23 Effect of Gauusian Noise On Steganography

Algorithms

The effect in CER with and without image attacks has been shown in Figure 24. The results are shown for the Gaussain noise with noise variance is 0.3.

Figure. 24 Effect of Gauusian Noise On Steganography Algorithms

• VII.    CONCLUSION

In this paper, various techniques of Steganography in Spatial domain and Frequency domain are implemented in order to suggest a Robust Algorithm that could give the best results in image quality when image is passed through the noisy channel. The LSB based Steganography, DCT based Steganography and DWT based Steganography were applied to compute PSNR, CER and to find out the Correlation coefficient ratio. It is observed that if PSNR ratio is high then images are of better quality. CER is used for the measurement of recovered data. The robustness of spatial and transform domain Steganography algorithms on digital images have been evaluated by using Gaussian Noise. For the Images without noise attack, Comparison of LSB based, DCT based and DWT based Stego images revealed that PSNR ratio of LSB based Steganography scheme is higher than Frequency domain based Steganography scheme for all types of images. DCT based Steganography scheme works perfectly with minimal distortion of the image quality in comparison to LSB based Steganography as when the image is passed through the noisy(Gaussian noise) channel, the MSE of LSB based Steganography changes at an alarming rate as compared to the DCT based steganography . Even though the amount of secret data that can be hidden by using this technique is smaller as compared to LSB based Steganography, DCT based Steganography scheme is being recommended as it ensures minimum distortion of image quality. LSB insertion is more vulnerable to even the most harmless and usual transformations whereas, in DWT Based Steganography, coefficients in the low frequency sub-band could be preserved unaltered for improving the image quality. This is due to the different characteristics of DWT coefficients in different sub-bands. Since the most essential portion (the low frequency part) remains unchanged, when the secret messages are embedded in the high frequency sub-bands corresponding to the edges portion of the original image, DWT is being recommended and is the more robust as compare to the LSB based and DCT based Steganography. But as the noise variance of Gaussian noise is increased, the data recovery rate decreases and hence the robustness also decreases. Therefore, DCT based Robust Image Steganography is proposed in which the data recovery rate is 100 percent as the noise variance increases.

It can be concluded that

• 1.    Spatial domain based Steganography Algorithm found it to be a less little robust technique for hiding data whereas Transform domain based Steganography Algorithm worksperfectly with minimal distortion of the image quality.

• 2.    Therefore, Proposed Robust Image based Steganography is

• 3.    We may tentatively conclude that PSNR, MSE, CER, Correlation function of the proposed system ismore robust than the existing ones.

more robust as its data recovery rate is 100 percent as compared to the other techniques and it also maintain quality of the image even when the image is passed through the noisy channel(Gaussian noise).