image compression and encryption using optimized wavelet ... · image compression and encryption...
TRANSCRIPT
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
Image Compression and Encryption using OptimizedWavelet Filter Bank and Chaotic Algorithm
Renjith V RaviResearch Scholar, Department of Electronics and Communication Engineering,
Faculty of Engineering, Karpagam University, Coimbatore, India.
Kamalraj SubramaniamAssociate Professor, Department of Electronics and Communication Engineering,
Faculty of Engineering, Karpagam University, Coimbatore, IndiaORCID: 0000-0001-9047-3220; ORCID: 0000-0002-6781-4282
Abstract: Over the past two decades, many developmentshas been made in the area of image processing. Growingdemand for storage and transmission of visual informationwas the real catalyst. Here, a novel image processing systememploying compression and encryption has been proposed.The system consists of optimized transformation module,compression and encryption module. A hybrid optimiza-tion algorithm has been developed initially, by combiningthe techniques of Bat and Genetic algorithms together andthe hybrid algorithm is used for developing an optimizedwavelet filter bank. This filter bank has been used withSPIHT algorithm for wavelet based image compression.Further a chaotic map based algorithm has been devel-oped for encryption of the compressed image data.Thequality of decompressed image has been assessed throughthe performance analysis of PSNR, MSE and SSIM. Theperformance of compression has been validated based oncompression ratio and compression rate. The results showthat the proposed filter performs better than other popularwavelet filters in terms of quality of decompression withoutaffecting the compression performance. Also, the perfor-mance of chaotic encryption algorithm has been verifiedusing different quality metrics and observed that, it resistsvarious cryptanalytic attacks.
Keywords: Optimized wavelet coefficients, HybridGenetic Bat algorithm, Chaotic Encryption, image Com-pression.
INTRODUCTION
In communication engineering, the rapid increase inrange and use of electronic imaging justifies attention forsystematic design of an image compression system withthe image quality needed in different applications [1]. Thechallenge however is that while high compression ratesare desired, the usability of reconstructed images dependson certain significant characteristics of the original imageswhich need to be preserved after the compression processhas been finished [2].
Several reputed image coders utilizes the transformDWT to accomplish improved compression performance[3], [1], [4], [5], [6]. A DWT based image compressionsystem consists of a quantizer and an encoder that exploitsthe redundancies to represent the image data in a com-pressed manner, whereas the decoder is used to reconstructthe original image from the compressed data. Despite thefact that the quantization incredibly enhances compressionratios, perfect reconstruction is unimaginable because ofthe quantization error[2].
A study in [7] on metaheuristic optimization for imagecompression demonstrates that it can be utilized to optimizewavelet coefficients and give enhanced image reconstruc-tion over the DWT when subject to quantization error.Theworks presented in the literature demonstrates the opti-mized transforms and its superior performance over stan-dard wavelets for satellite images[8], [9], [10], [11], [12],Military images [13], [14], [15], fractal images [16], space
10595
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
images [8], [17], [18], [19], Finger print images [20], [21]and medical images [22], [23] and [24].
When increasing access to the Internet and informa-tion resources like, image and video has a great impact inour everyday life and is making humans more dependenton computer systems and networks. This dependency hasbrought many threats to information security. As a result,reliably secure mechanisms are required to protect theimportant information which is presented as video or imageagainst vulnerabilities. One of the best known techniquesto protect data is cryptography. In this, the Encryptionand decryption are accomplished by using mathematicalalgorithms in such a way that no one but the intendedrecipient can decrypt and read the message.Among thecryptographic algorithms, the chaotic algorithms are bestsuitable for image encryption [25], [26], [27].
This paper deals with an optimized wavelet based imagecompression has been proposed and a chaotic transformbased image encryption algorithm has been developed. Thetechnique comprises of two modules, namely compressionmodule and chaotic encryption [28] module. In compres-sion module, the input image is transformed to waveletdomain with the use of hybrid bat-genetic algorithm basedoptimized wavelet filter bank and compressed using SPIHT[29]. Afterwards, in the encryption module, the encryptionusing chaos based encryption is carried out. For getting theoriginal image from the compressed and encrypted data, adecryption and decompression modules are also presented.
PROPOSED METHOD FOROPTIMIZATION OF WAVELET FILTERCOEFFICIENTS
Bat-Genetic hybridization
The hybrid Bat-Genetic hybridization is formed by incor-porating mutation [30] and cross-over operators [31] intothe bat algorithm [32] [33]. Bats are the only mammalsendowed with wings having the capability of echo loca-tion. The echolocation characteristics of bats assist in thedevelopment of several bat-inspired algorithms or bat algo-rithms. The vital features connected with the bat algorithmare the velocity of bats, the location of bats, and theirloudness. The technique derived in the bat algorithm isfor exploration and exploitation of issues based on these
features. Motivated by the characteristics of bats, the pro-posed approach adopts the bat algorithm for optimizing thefeatures listed in the feature list.
In the proposed technique, the wavelet filter banks areconsidered as the virtual bats. Based on the definition ofbat algorithm, each virtual bat is assigned a velocity vej aposition poj and loudness loj .
It is presumed that all bats invariably use echolocationto sense distance, in addition to guessing the distinctionbetween food/prey and background barriers in a certainamazing manner. Bats x‚y with velocity vej at positionpoj with a fixed frequency f remin, varying wavelength λ
and loudness loj to search for prey. They can automaticallyadjust the wavelength of their emitted pulses and adjustthe rate of pulse emission pe ∈ [0, 1], depending on theproximity of their target.
Bat algorithm [32] consists of diverse steps such as ini-tialization, creation of new solutions, local search, andgeneration of a new solution by randomly and finallyascertaining the current best solution. In the initializationprocess, all the elements are assigned arbitrary values in aspecific range demanded by the problem definition. Onceall the bats are initialized, their fitness levels are estimatedby means of a fitness function, which represents a ratiolinking the velocity, position, and the loudness. As it ispresumed that virtual bats are moving over the space, it iscertain that their velocity and position also will undergochange.
So the velocity and position should be updated forthe existing virtual bats. The new updated solutions canbe defined as based on equations (1a), (1b) and (1c)respectively.
f rej = f remin + (f remax − f remin)β (1a)
vetj = vet−1
j + (potj − pogb)f rej (1b)
potj = pot−1
j + potj (1c)
where t , is the time (iteration) in consideration, β ∈ [0, 1]isa random vector drawn from a uniform distribution, andpogb is the current global best location (solution) after com-paring all the solutions among all the bats. Subsequently,the initial best solutions are found out. For the local searchpart, once a solution is selected among the current bestsolutions, a new solution for each bat is generated locallyusing a local random walk:
ponew = poold + �Lot (2)
10596
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
where, � ∈ [−1, 1] is a random number, while Lot isthe average loudness of all the bats at the current time step.Accordingly, the velocity and position of all the virtual batsare updated till an end criterion.
The fitness function employed is the PSNR (Peak Sig-nal to Noise Ratio) value. The best solutions obtained afterthe bat algorithm is then modified using GA operators ofcross-over and mutation. GAs are adaptive heuristic searchalgorithms premised on the evolutionary concept of naturalselection and genetics, which have been extensively stud-ied, experimented and applied in several fields, includingengineering. GAs belong to the bigger class of evolutionaryalgorithms (EA), which generate solutions to optimizationissues using techniques enthused by natural evolution, likeinheritance, mutation, selection, and crossover. In a GA, apopulation of strings (chromosomes), which encode can-didate solutions to an optimization problem, is evolvedtowards superlative solutions.
Crossover characterizes the procedure of integratingtraits of two different individuals to generate solutions thatcan be of superior fitness than that of each of the parents.In our case, the wavelet filter bank constitutes the parents.Two parent individuals are chosen from the current popu-lation of the set to generate a new offspring. The numberof offspring chromosomes is evaluated using the crossoverprobability. In this connection, the modified Ranking par-ent selection, a modified version of ranking parent selection[34], is employed for choosing the parent individuals.Thealgorithm for modified ranking parent selection is shownin algorithm 1.
In this type of parent selection, the best solutions frombat algorithm will be arranged in the descending orderaccording to their fitness and selects the first and best fivesolutions. A uniform crossover [35] shown in algorithm 2is habitually used for performing this operation.
Mutations are perturbed probabilistically to usher in achange in the individuals. Crossover is incapable of bring-ing in any new features because it merely combines theexisting features with a new generation. The use of a muta-tion operator is likely to affect/remove certain new featuresdue to modifications in the chromosome. Uniform muta-tion [35] shown in algorithm 3 is effectively employed tomutate the individuals.
Mutation, on the other hand, is carried on the basis ofpre-determined mutating probability. The best chosen con-trol parameters for hybrid Bat-Genetic algorithm is listedin Table 1.
After performing the crossover and mutation, theobtained solutions are compared with the earlier solutions
10597
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
Table 1. Parameters of hybrid Bat-Genetic algorithm
Parameter ValuePopulation size 25Loudness 0.9Pulse rate 0.1Minimum frequency 0Maximum frequency 2No. of iterations 100Crossover Uniform crossoverCrossover rate 0.1Mutation Uniform MutationMutation rate 0.1Parent selection Modified Ranking
from bat algorithm and the best solutions are selected. Thecomparison is made by the use of fitness function. Finally,after all the iterations, the best solutions that emerge givethe optimized wavelet coefficients. Making use of thesecoefficients, decomposition and reconstruction are per-formed. The pseudo code of the proposed Bat-Geneticalgorithm hybridization is given in algorithm 4.
PROPOSED MODEL FOR SECURE IMAGECOMPRESSION AND ENCRYPTION
In this paper, an optimized wavelet filter-based image com-pression is proposed and shown in Fig. 1. The techniqueemploys hybrid bat-genetic algorithm based optimizedDWT and Chaos theory-based encryption. It comprisestwo modules, compression and encryption. In compressionmodule, the input image is transformed to wavelet domainusing optimized wavelet coefficients-based DWT. The opti-mality is brought about by the use of hybrid bat-geneticalgorithm. Subsequently, the compression is carried outusing SPIHT and encryption using Chaos-based algo-rithm.On the other side, a decryption and decompressionmodules were presented to do the reverse process.
FIGURE 1. Block diagram of the proposed technique
Image Compression Module
In this module, the input images are decomposed into subbands using optimized wavelet high-pass and low-passfilters.
After decomposition of an image, there will be four fre-quency bands, in particular the Low-Low(LL), Low–High(LH), High–Low (HL), and High–High (HH). The follow-ing level decomposition is simply connected to the LL
10598
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
FIGURE 2. Image decomposition. Each sub band has anatural orientation
band of the current decomposition stage, which structuresa recursive decomposition technique as shown in Fig. 2.Hence, an N-level decomposition will at long last have3n+1 diverse frequency bands, which incorporate 3n highfrequency bands and only one LL frequency band.
After applying wavelet transform to an image, theSPIHT [36],[5] algorithm has been used to encode thewavelet coefficients for achieving image compression.
Chaos-based encryption
The compressed image has been encrypted using permu-tation diffusion based Chaos technique [37].The techniquecomprises two processing stages: permutation (shuffle) anddiffusion. The shuffling processes the positions of pixelsand the diffusion diffuses the values of the pixels, whichare mentioned as position and values mask, respectively.
Specifically, the shuffle permutes the original organiza-tion pixels in the image, without changing their values. Forthis purpose, chaotic map named Arnold cat map is used,which is defined by equation (3).
[xm+1
ym+1
]=
[1 c
d cd + 1
] [xm
ym
]mod W (3)
Where c and d are two positive integers and W is the widthor height of the image. The terms xm and ym represents thecurrent position of pixels and xm+1 and ym+1 representsthe position of shuffled pixels. An image encryption algo-rithm only has the shuffle; its security is weak because thecat map is an invertible discrete map without mixing thepixels⣙ values. In other words, it does not change thestatistical properties of the plain image such as the inten-sity distribution of the pixels.So another process known asdiffusion using Gaussian map[38] is done for overcomingthis drawback.In this process,initially a key stream has beengenerated using the Equation (4) with α = 20, β = −0.9
and m1 = 0.1.
G(mi) = mi+1 = e(−α×m2i ) + β (4)
Usually, the output stream from a chaotic system is in therange of 0 to 1. So we will convert it into the range of 0 to256 using the Equation (5), before the diffusion process.
ki = (mi × 105) mod 256 (5)
The diffusion using this key stream ki is as shown belowin Equation (6)
Ei = Pi ⊕ ki (6)
Where Pi is the value of corresponding pixel in the shuffledimage and Ei is the value in encrypted image.The wholeencryption process has been described in Algorithm 5.
Decryption and Decompression
In order to obtain the original image from the compressedand encrypted data, the decryption and decompositionprocesses are to be carried out.The decryption is inverseoperation of the Chaos based encryption technique.In this,the original pixel value Pi is obtained by the Equation (7),provided that the secret key value Ei is known.
Pi = Ei ⊕ ki (7)
After that the inverse shuffling process will be carried outusing the Arnold Cat Map for getting the decrypted data.
10599
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
FIGURE 3. Test images
The decoding based on SPIHT process follows theinverse steps of compression exactly and is almost sym-metrical in terms of processing time. After decoding, theimage is inverse transformed to time domain using InverseDiscrete Wavelet Transform (IDWT). IDWT reconstructsa signal from the approximation and detail coefficientsderived from decomposition.
RESULTS AND DISCUSSION
The techniques are implemented in MATLAB on a systemhaving 8 GB RAM and 3.2 GHz Intel i-5 processor.The testimages [39] used for evaluation are shown in Fig. 3.
This section deals with the performance analysis ofproposed compression and encryption systems where eval-uated.The metrics used to evaluate the performance of theimage compression and decompression system includesthe PSNR, MSE [40], Compression ratio(CR) and thepercentage of compression ratio(CR%) [41], [42].
Performance of the Proposed Hybrid Bat-GeneticAlgorithm
Figure 4 shows the PSNR vs Iteration curve for theproposed hybrid Bat-Genetic algorithm.
Here, the use of this algorithm reveals that PSNR valueincreases with each iteration and reaches nearly saturation
10600
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
FIGURE 4. PSNR Vs Iteration of Proposed HybridBat-Genetic Algorithm
when the iteration count reaches more than 41. The max-imum PSNR value reached is around 42.3 for the trainedimage of ‘zelda’ of size (256 × 256) shown in Fig. 3(e).
Proposed Optimized Filter
After successful iteration of the hybrid Bat–Genetic algo-rithm, the coefficients of four optimized wavelet filterssuch as low pass decomposition filter (Lo_D), high passdecomposition filter (Hi_D), low pass reconstruction fil-ter (Lo_R), high pass reconstruction filter (Hi_R) wereobtained are shown in Table 2 and some of its propertiesare shown in Table 3.These filters performs their role in thecompression as like in [6].
Table 2. Filter coefficients of the proposed optimized filterbank
Lo_D Hi_D Lo_R Hi_R
−0.00038752 2.6966e−05 −2.6966e−05 −0.00038752
0.037922 −0.064251 −0.064251 −0.037922
−0.023092 0.039956 −0.039956 −0.023092
−0.11357 0.41771 0.41771 0.11357
0.38049 −0.78683 0.78683 0.38049
0.85321 0.41839 0.41839 −0.85321
0.37635 0.040143 −0.040143 0.37635
−0.10997 −0.06485 −0.06485 0.10997
−0.023781 −0.0004287 0.0004287 −0.023781
0.037046 7.9518e−05 7.9518e−05 −0.037046
Table 3. Properties of the proposed optimized filters
Sl.No. Characteristic Lo_D Hi_D Lo_R Hi_R
1 Filter Length 10 10 10 10
2 Filter Order 9 9 9 9
3 Stable Yes Yes Yes Yes
The single level decomposition and reconstruction ofimage in Fig. 3(a) using the proposed optimized waveletfilter is shown in Fig. 5.
Table 4 shows the performance analysis of the novel fil-ter based on energy and correlation coefficient. Ea, Eh, Ev,and Ed are the percentages of energy retained in the approx-imation, horizontal, vertical, and diagonal components,respectively.
The sum of energy is 100 in all cases; it means that thereis no loss of energy due to decomposition. Also the correla-tion coefficient between original image and reconstructedimage is unity; it means that there is no difference betweenthese two.
Performance Analysis of the Proposed Optimized FilterBased image compression
The results obtained from proposed optimized wavelet fil-ter and other existing wavelet filters with SPIHT basedcompression techniques are given in this section. Figure 6shows the corresponding decompressed output for the testimage ‘Lena.bmp’ obtained from our proposed techniqueand other wavelet filters such as haar, db4, Bior 5.5 andRbior 4.4 with SPIHT encoding at 1.0 bpp.
The evaluation metrics PSNR, MSE [40] and SSIM [43]are taken between the original image and decompressedimage and, compression ratio and the percentage of com-pression ratio (CR%) [41], [42] between original image andcompressed image. The comparison has been made withrespect to other popular wavelet filters such as Bior 5.5,RBior 4.4, Db4, haar at different bpp values and the resultsare shown in Table 5 and Table 9. The figures Fig. 7, 8, 9 and10 shows the performance comparison of the proposed filterwith other filters for the test image ‘Lena(256×256)’. Alsothe Table 8 shows the comparison of our results with somestandard results from literature.In all these cases the pro-posed optimized wavelet filter achieved better performancein image reconstruction compared to all other filters.
These results demonstrates the superiority of proposedoptimized wavelet filter over other wavelet filters. Note
10601
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
FIGURE 5. Decomposition and Reconstruction of test image ’Barbara.bmp(256 × 256)’ using proposed optimized filter
Table 4. Performance of Proposed optimized wavelet filter
Sl.No Image Ea Eh Ev Ed Sum of Percentage of Energy Correlation Coefficient1 Barbara 99.4275 0.1351 0.2756 0.1618 100 1.002 Cameraman 99.3776 0.1917 0.3671 0.0636 100 1.003 Bridge 98.8672 0.5932 0.3947 0.1449 100 1.004 Butterfly 97.6677 1.0761 0.9347 0.3215 100 1.005 Circuit 99.9031 0.0371 0.0544 0.0054 100 1.00
that Compression ratio is nearly same in all cases, thisclearly indicates that the use of proposed wavelet filter pre-serves the performance of image compression. In most ofthe cases, the use of proposed wavelet filter shows min-imum value of MSE and maximum value of PSNR andSSIM as compared to other standard wavelet filters. Thisindicates that there is less error between the original imageand decompressed image while using the proposed filter.
Performance Analysis of the Chaotic Image EncryptionAlgorithm
The results of chaotic encryption and decryption algorithmsare shown in Fig. 11. Here the shuffling process usingArnold Cat Map has been carried out for 12 rounds anddiffusion using Gauss Map has been carried out for onlyone round.
Histogram Analysis
It is desirable for a good encryption algorithm that the greyvalues of pixels are to be dispersed in the whole pixel valuespace [44]. From the Fig. 11(b) and 11(d) it is observedthat there is no change in the histogram, even after theshuffling process. But after the diffusion process,we can seein Fig. 11(f) that the gray values of pixels were scatteredamong the entire space. i.e., after encryption process thestatistical attack is not effective [44].
Correlation of Adjacent Pixels
It is desirable for an encryption algorithm to producethe encrypted image with less linear correlation (near to0) among its pixels in horizontal, vertical and diagonaldirection [44]. Here the correlation results are depictedin Fig. 12. It is observed that the there is high correla-tion between adjacent pixels in the plain image and in theencrypted image,it is less.Otherwise the linear correlationin the original image has been changed due to encryptionprocess.
From the Table 6, it is observed that the correlation inall the three directions, between pixels of original imageis larger than the encryption image. This means that theclosest pixels of original image have very large correlationbut the encrypted image has less correlation.Also comparedto [45] and [46], the correlation coefficient in Horizontal,Vertical and diagonal direction is less for the encryptedimage from proposed chaotic encryption algorithm.
Comparison with the literature
The performance analysis of chaotic image encryptionalgorithm has been done by using the evaluation metricssuch as Correlation between plain and encrypted images,entropy, Irregular Deviation(ID), Histogram Deviation(HD),Uniform Histogram Deviation(UHD), NPCR and
10602
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
Table 6. Correlation coefficient of two adjacent pixels for the test image Lena (256 × 256)
Direction of Plane Encrypted Image Encrypted Encryptedadjacent pixels image [Proposed Algorithm] image [45] image [46]Horizontal 0.9456 -0.0042 -0.0254 -0.0034Vertical 0.9727 -0.0018 0.0034 0.0061Diagonal 0.9213 0.0014 0.0315 0.0089
FIGURE 6. Decompressed image obtained from proposedtechnique and other wavelet filters such as for haar, db4, Bior4.4, Rbior 4.4, coif 4, and sym4 based techniques
UCAI mentioned in [47], [46] and [45]. The comparisonwith standard results are shown in Table 6 and 7.
From the Table 7, it is observed that entropy values ofthe encrypted image is near to 8 and thus the proposed
Table 5. Performance comparison of the proposed filter withother popular wavelet filters at bpp =1
Wavelet Filter bpp = 1.0
MSE PSNR SSIM
Barbara(256 × 256)bior5.5 18.2532 35.5174 0.83349db4 17.8421 35.6163 0.83939haar 31.1669 33.1939 0.76557rbio4.4 21.0365 34.9011 0.82185proposed 16.0459 36.0772 0.85299Lena(256x256)bior5.5 11.2332 37.6258 0.7997db4 10.9985 37.7175 0.81431haar 20.1757 35.0825 0.72155rbio4.4 13.4554 36.8418 0.79511proposed 9.3076 38.4424 0.82535Pepper(256x256)bior5.5 11.3805 37.5692 0.82167db4 10.3009 38.0021 0.84136haar 20.759 34.9587 0.75323rbio4.4 12.5261 37.1526 0.82455proposed 8.7879 38.692 0.85009Pirate(256x256)bior5.5 28.6055 33.5663 0.79127db4 27.857 33.6815 0.80461haar 41.5773 31.9422 0.73834rbio4.4 35.7834 32.594 0.78289proposed 25.208 34.1154 0.81721Zelda(256x256)bior5.5 4.3295 41.7664 0.91753db4 4.2348 41.8625 0.91953haar 12.2847 37.2372 0.84497rbio4.4 5.4921 40.7335 0.90545proposed 3.8306 42.2981 0.92611
Table 7. Evaluation of Chaotic Encryption Algorithm usingTest image Cameraman(256 × 256)
Metric Proposed [46] [48] [49]
Entropy 7.9970 7.9970 7.5717 7.9940
Correlation -0.0018 - - 0.0024
ID 0.5966 0.6034 - 0.5934
HD 0.9807 - - -
UHD 0.0680 0.0551 - -
NPCR 99.63 98.8251 - 99.9985
UCAI 31.33 33.1335 26.8856 -
10603
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
FIGURE 7. MSE Vs BPP for the test image ‘Lena.bmp’
FIGURE 8. PSNR Vs BPP for the test image ‘Lena.bmp’
FIGURE 9. SSIM Vs BPP for the test image ‘Lena.bmp’
chaotic encryption algorithm is able to resist the entropyattacks [45]. In the case of ID, a lower value indicates goodaccuracy in encryption[50]. Here the value of ID is lesscompared to [46] and near to [49].In the case of HD, ahigher value indicates good accuracy[50] and here it is
FIGURE 10. CR% Vs BPP for the test image ‘Lena.bmp’
FIGURE 11. Results of chaotic Encryption
0.9807. As a larger value of NPCR and UCAI is showsbetter accuracy of image encryption, the proposed algo-rithm had obtained nearly good values compared to [46]and [48].
10604
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
FIGURE 12. Correlation between adjacent pixels in plainand encrypted image in horizontal, vertical and diagonaldirection.
Table 8. Comparison of Proposed Method With ExistingMethods using Lena (256 × 256)
Method PSNR BPP
SCPSOGA[51] 27.24 0.3931
SC-CPSO[52] 27.23 0.3934
SC-GA[53] 27.41 0.4
SGA[54] 27.30 0.4
GA with hybrid selection[55] 27.03 0.4
FIC using DWT[16] 28.55 0.4
Proposed Hybrid BA-GA 31.6579 0.393
GA based method[56] 30.22 0.76
Proposed WorkHybrid BA-GA 36.1953 0.76
CONCLUSION
Optimized wavelet filter based image processing sys-tem makes use of hybrid BAT-Genetic algorithm basedoptimized DWT based compression and Chaos theory-based encryption. The proposed technique was comparedwith haar, Daubechies 4, biorthogonal 5.5, and ReverseBiorthogonal 4.4. The simulation results shows that theproposed technique has obtained better evaluation metric
compared to all the other existing wavelet-based imagecompression systems in terms of PSNR, MSE and SSIMvalues without affecting the compression performance.Further, the performance in decomposition and reconstruc-tion using the proposed filter, in terms of energy retainedin sub-bands and coefficient of correlation is analyzed.The sum of percentage of energy retained in all sub-bandsin all cases is 100%, which means that there is no lossin decomposition. Similarly, the coefficient of correlationbetween the reconstructed images is unity in all cases. Thisshows the proposed filter gives perfect decomposition andreconstruction. From all these results, we can infer that theproposed technique shows better performance in terms ofimage quality after decompression without affecting thecompression, compared to other existing filters.Also theperformance of encryption algorithm has been comparedusing various evaluation metrics and observed that it is alsoshowing optimized performance. The performance of com-pression can be improved by making proper modificationsin the encoding technique.
Conflict of Interests
The authors declare that there is no conflict of interestsregarding the publication of this article.
REFERENCES
[1] Sonja Grgic, Mislav Grgic, and Branka Zovko-Cihlar.Performance analysis of image compression usingwavelets. Industrial Electronics, IEEE Transactions on,48 (3): 682–695, 2001.
[2] Bryan E Usevitch. A tutorial on modern lossy waveletimage compression: foundations of jpeg 2000. IEEEsignal processing magazine, 18 (5): 22–35, 2001.
[3] Sonja Grgic, Krešimir Kerš, and Mislav Grgic. Imagecompression using wavelets. In Industrial Electronics,1999. ISIE’99. Proceedings of the IEEE InternationalSymposium on, volume 1, pages 99–104. IEEE, 1999.
[4] R Loganathan and YS Kumaraswamy. Medical imagecompression using biorthogonal spline wavelet with dif-ferent decomposition. IJCSE International Journal onComputer Science and Engineering, 2 (9): 3003–3006,2010.
[5] Bhawna Rani, RK Bansal, and Savina Bansal. Compar-ison of jpeg and spiht image compression algorithmsusing objective quality measures. In Multimedia, Sig-nal Processing and Communication Technologies, 2009.
10605
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
Tabl
e9
Perf
orm
ance
com
pari
son
ofth
epr
opos
edfil
ter
with
othe
rpo
pula
rw
avel
etfil
ters
atbp
pva
lues
0.3,
0.6
and
0.9
Wav
elet
Filte
rbp
p=
0.3
bpp
=0.
6bp
p=
0.9
MSE
PSN
RSS
IMC
RC
R%
MSE
PSN
RSS
IMC
RC
R%
MSE
PSN
RSS
IMC
RC
R%
Bar
bara
(256
×25
6)bi
or5.
5+sp
iht
97.2
656
28.2
512
0.60
275
3.33
3570
.001
243
.075
831
.788
50.
7274
61.
6667
40.0
024
21.4
721
34.8
121
0.81
406
1.11
1110
.000
6db
4+sp
iht
84.9
929
28.8
370.
6236
73.
3335
70.0
012
40.2
419
32.0
840.
7439
51.
6667
40.0
024
21.6
355
34.7
791
0.82
335
1.11
1110
.002
1ha
ar+
spih
t12
7.28
8927
.082
90.
5284
33.
3335
70.0
012
62.9
7730
.139
0.66
106
1.66
6740
.002
437
.917
432
.342
40.
7383
31.
1111
10.0
021
rbio
4.4+
spih
t96
.820
528
.271
10.
6012
33.
3335
70.0
012
47.0
489
31.4
053
0.71
981
1.66
6740
.002
425
.182
34.1
199
0.80
181.
1111
10.0
021
Prop
osed
+sp
iht
77.5
166
29.2
369
0.64
288
3.33
3570
.001
236
.570
532
.499
50.
7556
71.
6667
40.0
024
19.2
637
35.2
834
0.83
174
1.11
1110
.002
1L
ena(
256×
256)
bior
5.5+
spih
t76
.988
429
.266
60.
5806
13.
3335
70.0
012
30.5
683
33.2
781
0.69
894
1.66
6740
.000
913
.180
636
.931
50.
7863
61.
1111
10.0
006
db4+
spih
t73
.876
329
.445
80.
5992
43.
3335
70.0
012
29.0
262
33.5
029
0.72
459
1.66
6740
.002
413
.263
36.9
044
0.80
103
1.11
1110
.000
6ha
ar+
spih
t11
4.85
2927
.529
40.
5034
83.
3335
70.0
012
48.2
266
31.2
979
0.63
156
1.66
6740
.002
424
.785
34.1
889
0.69
935
1.11
1110
.000
6rb
io4.
4+sp
iht
89.4
433
28.6
153
0.58
126
3.33
3570
.001
235
.170
332
.669
0.70
262
1.66
6740
.002
416
.539
235
.945
70.
7728
41.
1111
10.0
021
Prop
osed
+sp
iht
63.7
421
30.0
865
0.63
323.
3335
70.0
012
24.0
893
34.3
126
0.74
481
1.66
6740
.002
411
.548
937
.505
40.
8103
21.
1111
10.0
006
Pepp
er(2
56×2
56)
bior
5.5
+sp
iht
82.2
116
28.9
815
0.61
261
3.33
3570
.001
227
.738
633
.70.
7374
41.
6667
40.0
009
12.9
767
36.9
992
0.81
155
1.11
1110
.002
1db
4+sp
iht
76.8
563
29.2
740.
6468
93.
3335
70.0
012
26.8
1433
.847
20.
7628
41.
6667
40.0
009
12.3
068
37.2
293
0.83
002
1.11
1110
.002
1ha
ar+
spih
t12
1.93
727
.269
40.
5298
53.
3336
70.0
027
49.1
953
31.2
116
0.66
456
1.66
6740
.002
425
.773
334
.019
10.
7333
91.
1111
10.0
006
rbio
4.4+
spih
t91
.864
428
.499
30.
6219
93.
3336
70.0
027
32.3
906
33.0
266
0.74
791.
6667
40.0
009
15.0
781
36.3
473
0.80
737
1.11
1110
.000
6Pr
opos
ed67
.350
229
.847
40.
6663
13.
3335
70.0
012
22.3
181
34.6
442
0.77
638
1.66
6740
.002
410
.883
637
.763
10.
8365
41.
1111
10.0
006
Pir
ate(
256×
256)
bior
5.5+
spih
t12
7.25
0427
.084
20.
5421
43.
3336
70.0
027
60.1
622
30.3
376
0.68
829
1.66
6740
.000
934
.882
832
.704
70.
7647
41.
1111
10.0
021
db4+
spih
t11
6.51
2627
.467
10.
5682
63.
3335
70.0
012
57.3
0630
.548
80.
711.
6667
40.0
009
33.9
139
32.8
270.
7890
61.
1111
10.0
021
haar
+sp
iht
153.
1436
26.2
798
0.47
633.
3336
70.0
027
78.8
512
29.1
627
0.61
703
1.66
6740
.002
449
.004
431
.228
50.
7138
1.11
1110
.002
1rb
io4.
4+sp
iht
132.
5628
26.9
066
0.53
424
3.33
3570
.001
266
.817
629
.881
90.
6758
11.
6667
40.0
009
41.0
641
31.9
962
0.76
041
1.11
1110
.000
6Pr
opos
ed+
spih
t11
1.13
5227
.672
30.
5781
83.
3335
70.0
012
53.3
029
30.8
633
0.71
863
1.66
6740
.000
929
.696
933
.403
70.
7949
11.
1111
10.0
006
Zel
da(2
56×2
56)
bior
5.5+
spih
t29
.427
33.4
433
0.78
298
3.33
3670
.002
710
.677
437
.846
20.
871
1.66
6740
.000
95.
0228
41.1
213
0.91
035
1.11
1110
.002
1db
4+
spih
t28
.231
733
.623
40.
7849
43.
3336
70.0
027
10.6
303
37.8
653
0.87
301
1.66
6740
.000
95.
2013
40.9
697
0.91
168
1.11
1110
.002
1ha
ar+
spih
t59
.342
530
.397
10.
6231
33.
3335
70.0
012
26.8
658
33.8
388
0.75
469
1.66
6740
.000
914
.533
236
.507
20.
8305
61.
1111
10.0
021
rbio
4.4+
spih
t36
.276
432
.534
60.
749
3.33
3670
.002
713
.293
836
.894
30.
8541
21.
6667
40.0
024
7.10
6439
.614
30.
8922
31.
1111
10.0
006
Prop
osed
+sp
iht
25.5
943
34.0
494
0.80
561
3.33
3570
.001
29.
2857
38.4
527
0.88
117
1.66
6740
.002
44.
5436
41.5
568
0.91
731.
1111
10.0
021
Cam
eram
an(2
56×2
56)
bior
5.5+
spih
t12
5.89
8927
.130
60.
3155
43.
3335
70.0
012
53.6
106
30.8
383
0.44
101
1.66
6740
.000
928
.021
833
.655
80.
5111
71.
1111
10.0
006
db4+
spih
t11
8.02
8427
.410
90.
3378
3.33
3670
.002
750
.056
331
.136
20.
4569
91.
6667
40.0
024
26.0
755
33.9
685
0.53
052
1.11
1110
.000
6ha
ar+
spih
t12
4.80
1527
.168
60.
3060
13.
3336
70.0
027
53.4
2630
.853
30.
4187
91.
6667
40.0
024
26.6
462
33.8
745
0.50
287
1.11
1110
.002
1rb
io4.
4+sp
iht
131.
7426
26.9
335
0.32
924
3.33
3670
.002
757
.684
430
.520
20.
4375
71.
6667
40.0
024
30.2
566
33.3
226
0.51
735
1.11
1110
.002
1pr
opos
ed+
spih
t10
8.29
3127
.784
80.
3470
13.
3335
70.0
012
46.0
202
31.5
013
0.46
539
1.66
6740
.000
921
.950
534
.716
40.
5382
91.
1111
10.0
006
10606
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
Tabl
e10
Perf
orm
ance
com
pari
son
ofth
epr
opos
edfil
ter
with
othe
rpo
pula
rw
avel
etfil
ters
atbp
pva
lues
0.25
,0.5
,0.7
5
Wav
elet
Filte
rbp
p=
0.25
bpp
=0.
5bp
p=
0.75
MSE
PSN
RSS
IMC
RC
R%
MSE
PSN
RSS
IMC
RC
R%
MSE
PSN
RSS
IMC
RC
R%
Bar
bara
(256
×25
6)bi
or5.
5+sp
iht
107.
7607
27.8
062
0.57
535
475
51.9
505
30.9
749
0.70
224
2.00
0150
.001
530
.076
433
.348
50.
7775
61.
3333
25db
4+sp
iht
96.3
127
28.2
940.
6040
14.
0002
75.0
015
48.9
8531
.230
20.
7197
92
5029
.763
733
.393
90.
7889
21.
3334
25.0
015
haar
+sp
iht
144.
0368
26.5
461
0.49
573
475
76.2
933
29.3
059
0.62
234
2.00
0150
.001
548
.462
531
.276
70.
7038
61.
3333
25rb
io4.
4+sp
iht
108.
5368
27.7
750.
5740
34.
0002
75.0
015
56.2
707
30.6
280.
6887
52
5036
.572
832
.499
20.
7540
21.
3334
25.0
015
prop
osed
+sp
iht
89.1
736
28.6
284
0.61
678
4.00
0275
.001
545
.747
631
.527
10.
7328
42.
0001
50.0
015
25.8
185
34.0
115
0.80
624
1.33
3325
Len
a(2
56×
256)
bior
5.5+
spih
t94
.145
628
.392
80.
5557
34
7538
.304
332
.298
30.
6779
12.
0001
50.0
015
17.6
101
35.6
732
0.75
658
1.33
3325
db4+
spih
t88
.470
828
.662
80.
5777
44
7537
.834
332
.351
90.
6986
52
5018
.856
35.3
763
0.76
121
1.33
3425
.001
5ha
ar+
spih
t13
2.99
726
.892
40.
4653
4.00
0275
.001
561
.088
30.2
712
0.59
351
2.00
0150
.001
534
.842
432
.709
70.
6728
21.
3333
25rb
io4.
4+sp
iht
103.
3765
27.9
866
0.54
648
4.00
0275
.001
545
.191
31.5
803
0.67
103
2.00
0150
.001
525
.294
234
.100
60.
7308
81.
3333
25pr
opos
ed+
spih
t79
.975
429
.101
20.
6096
34
7532
.637
32.9
937
0.72
321
250
16.0
231
36.0
833
0.78
198
1.33
3425
.001
5Pe
pper
(256
×25
6)bi
or5.
5+sp
iht
97.9
705
28.2
199
0.59
478
475
36.2
4632
.538
20.
7189
22
5016
.754
235
.889
60.
7904
41.
3334
25.0
015
db4+
spih
t92
.371
28.4
754
0.62
176
4.00
0275
.001
534
.527
632
.749
10.
7450
62.
0001
50.0
015
17.1
075
35.7
989
0.79
752
1.33
3325
haar
+sp
iht
147.
2965
26.4
489
0.47
725
475
65.2
409
29.9
856
0.61
605
250
35.9
849
32.5
696
0.70
781.
3333
25rb
io4.
4+sp
iht
111.
7614
27.6
479
0.57
835
4.00
0275
.001
542
.320
931
.865
30.
7118
82.
0001
50.0
015
23.3
825
34.4
419
0.77
007
1.33
3325
prop
osed
+sp
iht
85.7
845
28.7
967
0.64
065
475
30.2
2433
.327
30.
7574
32.
0001
50.0
015
14.6
214
36.4
809
0.81
435
1.33
3425
.001
5P
irat
e(2
56×
256)
bior
5.5+
spih
t14
3.76
9226
.554
10.
5122
24
7571
.848
629
.566
60.
6467
32.
0001
50.0
015
48.7
0731
.254
90.
7264
51.
3334
25.0
015
db4+
spih
t13
1.56
1826
.939
50.
5305
74.
0002
75.0
015
70.1
093
29.6
730.
6679
42.
0001
50.0
015
43.7
778
31.7
183
0.75
396
1.33
3425
.001
5ha
ar+
spih
t17
4.19
6725
.720
40.
4363
94.
0002
75.0
015
97.8
1328
.226
80.
5821
32
5061
.849
930
.217
40.
6749
1.33
3425
.001
5rb
io4.
4+sp
iht
153.
1598
26.2
794
0.49
436
4.00
0275
.001
587
.309
228
.720
20.
6274
92
5051
.402
831
.020
90.
7275
81.
3334
25.0
015
prop
osed
+sp
iht
126.
9465
27.0
946
0.54
061
4.00
0275
.001
564
.732
730
.019
60.
6788
72.
0001
50.0
015
40.1
3532
.095
60.
7609
91.
3334
25.0
015
Zel
da(2
56×
256)
bior
5.5+
spih
t35
.161
32.6
702
0.76
306
4.00
0275
.001
513
.372
236
.868
80.
8543
92.
0001
50.0
015
7.09
9439
.618
60.
8912
61.
3334
25.0
015
db4+
spih
t36
.113
932
.554
10.
7518
64.
0002
75.0
015
14.1
901
36.6
109
0.84
934
250
7.38
0939
.449
70.
8956
21.
3334
25.0
015
haar
+sp
iht
69.9
355
29.6
838
0.60
136
475
33.4
099
32.8
920.
7314
92
5019
.090
535
.322
60.
7970
41.
3334
25.0
015
rbio
4.4+
spih
t47
.569
931
.357
50.
7173
74
7519
.051
835
.331
40.
8205
92.
0001
50.0
015
9.40
2938
.398
20.
8763
51.
3333
25pr
opos
ed+
spih
t31
.293
33.1
763
0.77
984.
0002
75.0
015
12.0
729
37.3
127
0.86
617
2.00
0150
.001
56.
4101
40.0
622
0.90
172
1.33
3325
Cam
eram
an(2
56×
256)
bior
5.5+
spih
t14
4.59
1426
.529
40.
2957
64
7567
.973
229
.807
40.
4091
12.
0001
50.0
015
40.5
291
32.0
531
0.47
811
1.33
3325
db4+
spih
t14
0.18
2126
.663
90.
3149
14
7564
.690
730
.022
40.
4266
12
5037
.061
532
.441
60.
4945
81.
3334
25.0
015
haar
+sp
iht
146.
9839
26.4
581
0.28
989
475
70.0
271
29.6
781
0.39
342
5038
.663
632
.257
80.
4617
41.
3333
25rb
io4.
4+sp
iht
167.
1763
25.8
991
0.30
494
7579
.047
629
.151
90.
409
250
41.4
865
31.9
517
0.48
149
1.33
3325
prop
osed
+sp
iht
125.
9597
27.1
285
0.32
368
4.00
0275
.001
558
.026
130
.494
60.
4373
92.
0001
50.0
015
32.5
507
33.0
052
0.50
482
1.33
3425
.001
5
10607
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
IMPACT’09. International, pages 90–93. IEEE, 2009.[6] Athanassios Skodras, Charilaos Christopoulos, and
Touradj Ebrahimi. The jpeg 2000 still image compres-sion standard. IEEE Signal processing magazine, 18 (5):36–58, 2001.
[7] Frank Moore, Brendan Babb, Michael Peterson, andGary Lamont. Evolved transforms improve image com-pression. SPIE Newsroom, 2009.
[8] Frank W Moore and Brendan J Babb. Evolved trans-forms for improved reconstruction of lossy-compressednasa images. In Proceedings of the Companion Publi-cation of the 2014 Annual Conference on Genetic andEvolutionary Computation, pages 1465–1466. ACM,2014.
[9] Michael R Peterson, Toby Horner, and Frank Moore.Evolving matched filter transform pairs for satelliteimage processing. In SPIE Defense, Security, and Sens-ing, pages 80590L–80590L. International Society forOptics and Photonics, 2011.
[10] Michael R Peterson, Shawn Aldridge, Britny Herzog,and Frank Moore. Two satellite image sets for the train-ing and validation of image processing systems fordefense applications. In SPIE Defense, Security, andSensing, pages 77040B–77040B. International Societyfor Optics and Photonics, 2010.
[11] Brendan Babb, Frank Moore, and Michael Peterson.Optimized satellite image compression and reconstruc-tion via evolution strategies. In SPIE Defense, Secu-rity, and Sensing, pages 73470O–73470O. InternationalSociety for Optics and Photonics, 2009.
[12] Michael R Peterson, Gary B Lamont, Frank Moore,and Patrick Marshall. A satellite image set for the evo-lution of image transforms for defense applications.In Proceedings of the 9th annual conference compan-ion on Genetic and evolutionary computation, pages2901–2906. ACM, 2007a.
[13] Michael R Peterson, Gary B Lamont, and FrankMoore. The role of wavelet coefficients in fitness land-scapes of image transforms for defense applications. InSPIE Defense, Security, and Sensing, pages 73470D–73470D. International Society for Optics and Photonics,2009.
[14] Michael R Peterson, Gary B Lamont, Frank Moore,and Patrick Marshall. Evolving military-grade imagetransforms using state-of-the-art variation operators.In Defense and Security Symposium, pages 65630H–65630H. International Society for Optics and Photonics,2007b.
[15] M Peterson, G Lamont, and Frank Moore. Evaluatingmutation operators for evolved image reconstructiontransforms. In Proceedings of the Eighth Annual Geneticand Evolutionary Computation Conference (GECCO2006), volume 7, pages 08–12, 2006.
[16] Ming-Sheng Wu. Genetic algorithm based on discretewavelet transformation for fractal image compression.
Journal of Visual Communication and Image Represen-tation, 25 (8): 1835–1841, 2014.
[17] F Moore and B Babb. Evolved multiresolution anal-ysis transforms improve lossy compression of marsimages. In IASTED Int. Conf. Signal and Image Proc,2012.
[18] Frank Moore, Brendan Babb, Shawn Aldridge, andMichael R Peterson. Evolving matched forward andinverse transforms for improved lossy compression ofimages from mars. In Systems, Man, and Cybernetics(SMC), 2011 IEEE International Conference on, pages484–489. IEEE, 2011.
[19] Shawn Aldridge, Brendan Babb, Frank Moore, andMichael R Peterson. Improved reconstruction of deepspace images via genetic algorithms. In EvolutionaryComputation (CEC), 2011 IEEE Congress on, pages102–109. IEEE, 2011.
[20] Brendan Babb and Frank Moore. The best fingerprintcompression standard yet. In Systems, Man and Cyber-netics, 2007. ISIC. IEEE International Conference on,pages 2911–2916. IEEE, 2007.
[21] Brendan Babb, Frank Moore, and Michael Peterson.Evolved transforms beat the fbi wavelet for improved fin-gerprint compression and reconstruction. In 6th WSEASInternational Conference on Telecommunications andInformatics/6th WSEAS International Conference onSignal Processing, pages 179–184, 2007.
[22] V Ellappan and R Samson Ravindran. Optimal fil-ter design of wavelet transform to an adaptive medi-cal image compression technique using genetic groupsearch optimizer. Journal of Medical Imaging andHealth Informatics, 6 (2): 484–493, 2016.
[23] Chris Miller, Frank Moore, Brendan Babb, andMichael R Peterson. Improved reconstruction of quan-tized ct scans via genetic algorithms. In EvolutionaryComputation (CEC), 2011 IEEE Congress on, pages2293–2299. IEEE, 2011a.
[24] Chris Miller, Brendan Babb, Frank Moore, and MichaelPeterson. Evolving improved transforms for reconstruc-tion of quantized ultrasound images. In Applicationsof Computer Vision (WACV), 2011 IEEE Workshop on,pages 256–261. IEEE, 2011b.
[25] Jawad Ahmad, Seong Oun Hwang, and Arshad Ali. Anexperimental comparison of chaotic and non-chaoticimage encryption schemes. Wireless Personal Commu-nications, 84 (2): 901–918, 2015.
[26] Chenghang Yu, Baojun Zhang, and Xiang Ruan. Thechaotic feature of trigonometric function and its use forimage encryption. In Fuzzy Systems and Knowledge Dis-covery (FSKD), 2011 Eighth International Conferenceon, volume 1, pages 390–395. IEEE, 2011.
[27] Safwan ElAssad, Mousa Farajallah, and CalinVladeanu.Chaos-based block ciphers: An overview. In Communi-cations (COMM), 2014 10th International Conferenceon, pages 1–4. IEEE, 2014.
10608
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
[28] Mao-Yu Huang,Yueh-Min Huang, and Ming-Shi Wang.Image encryption algorithm based on chaotic maps. InComputer Symposium (ICS), 2010 International, pages154–158. IEEE, 2010.
[29] Amir Said and William A Pearlman. A new, fast, andefficient image codec based on set partitioning in hierar-chical trees. Circuits and Systems for Video Technology,IEEE Transactions on, 6 (3): 243–250, 1996.
[30] Jonathan Page, Riccardo Poli, and William B Langdon.Mutation in Genetic Programming: A Preliminary Study.Springer, 1999.
[31] Gilbert Syswerda. Uniform crossover in genetic algo-rithms. Morgan Kaufmann Publishers, Inc., 1989.
[32] Xin-She Yang. A new metaheuristic bat-inspired algo-rithm. In Nature inspired cooperative strategies foroptimization (NICSO 2010), pages 65–74. Springer,2010.
[33] Xin-She Yang and Xingshi He. Bat algorithm: literaturereview and applications. International Journal of Bio-Inspired Computation, 5 (3): 141–149, 2013.
[34] Lothar Thiele Tobias Blickle. A comparison of selec-tion schemes used in genetic algorithms. TechnicalReport 11, Computer Engineering and Communica-tions Networks Lab (TIK), Swiss Federal Institute ofTechnology (ETH), Gloriastrasse 35, CH-8092,Zurich,1995.
[35] R.C. Barros, A.C.P.L.F. de Carvalho, and A.A. Freitas.Automatic Design of Decision-Tree Induction Algo-rithms. SpringerBriefs in Computer Science. SpringerInternational Publishing, 2015. ISBN 9783319142319.
[36] Enas M. Jamel. Efficiency spiht in compression andquality of image. Journal of the College of Educa-tion For Women, Baghdad University, 22 (3): 627–637,2011.
[37] Ljupco Kocarev, Zbigniew Galias, and Shiguo Lian.Intelligent Computing Based on Chaos, volume 184.Springer Science & Business Media, 2009.
[38] S. Lynch. Dynamical Systems with Applicationsusing MATLAB®. Birkhäuser Boston, 2004. ISBN9780817643218.
[39] Rafael C Gonzalez and Richard E Woods. Imagedatabases. URL http://www.imageprocessingplace.com/root_files_V3/image_databases.htm.
[40] Quan Huynh-Thu and Mohammed Ghanbari. Scopeof validity of psnr in image/video quality assessment.Electronics letters, 44 (13): 800–801, 2008.
[41] M Cherifi, M Lahdir, and S Ameur. Sorted run lengthcoding-application to meteosat image compression. InEnvironmental Engineering and Computer Application:Proceedings of the 2014 International Conference onEnvironmental Engineering and Computer Application(ICEECA 2014), Hong Kong, 25-26 December 2014,page 159. CRC Press, 2015.
[42] ShaimaaA El-said, Khalid FA Hussein, and Mohamed MFouad. Image compression technique for low bit rate
transmission. International Journal of Computer Visionand Image Processing (IJCVIP), 1 (4): 1–18, 2011.
[43] Zhou Wang, Alan C Bovik, Hamid R Sheikh, and Eero PSimoncelli. Image quality assessment: from error visibil-ity to structural similarity. IEEE transactions on imageprocessing, 13 (4): 600–612, 2004.
[44] Aaditya Gupta, Richa Thawait, K Abhimanyu KumarPatro, and BibhudendraAcharya.A novel image encryp-tion based on bit-shuffled improved tent map. Interna-tional Journal of Control Theory and Applications, 9(34): 1–16, 2016.
[45] M Bin Younas and Jawad Ahmad. Comparative analysisof chaotic and non-chaotic image encryption schemes.In Emerging Technologies (ICET), 2014 InternationalConference on, pages 81–86. IEEE, 2014.
[46] Jan Sher Khan, Atique ur Rehman, Jawad Ahmad,and Zeeshan Habib. A new chaos-based secure imageencryption scheme using multiple substitution boxes.In Information Assurance and Cyber Security (CIACS),2015 Conference on, pages 16–21. IEEE, 2015.
[47] Ahmed M Ayoup, Amr H Hussein, and Mahmoud AAAttia. Efficient selective image encryption. Multime-dia Tools and Applications, 75 (24): 17171–17186,2016.
[48] Minal Govind Avasare and Vishakha Vivek Kelkar.Image encryption using chaos theory. In Communica-tion, Information & Computing Technology (ICCICT),2015 International Conference on, pages 1–6. IEEE,2015.
[49] Amr M Riad, Amr H Hussein, Hossam M Kasem, andA ABOU EL-AZM. A new efficient image encryp-tion technique based on arnold and idea algorithms.In International Conference on Image and InformationProcessing (ICIIP 2012), volume 46, 2012.
[50] Chiranjoy Chattopadhyay, Bikramjit Sarkar, andDebaprasad Mukherjee. Encoding by dna relations andrandomization through chaotic sequences for imageencryption. arXiv preprint arXiv:1505.01795, 2015.
[51] Gohar Vahdati, Habib Khodadadi, MahdiYaghoobi, andMohammad-R Akbarzadeh-T. Fractal image compres-sion based on spatial correlation and hybrid particleswarm optimization with genetic algorithm. In SoftwareTechnology and Engineering (ICSTE), 2010 2nd Inter-national Conference on, volume 2, pagesV2–185. IEEE,2010a.
[52] Gohar Vahdati, Mahdi Yaghoobi, and Mohammad RezaAkbarzadeh-Totonchi. Fractal image compression basedon spatial correlation and chaotic particle swarm opti-mization. In Hybrid Intelligent Systems (HIS), 2010 10thInternational Conference on, pages 131–134. IEEE,2010b.
[53] Ming-Sheng Wu, Wei-Chih Teng, Jyh-Horng Jeng, andJer-Guang Hsieh. Spatial correlation genetic algorithmfor fractal image compression. Chaos, Solitons & Frac-tals, 28 (2): 497–510, 2006.
10609
International Journal of Applied Engineering Research, ISSN 0973-4562 Volume 12, Number 21 (2017) pp. 10595–10610© Research India Publications, http://www.ripublication.com
[54] Ming-Sheng Wu, Jyh-Horng Jeng, and Jer-Guang Hsieh.Schema genetic algorithm for fractal image compres-sion. Engineering Applications of Artificial Intelligence,20 (4): 531–538, 2007.
[55] Ming-Sheng Wu and Yih-Lon Lin. Genetic algorithmwith a hybrid select mechanism for fractal image com-pression. Digital Signal Processing, 20 (4): 1150–1161,2010.
[56] Suman K Mitra, CA Murthy, and MK Kundu. Imagecompression and edge extraction using fractal techniqueand genetic algorithm. In Soft Computing for ImageProcessing, pages 79–100. Springer, 2000.
10610