## I. INTRODUCTION The need for information is constant. For example, in the prehistoric period, knowledge about poisonous plants, dangerous animals, etc., was the key to survival for an individual. Information on obtaining food, water, making your home, etc. is vital. Without the invention of communication and the exchange of information, humanity would be doomed to extinction. Now, humankind has ample opportunities to create, store and transmit information. The concept, types, properties of data, and the number of information resources in any field of human activity are growing enormously. The amount of information transmitted is constantly increasing: from household conversations to the data flow on the Internet. The reason is the complexity of all areas of modern society. The determining factor is the development of technology and scientific progress. ## II. WALSH FUNCTION A Walsh[1] function is a family of functions that form an orthogonal system and take only $+1$ and $1$ values throughout the definition. These functions are derived from Rademacher's functions. Easy processing is one of the main advantages of transforming the Walsh basis, but special generators are needed to form such functions. There are now several Walsh function generator circuits. See Fig. 1 for one possible variant of the first eight functions generator design.  Fig. 1: Generator of the first eight Walsh functions The algorithm for forming Walsh[2] functions in this generator is based on the multiplication of Rademacher functions $r1(\theta)$, $r2(\theta)$, and $r3(\theta)$. The function $r3(\theta)$ of the meander type is generated directly by the assigning generator and has the maximum frequency for the set of used functions. The functions $r2(\theta)$ and $r1(\theta)$ are obtained by triggering the countdown input by dividing the input frequency by 2. To get the remaining Walsh functions, adders by modulo 2 with inverse outputs are used as multipliers. On the output of triggers and augmentation circuits modulo 2, the voltage has two levels, 0 and 1, while Walsh functions, by definition, have levels -1 and +1. The level conversion is carried out by operational amplifiers, which compare the input signal with the offset voltage $E = 1/2$. The Walsh transform converts the signal to a set of rectangular or square signals (fig. 2).  Fig. 2: Walsh basis for 8x8 images The Walsh transform for two-dimensional signals is as follows: $$ P_{xy} = \frac{1}{N} \sum_{x=0}^{N-1} \sum_{y=0}^{N-1} H(u,v) (-1)^{\sum_{i=0}^{n} \left(b_i(x) p_i(u) + b_i(x) p_i(v)\right)} \tag{2} $$ The inverse Walsh transform is determined by the formula: $$ H (u, v) = \frac{1}{N} \sum_ {x = 0} ^ {N - 1} \sum_ {y = 0} ^ {N - 1} P _ {x y} (- 1) ^ {\sum_ {i = 0} ^ {n} \left(b _ {i} (x) p _ {i} (u) + b _ {i} (x) p _ {i} (v)\right)} \tag{3} $$ ## III. WAVELET HAAR TRANSFORM The wavelet transformation[3] decomposes the signal into a set of essential functions called wavelets. Wavelet transformation is a time-frequency transformation, that calculates moving averages and differences through scalar products with scaling signals and wavelets. Wavelets are not defined in terms of scaling and wavelet functions. Wavelet has balanced frequency characteristics. Wavelets use overlapping windows, so the spectrum of the high-frequency coefficient reflects all high-frequency changes (fig. 3).  Fig. 3: 2D Wavelet function Arithmetic coding is used to compress data without loss. It is also called entropic coding. Arithmetic coding is almost optimal for a given character set. One of the advantages of arithmetic coding is adaptation. It converts the data stream into a floating point range (0, 1). This also provides better compression, as the entire message is encoded as a new character rather than as individual characters. Wavelet Haar is the simplest type of wavelet transformation and serves as a model for other wavelet transformations, providing effective signal and image compression (fig. 4).  Fig. 4: Wavelet Haar Transform ## IV. IMAGE COMPRESSION Image compression[4] is a science that reduces the number of bits required to store, transmit and recover images without losing information. Lossless compression techniques are used to compress and unpack images. The compressed image can be sent via a cloud network on the recipient side, and the image can be reconstructed. The flowchart of the proposed algorithm is shown in fig. 5 and the two-level decomposition DWT is on fig. 6.  Fig. 5: Compression algorithm flow diagram  Fig. 6: Two-level decomposition DWT The efficiency of the proposed algorithm is confirmed in terms of performance indicators, such as the ratio of peak to signal and noise (PSNR), standard error (MSE), and compression ratio (CR). Input images from datasets are shown in Fig. 7. After compression, the file will be with the.wwt. On the receiver side, inverse transformations are applied to obtain the reconstructed image (fig. 8).  Fig. 7: Input image  Fig. 8: Reconstructed image PSNR[5] reflects the quality of the reconstructed image and indicates the effectiveness of the compression algorithm. The MSE standard error is the average error value between the input image $I$ and the compressed one $I^{\prime}$: $$ \mathrm{MSE} = \frac{1}{mn} \sum_{x=1}^{m} \sum_{y=1}^{n} \left(I(x,y) - I^\prime(x,y)\right)^2. \tag{4} $$ The PSNR peak signal/noise ratio measures the quality between the original and compressed images. High PSNR value gives better quality compressed and reconstructed images. PSNR is usually expressed as a formula: $$ P S N R = 2 0 \log_ {1 0} \left(\frac {2 5 5 ^ {2}}{\sqrt {M S E}}\right) \tag {5} $$ The compression ratio can be defined as the ratio of the original image size to the compressed image size: $$ K = \frac {N _ {\mathrm {i}}}{N _ {\mathrm {o}}} \tag {6} $$ Here is the matrix of performance for wavelets db3,haar,coif3,sym3,where $T_{c}$ -time for compression, $T_{d}$ time for decomposition. Table 1: Performance matrix for different wavelets <table><tr><td>Input image</td><td>PSNR</td><td>MSE</td><td>\(T_{c}\)</td><td>Td</td><td>Compression coefficient K</td></tr><tr><td colspan="6">db3</td></tr><tr><td>1</td><td>48,474987</td><td>3,72</td><td>7,677057</td><td>10,637286</td><td>51,32578</td></tr><tr><td>2</td><td>47,636765</td><td>4,39</td><td>7,793296</td><td>10,553187</td><td>47,42396</td></tr><tr><td>3</td><td>49,512393</td><td>2,93</td><td>7,220063</td><td>10,377102</td><td>55,23157</td></tr><tr><td>4</td><td>48,952306</td><td>3,34</td><td>7,817294</td><td>10,865413</td><td>49,97539</td></tr><tr><td>5</td><td>47,940439</td><td>4,21</td><td>7,995294</td><td>10,950095</td><td>47,12561</td></tr><tr><td>6</td><td>45,629887</td><td>4,38</td><td>6,365905</td><td>8,198367</td><td>38,85647</td></tr><tr><td colspan="6">haar</td></tr><tr><td>1</td><td>47,42677</td><td>4,74</td><td>7,162271</td><td>10,23863</td><td>54,13286</td></tr><tr><td>2</td><td>46,94007</td><td>5,30</td><td>7,581140</td><td>10,39107</td><td>50,97951</td></tr><tr><td>3</td><td>48,24472</td><td>3,93</td><td>6,926179</td><td>9,885088</td><td>59,79658</td></tr><tr><td>4</td><td>47,81663</td><td>4,33</td><td>7,422946</td><td>10,30475</td><td>52,48647</td></tr><tr><td>5</td><td>47,37572</td><td>4,80</td><td>7,536443</td><td>10,31744</td><td>51,89783</td></tr><tr><td>6</td><td>43,57184</td><td>7,03</td><td>5,811217</td><td>7,750165</td><td>39,25239</td></tr><tr><td colspan="6">coif3</td></tr><tr><td>1</td><td>48,99345</td><td>3,31</td><td>7,896789</td><td>11,26030</td><td>53,18951</td></tr><tr><td>2</td><td>48,03012</td><td>4,13</td><td>7,909564</td><td>11,13821</td><td>50,20183</td></tr><tr><td>3</td><td>49,70579</td><td>2,81</td><td>7,405461</td><td>11,05338</td><td>58,76425</td></tr><tr><td>4</td><td>49,40175</td><td>3,01</td><td>7,988354</td><td>11,30202</td><td>53,37582</td></tr><tr><td>5</td><td>48,27024</td><td>3,90</td><td>8,155997</td><td>11,57530</td><td>50,09869</td></tr><tr><td>6</td><td>44,86736</td><td>5,22</td><td>6,785390</td><td>8,942609</td><td>34,75683</td></tr><tr><td colspan="6">sym3</td></tr><tr><td>1</td><td>48,47499</td><td>3,72</td><td>7,658239</td><td>10,72807</td><td>51,15623</td></tr><tr><td>2</td><td>47,76368</td><td>4,39</td><td>7,815626</td><td>10,55944</td><td>47,16854</td></tr><tr><td>3</td><td>49,51239</td><td>2,93</td><td>7,620959</td><td>10,52366</td><td>54,99863</td></tr><tr><td>4</td><td>48,95231</td><td>3,34</td><td>7,926224</td><td>10,85511</td><td>50,08605</td></tr><tr><td>5</td><td>47,94044</td><td>4,21</td><td>8,008160</td><td>10,86697</td><td>47,38945</td></tr><tr><td>6</td><td>45,62989</td><td>4,38</td><td>6,184347</td><td>8,135875</td><td>38,67824</td></tr></table> Fig. 9 shows a comparative analysis of the compression ratio for wavelets db3,haar,coif3,and sym3. The results show that the wavelet Haar transform provides better compression.  Fig. 9: Compression ratio performance for various wavelets ## V. CONCLUSION The article offers a hybrid compression algorithm for various types of images. Wavelet transformation, Walsh transform, and arithmetic coding are used together to obtain the best results, such as at least 39 times compression, without loss of quality in decoding. The performance evaluation is based on signal/noise ratio, standard deviation, and compression ratio. The quality of the restored image matched the quality of the original. The proposed algorithm can be used in many areas, as image transmission has become an integral part of everyday life.

Generating HTML Viewer...