Volume 119 No. 16 2018, 447-454 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ Fuzzy Inference System for adaptive data embedding in compressive sense C. Lakshmi 1, N.Nivetha 2, S.Nithya 2, K. Thenmozhi 1, and Rengarajan Amirtharajan 1 1 Faculty & 2 Students,Department of Electronics and Communication Engineering, School of Electrical & Electronics Engineering, SASTRA University, Thanjavur, Tamil Nadu, India. Abstract: 'E-mail: lakshmi_c@ece.sastra.edu@ ece.sastra.edu *Corresponding author: C. Lakshmi Recent days most of the information are transmitted over internet. Data security plays important role in information sharing over internet. There was a problem with this data transmission over open channel such as copy right, hackers and so on. Communication might be effective if it secured. Information hiding is a way to achieve data security by hiding the secret data into cover medium. In recent time artificial intelligence and fuzzy logic have created the impact on entire science area. In this paper important characteristics of image was taken into account that changes in high frequency components was less sensitive than changes made in low frequency component. This scheme utilizes the fuzzy logic for adaptive edge detection and Arithmetic coding for secret data compression which enhances the payload. This scheme has been verified with various images and different size of payload. Results have been proved the effectiveness of the proposed method. Keywords: Fuzzy inference system (FIS), Arithmetic coding, soft and hard edge detection 1. Introduction: LSB insertion techniques modify the portion of LSBs of the image pixel with the secret bits of same length [1]. The entire pixel in the image will not have equal tolerance to accept the modification.hsv aided LSB method to overcome this problem [2]. Similar way embedding might be done in transform domain, frequency of the pixel has grouped as high and low frequency group and anything might be a elected group for embedding as concern of perceptual transparency of watermarked image or robustness of secret data respectively [3,4]. Edge detection methods assist to choose appropriate pixel for higher payload. Because pixel belonging to edge area has less sensitive to the human eye than pixel belonging to the smooth area [3, 4]. Pixel Variable Differencing (PVD) technique is another way to notify the pixel difference between the neighbors to decide the number bits to be embedded [6, 7]. Optical Pixel Adjustment Process (OPAP) reduces the MSE with higher pay load [8]. Rubik s cube enhances the complexity of the hiding way in terms of randomizing the road path for pixel modification [9]. 447
Adaptive way of embedding is required to achieve higher payload without affecting the PSNR. This can be attained by the method which identifies the appropriate pixel withstand against higher modification. Fuzzy [5] logic is the best way to achieve the above. Lossless compression will be an additional support to reach the goal. Hence this paper focuses the followings Fuzzy rule based image edge detector Adaptive embedding technique Higher embedding capacity through arithmetic coding 2. Proposed Method: Figure.1: Intelligent embedding scheme Figure.1 enlightens the significance of FIS and Arithmetic coding in variable secret data embedding. Proposed Algorithm: Phase.1: Edge detection using FIS Step 1: Convert the given color image into gray image I[x, y] to obtain the proper luminance value Step 2: Obtain the image gradient along with both x and y axis Step 2.1: Choose the scaling factor with respect to the gray image. Step 2.2: Choose the kernel for convolution such as 448
Gx 1 1 (1) Gy Gx (2) Step 2.3: Find the convolution between the I[x, y] and G X & I and G Y I[ m. n] GX [ m, n] I[ x, y] G[ m x, n y] (3) x y Step 3: Create a fuzzy inference system (FIS) for edge detection Step 3.1: Convert input variables into fuzzy variable using Gaussian membership function k x G( x : k, ) e (4) Where k parameter that determines the rate at which for each x the function increases or decreases with increasing difference ( x) and is the value for which membership grade is 1. Step 3.2: Choose the fuzzy output variable Iy Step 4: Specify FIS Rules r1 soft edge if I X & I y 0 (5) r2 hard edge if I & I 0 (6) X y Step 5: Evaluate the output of the edge detector for each row of pixels in I using corresponding rows of Ix and Iy as inputs. Fuzzy edge detector classifies the pixels into three clusters such as non edge pixels, soft edge pixels, hard edge pixels. Phase.2: Lossless compression on secret text Step 6: Get the first character and find the probability for the character between 0 to 1. Step 7: Find the next upcoming character and sub range related to previous character. Step 8: Find the encoded tag for the word. Step 9: Repeat the step 6 to step 8 for the remaining words till the last word of the sentence which to be transmitted. Phase.3: Embedding the compressed text Step 10: Chop the Compressed text into number of pieces, each piece may have 2, 3 or 4 bits. 449
Step 11: Embedding the secret data of 2 bits, 3 bits and 4 bits into non edge, soft edge, and hard edge respectively. 3. Results and Discussion: The proposed method analyzed with five number of images such as Krishna, Penguins, Bear, Superman, City of size of 256 X 256 and different size of secret text have been taken to verify the embedding capacity. (a) (b) (c) (d) (e) Figure.2: Sample input image: (a) Krishna (b) Penguins (c) Bear (d) Superman (e) City (a) (b) (c) (e) (f) (g) Figure.3: (a,e) Input image (b,f) Edge highlighted image (c,g) Watermarked image 450
Figure.3 conveys that watermarked image is much similar to the original image, this proves that hard edges withstand the higher payload than soft edges. Figure.4: Fuzzy output rules Figure.4 expresses that comparing the gradient of every pixel in the x and y directions. If the gradient for a pixel is not zero, then the pixel belongs to an edge (black). Table.1: Perceptual transparency between original and watermarked images 1.1 Using Arithmetic code: Image Text Size= 100 Text Size=75 Text size=50 Text size=25 Text size=20 MSE PSNR MSE PSNR MSE PSNR MSE PSNR MSE PSNR Krishna 5.2031 40.9682 4.2188 41.8790 2.5781 44.0178 1.2188 47.2717 0.9688 48.2687 Penguins 5.0625 41.0872 3.9375 42.1786 2.7656 43.7129 1.4375 46.5547 0.8750 48.7107 Koala 5.5469 40.6903 4.5938 41.5091 2.5625 44.0442 1.5000 46.3699 1.0625 47.8675 Vivekanada 5.4219 40.7893 4.0781 42.0262 3 43.3596 1.6094 46.0642 1.0156 48.0635 Lighthouse 6.2813 40.1503 4.9531 41.1820 3.3750 42.8481 1.5156 46.3249 0.8750 48.7107 1.2 Without Arithmetic code Image Text Size= 100 Text Size=75 Text size=50 Text size=25 Text size=20 MSE PSNR MSE PSNR MSE PSNR MSE PSNR MSE PSNR 451
Krishna 9.6250 38.2968 7.0313 39.6605 4.4688 41.6289 2.6563 43.8881 2.2188 44.6697 Penguins 8.4063 38.8848 6.2500 40.1720 4.0156 42.0933 1.8906 45.3647 1.5000 46.3699 Koala 12.7969 37.0598 9.2656 38.4621 5.0938 41.0604 2.6406 43.9137 2.2031 44.7004 Vivekanada 8.8906 38.6415 6.6094 39.9292 4.1563 41.9438 2.0313 45.0532 1.6406 45.9807 Lighthouse 11.4375 37.5475 8.4219 38.8767 5.3906 40.8144 2.1250 44.8572 1.7344 45.7394 FIS edge detection technique for data embedding is verified with and without lossless compression and the results are tabulated in Table 1.1 and Table 1.2.These tabulated values are proved that FIS edge detection technique supports higher embedding capacity and additionally arithmetic lossless compression enhances the payload. 4. Conclusion: References: Conventional method such as hard thersholding is not right way to identify the image edges, because images should not have sharp boundary for edge detection. This proposed method have grouped the pixels into three clusters such as smooth pixels, soft edge pixels and hard edge pixels. This groping have been provided the opportunity to manipulate different payload with different pixel group. FIS have been optimized the edge embedding technique. These ideas have been verified through parameters. In addition Arithmetic Lossless compression method has supported the higher pay load and 100% of secret data recovery. [1]. Petitcolas, F. A. P., R. J. Anderson, and M. G. Kuhn. "Information Hiding - a Survey." Proceedings of the IEEE, vol. 87, no. 7, 1999, pp. 1062-1078, SCOPUS, doi:10.1109/5.771065. [2]. Carvajal-Gamez, B. E., F. J. Gallegos-Funes, and A. J. Rosales-Silva. "Color Local Complexity Estimation Based Steganographic (CLCES) Method." Expert Systems with Applications, vol. 40, no. 4, 2013, pp. 1132-1142, SCOPUS, doi:10.1016/j.eswa.2012.08.024. [3]. Uma Maheswari, S., and D. Jude Hemanth. "Performance Enhanced Image Steganography Systems using Transforms and Optimization Techniques." Multimedia Tools and Applications, vol. 76, no. 1, 2017, pp. 415-436, SCOPUS, doi:10.1007/s11042-015-3035-1. [4]. Cheddad, A., et al. "Digital Image Steganography: Survey and Analysis of Current Methods." Signal Processing, vol. 90, no. 3, 2010, pp. 727-752, SCOPUS, doi:10.1016/j.sigpro.2009.08.010. [5]. S.Abinaya G.Arulkumaran DETECTING BLACK HOLE ATTACK USING FUZZY TRUST APPROACH IN MANET International Journal of Innovations in Scientific and Engineering Research (IJISER),vol4,no3,pp102-108,2017. 452
[6]. Sahu, A. K., and G. Swain. "A Review on LSB Substitution and PVD Based Image Steganography Techniques." Indonesian Journal of Electrical Engineering and Computer Science, vol. 2, no. 3, 2016, pp. 712-719, SCOPUS, doi:10.11591/ijeecs.v2.i3.pp712-719. [7]. Shaik, A., V. Thanikaiselvan, and R. Amitharajan. "Data Security through Data Hiding in Images: A Review." Journal of Artificial Intelligence, vol. 10, no. 1, 2017, pp. 1-21, SCOPUS, doi:10.3923/jai.2017.1.21. [8]. Duric, Z., M. Jacobs, and S. Jajodia. Information Hiding: Steganography and Steganalysis, vol. 24, 2004, SCOPUS,, doi:10.1016/s0169-7161(04)24006-8. [9]. Amirtharajan, R., V. M. Abhiram, G. Revathi, B. J. Reddy, V. Thanikaiselvan, and M. B. B. Rayappan. 2013. "Rubik's Cube: A Way for Random Image Steganography." Research Journal of Information Technology 5 (3): 329-340. doi:10.3923/rjit.2013.263.276. 453
454