A Paper Presentation on

AUTHENTICATION OF MEDICAL IMAGES USING DATA HIDING TECHNIQUES

UTHENTICATION OF MEDICAL IMAGES USING DATA HIDING TECHNIQUES

ABSTRACT: In bio medical applications it is some times necessary to hide the data presented by the medical images. In such applications we need to perform transformations on the images to hide the contents of the images. One such method is the use of data hiding schemes.the data hiding is a process based methodology in which the image is resolved and stored in pixel form, this data hiding has been proposed in a number of various formin this paper we discuss a brief overview of the data hiding technique and give an enlarged description about reversible data hiding technique that presents better performance than others. Key words image authentication, data hiding , reversible data hiding technique. I. Introduction Data hiding means the hiding of secret data in a cover image, the result of which is the so-called stego-image. Recently, the reversible data-hiding technique has attracted much attention. It is also called lossless data embedding [1,2], wherein the original image can be restored after extracting the secret message. Following current trend, more and more medical

images are now stored in digital form. On the other hand, as a result of the availability of powerful image processing software packages such as Photoshop, anyone can easily modify such digital media for any reason and create unconscious forgeries. How to prevent a medical image from being maliciously altered, that is, detecting the tampered parts, has become an important issue. In order to safeguard digital images, image authentication schemes are the most widely used method. Generally, the authentication codes are usually derived from the prominent features of the medical image and are directly embedded into the image. However, the embedding procedure will distort the images. This distortion may cause the modified medical images to be unable to be used for further diagnosis. That is to say, the method must have the ability to restore the original content after the extraction of the authentication codes. Therefore, it is an important challenge to develop a reversible data-hiding scheme for medical images. In the past decade, many reversible data embedding methods have been proposed. Honsinger et al. [1] was the first

to propose the concept. Originally, Honsinger et als scheme was designed for lossless authentication. Nonetheless, their scheme suffers seriously from the disturbing salt-and-pepper noise problem. Ni et al. [3] proposed a reversible data-hiding algorithm based on the shifting of an image histogram. The maximum point of the histogram is selected to embed a message. When embedding a message into the image, the pixel value at the maximum point is altered by 1 or left unchanged if the message bit is 1 or 0, respectively. Their idea is very simple and causes only a slight distortion with low complexity. However, it is limited by the hiding capacity. Tseng et al. [4] also proposed a reversible hiding scheme based on image histograms. In their method, the peak point in the histogram remains unchanged for retrieving hidden data without additional side information. Thus, secret data is embedded in the peaks neighboring pixels. Lin et al. [5] proposed a multilevel reversible data hiding scheme based on the difference histogram modification that uses the peak point to hide messages. Their experimental results confirm that their proposed scheme can provide higher hiding capacity while keeping distortion low. Difference expansion technique has been employed for hiding data reversibly [6,7]. The differences between two pixels are expanded to embed messages. The redundancy in the digital content is explored to achieve reversibility. However, a significant part of the embedding space is consumed by a large location map that indicates whether a pixel pair has embedded a message. Lee et al. [8] proposed an adaptive lossless steganographic scheme based on the centralized difference expansion. In their proposed scheme, the original cover image is partitioned into a series of non-overlapping blocks, and the payload of each block depends on its block size and the image complexity. Due to the fact that schemes with difference expansion tend to seriously damage the image quality in the edge areas, the peak signal-to-noise

ratio (PSNR) value of stego-image is always less than 40 dB. In addition, some methods for reversibly embedding secret data into binary images and palette-based images have been proposed. For example, Tsai et al. [9] introduced a reversible data-hiding mechanism based on pairwise logical computation to embed a message in a binary image. Pan et al. [10] proposed a reversible data-hiding method for error-diffused halftone images. It employs statistical features, with pixel block patterns to embed data. Lee and Wu [11] proposed a reversible data-hiding method based on an iterative approach for palette-based images. In general, embedding capacity and stegoimage quality are the major criteria used to evaluate reversible data embedding. Embedding capacity means how much secret information can be embedded in an image. The quality of a stego-image is measured by the PSNR; a higher PSNR value can guarantee less distortion caused in the cover image. II. Methods The proposed method consists of preprocessing, embedding, extraction and recovery process II.I preprocessing The preprocessing step is performed in the original image except for the first and last columns. The goal of the preprocessing step is to eliminate the pixels with a graylevel of 0 and 255. First, the pixel number of the gray-level between 0 and T is calculated and denoted by h(0),h(T). The minimum value is searched from {h(0),h(T)}, that is, h(T1) = min {h(0),h(T)}. Second, the pixel number of the gray-level between 255 and 255-T is calculated and denoted by h(255),h(255-T). The minimum value is searched from {h(255),h(255-T)}, that is, h(T2) = min {h(255),h(255-T)}. If T1 is 0, all pixel values of 0 shift to 1; otherwise, all pixel values from 0 to T1-1 shift to T1 by 1. If T2 is 255, all pixel values of 255 shift to 254; otherwise, pixel values from 255 to T2+1 shift to T2 by 1. The position information of pixels with a value of T1 and

pixels with a value of T2 are recorded as the overhead information O1. At the same time, the first 80 least significant bits (LSBs) of the pixels in the last column are concatenated as the overhead information O2. The value of T is set to 20 in our method. After the preprocessing step is performed, the cover image is obtained. The cover image except for the first and last columns contains no pixel with a grey-level of 0 or 255. The overhead information O1, O2, and secret message SM are concatenated as the binary string EP for embedding. II.II embedding algorithm For more security, cryptographic techniques can be applied to an information hiding scheme to encrypt the secret message prior to embedding. The embedding algorithm is as follows: Step 1: The even row of the cover image is scanned in the raster-scan order except for the pixels of the first and last column, as shown in Fig. 1. Figure 2 shows the current pixel and its three neighboring pixels. Our method uses three neighboring pixels to predict the current pixel. The predictive value P(x,y) of the current pixel P(x,y) is computed using Eq. (1), and the prediction error d is calculated using Eq. (2). P(x,y)= floor((x,y-1)+(x, if ) located at the first row floor((,y d = P(x,y) - P(x,y). (2)

Figure 2. The current pixel CP and its three neighboring pixels. Step 2: The histogram h1 for the prediction error is generated. The two peaks M1 and M2, with M1 < M2, are searched. In this step, a bit is embedded if the value of d is equal to M1 or M2. The current pixel P(x,y) is kept unchanged or modified accordingly as follows: If d < M1 { P(x,y) = P(x,y)-1; } If d > M2 { P(x,y) = P(x,y)+1; } If d == M1 { P(x,y) = P(x,y)-b; } If d == M2 { P(x,y) = P(x,y)+b; } An illustration of the histogram modification is described as follows. Figure 3(a) shows the histogram of the prediction error d. Two peaks, M1 = -1 and M2 = 1, are searched. Scan the cover image to select the pixels with a gray-level value p. In the case of d < M1 (or d > M2), its gray value is modified to p - 1 (or p + 1), with no secret data embedded. The modified histogram is shown in Fig. 3(b). In the case of d == M1 (or d == M2), its gray-level value remains p when the corresponding embedded bit b is 0 and is modified to p - 1 (or p + 1) when the corresponding embedded bit b is 1. An example of the modified histogram is shown in Fig. 3(c).

Figure 1. The even row of the cover image is scanned in the raster-scan order except for the pixels of the first and last column.

are replaced by this binary string. Finally, the stego-image is generated.

Figure 3. (a) The histogram of the prediction error; (b) and (c) the modified histogram. Step 3: The odd row of the cover image is scanned in the raster-scan order except for the pixels of the first and last column, as shown in Fig. 4. The predictive value P(x,y) of the current pixel P(x,y) is computed using Eq. (1), and the prediction error d is calculated using Eq. (2).

Figure 4. The odd row of the cover image is scanned in the raster-scan order except for the pixels of the first and last column. Step 4: The histogram h2 for the prediction error is generated. The two peaks M3 and M4, with M3 < M4, are searched. In this step, a bit is embedded if the value of d is equal to M3 or M4. The current pixel P(x,y) is kept unchanged or modified accordingly as follows: If d < M3 { P(x,y) = P(x,y)-1; } If d > M4 { P(x,y) = P(x,y)+1; } If d == M3 { P(x,y) = P(x,y)-b; } If d == M4 { P(x,y) = P(x,y)+b; } Step 5: The values of T1, h(T1), T2, h(T2), M1, M2, M3, and M4 are transformed to a binary string. In our method, each value of T1, T2, M1, M2, M3, and M4 is represented by 8 bits, and each value of h(T1) and h(T2) is represented by 16 bits. Therefore, the length of the binary string is 80. The first 80 LSBs of the image pixels in the last column

Conclusion:

This paper presents a reversible data hiding scheme for medical images. Our method uses three neighbouring pixels to predict the current pixel. For the prediction error,two histograms, h1 and h2 are generated. Our proposed method intends to embed secret data into cover image by using the two histograms. From the experimental results, we can see that the proposed method has the following advantages. First, the stego image have good visual image quality. Second our proposed method has a higher pure payload. Third, our proposed method is simple and effective.

REFRENCES:
[1] C. W. Honsinger, P. W. Jones, M. Rabbani and J. C. Stoffel, Lossless recovery of an original image containing embedded data, U.S. Patent No. 6,278,791, 2001. [2] J. Fridrich, M. Goljan and R. Du, Lossless data embedding: new paradigm in digital watermarking, EURASIP J. Appl. Signal Processing, 2002: 185-196, 2002. [3] Z. Ni, Y. Q. Shi, N. Ansari and W. Su, Reversible data hiding, IEEE Trans. Circ. Syst. Video Technol., 16: 354-362, 2006. [4] H. W. Tseng and C. P. Hsieh, Reversible data hiding based on image histogram modification, Imaging Sci. J., 56: 271-278, 2008. [5] C. C. Lin, W. L. Tai and C. C. Chang, Multilevel reversible data hiding based on histogram modification of difference images, Pattern Recognit., 41: 3582-3591, 2008. [6] J. Tian, Reversible data embedding using a difference expansion, IEEE Trans. Circ. Syst. Video Technol., 13: 890-896,

[7] A. M. Alattar, Reversible watermark using the difference expansion of a generalized integer transform, IEEE Trans. Image Process., 13: 1147-1156, 2004. [8] C. C. Lee, H. C. Wu, C. S. Tsai and Y. P. Chu, Adaptive lossless steganographic scheme with centralized difference expansion, Pattern Recognit., 41: 2097-2106, 2008. [9] C. L. Tsai, H. F. Chiang, K. C. Fan and C. D. Chung, Reversible data hiding and lossless reconstruction of binary images using pair-wise logical computation mechanism, Pattern Recognit., 38: 1993-2006, 2005. [10] J. S. Pan, H. Luo and Z. M. Lu, Look-up table reversible data hiding for error diffused halftone images, Informatica, 18: 615628, 2007. [11] J. H. Lee and M. Y. Wu, Reversible data-hiding method for palette-based images, Opt. Eng., 47: 1-9, 2008. [12] Q. Huang, Y. Zheng, M. Lu, T. Wang and S. Chen, A new adaptive interpolation algorithm for 3D ultrasound imaging with speckle reduction and edge preservation, Comput. Med. Imaging Graph., 33: 100-110, 2009. [13] M. H. Horng and S. M. Chen, Multiclass classification of ultrasonic supraspinatus images based on radial basis function neural network, J. Med. Biol. Eng., 29: 242-250, 2009. [14] G. Zheng, S. Gollmer, S. Schumann, X. Dong, T. Feilkas and M. A. G. Ballester, A 2D/3D correspondence building method for reconstruction of a patient-specific 3D bone surface model using point distribution models and calibrated Xray images, Med. Image Anal., 13: 883-899, 2009. [15] T. Okafuji, H. Yabuuchi, Y. Nagatoshi, Y. Hattanda and T. Fukuya, CT and MR findings of brain aspergillosis, Comput. Med. Imaging