# Multimedia Image Data Compression Based on Wavelet Analysis

Authors: Rui Wang; Qi Zhu; Weichun Bu
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

In order to improve the compression technology of multimedia image data, a compression method of multimedia image data based on wavelet analysis was proposed. By combining Fourier transform and wavelet packet multithreshold denoising method, the image data was denoised and compressed through the transform of wavelet analysis and multithreshold processing, so as to realize the compression of image data with high quality. The experimental results showed that it was effective to analyze signal singularity, singularity position, and singularity degree by using wavelet analysis. And the signal mutation position neart=0 could be seen clearly from the wavelet coefficient diagram, while the Fourier transform diagram did not provide any information about when the frequency mutation occurred. It was concluded that the method of multimedia image data compression based on wavelet analysis could promote the development of multimedia image data compression technology effectively.


---

## Body

## 1. Introduction

The amount of multimedia image data is very large after digital processing. If the data is not compressed, the computer system cannot store and exchange it. Therefore, how to effectively store and transmit the image data in the multimedia system becomes one of the biggest problems faced by the multimedia personal computer (MPC). Data compression is an important way to solve this problem.Wavelet analysis is an applied mathematical theory developed in the 1980s. It has obtained many important applications in many fields of surveying and mapping. An automatic cartographic synthesis model based on wavelet analysis is established to test the river network data [1]. These researches have achieved good results, but the depth and breadth of the research are not enough, and there are still many problems to be further investigated, but it is undeniable that wavelet analysis is an ideal mathematical tool for signal processing. As a means of signal processing, wavelet analysis has been more and more important for theoretical workers and engineers. And it has obtained the remarkable effect in many applications. Compared with the traditional processing method, there is a qualitative leap. It proves that the wavelet analysis technology, as a harmonic analysis method, has the huge vitality and broad application prospects, as shown in Figure 1.Figure 1
Multimedia image data compression.


## 2. Literature Review

Data compression refers to the technology of reencoding the original data to remove the redundancy in the original data and represent the original data with a small amount of data, which is the premise of processing image, audio, video, and other media data on the computer. With the development of computer network and computer communication technology, the data compression technology has received unprecedented attention and popularized and developed rapidly.The compressed coding theory was first proposed in 1948. Oliver proposed the PCM (pulse code modulation) coding theory [2, 3]. From the perspective of the development of data compression technology, it could be divided into two important stages. The first stage was before 1984, in which the main theory was to study the basis of data compression. The second phase was from 1985 to now, and it walked into the practical phase of data compression technology. In 1988, the data compression technology had a breakthrough, and the suitable chip structure was made.Transform coding is a kind of lossy coding. The so-called transform refers to the mathematical transform of the original time or space domain of the original data to highlight important parts of the original data after transform, so as to focus on processing [4]. At present, it is widely used in monochrome image, color image, still image, moving image, and multimedia computer technology in TV image compression within frames and between frames.Transform coding refers to the transform of a given image to another data domain (transform domain or frequency domain) in order to represent a large amount of information with less data. In other words, it does not directly encode spatial domain image signals but first maps the currently expressed spatial domain image signals to another orthogonal vector space through transform to obtain a series of transform coefficients which are encoded then [5]. The coding accuracy of the important coefficients in the transform domain is higher than that of the second important coefficients. Transform itself is a lossless and reversible technology, but in order to obtain better coding effect, some unimportant coefficients are ignored; so, it becomes a lossy technology. Commonly used transform coding schemes include discrete cosine transform (DCT) and Fourier transform coding [6, 7].In the DCT transform coding algorithm, the original image is usually divided into subblocks of8×8 size, and each subblock performs DCT forward transform in sequence, quantizes the DCT transform coefficient, and then carries out coding. The decoding process is the opposite of the coding process; that is, the first is decoding and then dequantization. DCT inverse transform is performed on each subblock to obtain subblock image, and each subblock is carried out in sequence to obtain the image restored after decoding. DCT is widely used in image compression.After DCT forward transform, most of the energy is concentrated in the upper left corner ofY matrix, which means that the correlation of the image decreases after DCT transform, so that fewer bits can be used to encode the upper left corner element of matrix D, thus achieving the purpose of data compression.Wavelet analysis is a new field which is rapidly developing in current mathematics. It has both profound theory and extensive application. Compared with Fourier transform and Gabor transform, it is a local transform of time and frequency. So, it can effectively extract information from signals and perform multiscale analysis on functions or signals by scaling and shifting operations. Wavelet transform has solved many problems that Fourier transform could not solve; so, it is known as the “mathematical microscope” and is a landmark progress in the development history of harmonic analysis [8].In the research, data compression of multimedia image was processed based on wavelet analysis. Wavelet analysis could achieve higher compression ratio and higher reproducibility image compression in image data compression. Therefore, wavelet analysis could be used to compress multimedia image data more efficiently and achieve better results.


## 3. Research Methods

### 3.1. Fourier Transform

Fourier transformFT is one of the important application tools in many scientific fields. Mathematically, it is the conversion of a complex operation on one function into a simpler operation on another function. Fourier transform transforms one function Ft−∞<t<∞ into another function Fω−∞<ω<∞ by means of integration, as shown in Formula (1).
(1)FT:ft⟶Fω=∫−∞∞fteiωtdt.Whenft meets the appropriate conditions, it has the contravariant transform FT−1, as shown in Formula (2).
(2)FT−1:Fω⟶ft=12π∫−∞∞Fωeiωtdω.TheFT transform transforms the derivative of ft into the multiplication of Fω, d/dtft⟶iωFω and transforms the two functions the convolution of two functions ft with gt into the multiplication of Fω with gt. Most of the analysis and processing of signals uses linear constant coefficient differential operators or convolution operators to describe the relationship between the inputs and outputs. It is much simpler to study the relationship between the input and output spectrum of such signals than to directly study the signal itself, that is, from the frequency domain characteristics [9]. Fourier transform is the time domain and frequency domain mutual conversion tool. From a physical sense, the essence of the Fourier transform is to decompose this waveform in the time domain into a superposition of many sine waves of different frequencies. So, the study of the function ft can be translated into the study of its weight, namely, Fourier transform Fω.By the definition of the Fourier transform,Fω depends on the global properties of ft along the real axis −∞,∞; so, it does not reflect the local time range of the signal, that is, for a particular frequency in the Fourier spectrum, when that frequency is generated cannot be known. And in many practical problems, what people are interested in is the characteristics of the signal in the local time range. To address this weakness, Gabor puts forward the concept of “window Fourier transform” in 1946, also known as short-time Fourier transform STFT [10]. The basic idea of window Fourier transform is to divide the signal into many small time intervals and analyze each time interval with Fourier transform in order to determine the frequency existing in this time interval. The approach is to introduce a smooth function gt, called the window function, which is identical to 1 on the interval −Δ+δ,Δ−δ and rapidly decreases smoothly from 1 to 0 on the interval −Δ−δ,−Δ+δ and Δ−δ,Δ+δ (δ is a suitably small positive number). Multiplying ft by gt−τ is equivalent to opening a 2Δ window centered on t=τ.The window Fourier transform formula of functionft on window function gt−τ is Formula (3).
(3)Gfω,τ=∫−∞∞Ftgt−τe−iωtdt.Gω,τ reflects the spectral characteristics of signal ft near t=τ, and its inversion formula is Formula (4).
(4)ft=12π∫−∞∞dω∫−∞∞eiωtgt−τGfω,tdτ.The window position ofSTFT changes with τ, which meets the requirements of studying the local nature of different positions of signals. However, the size and shape of its window function remain unchanged regardless of time and frequency, which cannot meet the requirements of variable window processing when processing time-varying signals. In order to solve this problem, a new time-frequency analysis theory, the wavelet transform, was developed in the late 1980s on the basis of inheriting and developing the localization idea of STFT.The so-called wavelet transform is to obtain a subwavelet (also known as wavelet base)ψabt=1/aψ1−b/a after the independent variable t of a function ψt is shifted b and stretched a [11]. The Wfa,b, a function with double parameters a and b, was obtained by the inner product of the function ft, as shown in Formula (5).
(5)Wfa,b=1a∫−∞+∞ftψt−badt,a>0.The mother waveletψt has a compact support set [12]. That is, ψt is equal to 0 or rapidly approaches 0 outside the finite interval (making it play the role of a window). It is ensured that ∫−∞∞ψtdt=0 (so that its function values alternate with positive and negative fluctuations). The position of the window moves with ∫−∞∞ψtdt=0, and the window shrinks with a. Integral Formula (5) can be transformed into convolution form; so, the wavelet transform is to filter the ft in the window, and this filtering is a band-pass filtering. The larger a is, the narrower the band is and the lower the average frequency is. It is as if a man was watching a scene, and the farther he stood, the greater the window, and the more obscure the scene. Conversely, the smaller a is, the higher the resolution is. This is multiresolution analysis, known as the “mathematical microscope” [13].The data quality of wavelet transform is to project the signal onto a series of wavelet basis (a series of wavelet basis functions are used to approximate the signal), which is generally divided into continuousCWT and discrete DWT wavelet transform [14, 15].The process of continuous wavelet transformCWT can be understood as follows. The wavelet with a certain scale a is selected, and it is compared with the left end alignment of the original signal. According to the continuous wavelet transform formula, see Formula (6).
(6)CWT=∫−∞∞ftψabtdt.Calculate the similarity coefficient of the two functions and then move the wavelet function to the right one wavelet function distance for comparison and calculation, until the whole signal operation is completed. The wavelet scale parametera is changed to repeat the above process. This results in wavelet coefficients at a range of scales. Finally, the gray scale of wavelet coefficients can be made by taking time as abscissa and scale as ordinate. Taking Morlet wavelet as an example to transform the function ft, when −1<t<0 and ft=sin50t. When 0<t<1, f=sin100t. It can be clearly seen from the wavelet coefficient diagram that the position of signal mutation is near t=0, while the Fourier transform diagram does not provide any information about when the frequency mutation occurs.


### 3.2. Key Technologies of Wavelet Packet Multithreshold Denoising Method

Image denoising refers to the process of reducing the noise in digital images. In the process of digitalization and transmission, the digital image in reality is often affected by the noise interference of imaging equipment and external environment, which is called noise-containing image or noise image. Noise is an important cause of image interference. So, in order to better compress the digital image, it is necessary to carry out the denoising processing. Wavelet packet multithreshold denoising method is a good denoising method [16]. The mathematical expressions of the decomposition algorithm and reconstruction algorithm of wavelet packet theory are as follows.The decomposition algorithm of wavelet packet is thatdtj,2k and dtj,2k+1 are solved through dtj+1,k, as shown in Formula (7).
(7)dtj,2k=∑php−2tdpj+1,2kdtj,2k+1=∑pgp−2tdpj+1.The reconstruction algorithm of wavelet packet is thatdtj+1,k is solved by dtj,2k and dtj,2k+1.
(8)dtj+1,k=∑pht−2pdpj,2k+gt−2pdpj,2k+1.In Formula (8), h and g are the filter coefficient. d is the wavelet packet decomposition coefficient. pandt are the decomposition layer number, and j and k are the node number of the wavelet packet.The distribution of noise in the frequency domain is mainly concentrated in the higher frequency part. Therefore, when using wavelet packet to denoise, if the same threshold processing method is adopted in different frequency band information, or different threshold processing methods are adopted in the same frequency band information, the denoising accuracy will be affected. So, how to divide frequency band accurately is the key problem of multi-threshold denoising. In the research, a classification method is proposed, which is based on frequency order and information type reorganization. According to the theory of wavelet packet transform, it can extract useful information hidden in low frequency, medium frequency, and high frequency. Taking three layers as an example, signal decomposition is shown in Figure2. The GPS deformation monitoring data with sampling frequency of 2 Hz is taken as an example, and Nyquist sampling theorem is applied [17]. The signal is divided into wavelet packets as shown in Figure 3. Then, each node of the wavelet packet tree at the third layer is corresponding to Figure 2 one by one, and Table 1 is obtained.Figure 2
Node number of wavelet packet three layer decomposition.Figure 3
Frequency decomposition of wavelet packet three layers (unit: Hz).Table 1
The correspondence table of the third layer node number of wavelet packet tree and the decomposition frequency of wavelet packet.
The serial number1234Wavelet packet tree node number[3, 0][1, 3][2, 3][3]Decomposition frequency/Hz0/8 ~ 1/82/8 ~ 1/84/8 ~ 3/82/8 ~ 3/8The serial number5678Wavelet packet tree node number[3, 4][3, 5][3, 6][3, 7]Decomposition frequency/Hz8/8 ~ 7/86/8 ~ 7/84/8 ~ 5/86/8 ~ 5/8Table1 shows that the natural order and frequency order of nodes in wavelet packet tree are inconsistent. The lowest frequency part corresponds to the first node, and the highest frequency part corresponds to the fifth node. The reason for this phenomenon is that the high-pass filter will carry out a “flip” operation when the wavelet packet is decomposed. It can be proved by the properties of wavelet packet that the decomposition of any wavelet packet will produce the phenomenon of inconsistency between natural order and frequency order, and the situation of inconsistency is the same. Therefore, when the wavelet packet decomposes each layer, the low-frequency decomposition part is arranged in ascending order of frequency, and the high-frequency part is arranged in ascending order of frequency. In the field of deformation monitoring, because noise distribution is closely related to frequency order, frequency order rather than natural order is needed.In the deformation analysis, there are often frequency bands that need to be preserved and denoised centrally, if the vibration frequency information of the building owner mode of 0.15 Hz needs to be monitored; according to the calculation, [3, 0] and [1, 3] are the concentrated frequency band of useful information, namely, the low frequency band. However, noise pollution is general. [3 and 4] are the frequency band of useless information concentration, that is, the high frequency band. The other nodes are transitional frequency band, that is, middle frequency band. Therefore, the wavelet packet decomposition coefficients can be grouped according to the frequency bands to be monitored and the situation of noise pollution, which is the method of reorganization according to the information type. Specifically, according to the distribution of signal and noise, taking three layers as an example,α is the proportion coefficient of low frequency band, β is the proportion coefficient of high frequency band, and n is the number of signal decomposition layers. Then, there is a wavelet packet tree node grouping. It should be pointed out that in some special cases, the frequency band can be further subdivided into low frequency, sublow frequency, intermediate frequency, subhigh frequency, and high frequency, but the basic principle remains the same.In Table1, wavelet packet tree nodes n,m0,n,m1, …, n,m2n−1, … are arranged in order of frequency from smallest to largest.


### 3.3. Multithreshold Processing of Wavelet Packet Decomposition Coefficients

Because the distribution of signal and noise is not fully considered in the single threshold criterion, it is easy to have insignificant or excessive denoising effect in denoising, while the multithreshold criterion can overcome the above shortcomings well [18]. The basic idea of multithreshold criterion is to flexibly select different threshold criteria for each wavelet packet decomposition coefficient according to certain rules, so as to retain useful information to the maximum extent and remove useless information. The four threshold criterion commonly used in wavelet packet analysis includes fixed-form threshold criteria (sqtwolog), adaptive threshold criteria (rigrsure), heuristic threshold criteria (heursure), and minimaxi [19]. Due to the different selection rules, the denoising effect is different. Therefore, each wavelet packet decomposition coefficient has its most appropriate threshold criteria [20].The four threshold criterion has their own characteristics. Among them, sqtwolog threshold criteria and heursure threshold criteria are similar in that all coefficients are processed; so, noise can be strongly removed. Correspondingly, it is easy to over-denoise; so, it can be called “radical” denoising criteria, which is suitable for processing the high frequency part of GPS signal [21, 22]. Rigrsure threshold criteria and minimaxi threshold criteria deal with part of the coefficient, which is a relatively compromise processing method. Therefore, it can prevent excessive denoising. Correspondingly, it is prone to the phenomenon of not obvious denoising; so, it can be called “conservative” denoising criteria, suitable for dealing with the low-frequency part. Among them, rigrsure threshold criteria and minimaxi threshold criteria are more suitable for middle frequency band. Therefore, the selection table of multithreshold criteria as shown in Table 2 is established for threshold processing of wavelet packet decomposition coefficients [23].Table 2
Multithreshold criteria selection table.
Low frequencyMiddle frequencyHigh frequencyRigrsureRigrsureSqtwologMinimaxiMinimaxiHeursure


## 3.1. Fourier Transform

Fourier transformFT is one of the important application tools in many scientific fields. Mathematically, it is the conversion of a complex operation on one function into a simpler operation on another function. Fourier transform transforms one function Ft−∞<t<∞ into another function Fω−∞<ω<∞ by means of integration, as shown in Formula (1).
(1)FT:ft⟶Fω=∫−∞∞fteiωtdt.Whenft meets the appropriate conditions, it has the contravariant transform FT−1, as shown in Formula (2).
(2)FT−1:Fω⟶ft=12π∫−∞∞Fωeiωtdω.TheFT transform transforms the derivative of ft into the multiplication of Fω, d/dtft⟶iωFω and transforms the two functions the convolution of two functions ft with gt into the multiplication of Fω with gt. Most of the analysis and processing of signals uses linear constant coefficient differential operators or convolution operators to describe the relationship between the inputs and outputs. It is much simpler to study the relationship between the input and output spectrum of such signals than to directly study the signal itself, that is, from the frequency domain characteristics [9]. Fourier transform is the time domain and frequency domain mutual conversion tool. From a physical sense, the essence of the Fourier transform is to decompose this waveform in the time domain into a superposition of many sine waves of different frequencies. So, the study of the function ft can be translated into the study of its weight, namely, Fourier transform Fω.By the definition of the Fourier transform,Fω depends on the global properties of ft along the real axis −∞,∞; so, it does not reflect the local time range of the signal, that is, for a particular frequency in the Fourier spectrum, when that frequency is generated cannot be known. And in many practical problems, what people are interested in is the characteristics of the signal in the local time range. To address this weakness, Gabor puts forward the concept of “window Fourier transform” in 1946, also known as short-time Fourier transform STFT [10]. The basic idea of window Fourier transform is to divide the signal into many small time intervals and analyze each time interval with Fourier transform in order to determine the frequency existing in this time interval. The approach is to introduce a smooth function gt, called the window function, which is identical to 1 on the interval −Δ+δ,Δ−δ and rapidly decreases smoothly from 1 to 0 on the interval −Δ−δ,−Δ+δ and Δ−δ,Δ+δ (δ is a suitably small positive number). Multiplying ft by gt−τ is equivalent to opening a 2Δ window centered on t=τ.The window Fourier transform formula of functionft on window function gt−τ is Formula (3).
(3)Gfω,τ=∫−∞∞Ftgt−τe−iωtdt.Gω,τ reflects the spectral characteristics of signal ft near t=τ, and its inversion formula is Formula (4).
(4)ft=12π∫−∞∞dω∫−∞∞eiωtgt−τGfω,tdτ.The window position ofSTFT changes with τ, which meets the requirements of studying the local nature of different positions of signals. However, the size and shape of its window function remain unchanged regardless of time and frequency, which cannot meet the requirements of variable window processing when processing time-varying signals. In order to solve this problem, a new time-frequency analysis theory, the wavelet transform, was developed in the late 1980s on the basis of inheriting and developing the localization idea of STFT.The so-called wavelet transform is to obtain a subwavelet (also known as wavelet base)ψabt=1/aψ1−b/a after the independent variable t of a function ψt is shifted b and stretched a [11]. The Wfa,b, a function with double parameters a and b, was obtained by the inner product of the function ft, as shown in Formula (5).
(5)Wfa,b=1a∫−∞+∞ftψt−badt,a>0.The mother waveletψt has a compact support set [12]. That is, ψt is equal to 0 or rapidly approaches 0 outside the finite interval (making it play the role of a window). It is ensured that ∫−∞∞ψtdt=0 (so that its function values alternate with positive and negative fluctuations). The position of the window moves with ∫−∞∞ψtdt=0, and the window shrinks with a. Integral Formula (5) can be transformed into convolution form; so, the wavelet transform is to filter the ft in the window, and this filtering is a band-pass filtering. The larger a is, the narrower the band is and the lower the average frequency is. It is as if a man was watching a scene, and the farther he stood, the greater the window, and the more obscure the scene. Conversely, the smaller a is, the higher the resolution is. This is multiresolution analysis, known as the “mathematical microscope” [13].The data quality of wavelet transform is to project the signal onto a series of wavelet basis (a series of wavelet basis functions are used to approximate the signal), which is generally divided into continuousCWT and discrete DWT wavelet transform [14, 15].The process of continuous wavelet transformCWT can be understood as follows. The wavelet with a certain scale a is selected, and it is compared with the left end alignment of the original signal. According to the continuous wavelet transform formula, see Formula (6).
(6)CWT=∫−∞∞ftψabtdt.Calculate the similarity coefficient of the two functions and then move the wavelet function to the right one wavelet function distance for comparison and calculation, until the whole signal operation is completed. The wavelet scale parametera is changed to repeat the above process. This results in wavelet coefficients at a range of scales. Finally, the gray scale of wavelet coefficients can be made by taking time as abscissa and scale as ordinate. Taking Morlet wavelet as an example to transform the function ft, when −1<t<0 and ft=sin50t. When 0<t<1, f=sin100t. It can be clearly seen from the wavelet coefficient diagram that the position of signal mutation is near t=0, while the Fourier transform diagram does not provide any information about when the frequency mutation occurs.


## 3.2. Key Technologies of Wavelet Packet Multithreshold Denoising Method

Image denoising refers to the process of reducing the noise in digital images. In the process of digitalization and transmission, the digital image in reality is often affected by the noise interference of imaging equipment and external environment, which is called noise-containing image or noise image. Noise is an important cause of image interference. So, in order to better compress the digital image, it is necessary to carry out the denoising processing. Wavelet packet multithreshold denoising method is a good denoising method [16]. The mathematical expressions of the decomposition algorithm and reconstruction algorithm of wavelet packet theory are as follows.The decomposition algorithm of wavelet packet is thatdtj,2k and dtj,2k+1 are solved through dtj+1,k, as shown in Formula (7).
(7)dtj,2k=∑php−2tdpj+1,2kdtj,2k+1=∑pgp−2tdpj+1.The reconstruction algorithm of wavelet packet is thatdtj+1,k is solved by dtj,2k and dtj,2k+1.
(8)dtj+1,k=∑pht−2pdpj,2k+gt−2pdpj,2k+1.In Formula (8), h and g are the filter coefficient. d is the wavelet packet decomposition coefficient. pandt are the decomposition layer number, and j and k are the node number of the wavelet packet.The distribution of noise in the frequency domain is mainly concentrated in the higher frequency part. Therefore, when using wavelet packet to denoise, if the same threshold processing method is adopted in different frequency band information, or different threshold processing methods are adopted in the same frequency band information, the denoising accuracy will be affected. So, how to divide frequency band accurately is the key problem of multi-threshold denoising. In the research, a classification method is proposed, which is based on frequency order and information type reorganization. According to the theory of wavelet packet transform, it can extract useful information hidden in low frequency, medium frequency, and high frequency. Taking three layers as an example, signal decomposition is shown in Figure2. The GPS deformation monitoring data with sampling frequency of 2 Hz is taken as an example, and Nyquist sampling theorem is applied [17]. The signal is divided into wavelet packets as shown in Figure 3. Then, each node of the wavelet packet tree at the third layer is corresponding to Figure 2 one by one, and Table 1 is obtained.Figure 2
Node number of wavelet packet three layer decomposition.Figure 3
Frequency decomposition of wavelet packet three layers (unit: Hz).Table 1
The correspondence table of the third layer node number of wavelet packet tree and the decomposition frequency of wavelet packet.
The serial number1234Wavelet packet tree node number[3, 0][1, 3][2, 3][3]Decomposition frequency/Hz0/8 ~ 1/82/8 ~ 1/84/8 ~ 3/82/8 ~ 3/8The serial number5678Wavelet packet tree node number[3, 4][3, 5][3, 6][3, 7]Decomposition frequency/Hz8/8 ~ 7/86/8 ~ 7/84/8 ~ 5/86/8 ~ 5/8Table1 shows that the natural order and frequency order of nodes in wavelet packet tree are inconsistent. The lowest frequency part corresponds to the first node, and the highest frequency part corresponds to the fifth node. The reason for this phenomenon is that the high-pass filter will carry out a “flip” operation when the wavelet packet is decomposed. It can be proved by the properties of wavelet packet that the decomposition of any wavelet packet will produce the phenomenon of inconsistency between natural order and frequency order, and the situation of inconsistency is the same. Therefore, when the wavelet packet decomposes each layer, the low-frequency decomposition part is arranged in ascending order of frequency, and the high-frequency part is arranged in ascending order of frequency. In the field of deformation monitoring, because noise distribution is closely related to frequency order, frequency order rather than natural order is needed.In the deformation analysis, there are often frequency bands that need to be preserved and denoised centrally, if the vibration frequency information of the building owner mode of 0.15 Hz needs to be monitored; according to the calculation, [3, 0] and [1, 3] are the concentrated frequency band of useful information, namely, the low frequency band. However, noise pollution is general. [3 and 4] are the frequency band of useless information concentration, that is, the high frequency band. The other nodes are transitional frequency band, that is, middle frequency band. Therefore, the wavelet packet decomposition coefficients can be grouped according to the frequency bands to be monitored and the situation of noise pollution, which is the method of reorganization according to the information type. Specifically, according to the distribution of signal and noise, taking three layers as an example,α is the proportion coefficient of low frequency band, β is the proportion coefficient of high frequency band, and n is the number of signal decomposition layers. Then, there is a wavelet packet tree node grouping. It should be pointed out that in some special cases, the frequency band can be further subdivided into low frequency, sublow frequency, intermediate frequency, subhigh frequency, and high frequency, but the basic principle remains the same.In Table1, wavelet packet tree nodes n,m0,n,m1, …, n,m2n−1, … are arranged in order of frequency from smallest to largest.


## 3.3. Multithreshold Processing of Wavelet Packet Decomposition Coefficients

Because the distribution of signal and noise is not fully considered in the single threshold criterion, it is easy to have insignificant or excessive denoising effect in denoising, while the multithreshold criterion can overcome the above shortcomings well [18]. The basic idea of multithreshold criterion is to flexibly select different threshold criteria for each wavelet packet decomposition coefficient according to certain rules, so as to retain useful information to the maximum extent and remove useless information. The four threshold criterion commonly used in wavelet packet analysis includes fixed-form threshold criteria (sqtwolog), adaptive threshold criteria (rigrsure), heuristic threshold criteria (heursure), and minimaxi [19]. Due to the different selection rules, the denoising effect is different. Therefore, each wavelet packet decomposition coefficient has its most appropriate threshold criteria [20].The four threshold criterion has their own characteristics. Among them, sqtwolog threshold criteria and heursure threshold criteria are similar in that all coefficients are processed; so, noise can be strongly removed. Correspondingly, it is easy to over-denoise; so, it can be called “radical” denoising criteria, which is suitable for processing the high frequency part of GPS signal [21, 22]. Rigrsure threshold criteria and minimaxi threshold criteria deal with part of the coefficient, which is a relatively compromise processing method. Therefore, it can prevent excessive denoising. Correspondingly, it is prone to the phenomenon of not obvious denoising; so, it can be called “conservative” denoising criteria, suitable for dealing with the low-frequency part. Among them, rigrsure threshold criteria and minimaxi threshold criteria are more suitable for middle frequency band. Therefore, the selection table of multithreshold criteria as shown in Table 2 is established for threshold processing of wavelet packet decomposition coefficients [23].Table 2
Multithreshold criteria selection table.
Low frequencyMiddle frequencyHigh frequencyRigrsureRigrsureSqtwologMinimaxiMinimaxiHeursure


## 4. Result Analysis

A signal can be decomposed by the wavelet transform, and then the original signal can be obtained through the reconstruction. Figure4 is a schematic diagram of a fault signal decomposed and reconstructed by algorithm. From the low-frequency coefficients in the figure, it can be clearly seen in the “approximate signals” of the original signal at different scales. The rough outline of the signal is preserved, while the high frequencies reflect the turning points of the signal clearly. Singular value detection is carried out on the basis of the algorithm. The singular point and irregular mutation part of the signal often carry important information, which is an important part of the signal. Image compression processing is of great significance [24]. For a long time, the Fourier transform is the main tool to study the singularity of functions. Its method is to study the attenuation of functions in the Fourier transform domain to infer whether the function has the singularity and the magnitude of the singularity. However, Fourier transform lacks spatial locality. It can only determine the global properties of the singularity of a function, but it is difficult to determine the position and distribution of the singularity in space. However, the wavelet transform has the property of spatial localization, and the wavelet coefficient diagram can clearly reflect that the location of signal mutation near t=0, while the Fourier transform diagram does not provide any information about when the frequency mutation occurs. Therefore, it is effective to use wavelet to analyze signal singularity, singularity position, and singularity degree [25].Figure 4
Signal decomposition and reconstruction.


## 5. Conclusions

In the research, the multimedia data image compression method based on wavelet analysis is used for compression processing. When using the wavelet analysis method to compress data image, the compression ratio is high, the compression speed is fast, and the basic characteristics of signal and image can be kept unchanged after compression and can be anti-interference in the transmission process. The wavelet packet multithreshold denoising method is better than traditional wavelet, wavelet packet denoising method, and other improved wavelet packet denoising method. It provides an optimization method for the compression of multimedia image data.



---

*Source: 2773868-2022-08-21.xml*