2017 International Conference on Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT)
Region of Interest Based Selective Medical Image
Encryption Using Multi Chaotic System
K Prabhavathi Sathisha C P
Department of ECE Department of ECE
BGSIT, BG Nagara BGSIT, BG Nagara
Abstract— As of late, numerous fraudulent assaults
towards life/medical coverage's by giving fake wellbeing
data are in increment. Hence forth there is a requirement
for security of the images sent by the medical expert to the
insurance provider. This examination proposes a chaos-
based image encryption conspire utilizing Lorentz map and
Logistic condition with numerous levels of diffusion. The
Lorentz map is utilized for confusion and the Logistic
condition for diffusion, in this work, stenography and
encryption systems are joined to ensure the patient secrecy,
and increment the security in medicinal images. This
encryption calculation has high key space, entropy near
eight (for dim images) and less relationship among nearby
pixels.
Keywords— Selective encryption .Chaos .Chaotic image.
I. INTRODUCTION
The Data that can be used and implicit with no
special techniques or strategy is named as plain text or
clear content. The procedure of disguising plain text
keeping in mind the end goal to shroud its specific
material is called encryption. The impression of
encryption is to make a message vast, but to the recipient.
Information encryption innovation is utilized to
profit assurance against misfortune, misuse or
modification of private data. Encoding plaintext brings
about unintelligible garbage called image content.
Encryption is utilized to ensure the concealed data from
anybody of concern not expected to, even the individuals
who can fathom the scrambled information. The system
of descending into sin image content to its unique
plaintext is considered as decoding. Ismail et al
anticipated image encryption procedures by integration of
2 Logistic charts for confusion and diffusion [24]. Based
on the writing, the original strong picture encryption
system is in work to create a cipher icon which withstand
for some security attack.
A particular encryption move toward for
uncompressed representation is to scramble 4 to 5
minimum critical bits since it is arbitrary similar to plus
plaintext assault on irregular like information is harder.
One more particular encryption technique that specified
K. Hong and K. Jung [16] planned an incomplete
encryption technique utilizing the face area as a
component on the grounds that a face has the similar data
and mainly critical part in a image or video. That utilized
978-1-5386-2361-9/17/$31.00 ©2017 IEEE
Ravikumar K M
SJCIT
Chickballapur
Multiple Layer Perception’s to identify confront district
and for extra correct, Gaussian skin-shading connected to
segregate among skin areas with non-skin locales.
Brindha Murugan et al [41] proposes a disorder
based picture encryption conspire utilizing Henon guide
and Lorenz condition with various levels of dispersion.
The Henon delineate utilized for disarray and the Lorenz
condition for dispersion. The proposed strategy yields the
entropy of 7.999 and the UACI of 33.44%. Chen Wei-bin
et al [39] presented a latest picture encryption procedures
support for combination of Arnold cat map and Henon
confused scheme in organize to convene the necessities
of safe picture transport. To start with, the Arnold feline
guide is utilized to rearrange the places of the picture
pixels. Second, the rearranged picture is encoded in light
of Henon's riotous framework pixel by pixel.
An elective approach will be to encoding I-hinders in
general edges rather that I-outlines that improves
security. Droogen broeck similarly proposed two
procedures to specific encryption from asserting both
compacted likewise not compressed images [13]. The rest
of this paper is organized as follows. Section 2 introduces
the proposed selective image encryption algorithm.
Section 3 provides results and discussions. Section 4
provides comparison. The conclusions are drawn in the
final section.
II. PROPOSED ARCHITECTURE
Based on chaotic systems many picture encryption
algorithms anticipated. In this work, we advise a
selective-image encryption scheme composed of two
chaotic systems. The method merge the usual bit flow
ciphers expertise and the spatial-domain encryption of
digital imagery. One of the chaotic systems used is the
logistic map which is worn to produce a chaotic series.
Using chaotic series the image is confused. The other
chaotic system is use is the Lorenz map which is use to
build a change medium P. As per the conventional bits
flow ciphers expertise, using the binary stream the pixel
standards of a basic image is adapted arbitrarily. Then by
the permutation matrix P the customized picture is
encrypted. Thus the combination of two methods
enhances the safety of the encryption system
successfully.
 Fig. 1. Block Diagram for Proposed Architecture.

Let the plain image I, whose pixels can be accessed

using i, j, can be represented as I (i, j).And the keys for
encryption can be represented as k (k1; k2) = k(a,
x0;r,s,x0,y0,z0 ),where the key1 using logistic map and
key2 using Lorenz map can be represented as k1= (a,x0),
k2 = (r,s,x0,y0,z0).The scheme of multi chaotic
encryption system consists of following steps.
The proposed work can be implemented with the
help of following flow chart shown with its steps in
below Fig.2 Fig. 2. Flow chart for proposed system.

1. Read the input plain Image I and select the region of

interest.
2. Via the key as the preliminary state of the initial
logistic chaotic scheme, generate a chaotic series.
3. Using a very large number i,e 1015, change the
obtained chaotic series keen on a flow of natural
numbers.
4. From the obtained natural numbers, change the
position of the pixel ideals of the plan picture I (i, j)
and get the first level ciphered image I’ (i, j).The
operation performed is called Confusion.
5. With the key as the primary form of the next
Lorenz Chaotic scheme, Construct the permutation
matrix P.
6. Perform the second level encryption of the image I’
(i, j) by using the permutation matrix P and obtain
the encrypted picture I” (i, j). The operation
performed is called Diffusion.
III. RESULTS AND DISCUSSIONS
The simulation results are shown in this section. Three
examples of images like two medical images and one
Lena image are taken. For the given input, respective
decrypted images are shown. Histogram analysis and
correlation analysis are shown for the respective input
image.
A. Entropy analysis
The information of entropy as shown in the below
equation is always designed to calculate the uncertainty
in a random variable.
(1)
Where F is1the gray1level and P (L=l) is
the1probability1of1pixels that1the value is equal to l. The
information1entropy1usually1can be used to1evaluate
805
the1randomness of an1image. For a gray2scale image Lena images are taken for the given input, respective
maximum1information2entropy is HL=8. decrypted images are shown.
The1information2entropy of the medical1image and For a brain medical image it’s selective as well as
Lena image after encryption should be close to 8 to complete encryption results are shown in Figure. 3
ensure security. As can be seen from the Table 1.
B. Histogram analysis
The histogram is the graphical representation of the
distribution of the pixels of different intensity levels as
against their numbers. Ideally the histogram for ciphered
image should be flat/uniform. This depicts that the image
is truly in disorder and uniformly distributed. The
uniform pixel level distribution reveals no leakage of
information. The histogram of the plain image has (a) (b)
several spikes.
The histogram of analysis as show in the Figure: 4.
Figure (a) is histogram of plain image and figure (b) is
histogram of encrypted image.
C. Correlation analysis
The A clearly visible image with proper brightness
has its correlation coefficient equal to one. But for the
ciphered image it has a significantly reduced value
(almost equal to zero). An encryption algorithm generates (c)
a ciphered image with randomly distributed pixels of Fig. 3 Encryption results a) Input Brain Medical Image, b) Selecting the
different intensities and has its correlation coefficient region of interest. c) Encrypting the selected region.
between adjacent pixels close to zero. A set of 4000
pairs1of1two1adjacent1pixels in1horizontal, The respective histogram and correlation analysis for
vertical1and1diagonal1directions were selected randomly original image as well as for the encrypted medical image
to determine the1correlation coefficient from the plain are shown.
and ciphered image. The correlation coefficient is given
by

(2)

Where is1the1Covariance1between1x and3y

can be formulated as

(3)
(a)
Where, x and y are two8adjacent2pixels values in the
image, V (x) is the variance of variable x,

(4)

Is the mean of variable x

= (5)
The correlation of results as show in
Figure:5.Figure5(a)5(c)and5(e)correlation of plain image
in horizontal, vertical and diagonal directions, fig5(b) (b)
5(d) and 5(f) is correlation of encrypted image in Fig. 4 Histogram results, (a) Histogram of Plain Image,
horizontal vertical and diagonal direction. Histogram of Encrypted image
The simulation results are shown in this section. Three
examples of images like two medical images and one

806
 IV. COMPARISIONS
TABLE I. COMPARISON OF THE DIFFERENT PARAMETERS
(MSE, PSNR, UACI, NPCR AND ENTROPY) FOR TWO
+MEDICAL IMAGES AS WELL AS LENA IMAGES AS SHOW IN
THE TABLE 1)
Horizo- Verti- Diago- Horizo- Vertic- Diagon-
Image ntal cal nal ntal al al
Plane Plane Plane Cipher Cipher Cipher
Medical
brain 0.7834 0.8532 0.8442 -0.0067 -0.0045 -0.0052
Image
Womb 0.9228 0.9372 0.9434 0.00065 -0.02308 0.01772
Lena 0.9722 0.9892 0.9578 -0.0087 -0.0273 -0.0049

TABLE II. COMPARISON OF THE CORRELATION

COEFFICIENT FOR THE CIPHERED AS WELL AS
PLAIN FOR TWO MEDICAL IMAGES AND LENA
IMAGE AS SHOW IN THE

Images MSE PSNR UACI NPCR Entropy

Medical
brain 1.8786x 5.392372 30.328907 99.477005 7.907750
Image
Womb 1.139x 7.577339 22.742875 99.597931 7.99925

Lena 0.9089x 8.338365 20.426840 99.619293 7.999275

Fig. 5 Correlation results, (a), (e) Correlation of Plain Image in V. CONCLUSION

Horizontal, Vertical and Diagonal Directions, (b), (d) and (f)
Correlation of Encrypted Image in Horizontal, Vertical and Diagonal
For a Lena image its selective as well as complete
encryption results are shown in Fig. 6.
(a) (b) (c)
Fig.6 Encryption results for Lena a) Input Medical Image, b) Selecting
the region of interest, c) Complete Encryption.
(a) (b) (c)
Fig. 7. Encryption results, a) Input Womb Medical Image, b)
Encrypting the selected region, c) Complete Encryption
Among other different variety of image compression
procedures it can be completed that chaotic picture
compression method is one of the finest and provide us
excellent mixture of speed, calculation power and
elevated height of safety. As of analysis, innovative
system for image encryption is introduced to encrypt
imagery by transformation and replacement process by
using chaotic map and LCG. in the anticipated system
chaotic map is worn to provide more encryption charge
and high level of safety, since chaos chart have pseudo-
random assets and non-periodicity as the chaotic sign are
typically noise-like and estimate some limit value as
result. More security is provided in medical field, since
confusion uses logistic map and diffusion uses Lorenz
map.
REFERENCES
[1] W. Diffie and M. E. Hellman, New Directions in Cryptography,
IEEE Transactions on Information Theory, Vol. 22, Issue 6, Nov
1976.
[2] H. Shuihua and Y. Shuangyuan, An Asymmetric Image
Encryption Based on Matrix Transformation, Transactions on
Computer and Information Technology, Vol. 1, No. 2, 2005.
[3] J. Daemen and V. Rijmen, AES Proposal: Rijndael, AES
Algorithm Submission, September 3, 1999.
[4] R. Matthews, on the derivation of a chaotic encryption algorithm.
Cryptologia, pp. 2942, 1989.
[5] B. Mohammed, G. Mourad, Z. Nourddine, R. Fakhita and B.
ElHoussine, Encryption-Compression Method of Images, Int.
Journal on Computer Science and Information Systems Vol. 4,
No. 1, pp. 30-41, 2009.
807
[6] L. Vorwerk, T. Engel and C. Meinel, A proposal for combination
of compression and encryption, Proceedings of Visual
Communications and Image Processing, SPIE, Vol. 4067, 2000.
[7] I. Masanori, O. Noboru, A. Ayman, M. Ali, New Image
Encryption and Compression Method Based on Independent
Component Analysis, 3rd International Conference on
Information and Communication Technologies: From Theory to
Applications, April 2008.
[8] C. P. Wu and J. Kuo, Design of Integrated Multimedia
Compression and Encryption Systems, IEEE Transactions on
Multimedia, Vol. 7, No. 5, 2005.
[9] W. Effelsberg and R. Steinmetz, Video Compression Techniques,
Heidelberg, Germany: Dpunkt-Verlag, 1998.
[10] W. Zeng and S. Lei, Efficient Frequency Domain Selective
Scrambling of Digital Video, IEEE Transactions on Multimedia,
5(1), March 2003.
[11] T. Maples and G. Spanos, Performance study of a selective
encryption scheme for the security of networked real-time video,
Proceedings of the 4th International Conference on Computer
Communications and Networks, Las Vegas, 1995.
[12] I. Agi and L. Gong, An empirical study of secure MPEG video
transmission, Symposium on Network and Distributed Systems
Security, 1996.
[13] M. V. Droogenbroeck and R. Benedett, Techniques for a selective
encryption of uncompressed and compressed images, Proceedings
of ACIVS, Ghent, Belgium, September 2002.
[14] M. V. Droogenbroeck, Partial Encryption of Images for Real-
Time Applications, 4th IEEE Signal Processing Symposium,
Hilvarenbeek, The Netherlands, pp. 11-15, 2004.
[15] O. M. Odibat, M. H. Abdallah and M. B. Al-Zoubi, New
Techniques in the Implementation of the Partial Image Encryption
, 4th International Multi-conference on Computer Science and
Information Technology, Jordan, 2006.
[16] K. Hong and K. Jung, Partial Encryption of Digital Contents
Using Face Detection Algorithm, Springer-Verlag, 2006.
[17] E. N. Lorenz, The Essence of Chaos, University of Washington
Press, Seattle, WA, 1993.
[18] H. S. Kellert, In the Wake of Chaos: Unpredictable Order in
Dynamical Systems, University of Chicago, pp. 56-62, 1993.

808