Histogram Based Visible Image Encryption for Real Time Applications

: Like most patient information, medical imaging data is subject to strict data protection and confidentiality requirements. This raises the issue of sending the data which contains a medical image on an open network as per the above issue, also there might be a leakage of information. Encrypting an Image and hiding the information in it is the Potential way of avoiding this problem. But there might be many problems when we try restoring the original image. As a solution to that, an algorithm dealing with region of intrest (ROI) in medical images based on the pixels of interest and histogram peak technique. Firstly Image histogram peak technique is used for calculating peaks in medical images. Then set the Threshold value to segregate the pixels of interest in the medical images. The threshold value can be calculated by taking an average of all peaks in the histogram. These pixels are encrypted with the help of the Sudoku matrix. The proposed scheme will be evaluated using a various test based on statistics along with those results which will be compared to benchmarks of the existing work. We can see the better performance in terms of security from the proposed technique.


Introduction
Medical imaging research has made remarkable progress as a result of increased and improved investment in multimedia technology. The medical image contains the patient's important personal privacy information. Medical images are usually encrypted to protect sensitive content. Common methods used for encrypting are International Data Encryption Algorithm, Data Encryption Standard to protect text data is commonly used [1]. We can see the distribution of pixels is uneven in data of Medical image with good resolution and various features. Regular cryptography used for image protection is not perfect to protect images from digital imaging and communication (DICOM) in medical care because of its inefficiency to handle huge data.
Observing the existing literature, the main issues of telemedicine are as follows. Traditional environments and cryptographic systems are: • Secure medical images without loss of quality • Maintain the reliability of confidential medical imaging data.
The aim of the proposed work includes three elements for the rapid and safe transmission of medical images.
• Confidentiality of Medical Images • Integrity of Areas of Interest of medical images • Safe recovery of images for diagnosis The rest of the sections are as follows. Section 2 explained about various methods related to medical image encryption. Section 3 explains the basic concept of Sudoku used in the proposed encryption method. Section 4 explains the proposed work. Section 5 gives the performance analysis and finally, section 6 gives the conclusion of the work.

Related Works
In [2] authors proposed medical imaging is an effective and essential secondary information source they look into when a patient is to be diagnosed by a medical person. The faster way to share medical images is usually through an open network like email or file sharing. These methods will lead to copyright problems, illegal copy, and manipulation of the content. In [3] authors explained into medical image security focused on image encryption and information hiding has grown. In [4] authors explained a simple but efficient method by using matrix multiplication to change the value of a pixel in an image, which made the algorithm very simple but also made it very difficult for intruders to extract the information in the images. In [5] authors described abut 5-D hyperchaotic map actually the result of combining a logistic map with 3D Lorenz, which exhibited dual operating modes. One of the modes focuses only on the pixels obtained from clear text images while the other mode performs diffusion twice in order to obtain secured images. In [6] authors addressed the security issue made the confidential data from the web users be shared on web applications without fear and hence preserving their privacy. In [7] authors explained the improved chaotic map to obtain more security by identifying its drawbacks, followed by the introduction of a modified version of chosen plain text attack. In [8] authors described how to select the most important part of a medical image to hide confidential data. In [9] authors came up with partial encryption of images with secret data in images using FF3-1 and FF1. Without varying the size of the data, encryption of confidential data is done to reduce the usage of storage. In [10] authors introduce the grayscale encryption technique based on ROI with chaos. Using the Edge detection technique (Sobel), extraction of the ROI part is done. Lorenz's system encrypts the sine map and ROI part which are required for the encryption. In [11] authors present a self-generating region of interest (ROI) method for watermarking application in biomedical images. This technique is robust enough to prevent many attacks such as Gaussian, median, sharpening, and wiener filters, which is the major advantage over other methods. In [12] authors discussed a new method to recover the information lossless from encryption in the transform domain. In [13, 14, 15, 16] authors come across a novel lossless game theory-based medical image encryption scheme with optimized ROI parameters along with ROI hidden positions. In [17] authors propose an HS method to examine the hidden lossless data in highresolution medical images. Use high correlation for the smooth surface of medical imaging anatomy in the local block pixels of the image. In [18, 19] authors described about histogram peak detection of image is a fundamental technique for digital image processing that can be used directly and effectively for image segmentation, quality assessment, enhancement, and data reduction. In [20, 21, 22, 23] authors proposed the conventional indirect method to derive peak values. It consists of two steps. The first step is to fit the data to obtain a P D F. The second step is to calculate the derivative of the PDF to obtain significant peaks.

Sudoku Matrix
Here we define a Sudoku matrix as an X * X matrix containing numbers from 1 to N, but since X is the square of the number and N = X, each number occurs only once in each row. Increase only once in each column, only once in each block. Figure 1 below shows an example of a Sudoku puzzle and a solution for X = 9. The solution to the Sudoku puzzle is called the Sudoku matrix [24].

Proposed Visible Encryption Work
Block diagram of proposed selective image encryption system as shown in figure 2. The proposed system includes different steps for selecting and encoding regions of interest in medical images. First, calculate the histogram peak of the original medical image using the peak detection technique and as shown in Figure 3. The peak detection algorithm first generates a peak detection signal from the image histogram. The peaks in the histogram are then determined using the extreme point between the zero and zero intercepts of the peak detection signal. Convolution uses the first derivative approximation discriminator. For an ideal smooth histogram, the peak can be determined from the sign and zero intersection of the signal obtained from the h and S convolutions. The zero intersection estimates the extreme points of the histogram and the position of the turning point. The `*` symbol in figure 3 indicates the maximum values of the original medical image. The threshold value for separating the important pixels of the medical image can be calculated by taking the average of all the peak values obtained when the histogram peak is detected. Then compare each pixel of the original medical image with the threshold value, and if it is above the threshold value, group them into meaningful blocks of pixels. Sudoku matrix of multiples of 16*16 randomly generated for diffusion operation. Using pixels in a sudoku matrix, randomly encrypt a block of important pixels by performing an XOR operation. If it is greater, then store the pixel into significant block. • Step 6: Construct the Sudoku matrix with a same size of significant block. • Step 7: Finally visible encrypted image is produced by performing XOR operation between significant block pixels and random pixels in the sudoku matrix.

Results and Discussion
The proposed technique is analyzed by evaluating the various parameters. Below are the parameters involved in this.

Analysis of Entropy
The amount of randomness is evaluated by Entropy in a cryptographic system. Equation of Entropy is [25-26]: where P (si) gives the probability of i th gray-level occurring in the image. Ideal entropy value for a random image is 8. If it is low, it is more predictable. Table 2 gives sample image's entropy along with its respective cryptographic image.

M S E (Mean Square Error)
M S E is generally analyzed by averaging the squares of the difference between scrambled and plain scrambled image. Higher the value of M S E, the higher the encryption and the more noisy the clear image. The formula for MSE [27] given by. (2)

P S N R(Peak Signal to Noise Ratio)
PSNR is always the reciprocal of the mean squared error (M S E). Increase MSE and reduce PSNR for better image security. Mathematically, the PSNR is given as follows [28].

UACI and NPCR
NPCR stands for number of pixel change rate and UACI is unified avarage change intensity defins as follows [29].
here n and m gives the number of columns and rows respectively. D(i, j) is given by here cipher and original images are given by C2(i, j) and C1(i, j) respectively.

U I Q(Universal Image Quality Index)
To extract the similarity between cipher and original image we use U I Q. It is ranging from -1 to +1 where the more similarity is indicated by the 1 and least similarity is indicated by -1. Equation for U I Q is [29].

S S I M(Structural Similarity Index Measure)
U I Q Index's improved version is S S I M. It is ranging from -1 to +1 where the more similarity is indicated by the 1 and least similarity is indicated by -1. Equation for S S I M is [29].
here, when the division is done with weak denominator, to stabilize that we use the constants C2 and C1.     Table 1 shows the inputs images, encrypted images and decrypted images of proposed system. From Table 2, we conclude that the entropy value of the encoded image is greater than the entropy value of the original simple image. The MSE score is increased based on the image showing the level of encoding. With selective encoding, the NPCR values of the proposed method do not change significantly, the cost and computation time are reduced, and the same metrics are reduced to zero. In other words, the lower the value, the higher the difference between them. Input image and encoded ROI image. Table 3 shows the effectiveness of the proposed method in terms of speed of implementation and cost. Compared with full-frame encoding, this method saves about 50% of computation cost and provides fast framecoding execution time. The analysis of the entropy values of the various medical images in Table 2 reveals the high entropy of the new cryptographic algorithms.  Table 3, we can see that the coding time for different medical images has been reduced. This is achieved because it performs image selective encoding rather than full encoding, and because it is a lightweight encoding technology, it takes less time to perform bit-plane encoding.  [30,31] Our method significantly reduces encryption time, ensures the reliability of images sent to the cloud, and ensures security with a two-level encryption scheme. To check the validity of the selective encoding scheme, calculate various parameters such as NPCR, MSE, PSNR, SSIM, and encoding time and compare these values with those obtained by existing methods. Table 4 shows that selective encryption schemes are an effective method because they give better results than existing methods.

Conclusion
In this article, we have proposed a method to partially encrypt personal information such as tumors and fetal organs. Traditional image protection technologies have many problems such as data filling up and growing larger as storage space is wasted over time. Furthermore, since the entire image is encrypted, the image cannot be recognized before decryption and sensitive information is leaked after decryption. The problem of conventional sub-image encryption is that the unnecessary parts are encrypted by encrypting a rectangular region consisting of pieces of information requiring security. The proposed method detects important pixels using histogram vertex detection and counts them using Sudoku matrix. In this study, we measure the encryption speed of the proposed method and determine the most suitable block unit for encryption in order to improve the encoding and decoding speed of the image part. Limitation of proposed work is not applicable to binary image encryption.