# Analysis of Communication Compression and Transmission in a Multimedia and Internet of Things Environment Integrating Scene Elements

Authors: Jia Jia; Guohua Wu
Journal: Advances in Multimedia
 (2022)

---

## Abstract

In order to improve the effect of multimedia data transmission, this paper integrates scene elements to analyze the needs of multiple types of data transmission and uses the technology of the Internet of Things to analyze the compression and transmission of multimedia data communication. Moreover, this paper proposes a reversible information hiding algorithm for encrypted images based on pixel sorting and grouping prediction and discusses how to improve the prediction accuracy through the histogram of prediction errors. In addition, this paper designs a communication compression transmission system in a multimedia and Internet of Things environment integrating scene elements and builds system function modules and system processes. Finally, this paper verifies the performance of the proposed system by means of simulation experiments. From the experimental results, we can see that the system proposed in this paper has a good multimedia information transmission effect.


---

## Body

## 1. Introduction

With the rapid development of multimedia technology and Internet technology, the relationship between the two is getting closer and closer. Multimedia network technology has gradually penetrated into schools, families, and society, making the connection between people beyond the limits of time and space. Network multimedia, including text, graphics, images, sounds, applications, and animations, can run on computer networks at the same time without affecting each other [1]. Any terminal on the network can share multimedia information and can also store, process, and retransmit the acquired multimedia data. That is to say, network multimedia is developed on the basis of computer, multimedia, and network. It integrates computer, multimedia, and network and can realize various functions such as transmission and exchange of graphics, images, sound, and text in the network [2]. Network multimedia includes two aspects. (1) Different from the general network, network multimedia requires a special equipment environment. (2) Compared with traditional multimedia, the computer equipment used in network multimedia is quite special. The way that network multimedia processes information such as images and sounds is different from that of general multimedia, so the requirements for hardware equipment are higher [3]. The quality of the image is determined by the number of frames transmitted per second and the size of the image. In terms of images, if images are played at a frame rate of thirty frames per second, the human eye can see continuous images. However, in the network multimedia system, the playback effect of 30 frames per second is not ideal. We need to use DIV, JPEG, MPEG, and other encoding and decoding methods [4].The development of multimedia technology is inseparable from the development of other technologies. Multimedia network transmission technology is essentially the product of a combination of multiple technologies, including multimedia computer technology, network communication technology, and multimedia data encoding and decoding technology. It is precisely because of the development of network communication technology that computers all over the world are connected to each other to form a global network, which provides a prerequisite for the sharing of resources. Each computer is no longer a separate device, but a node in the entire network.In the actual multimedia transmission process, the transmission of many multimedia signals, including audio, video, and image data, still uses relatively old technical means based on analog signal transmission. The use of analog signals to transmit multimedia signals has a long history. The main problems it brings are the high cost of the system, the need to lay a long line, the long construction period, and the poor stability. Once the scale of the system becomes larger, it is often necessary to lay more cables. These thick and long cables increase the complexity of the circuit. If the system structure changes, the existing lines need to be changed. This makes it very inconvenient to implement maintenance on the entire system.With the support of the Internet of Things technology, this paper studies multimedia communication transmission, improves the corresponding algorithm, builds an intelligent model, and improves the multimedia communication compression transmission effect that integrates scene elements.


## 2. Related Work

The literature [5] applied compressed sensing technology to the field of camera imaging and successfully produced a single-pixel digital camera. The literature [6] used Bayer color filters to enable single-pixel digital cameras to produce color images. The literature [7] used background attenuation technology combined with single-pixel camera data to automatically monitor and track targets. The literature [8] proposed a single-pixel terahertz imaging system based on compressed sensing to successfully avoid mechanical planar image scanning. The literature [9] proposed a sparse imaging technology with the support of compressed sensing theory and a dynamic imaging technology at the same time. In communication technology and network, the literature [10] proposed fast Fourier sampling algorithm based on compressed sensing theory for wireless signal sensing and compression. The literature [11] proposed a cyclic feature detection framework based on compressed sensing for broadband spectrum sensing, which uses second-order statistical information to meet the high sampling rate requirements of traditional cyclic spectrum remote sensing. The literature [12] uses compressed sensing to restore sparse signals through decentralized channels in a large-scale energy-efficient network. The literature [13] proposed a framework to improve the compressed sensing algorithm, making it more suitable for the restoration of overlay network traffic matrix and delay matrix. By calculating the traffic matrix and the delay matrix, the congestion of the overlay network can be estimated, which can reflect the current network security status.The compressed sensing method proposed in [14] ignores the internal correlation of a single set of signals and only pays attention to the cross-correlation of multiple sets of signals. Ray [15] formally proposed distributed compressed sensing based on the compressed sensing series theory. The main idea of distributed compressed sensing is to extend the original compressed sampling of a single signal to the centralized compressed sampling of the signal group, focusing on the analysis of the internal correlation and cross-correlation of the signal group, and then use these properties to perform joint recovery of the signal group. Compared with traditional compressed sensing, distributed compressed sensing has greatly reduced the requirements for the amount of observation data in the processing of signal groups, which has further expanded the application of compressed sensing theory. In the literature [16], the author proves through experiments that distributed compressed sensing processing related signals can improve the performance by 30%. The joint sparse model of signal group is the theoretical basis of distributed compressed sensing. Observation, the obtained observation data can be accurately restored and reconstructed at the receiving end. Literature [17], based on a comprehensive analysis of the theoretical knowledge and application background of the distributed compressed sensing series, proposed three different joint sparse models for different application scenarios and gave the corresponding signal compression schemes. The paper discusses the selection principle of distributed compressed sensing observation matrix and uses a simple random sparse projection matrix as the observation matrix. The literature [18] focused on the problem of restoring and reconstructing the signal group with the distributed compressed sensing method and adopted a reconstruction error estimation method to improve the existing distributed compressed sensing method.Literature [19] proposed a distributed compressed sensing model based on spatial correlation in wireless sensor networks. After analyzing the joint sparse model and the spatial correlation between nodes in the wireless sensor network, the DCS encoding and decoding algorithm was adopted, and the energy of the node was used as an evaluation index to perform a series of operations of distributed compressed sensing. Literature [20] applies compressed sensing technology to point-to-point networks and distributed networks in the Internet of Things, studies the existing three types of joint sparse models of distributed compressed sensing, and implements distributed compressed video sensing GPSR (Gradient Projection for Sparse Reconstruction) algorithm focusing on the analysis of Bayesian compressed sensing, using the prior probability distribution characteristics of the original signal, and using the Bayesian principle in the reconstruction algorithm, which makes Bayesian compressed sensing under the same conditions. Compared with the traditional compressed sensing model, the model can recover and reconstruct the original signal more accurately.


## 3. IoT Communication Compression Processing Algorithm

The image encryption algorithm can be realized by changing the pixel value or changing the pixel position. Commonly used symmetric encryption algorithms mainly include XOR encryption, scrambling encryption, and mod 256 encryption.XOR encryption uses an encryption key to generate a stream cipher and then performs XOR operation on each bit of the stream cipher image pixel bit by bit to obtain an encrypted image. For a 256-level grayscale image I with a size of M∗N, each pixel can be divided into 8 bits. For the pixel I(i, j), the s-th bit can be expressed as I(i, j, s), as calculated by the following formula [21]:(1)Ii,j,s=Ii,j2smod2,s=0,1,…,7.Among them,i represents the row where the pixel is located, and j represents the column where the pixel is located.After obtaining the 8 bits of the original image pixels, an 8 bit pseudorandom sequence P with a size of M∗N can be generated according to the encryption key. P(i, j) and pixel I(i, j) are XORed to obtain encrypted pixel E(i, j), and finally encrypted image E is obtained. The following formulas are specific calculation processes:(2)Ei,j,s=Ii,j,s⊕Pi,j,s,(3)Ei,j=∑s=07i,j,s×s.Figure1 shows the changes of Lena images before and after encryption. It can be seen that the encrypted image is the same as the noise, and the original image content is completely invisible to the human eye, thus achieving the purpose of protecting the image content. The reason why the XOR encryption algorithm can achieve the encryption effect is mainly that the random sequence P is randomly generated according to the key, without any rules, and is evenly distributed. Moreover, the encrypted pixels obtained after the XOR become evenly distributed, without retaining any features of the original image, and greatly weaken the correlation between the pixels of the original image. Figure 1(a) is the original image histogram. We can see the approximate distribution of pixel values in the original image. Figure 1(b) is an encrypted image histogram. Compared with the original image histogram, the pixel values of the encrypted image histogram are evenly distributed without retaining any distribution characteristics of the original image. Therefore, the original image cannot be found through the encrypted image, indicating that the exclusive OR encryption algorithm is safe and can achieve the purpose of protecting the security of the image.Figure 1
Comparison of histograms before and after Lena XOR encryption: (a) original histogram; (b) encrypted image histogram.
(a)(b)For a grayscale image I with a size of MN, the range of pixels is [0, 255]. According to the encryption key, a random matrixR with the same size as the image is generated, the image I and the random matrix R are added, and then modulo 256 is added to obtain the encrypted image E. The specific encryption process is shown in the following formula [22]:(4)Ei,j=Ii,j+Ri,jmod256.When the image is decrypted, the encrypted imageE is subtracted from the random matrix R and then modulo 256 to obtain the original image I. The specific calculation process is as shown in the following formula:(5)Ii,j=Ei,j−Ri,jmod256.Mod 256 encryption can be completely decrypted, and there is no unrecoverable boundary point. For example, when the original pixel isl(ij) = 255, the random number is R(i, j) = 1 and the encrypted pixel is E(ij) = 0, and when decrypted, I(i, j)=(0−1) and mod 256 = 255. For the original pixel I(ij) = 0, the random number is R(i, j) = 255, then the encrypted pixel is E(ij) = 255, the decryption is E(ij)-R(ij) = 0, the pixel is I(i, j) = 0, and mod 256 = 0. In the same way, other pixel values can be also completely decrypted.Arnold transformation is a typical scrambling encryption algorithm. The main idea is to perform multiple elementary matrix transformations on the image matrix, scramble the position of the image pixels, and then realize image encryption. Arnold transformation is mainly for square images, and for rectangular images, it needs to be filled into a square matrix. Arnold transformation has a transformation cycle, which is related to the pixel position transformation cycle during encryption and decryption. For images of different sizes, the transformation period is different. For images of size NN, the periodT is shown in Table 1 [23].Table 1
Arnold transformation period of images of different sizes.
N246122564128256512T331212504896192384If it is assumed that the period of the Arnold transform ist1 and the period of the inverse Arnold transform is t2, then T = t1+t2. Arnold transformation is transformed by elementary matrix, and the specific calculation process is shown in the following formula:(6)i′j′=1baab+1ijmodN.Among them, a andb are variable values, but the matrix must satisfy the determinant value of 1, such as a−b = 1. (i,j) represents the position coordinates of the pixel, (i′,j′) represents the pixel coordinates after transformation, and the N∗N grayscale image is transformed t1 times according to (5) to obtain the encrypted image. In the Arnold inverse transformation, we only need to change the matrix to the inverse matrix of the original elementary matrix. The specific calculation is as follows:(7)ij=ab+1−b−a1i′j′modN.Figure2 shows the original histogram of the Lena image and the histogram of the scrambled encrypted image. It can be seen that the changing trends of the two histograms are the same, indicating that the encrypted image retains the characteristics of the original image. Therefore, the encryption method has security problems, which may cause the original image information to be leaked.Figure 2
Arnold transform histogram: (a) original histogram; (b) scrambling encryption histogram.
(a)(b)Figure3(a) is an original image block, using the encryption key to generate a random number, which is set to 56. Figure 3(b) is the image block after XOR encryption, and Figure 3(c) is the image block after mod 256 encryption. Figures 3(d) and 3(e) show the corresponding difference (pixels in the block minus the pixel at the first position) image block. It can be seen from Figure 3 that Figure 3(f) and Figure 3(d) are closer. It shows that the mod 256 encryption algorithm can better preserve the correlation of the image, so the mod 256-scrambling encryption algorithm is more suitable for introducing the traditional reversible information hiding algorithm into the encrypted image.Figure 3
Comparison of the relevance of encryption methods. (a) The original image block. (b) Encrypted image block. (c) Mod 256 encryption image block. (d) The original image block D-value. (e) Encrypted image block D-value. (f) Mod 256 encryption image block D-value.
(a)(b)(c)(d)(e)(f)Figure4 shows the encryption effect of the Lena image under different size blocks, and Figures 4(a)–4(c) show the effect diagram encrypted with the mod 256 algorithm. It can be seen that as the block becomes larger, the image encryption effect becomes worse, and the basic outline of the original image can even be seen. Therefore, only using mod 256 encryption is insecure. Figures 4(d) and 4(e) show the encrypted image after block scrambling. It can be seen that compared with Figures 4(a)–4(c), no original image content can be seen. Therefore, the encryption effect of using mod 256-scrambling encryption algorithm is better than that of using mod 256 encryption algorithm alone.Figure 4
Comparison of encryption effects of different encryption algorithms. (a) 4 ∗ 4 mod2 56s. (b) 8 ∗ 8 mod 256. (c) 16 ∗ 16 mod 256. (d) 4 ∗ 4 mod 256 scrambling. (e) 8 ∗ 8 mod 256 scrambling. (f) 16 ∗ 16 mod 256 scrambling.
(a)(b)(c)(d)(e)(f)Figure5 shows the encrypted image histogram of the block mod 256-block dislocation encryption algorithm for different block sizes. From Figures 5(b)–5(d), it can be seen that the encrypted image has a uniform pixel distribution and does not retain any features of the original image. Thus, the original image cannot be obtained by attacking the histogram of the encrypted image, indicating that the mod 256-block dislocation encryption algorithm is secure.Figure 5
(a) Original and encrypted Lena image histogram. Mod 256-scrambling encrypted image histogram: (b) 4∗4 block; (c) 8∗8 block; (d) 16∗16 block.
(a)(b)(c)(d)As the block becomes larger, it can be seen that the distribution of the encrypted image histogram gradually changes, and it begins to become less uniform. Therefore, when using this encryption method, in order to ensure the security of the original image, it is necessary to use as small image blocks as possible.The detailed operation steps of the histogram modification algorithm are as follows.Step 1: the algorithm scans the image, counts each pixel value, and obtains the histogram of the image as shown in Figure6. The peak point pixel value P = 121 is obtained from Figure 6, the zero point is the pixel value in the range of [209, 255], and the pixel value Z = 209 is the minimum zero point on the right.Figure 6
Image histogram.Step 2: the algorithm finds the peak point P and the zero pointZ in the histogram. The following takes the case of P < Z as an example to introduce the histogram modification algorithm. P < Z indicates that the zero point is on the right of the peak point. Before embedding additional data, the pixel value point falling in the interval (PZ) is shifted to the right by one unit. At this time, the number of pixel value points P+1 is zero, which can be used to hide the additional data. The specific operation is shown in (8), where b is the additional data, x is the original pixel value, and x′ is the modified pixel value.(8)x′=x+b,ifx=p,x+1,ifp<x<Z,x,otherwise.Step 3: when extracting additional data, the algorithm first obtains the histogram of the image with additional data according to Step 1. The recovery process is the opposite of the hiding process. Since the location of the peak point will not change, the algorithm first finds the peak pointP. The additional data 0 is extracted at the pixel point equal to P, and the additional data 1 is extracted at the pixel point equal to P+1. The following formula is the additional data extraction process:(9)b=0,ifx′=P,1,ifx′=P+1.Step 4: after the additional data is extracted, the algorithm needs to restore the image. If the pixels in the range of [P+1, Z] are shifted by one unit to the left, the original image can be obtained. The specific operation process is as follows:(10)x=x′,ifx′=P,x′−1,ifP+1<x<Z+1,x′,otherwise.After determining the pixel prediction method, the algorithm uses three-neighbor pixels to predict the pixel. Formula (11) shows the prediction process, where a, b, and c are the pixels at the right, bottom, and right diagonal positions of the predicted pixel x, respectively.(11)x′=mina,b,ifc≥maxa,b,maxa,b,ifc≤mina,b,a+b−c,otherwise.After the pixel predicted valuex′ is obtained, the original pixel x is subtracted from its predicted value x′ to obtain the prediction error e, as shown in (12), to obtain the space for embedding additional data. The specific operation process is as in (13). After the additional data is embedded in the prediction error, the pixel value X after the embedded additional data can be obtained by formula (14).(12)e=x−x′,(13)e′=e−1,ife<−1,e−b,ife=−1,e+b,ife=0,e+1,ife>0,(14)X=x′+e′.The prediction error histogram is Gaussian distributed, with the peak generally at prediction error 0. Figure7 shows the process of panning the prediction error histogram to hide the additional data. Figure 7(a) shows the original prediction error histogram. If we choose to hide the additional data at prediction error −1 and 0, the prediction error region to the left of prediction error −1 is shifted one unit to the left to free up prediction error −2 as the space for hiding the additional data. Similarly, the prediction error 1 is vacated to the right of the prediction error 0 as the space of hidden additional data, the histogram of prediction error after translation is obtained as in Figure 7(b), and 7(c) shows the histogram of the prediction error after embedding the additional data. The errors −2 and 1 are obtained when the additional data hidden in the prediction error value −1 and 0 is 1. If the additional data hidden is 0, the errors −1 and 0 remain unchanged.Figure 7
The translation process of the prediction error histogram: (a) histogram of the prediction error; (b) histogram of the prediction error after translation; (c) prediction error histogram with additional data.
(a)(b)(c)The prediction valuex′ can be obtained accurately using the same prediction method, and the prediction error e′ is obtained by subtracting the pixel X containing additional data from the prediction value x′. According to the principle of modifying the prediction error to hide the additional data, the range of the prediction error with additional data can be inferred. It is also obvious from Figure 7(c) that the prediction error with additional data is in the range of [−2, 1]. Then, the additional data is extracted, and the prediction error is recovered according to the prediction error range, as follows:(15)b=0,ife′=−1or0,1,ife′=1or−2,(16)e′=e′−1,ife≥1,e′+1,ife′≤−2,e′,otherwise.Step 5: The algorithm extracts additional datab through Step 3, and then obtains the initial prediction error e. The original pixel x can be obtained by adding the prediction error e to the pixel x containing the additional data, as shown in the following formula:(17)x=X+e.The additional data embedding rate indicates how many bits of additional data can be hidden in a pixel, and is an evaluation of the image's ability to carry additional data. The higher the additional data embedding rate, the better the algorithm, and the lower the additional data embedding rate, the worse the algorithm. The following formula calculates the additional data embedding rate with an image size of M∗N and an embedding capacity of num:(18)ratebpp=numM×N.For an 8 bit 256-level grayscale image with a size of M∗N, its PSNR value is calculated as follows:(19)PSNR=10×log10255×255MSE.Among them, MSE is the mean square error between the directly decrypted image and the original image, as defined in (20), where I is the original image and Γ is the directly decrypted image.(20)NSE=∑i=0M−1∑j=0N−1Ii,j−I′i,j2M×N.For an image block containingn pixels, the pixels are sorted in ascending order; nL, nH, and nR are used to represent the lengths of sets L, H, and R; and each set represents a category of pixels. Pixel x1,x2,…,xn in the block is sorted in ascending order to get h1,h2,…,hn, and L=h1,R=hn,i=1,j=n,nL=1,nR=1, are initialized. The specific classification process is described in (1), where the parameter EL is the maximum value of the prediction error interval used to embed additional data, and i and j are used for classification and counting.(21)hi∈L,i=i+1,if hi−h1≤EL and i≤j≤n,hj∈R,j=j−1,if hn−hj≤EL and j≤i≥1.After the classification, the remaining pixels in the block form a setH. In pixel prediction, different prediction methods are designed for different sets according to their characteristics. The predicted value of the pixel in the set L is the maximum value max(L) in the set, and the predicted value of the pixel in the set R is the minimum value min(R) in the set. The pixels in the set H are predicted by judging the relationship between the difference between the maximum values max(H) and max(L) of the pixels in the set H and the parameter EL. The specific prediction process for the pixels in the set H is as follows:(22)fi=maxL,ifi=nH,maxL,if1≤i≤nH,maxH−maxL≤EL,maxL+EL,if1≤i≤nH,EL<maxH−maxL≤2EL,maxL−EL,if1≤i≤nH,maxH−maxL>2EL.An image I of size M∗N is divided into nonoverlapping blocks B1,B2,…,Bt of u×v size, where t=M∗N/u∗v represents the number of blocks, and the specific image encryption steps are as follows.Step 1: The algorithm generates a pseudorandom sequenceR of length t according to encryption key 1 and adds mod 256 to the random number in the sequence and the pixels in the block. Moreover, the same random number is added to the pixels in each block, and the specific operation is shown in the following formula to obtain the encrypted image block E1,E2,…,Et.(23)Esi,j=Bsi,j+Rsmod2561≤i≤u,1≤j≤v,1≤s≤t.Step 2: The algorithm scrambles the position of the encrypted image block and generates a random natural number sequencew from 1 to t according to encryption key 2. The position of the block is exchanged according to the sequence W, the obtained block is Ew1,Ew2,…,EwN, and then the block is reorganized to obtain the encrypted image C.In order to make the scrambling process clearer, Figure8 is an example of scrambling encryption. The sequence W = {5, 3, 9, 7, 2, 1, 4, 8, 6} is generated according to encryption key 2. This sequence corresponds to the original sequence {1, 2, 3, 4, 5, 6, 7, 8, 9}; for example, 5 corresponds to 1 and the positions are swapped. Figure 8(a) is the position before scrambling, and Figure 8(b) after scrambling. Figure 8 shows that the position after scrambling is completely different from the original position, and the scrambling effect is achieved.Figure 8
Changes before and after image block scrambling: (a) images block before scrambling; (b) images block after scrambling.
(a)(b)Additional data hiding is divided into three parts: (1) encrypted image overflow processing; (2) pixel selection; (3) embedded additional data. Figure9 is a general flow chart of the additional data embedding algorithm. The process of recording the location is shown in as follows:(24)LNi,j=1,ifCi,j>255−EL+1,andCi,j<EL+1,0,ifCi,j∈255−2EL−1255−EL−1,andCi,j<EL+1,2EL+1.Figure 9
Flow chart of the additional data embedding algorithm.The specific calculation process of the processed encrypted imageE is shown as follows:(25)ei,j=ci,j−EL−1,ifci,j>255−EL−1,ci,j+EL+1,ifci,j<EL+1,ci,j,otherwise.In order to accurately extract the additional data, the com value in the last row and the last column of the image is recorded as 0. According to the three pixels on the right, bottom, and right diagonal positions, the com value is obtained by calculating the absolute value of the difference between the right pixel and the bottom pixel and the right diagonal pixel. The specific calculation is as follows:(26)comi,j=ei+1,j−ei+1,j+1+ei,j+1−ei+1,j+1.The predicted value of e1 is obtained according to (22); the predicted value is specifically calculated as (27); and the predicted value of pixel e1l is subtracted from the predicted value to obtain the prediction error Pel of e1, which is calculated as formula (28).(27)e˜=maxL,e≤maxL,MINR,e≥minR,f,other,(28)Pe=e−e˜.The specific calculation of the additional data embedding is shown in formula (29), where e is the pixel value after embedding the additional data and b is the additional data.(29)e′=e−EL+1,if Pe<−EL,e+Pe−b,if−EL≤Pe<0,e+Pe+b,if0≤Pe<EL,e+EL+1,if Pe>EL.The additional data is extracted in three steps: (1) pixel selection; (2) pixel prediction; (3) extraction of additional data. Because this part scans the image and the image block in reverse order, it can accurately calculate the complexity of the pixel and select the pixel to obtain the setsL, H, R. According to the size relationship between the pixel e4′ and the set critical values max(L) and min(R), it is determined which set the pixel e4 belongs to, and the predicted value of the pixel e4′ is predicted. The specific operation is shown in (17). The predicted value e˜4 of the pixel e4′ is subtracted to obtain the prediction error Pe4′, as shown in the following:(30)Pe′=e′−e˜.The peak area of the embedded additional data is [–EL, EL], and the maximum change value of the pixel is (EL+1). Therefore, if the prediction error Pe4′ is in the range of [−2EL−1, 2EL+1] when the additional data is extracted, this means that the pixel e4′ contains additional data, and the additional datab is extracted according to the prediction error Pel′. The specific calculation is as follows:(31)b=0,if Pe′mod2=0,1,if Pe′mod2=1.After the additional data is extracted, the pixel e4′ is restored according to the extracted additional datab to obtain e4. If the additional data is not included, the pixel e4″ is directly modified according to the prediction error Pe4′ to obtain e4. The specific calculation process is shown in the following formula:(32)e=e′+EL+1,if Pe′<−2EL−1,e˜+fixPe′−b2,if0≤Pe′≤2EL+1,e˜+fixPe′+b2,if−2EL−1≤Pe′<0,e′−EL+1,if Pe′>2EL+1.The algorithm decompresses through arithmetic coding to obtain the original overflow position map LM, processes the imageE according to the LM, removes the preprocessing operation before embedding additional data, and obtains the original encrypted image C. The specific operation process is as follows:(33)Ci,j=C′i,j+EL+1,if LMi,j=1,c′i,j∈255−2EL−1,255−EL−1,C′i,j+EL−1,if LMi,j=1,c′i,j∈EL+1,2EL+1,C′i,j,otherwise.Image decryption is the reverse process of image encryption. In order to ensure lossless image decryption, the algorithm first generates a random sequence W of numbers 1 tot according to encryption key 2. After that, the algorithm scrambles the image block, and the image block returns to the original position. The algorithm generates a pseudorandom sequence R of length t according to encryption key 1 and then subtracts mod 256 from the image block E,E,…,. As calculated by formula (34), the decrypted image block B1,B2,…,Bt is obtained, and the original image I is finally obtained.(34)BSi,j=Esi,j−Rsmod2561≤i≤u,1≤j≤v,1≤s≤t.


## 4. Analysis of Communication Compression and Transmission in a Multimedia and Internet of Things Environment Integrating Scene Elements

The working principle of network multimedia communication system is as follows: when the caller initiates a call and the two sides establish a connection, the two sides can make voice calls normally, and when graphic communication is needed, the two sides can make graphic communication through the touch screen. First, the sender makes the graphic information input on the touch screen, and the graphic signal processing module collects the graphic signal and sends it to the microprocessor for processing. The microprocessor first judges whether the graphic data meets the sending criteria. If it does, the data is compressed and coded for one frame and then sent. The principle block diagram of the transmitting side of the network multimedia system is shown in Figure10.Figure 10
Block diagram of the system transmitter.According to the idea of this algorithm, an adaptive transmission mode is designed for video transmission. The frame diagram is shown in Figure11. A rate adjustment module is added to the video compression data sending end, and a network data monitoring module is added to the receiving end accordingly.Figure 11
Video transmission system.Next, this paper evaluates the communication compression transmission effect of the model proposed in this paper. This article collects multi-scene element data and combines it with the system for multimedia data transmission. After constructing the intelligent Internet of Things system, this paper evaluates the effect of communication compression transmission. The set evaluation parameters are the data compression effect and the communication transmission effect, and the results obtained are shown in Table2 and Figure 12.Table 2
Evaluation of the effect of the communication compression transmission system in the multimedia IoT environment integrating scene elements.
NumberData compressionData transmissionNumberData compressionData transmissionNumberData compressionData transmission196.997.31695.598.33196.797.2296.998.61795.999.53297.099.1398.097.51896.899.33398.297.3496.699.61995.198.83496.398.1595.399.92097.197.83594.599.6695.298.62198.999.13694.599.1798.199.72295.098.73797.8100.0897.599.32397.799.33897.998.2996.997.72495.097.93998.898.51096.499.12596.1100.04095.197.21194.798.72698.397.84198.398.41294.698.92794.897.84297.399.31399.097.22896.199.94398.499.61494.298.02997.698.34497.198.41596.898.33097.897.14595.099.7Figure 12
Statistical diagram of test data.Through the above experimental research results, it can be seen that the communication compression transmission system in the multimedia and Internet of Things environment integrating scene elements proposed in this paper is more effective.


## 5. Conclusion

The development of multimedia technology cannot be separated from the development of other technologies. Multimedia network transmission technology is essentially the product of a combination of technologies, including multimedia computer technology and network communication technology, as well as multimedia data coding and decoding technology. In the actual multimedia transmission process, the transmission of many multimedia signals, including audio, video, and image data, still uses relatively old technical means based on analog signal transmission. The use of analog signals to transmit multimedia signals has a long history, and it brings the main problems of the high cost of the system, the need to lay a long line, the long construction cycle, the poor stability. Once the system becomes larger, more cable runs are often required, and these thick and long cable runs add to the complexity of the wiring. If the system structure changes, existing wiring also needs to be changed. This leads to very inconvenient maintenance of the whole system. With the support of Internet of Things technology, this paper studies multimedia communication transmission, improves the corresponding algorithm, builds an intelligent model, and enhances the compressed transmission of multimedia communication with fused scene elements.



---

*Source: 5509637-2022-02-03.xml*