Low Power Lossless Image Compression Algorithm Using Spider Monkey Optimization

3799

Low Power Lossless Image Compression

Algorithm Using Spider Monkey Optimization

Abstract: Image compression is essential for 4G, 5G, multimedia applications, communications etc. Today storage space is very costly in favor of technological improvements, for storage maintenance, spending many economies, so digital images are to be compressed for maintains electronic storage devices. Redundancy removal concept is related to image compression, because of this, memory utilization and processing time, training time, videos, images, data transmission, and receiving all parameters shall be reduced. Image compression decreases the size, in terms of bits and bytes, without affecting the quality of image properties. Different algorithms existed methods like PSO, DE, GA are used for images but not give a better quality of images, PSNR, MSE, CR, BPP etc. In this paper, the proposed method for image compression using spider and monkey optimization gives better results compared to PSO, DE and GA methods.

Index terms: PSO, DE, GA, Spider Monkey Optimization (SPMO).

——————————  ——————————

1.

INTRODUCTION

In this scenario presents a lossless image compression and calculation. To achieve high compression, speed, operate a straight forecast, SPMO can execute all displaying strategy. Contrast tone and gray scale IM digital bit can improve up to 16-bits. This work results are particularly useful for high, small, medium dimensional image applications. The average comp speed on Intel Xeon 3.06GHz CPU is 47MB/s. For enormous pictures, the rate is over 60MB/s, i.e., the calculation needs under 50CPU cycles per byte of the image. Our calculation is prescient and versatile; it packs continuous tone grayscale pictures. The picture is handled in a raster-check request. Right off the beat, we perform expectation utilizing an indicator chose from a fixed set of 9 direct fundamental indicators. Forecast mistakes are reordered to get likelihood appropriation expected by the information model and the entropy coder, and after that give way as a succession of residuum images. For encoding scheme images, we utilize a group of prefix codes dependent on the SPMO model. For quick and versatile displaying, we use a straightforward setting information model dependent on a model of the SPMO calculation [1] and the strategy for diminished model update recurrence [2]. The calculation was intended to be necessary and quick. We don't utilize techniques, for example, identification of smooth locales or tendency dropping. Decompression is an essential inversion of the comp procedure. To predict the power of a specific pixel X, we utilize quick straight indicators that utilization up to 3 neighboring pixels: the left-hand neighbour (A), the upper neighbor (B), and the upper-left neighbor (C). We utilize 8 indicators of the Lossless JPEG calculation [3], and one more unpredictable indicator Pred8, that restores a normal of Pred4 and Pred7.

Signs are determined to utilize whole number maths. We select a single indicator for the entire image, anyway for pixels of the first push and the first column a few signs can't be determined for this situation we utilize more straightforward indicators (e.g., Pred2 for the first section). On the off chance that there is a subtraction activity in a figuring of the indicator, at that point its value might be out of the apparent scope of pixel powers [0,2N−1], where N means picture bit depth. In such a case, we take the nearest estimation from the above range. We pack the trained image that is a difference between the genuine (X) and the anticipated (Pred(X)).The process that involves transforming of data starting one demonstration to additional, lesser illustration after which the innovative, otherwise a near estimate to it [1] explains the singular value decomposition with denoising and image compression, container be improved, is termed as data compression. The compression, as well as decompression procedures, are conveyed as encoding and decoding. Data compression is required because uncompressed data take up a lot of space which reduces the efficiency of CPU due to limited availability of hard drive space[2]. Uncompressed Data also reduce the internet download speeds. Compression has other advantages as well, it helps in reducing the resource usage and cost. Moreover, the hardware gets better and cheaper [3]. It is significantly used in the areas of file storage and distributed system. In order to increase speed also presentation effectiveness, compression is used. We need to design an efficient algorithm in order to compress data and simultaneously, remove various duplicates from a different data formats. While designing an algorithm for data compression, the efficiency and effectiveness of the algorithm must be considered [4-8]. There are different data formats available that can be compressed. It can either be audio, video or text. Every format has a unique method for identifying the redundancy and then, to remove it. Enhanced prediction models container be considered if we know the file type and hence, improved compression consequences can be achieved through fewer effort[9-10]. There are two kinds of algorithms namely, Lossless and Lossy algorithms. In Lossless technique, data compression algorithms are used to compress the data such that the exact original records container remain brought back commencing the compressed statistics. Lossless density is also named changeable compression meanwhile the original data may be reconstructed perfectly by decompression. These constrict

___________________________________

 Mahesh Boddu, Ph.D. Student Maulana Abul Kalam Azad University of Technology, Kolkata, West Bengal.

methods are generally used to compress medical pictures, manuscript as well as images conserved for legal reasons, computer executable file and so on. This is in contrary to the lossy statistics compression in which the exact innovative records cannot be reassembled commencing the compressed data. There are specific irrelevant particulars that might become lost throughout the procedure of compression [11].

2. EXISTED

METHOD

The word insignificant here understands certain prerequisites to the nature of the reproduced information. Lossy image compression is called irreversible since it is difficult to recover the first information correctly by decompression. It is altogether exploited on behalf of mixed media pictures, video, also sound to achieve increasingly minimal statistics comp. compression Ratio(CR) or proportion of the size of a compacted file to a unique uncompressed record and Saving Percentage are the parameters used to analyses the demonstration of calculations. So as to show high-range target pictures on low-resolution objective fragment target should be decreased. This issue is fundamental particularly for minimal effort or little (portable) implementation. To relax the bit decrease issue, extraordinary shading quantization calculations, called irresolution’s, are utilized on high-segmented target images. Arithmetic Coding is consummate they have develop the comp productivity and execution time of the assignment, including the impact of various number organize word lengths on comp proficiency. The utilizations of number organization coding are additionally portrayed in the paper[4]. In [5] the ongoing control plan accomplishments in teleportation that is working a ways off are examined. As of late, the capability of haptic correspondence has been perceived as being convincing to further increase human-to-human and human-to-machine cooperation. Haptic teleportation empowers the human to perform control errands in far off, scaled, perilous, or difficult to reach conditions. Subsequently, video and sound compressions are viewed as key empowering advances for top-notch collaboration. In [6] audits of various essential lossless information comp techniques are given. The calculations utilized for lossless comp are portrayed in a word. They presumed that in the Statistical pressure procedures, Arithmetic coding strategy performs superior to Huffman coding, Shannon Fanon coding, and Run Length Encoding system. In [7] a lot of chosen calculations are inspected in addition to represented for evaluate the exhibition in compacting contented information. An exploratory investigation of numerous diverse lossless image compression calculations is displayed. They finished up through making an allowance for the comp periods, decompression times as well as sparing charges of the significant digit of calculations, the Shannon Fanon scheming container be measured as the greatest valuable calculation amongst the selected ones. In [8] lossless information image compression approaches are given and their exhibitions are analyzed. Huffman and number shuffle coding are contrasted concurring with their exhibitions. In an examination, they supposed that a compression proportion of number-statically encoding is better when contrasted with Huffman coding. What's more, besides, number Random encoding lessens channel data transfer capacity and transmission time. In [9] lossless and lossy procedures are

regularly utilized together to get the most elevated comp proportions has appeared. LZH is utilized to get exceptionally image compression proportions for the pressure activity of records of sorts: doc, txt, bmp, instead of HLZ.

3. PROPOSED

METHOD

The image compression is a procedure of coding that will diminish the all outnumber of bits expected to converse data successfully. By the human optical framework, Image is a two-dimensional bit handled. Picture information assumes a crucial job in numerous applications, for example, Remote detecting Military, Industrial excellence regulator. The comp is a dimensionality reduction procedure also study of diminishing the measure of data essential toward the picture. It is the best in addition to valuable innovation in the field of advanced pictures. The decreasing size articulates to enables extra pictures to have appeared in a specified amount of circle space. The square chart of the image compression model demonstrates that the mapper changes picture f(x, to lessen the spatial and sophisticated overload. Quantized decreases the capitulation exactness in pre-recognized rule region. The image encoder makes adaptable length code to shape compacted information for capacity and transmission.

Figure: 1 Image compression model

A decoder has two squares, for example, opposite mapper and image decoder, which perform backward request to recoup the first picture from the compacted picture. The above chart demonstrates that the picture comp takings unique information and produces packed information when contrasted with unique information consuming the fewer amount of bits. This is finished through the procedure of decompression. Decompression is the turnaround procedure that receipts the compacted information also creates otherwise recreates the information as appeared in Fig: .1.

A. Image Compression

3801

remain different strategies aimed at encrypting like

 Huffman-Encoding

 Run-length Encoding

 Incremental Encoding

B. Lossy Compression Technique

Lossy compression procedures give a higher comp proportion when contrasted with the lossless pressure system. In this strategy, the picture-packed isn't equivalent to the first picture. Some measure of data is misplaced in this strategy.

1. Vector-Quantization 2. Wavelet-Compression 3. Conversion Coding

C. Problem Formulation

Image Compression is estimated as far as their comp proportion for example principally pressure proportion is characterized as the proportion of a whole amount of bits in the first picture also digit of bits in its packed type of representation. Comp proportion increments when a more significant amount of clamour is added to the information. In this work, we need to get information on the web, spare additional reality use. Word reference-based picture comp methods are the most prominent type of lossless information comp. In any case, this paper clarified how unique dictionary is created in the onward movement. Code is created on behalf of every string which is originating commencing a dictionary. It additionally explained how it is utilized in the following square of information; also it requires some investment. This paper is the main implementation for image compression information. Predominantly four pieces of literary substitution information: fixed-length code, ―fixed-length phrases‖, ―variable-―fixed-length phrases‖, ―variable-―fixed-length code word‖. Dictionary founded pressure procedure is comparable toward pack the printed information. In picture file, it has an enormous numeral of the excess as well as it resolves to be extremely useful on behalf of picture compacting

D. Characteristics which moderate the compression algorithm

The nature of the photograph depicts the reliability of picture comp conspires aimed at the information basis picture. Subsequent limitations which judge the exhibition of pressure calculation.

PSNR

Compression/Ratio-(CR) Mean/Square/Error/(MSE) Bits/Per/Pixel/(BPP)

i. Particles Swarm Optimization (PSO)

Particles Swarm Optimization is an incredibly basic calculation that consuming the space in nature amongst developmental detection also it is incredibly successful aimed at a wide scope of capacities which is near be advanced through the streamlining procedure. PSO-International/Journal of/Engineering/Science also Computing, April 2017 10981 http://ijesc.org/has specific calculation issues which appear to recline amongst hereditary calculation also transformative programming. It is the cutting edge heuristic calculation that container be connected to the nonlinear and non/continuous

enhancement issues. The fundamental objective of this enhancement is the re-enactment of collective. PSO resembles a hereditary calculation wherein the inhabitants are started through a gathering of irregular probable arrangements. Initial analysis create that the execution is extremely successful through a few sorts of difficulties [10].

ii. Spider Monkey Optimization

SPMO is a populace based strategy. The collective conduct of a spider &monkey is a case of splitting combination framework. SPMOs are existing in a huge network based unit-congregations otherwise relative gathering. So as to limit search contention among gathering populace, SPMO partition them captivated on subgroups. The subdivisions individuals begin to look for sustenance also convey composed inside as well as external the subgroups so as to part data around sustenance amount in addition to spot. The parental bunch individuals look aimed at sustenance (scavenge) or pursue by partitioning themselves into sub-gatherings (splitting) in an alternate heading then during the dusk they come back to connection the relative gathering (combination) to share sustenance also ensure different exercises. SPMOs are travailing an alternate way to look for rational divisions [11]. They interface also speak through one another utilizing a specific call by producing an influence similar to groups of pairs. Every separable pixel group has its recognized speech with the goal that different individuals from the gathering can recognize which branch is calling.

Lossless Encoder

Figure: 2 Lossless Image Compression

IV.ALGORITHM

This below steps describes Spider Monkeys Algorithm and helps to calculate MSE and PSNR values from it

Step-1: Input the picture starting the neighborhood basis. Step-2: Distinguish the greatest appropriate molecule on behalf of its power an incentive commencing all

Out picture.

Step-3: Standardize the all frequencies dependent on SPMO for the picture, with the end goal that all

Frequencies can be decreased to the degree of that force esteem which is discovered utilizing PSO.

Step-4: Picture force decrease will in result lessens the memory space necessity.

Step-7: Calculate the PSNR value.

Step-8: Store the image into the local disk memory.

Figure: 3 Spider Monkeys Algorithm Flow Chart V.RESULTS

The irritable strain method of SPMO (spider monkey advancement) and PSO is toward be measured. This short method will sub-division the all-out picture into different lattices also deliberates force value and attempts to diminish the powers estimations of every network pixel with the goal that comparative memory livelihood container be decreased.

Figure:4 Lossless image density (a) original image (b) compressed image

TABLE 1: COMPRESSED DATA ANALYSIS

Image Name Original Image Size(bytes)

Compressed Size(bytes)

Percentage Reduction

Desert.jpg 2359296 1519518 64% Lighthouse.jpg 2367900 1515456 64%

Figure: 5 Lossless image compression (a) original image (b) compressed image

The table2 demonstrates the examination edge by sizes of unique also packed pictures through Hybrid PSOSPMO approach aimed at picture pressure. On behalf of correlation, the two jpg pictures Desert.jpg also Lighthouse.jpg consuming a scope in bytes are looked at. In the two instances of pictures, the packed size is diminished through 64%.

TABLE:2 PARAMETERS ANALYSIS

Image M.S.E P.S.N.R C.R. B.P.P.

Desert.jpg% 254.83% 24.10 4.7659 0.4238

Lighthouse.jpg% 254.83% 24.1022 4.7253 0.4141

The quality factor between the two pictures. However, table no.3 demonstrates the correlation among PSO and half breed SPMO approach for IMC based on quality factors, for example, PSNR, MSE, CR, also BPP. It is obvious commencing the table that the planned crossover method has advanced PSNR admiration when contrasted with PSO strategy implies the remade picture quality is exceptionally near the first picture.

TABLE:3 EVALUATION OF WORK

Propose d Algorith

m

Image

PSNR In

dB

MSE C.R. B.P.P

PSO Desert.jpg 17.8924 388.8242 3.290 4

0.861 7

SPMO Desert.jpg 24.102217

9 254.83

4.765 9

0.423 8

PSO Lighthouse.

jpg 19.8924 388.8242 3.225

3 0.86

SPMO Lighthouse.

jpg 24.1022 254.85

4.725 3

3803 Figure: 5 Graphical analysis of PSO vs SPMO of desert.jpg

model

The comp proportion is of the developed sum if there should happen an occurrence of this procedure. Here is an enhancement of 64%. That is BPP has remained developed through about 49%. The error is diminished as the M/S/E factor is diminished through utilizing the projected system. The CR worth is great implies additional information of a picture is packed regarding bytes. The comp ratio for the two pictures Desert and beacon are the equivalent. For the existed system, the BPP rate is less a direct result of the fewer data put away per pixel of the recreated picture when contrasted with the first picture. The error rate is diminished as the MSE this feature is diminished through utilizing the anticipated system. The CR worth is great implies additional information of a picture is compacted as far as bytes. The comp proportion for the two pictures Desert.jpg and Lighthouse.jpg are roughly the equivalent. For crossover SPMO procedure the BPP rate is less a direct result of the fewer data put away per pixel of the remake picture when contrasted with the first picture.

4. CONCLUSION

This research work concludes that interconnects calculation for image compression and improves the adjustments like PSNR, MSE, BPP, etc also provides the development of various limitations. Two calculations are utilized in this hypothesis effort, for example, S-M-P-O also with Particle/Swarm/Optimization/. These two calculations are executed on behalf of packing the picture. Some subjective constraints are investigated, for example, Compression/Ratio (C/R), Peak Signal to Noise Ratio. BPP improve 52.32%, CR trained up to 31.91%, MSE reduced by 34.53%, PSNR improves by 17.05%

REFERENCES

[1]. Ajay Kumar Boyat and ParthKhare, ―Singular Value Decomposition using Block Least Mean Square method for Image Denoising and Compression‖, IEEE International Conference on Computer, Communication and Control , Vol. 642, Issue No. 10, pp. 40-47, September 2015.

[2]. Ali A. Al-Azza and Ammar A. Al-Jodah, ―Spider Monkey Optimization: A Novel Technique for Antenna Optimization‖ , Institute of Electrical and Electronics Engineering,Vol. 15, Issue No. 8, pp. 1016-1019, January 2015.

[3]. Amandeepkaur and Monica Goyal, ― A Review: ROI based Image Compression of Medical Images‖, International Journal of Advance Research in Computer Science and Management Studies‖,Vol. 2, Issue No. 11, pp. 243-240, November 2014.

[4]. Ammar A. Al-Jodah and Frances J. Harackiewicz. ―Spider Monkey Optimization: A Novel Technique in elecromagnetics‖ , Institute of Electrical and Electronics Engineering, Vol. 25, Issue No. 98, pp. 238-240, January 2016

[5]. A.M.Raid ,Wesam Ahmed and W.M.Khedr, ―JPEG Image Compression Using Discrete Cosine Transform - A Survey‖, International Journal of Computer Science & Engineering Survey ,Vol. 5, Issue No 2, pp. 39-47, April 2014.

[6]. Bhaskar Mishra, BhanuPratap Singh and Pradeep Tripath ,‖ The various Image Compresson Handbook‖, The International Journal Of Science &Technoledge, Vol. 2, Issue No. 13, pp.164-168, December 2014.

[7]. Chunjuan Ouyang and Xia Li, ―A best Wavelet Packet basis Image Compression algorithm based on PSO‖,. Institute of Electrical and Electronics Engineering, Vol. 7, Issue No. 8, pp. 11-13, December 2010. [8]. Deepa Raj and Seema Gupta, ―Adaptive Lossles

Forward Move Dictionary Based Compression‖, Institute of Electrical and Electronics Engineering, Vol. 187, Issue No. 1, pp. 1859- 1864 , June 2015. [9]. DianxunShuai, Bin Zhang and Ping Zhang, ―Particle

Algorithm for Lossless Data Compression‖ Institute of Electrical and Electronics Engineering,Vol.5 , Issue No. 21, pp. 3766-3771 , October 2006.

[10]. Gaurav Gupta and Parul Thakur, ―Image Compression Using Lossless Compression Techniques‖, International Journal on Recent and Innovation Trends in Computing and Communication, Vol. 2, Issue No. 12,pp. 3896-3900, December 2014. [11]. G.Scarmana, ―Lossless Data Compression of grid