# Animation Design Based on 3D Visual Communication Technology

Authors: Feng Shan; Youya Wang
Journal: Scientific Programming
 (2022)

---

## Abstract

The depth synthesis of image texture is neglected in the current image visual communication technology, which leads to the poor visual effect. Therefore, the design method of film and TV animation based on 3D visual communication technology is proposed. Collect film and television animation videos through 3D visual communication content production, server processing, and client processing. Through stitching, projection mapping, and animation video image frame texture synthesis, 3D vision conveys animation video image projection. In order to ensure the continuous variation of scaling factors between adjacent triangles of animation and video images, the scaling factor field is constructed. Deep learning is used to extract the deep features and to reconstruct the multiframe animated and animated video images based on visual communication. Based on this, the frame feature of video image under gray projection is identified and extracted, and the animation design based on 3D visual communication technology is completed. Experimental results show that the proposed method can enhance the visual transmission of animation video images significantly and can achieve high-precision reconstruction of video images in a short time.


---

## Body

## 1. Introduction

3D visual communication technology is immersive, interactive, and conceivable for users to create high-quality visual experience. Video based on 3D visual communication technology needs to go through different processes such as content making, coding compression, network transmission, and terminal display. In recent years, visual communication technology has been widely used in various fields because of its function of fast and real-time measurement of information [1]. With the development of multimedia technology, visual communication technology is widely used in the field of video and animation image management, such as network media operation, animation release, etc. Film and television animation and video images are developing constantly in the field of film and television animation and video images. The core of film and television animation and video is visual communication, and it is difficult to obtain target film and television animation and video images in complex background in real time and accurately. It is a common problem in multiframe film and television animation and video visual communication [2].Reference [3] proposes an innovative design of visual communication system for animated figures and images in virtual reality environment. In the hardware design, the adaptation parameters of the main board of the renderer are designed to optimize the experience of visual communication. In the software design, by introducing Sobel edge operator, the gray function is established to solve the gradient amplitude, and the threshold is selected to compare it to complete the recognition and thinning of the edge data of animated character graphics and images. Design the motion capture module, establish the behavior control model, generate and manage the motion capture files, and complete the overall design of the system. Reference [4] proposes a new optimization method—plane visual communication effect optimization method based on wavelet change. The image is decomposed by wavelet, and the wavelet is reconstructed. In the process of reconstruction, the modulus diagram and phase angle diagram are calculated, and the edge images of each scale are extracted. The corresponding edge points of the semireconstructed image are enhanced through the edge image. On the above basis, the graphic beautification vector of slip model is used for operation. In order to simplify the operation, the above operation method is transformed into simple mathematical operation, and the visual communication effect is optimized through the reflected light graphic mode. Reference [5] proposes a new automatic graphic language arrangement algorithm in visual communication design. The display size of buffer image in visual communication design is calculated by fixed value method, and the minimum number of layout and the maximum surface utilization are taken as the layout objective function. Ant colony algorithm is used to solve it, get the optimal solution, and obtain the best display position of graphics in visual communication design. The description of graphic language is realized by rule-based syntax description and ASM (abstract state machine) semantic description. The parallel process and selection process of graphic language in visual communication design are described by using parallel and selection marks, and the parallel process and selection process are used to realize the automatic arrangement of graphic language. The proposed algorithm is programmed and run in C language to achieve the purpose of automatic arrangement of graphic language.However, when the above image visual communication technologies ignore the depth synthesis of image texture, the image visual effect is not ideal. Therefore, a film and television animation design method based on 3D visual communication technology is proposed. Build the video processing process under 3D visual communication technology, and mainly process film and television animated video through 3D video content production, and server and client links; based on the visual distance between 2D image and scene, calculate the zoom factor of 3-dimensional scene transformation; build a deep learning-based deep feature extraction model PCANet, filter images and extract features of film and television animation video images, use PCAN deep network to create a low-resolution feature dictionary, use high-resolution video image reconstruction method, realize LR animated video images and HR animation video images, and introduce nonlocal similarity empirical constraints to optimize HR images; analyze gray and detail features based on wavelet transform, extract the video image features, separate the prospect and background of animated video images, transform K-L (Karhunen–Loeve) as the core, dynamically identify the similarity between evaluation features, and complete the animation design based on three-dimensional visual communication technology. The experimental results show that the proposed method can significantly improve the visual transmission of animated video images and improve the speed of high-precision video image reconstruction.


## 2. Film and Television Animation Design Based on 3D Visual Communication Technology

3D visual communication technology mainly uses the computer to simulate the environment, to make people feel immersive. Three-dimensional visual communication technology, on the basis of 2D images, reads the main information, compresses and decomposes, and transforms it into three-dimensional images, increasing the measurement and display function of arbitrary sections. In the human-computer interaction module, we can zoom in the three-dimensional image to facilitate users to browse and change the image.


### 2.1. Video Processing Process under 3D Visual Communication Technology

Figure1 shows the flowchart of video processing under 3D visual communication technology.Figure 1
Video processing flowchart under 3D visual communication technology.The 3D visual communication technology can be divided into three parts: 3D visual communication content production, server and client, and 3D visual communication content production which is the core of the whole video processing process [6]. In the production of 3D visual communication content, a set of cameras or a set of camera devices and audio sensors containing multiple cameras and sensors are used to capture the sound and visual scene in the real physical world. Cameras and sensors, for example, produce a set of digital video and audio signals. In general, the camera captures content within 360° of the periphery of the unit [7, 8].Aiming at the video processing under the 3D visual communication technology, the 3D visual communication video image at the same time is combined with mosaic, projection mapping, and frame texture to generate a package, as shown in Figure2.Figure 2
3D visual communication animation video image mosaic, projection, and area-based packaging.


### 2.2. The Scaling Factor of the 3D Scene Transformation

After determining the triangular meshes on a two-dimensional plane through screen projection, a continuous scaling field shall be assigned to each triangular facet; that is, a scaling factor shall be assigned to each triangular facet, and the scaling factor between adjacent triangular facets shall be continuously variable. The specific process is as follows [9, 10]:Si is used to represent the distance from the triangle to the viewpoint in 3D scene. Si is defined as visual distance, and all Si can be integrated into a threshold of discrete function Si.Determine the apparent distanceSi and Si+1 between any adjacent triangles i and i+1, and the difference ∂i between the two can be expressed as follows:(1)∂i=Si−Si+1.Obtain the upper limit valuemax∂ of ∂i through formula (1).When the value ofminScale is 0.4, the sample size changes gradually from 0.4–1 to 0.4. Based on the value of minScale, pyramid shrinkage is applied to a given texture sample drawing to obtain a multilevel progressive shrinkage sample drawing, which is used as a scaling factor in the process of texture synthesis to obtain the basis for the corresponding sample drawing [11, 12].In order to make the neighboring triangle mesh correspond to the neighboring layer, based onmax∂, set up: the value of S function can only be different one layer within the sample layer if the difference is max∂ that is, according to max∂ to divide the value range of S function, the value of the function is divided into different layers according to max∂, and the layers corresponding to the neighboring triangle mesh are also adjacent, thus ensuring the continuity of texture in the process of composition.The value ofSi for each triangle can obtain a value of ScaleminScale≤Scale≤1 according to the above setting, which is the value of Scale corresponding to the scaling of the meta-texture sample image [13]. Based on this, each Scalevalue corresponds to a Scale-fold shrunk layer, and a Scale-fold shrunk image can be mapped to a Scale-fold shrunk film and TV animation image, where each triangle has a scaling factor.


### 2.3. Deep Feature Extraction Model Based on Deep Learning

PCANet is a relatively simple method of deep learning based on the theory of deep learning and convolutional neural networks [14, 15]. The PCANet structure is composed of two PCA (principal component analysis) filter layers, a hash layer and a histogram calculation layer, which can extract the deep-seated features of high-resolution animation and video images. But unlike the usual networks, PCANet's filters are more computationally efficient. PCANet is not obtained through training, but through obtaining the mapping results of parts of high-resolution film and television animation video images, and then adopts the PCA (principal component analysis) method to extract the principal components of the high-resolution film and television animation video images, each of which is an independent filter [16]. When the neural network of the filter is used to extract the features, the optimal weights can be obtained without iterative operation; thus, the calculation time is reduced [17]. In order to further discuss the advantages of PCANet depth network in extracting the features of high-resolution animated cartoon video images, a mapping eigenvalue of N, 8 × 8 and 1 moving distance is set up for the input of animated video images [18, 19]. The main parts of the mapping features L1 were computed using the PCANet algorithm, and a two-layer filter filters L1. The steps are as follows:


#### 2.3.1. First Layer: PCA Filter Layer 1

For theN training picture LiN with size of m1m2, PCANet selects a k1×k2 window, and each training image is compared by row and column to obtain the local features of the image. Get m1×m2 picture blocks of k1×k2 size. Dislodge the mean value of the picture block, the output behind dislodging the mean value of Li:(2)A¯i=a¯i,1,a¯i,2,⋯,a¯i,m1,m2.In formula, each column of the matrixA¯i represents a block of image, and each column contains k1×k2 elements. There are m1×m2 columns in total. After performing the above operations separately for all N training images, a new data matrix A was obtained: A=A¯1,A¯2,⋯,A¯N∈Rk1k2×L, and A has N×m1×m2 columns. Then, the A matrix was PCA and the ahead Li eigenvectors of the eigenvector matrix W were taken as the convolutional kernel of the filter group.(3)WLi=mak1k2qlAAT∈Rk1k2,l=1,2,⋯,Li.In formula,qlAAT represents the l-th eigenvector of the matrix AAT. mak1k2 is a function, representing rearranging each of the Li eigenvectors into the matrix. Each eigenvector contains k1×k2 elements, amount to get Li convolutional nuclei of length k1 and width k2. Finally, for each input image L, the Li convolutional nuclei were filtered separately. Thus, the first layer of the PCA filter group is completed.


#### 2.3.2. Second Layer: PCA Filter Layer 2

The second layer of the PCA filter group is the same principle as the first layer. This yields the convolutional kernel of the second layer:(4)WLi2=mak1k2ql2BBT∈Rk1k2,l2=1,2,⋯,Li2.For each input imageLi2 in the second layer, the PCA filter group is all complete through the filter WLi2 output features.Finally, theLi and Li2 feature mappings are obtained in the same way as CNN. PCANet is characterized by these L1 mapping features, so it can provide a reliable data for the film and television animation video image processing [20]. PCANet uses learning to get multilayer network filters. After the input video image is filtered through two layers of filters, it can have very high-dimensional data output and can be regarded as the input of video image characteristics of the film and television animation and be used for the reconstruction of high-resolution video image of the film and television animation [21].Therefore, when PCANet extracts the features of film and television animation video images, it is actually a direct processing of the pixels of the film and television animation video images, the operation stage has joined the process of blocking, and the number of film and television animation video image block output from the deep network has increased [22]. PCANet uses the deep network learning process to extract the features of the animation video image, and the video image features extracted by PCANet and the features obtained by artificial rules are more abundant in detailed information and more prominent in texture structure, which provides rich prior knowledge for subsequent reconstruction and fills in the details of the animation video image of low-resolution film and television so as to facilitate the reconstruction of the animation video image of super-resolution film and television.


### 2.4. Image Reconstruction Method of Multiframe Animation Video Based on Visual Communication

Combining the advantages of PCANet depth network and sparse representation-based reconstruction method, this paper proposes a visual communication-based multiframe animation video image reconstruction method [23, 24]. For the multiframe animation video image reconstruction method, it is assumed that the high-resolution image and the low-resolution image are sparse expressions for their respective dictionaries, and then, the image sample features are obtained by PCANet depth network. Dh represents the dictionary feature of a high-resolution image, and D1 represents the dictionary feature of a low-resolution image. In the stage of high-resolution image reconstruction, the low-resolution image is processed in the same way, the deep-seated feature is extracted by PCANet, the sparse representation of D1 above the low-resolution dictionary feature of the high-resolution image is obtained, the coefficients expressed by the sparse D1 feature of the low-resolution image are directly applied on Dh, and the corresponding high-resolution feature image is obtained [25]. Low-resolution video animation images are used to achieve high-resolution reconstruction. Through the PCANet depth network, we can get better film and TV animation video image features than the nondepth network. The deep feature dictionary can also improve the description ability of the feature dictionary and improve the quality of film and TV animation video image reconstruction significantly [26].K blurred film and TV animation video image need to be sampled in the training data set, which is adjusted to the same size to get the corresponding low-resolution film and TV animation video image, which is combined into a model sample pair: T=Xh,X1, Xh=xhii=1k represents high-resolution features, and X1=xhii=1k represents low-resolution features. Compute the matrix into blocks for all samples in the data set, and select a sliding window of size k1×k2, (normally, the pixel square window of the film and television animation video image used is 3, 5, or 7). After feature extraction for all the film and television animation video images is carried out through the aforesaid sliding window, the new data matrix X of column N×m×n can be obtained, and each column of the matrix represents a film and television animation video image block with a total of k1×k2 elements.To obtain the training sample ofi high-resolution animation video image, the formula is(5)X¯hi=x¯hi,1,x¯hi,2,⋯,x¯hi,mn.Features were extracted with the above data matrixX, and the extracted features were regarded as feature samples in SCSR model and substituted into dictionary features of PCANet.Suppose thatThiL represents the results of the high-resolution animated video image after sparse coding, the H· function is regarded as a unit step function, the results of sparse coding are quantized, the histogram coding is completed, and the deep detail features of the high-resolution animated video image are extracted, that is, [27, 28](6)Fhi=BhistThi1,⋯,BhistThiL1T∈R2L1L1B.Similarly, it is inferred that through the same processing process as the high-resolution film and television animation video image, the results of extracting the deep-seated detail features of the low-resolution film and television animation video image are given, namely,(7)Fli=BhistThi1,⋯,BhistThiL1T∈R2L1L1B.Here,Fhi and Fli on behalf of the film and television animation video image feature extraction results; Bhist on behalf of the histogram coding; and B on behalf of the film and television animation video image segmentation block number of samples.In this paper, the dictionary is trained in the SCSR framework by combining the sparse coding method. The goal is to obtain a set of dictionary pairsDh and D1 that can represent complex feature samples. Make K have the same sparse representation on Dh and D1 for the deep-level detail features Fhi and Fli generated by film, television, animation, and video images, and Fhi and Fli have the same description coefficient, that is,(8)Dh,a=Fhi−Dh⋅a+∑i=1Kλiαi,D1,a=Fli−D1⋅a+∑i=1Kλiαi.In the above formula,a=aii=1k represents sparse matrix and λi represents equilibrium coefficient [29]. In order to make the high-resolution film and television animation video image features and low-resolution film and television animation video image features have the same sparse description method as their respective dictionaries, the combined training method is adopted through formula (5) and (6), that is,(9)Dh,D1,α=1NFhi−Dh⋅a+1MFli−D1⋅a+∑i=1Kλiαi.In the above formula,N and M, respectively, represent the dimension rearrangement of the column vectors by the element values of high- and low-resolution feature blocks of film, television, and animation video images, and 1/N and 1/M are the cost between Dh and D1 of balanced formula (9). In order to facilitate subsequent calculation, formula (10) is reconstituted:(10)Dh,a=∑i=1Kλi′αi,(11)DC=1/NDh1/MD1,XC=1/NFh1/MF1,λI′=1N+1Mλi.Equation (11) is solved by iteration. Given dictionary DC, calculate the sparse representation coefficient ai of each data sample FC on DC, obtain matrix a=aii=1k, and finally update dictionary DC through a.After obtaining the dictionary pairDC, the reconstruction of LR film and television animation video image Y and HR film and television animation video image X can be obtained by using the high-resolution film and television animation video image reconstruction method based on sparse regular model.In the stage of reconstructing the video image of film and television animation, some noise exists in the video image of film and television animation due to the interference of external environment noise, and block effect and blurred artifact will appear in the reconstructed video image of film and television animation [30]. Considering that the conventional back-projection model cannot guarantee the quality of the reconstructed image, the details of the image can be better preserved by matching the similar blocks between the image and the image without the prior constraints of partial similarity. Relative to the image block effect and blurred artifacts after the reconstruction, the nonlocal similarity empirical constraint is introduced to optimize the HR image based on the global optimization of back-projection. The global and nonglobal constraint models in this paper are as follows [31, 32]:(12)X∗=argminXSHX−Y22+cX−X022+γI−WX22.In the above formula,S represents sampling operation, H represents fuzzy filtering, X−X022 represents global constraint term, I−WX22 represents nonlocal self-similarity constraint term, I represents identity matrix, c and γ represent normalization parameters, W represents nonlocal weight matrix, and the element formula in W is as follows:(13)Wij=1ziexp−Nxi−Nxj22h.In the above formula,Nxi represents the i-th film and television animation video image block in the film and television animation video image, xj represents the searched film and television animation video image block similar to Nxi, h represents the attenuation factor, and zi represents the normalized value.(14)zi=∑jexp−Nxi−Nxj22h.


### 2.5. Dynamic Recognition of Frame Features of Film, Television, and Animation Video Images

#### 2.5.1. Frame Feature Extraction of Video Image under Gray Projection

The first step of frame feature extraction is to analyze the features of gray level and detail in the video image based on wavelet transform and then to extract the feature of the video image by gray projection [33]. Finally, the problem of frame feature extraction of film and television animation video image evolves into the problem of foreground and background classification of film and television animation video image, and the separation coefficient is determined by the ratio function of the variance of feature distribution of film and television animation video image in the foreground and background region. The process of extracting frame feature of film and television animation video image is as follows:The input of preprocessed grayscale animation video images shall be represented byfkx,y, the grayscale image shall be decomposed by Mallat algorithm with wavelet, and a grayscale pyramid Lks shall be established. According to the high-frequency component, the decomposed grayscale image shall be built into detail pyramid Oks,d, the size shall be represented by s∈0,N, and the three detail directions of the video image shall be represented by d∈HL,LH,HH. The establishment of the original video grayscale image shall be completed by the pyramid Lks and detail pyramid Oks,d calculated in the above process, and the multiple features of two detail features can be obtained simultaneously [34].In a video image conveyed visually, the local contrast of a certain image at different positions within a certain range is determined by the difference between scales, so as to improve the contrast effect of the animation and video images. The formula is as follows:(15)DOGx,y,σc,σs=12πσc2exp−r22σc2−12πσs2exp−r22σs2,where r represents the feature contrast measure, σc represents the range of feature area, and σs represents the range of film, television, and animation video image suppression area. Fc represents the coarse-scale film and television animation video image, which can suppress the features other than the target area [35]. Fs represents the fine-scale film and television animation video image, which can describe the detail features of the target area, and then the scale difference between Fc and Fs is shown in the following equation:(16)Fc,s=FcΘFs.Fs adjusts the difference value to the film and television animation video image area with the same scale as Fc, which is represented by Lkc and Lks, and subtracts each point to obtain the corresponding absolute values Okc,d and Oks,d, so as to obtain the gray-level features and detail features of the film and television animation video image. The formula is as follows:(17)L^kc,s=LkcΘLks,O^kc,s,d=Okc,dΘOks,d.Gki,j represents the gray value of the i,j-th pixel in the film and television animation video image, d^x and d^y represent the evaluation estimator between the film and television animation video images, and the image feature display diagram is calculated according to the translation estimator, as shown in the following equation:(18)M^ki,j=Gki,j−Gk−mi−d^y,j−d^x.In the formula,Gk−m⋅ represents the translation difference, the normalized function No is used to unify the scale of the image, and then a group of weighting factors α, β, and γ are determined to complete the weighted fusion of the video image through the above method. The formula is shown in the following equation:(19)Sk=α⋅NL^k⋅β⋅NO^k⋅γ⋅NM^k,where NL^k represents grayscale, NO^k represents detail, and NM^k represents the normalization function of motion feature image and represents the feature value of film and television animation video image frame extracted at last.


#### 2.5.2. Dynamic Identification

Dynamic recognition methods mainly include global and local recognition. Because the dimension of video image is high, it is difficult to identify the whole video image by global method, and there are noise interference and information occlusion in the image after dynamic recognition. Therefore, in order to improve the efficiency of dynamic recognition, local recognition method is adopted [36]. This method takes K-L (Karhunen–Loeve) transformation as the main core and uses the similarity between evaluation features to realize dynamic recognition.K-L transform is based on the statistical characteristics of the transformation, through the incoming vector orthogonal transform and the outgoing vector to decouple the relevance of the data, which is the best way in the sense of variance.Suppose,f1 represents the N×M-dimensional matrix, Γ represents the sample statistic Γ=Γ1,Γ2,Γ3…ΓL, NM×1 represents the dimension vector, and the average value μ of Γ is calculated and obtained from the set of L sample values, as shown in the following equation:(20)μ=EΓ.Its variance matrixCΓ is shown in the following equation:(21)CΓ=EΓ−μΓ−μT.λi represents the eigenvalue of the variance matrix, and Φi represents the eigenvector of the variance matrix. L−1 eigenvectors and their corresponding eigenvalues are obtained, as shown in (19):(22)CΓΦi=λiΦi,0≤i≤L−1.The order of feature vectorΦi is based on the order of the size of feature values. The first m eigenvectors are determined and then normalized to form a change matrix ℜ. Then, the transformation matrix is used to transform vector Γi into vector ℑ in row m through (20):(23)ℑ=Γi×ℜ.Thus, achieve the effect of dimensionality reduction, and effectively complete the film and television animation video image enhancement design.


## 2.1. Video Processing Process under 3D Visual Communication Technology

Figure1 shows the flowchart of video processing under 3D visual communication technology.Figure 1
Video processing flowchart under 3D visual communication technology.The 3D visual communication technology can be divided into three parts: 3D visual communication content production, server and client, and 3D visual communication content production which is the core of the whole video processing process [6]. In the production of 3D visual communication content, a set of cameras or a set of camera devices and audio sensors containing multiple cameras and sensors are used to capture the sound and visual scene in the real physical world. Cameras and sensors, for example, produce a set of digital video and audio signals. In general, the camera captures content within 360° of the periphery of the unit [7, 8].Aiming at the video processing under the 3D visual communication technology, the 3D visual communication video image at the same time is combined with mosaic, projection mapping, and frame texture to generate a package, as shown in Figure2.Figure 2
3D visual communication animation video image mosaic, projection, and area-based packaging.


## 2.2. The Scaling Factor of the 3D Scene Transformation

After determining the triangular meshes on a two-dimensional plane through screen projection, a continuous scaling field shall be assigned to each triangular facet; that is, a scaling factor shall be assigned to each triangular facet, and the scaling factor between adjacent triangular facets shall be continuously variable. The specific process is as follows [9, 10]:Si is used to represent the distance from the triangle to the viewpoint in 3D scene. Si is defined as visual distance, and all Si can be integrated into a threshold of discrete function Si.Determine the apparent distanceSi and Si+1 between any adjacent triangles i and i+1, and the difference ∂i between the two can be expressed as follows:(1)∂i=Si−Si+1.Obtain the upper limit valuemax∂ of ∂i through formula (1).When the value ofminScale is 0.4, the sample size changes gradually from 0.4–1 to 0.4. Based on the value of minScale, pyramid shrinkage is applied to a given texture sample drawing to obtain a multilevel progressive shrinkage sample drawing, which is used as a scaling factor in the process of texture synthesis to obtain the basis for the corresponding sample drawing [11, 12].In order to make the neighboring triangle mesh correspond to the neighboring layer, based onmax∂, set up: the value of S function can only be different one layer within the sample layer if the difference is max∂ that is, according to max∂ to divide the value range of S function, the value of the function is divided into different layers according to max∂, and the layers corresponding to the neighboring triangle mesh are also adjacent, thus ensuring the continuity of texture in the process of composition.The value ofSi for each triangle can obtain a value of ScaleminScale≤Scale≤1 according to the above setting, which is the value of Scale corresponding to the scaling of the meta-texture sample image [13]. Based on this, each Scalevalue corresponds to a Scale-fold shrunk layer, and a Scale-fold shrunk image can be mapped to a Scale-fold shrunk film and TV animation image, where each triangle has a scaling factor.


## 2.3. Deep Feature Extraction Model Based on Deep Learning

PCANet is a relatively simple method of deep learning based on the theory of deep learning and convolutional neural networks [14, 15]. The PCANet structure is composed of two PCA (principal component analysis) filter layers, a hash layer and a histogram calculation layer, which can extract the deep-seated features of high-resolution animation and video images. But unlike the usual networks, PCANet's filters are more computationally efficient. PCANet is not obtained through training, but through obtaining the mapping results of parts of high-resolution film and television animation video images, and then adopts the PCA (principal component analysis) method to extract the principal components of the high-resolution film and television animation video images, each of which is an independent filter [16]. When the neural network of the filter is used to extract the features, the optimal weights can be obtained without iterative operation; thus, the calculation time is reduced [17]. In order to further discuss the advantages of PCANet depth network in extracting the features of high-resolution animated cartoon video images, a mapping eigenvalue of N, 8 × 8 and 1 moving distance is set up for the input of animated video images [18, 19]. The main parts of the mapping features L1 were computed using the PCANet algorithm, and a two-layer filter filters L1. The steps are as follows:


### 2.3.1. First Layer: PCA Filter Layer 1

For theN training picture LiN with size of m1m2, PCANet selects a k1×k2 window, and each training image is compared by row and column to obtain the local features of the image. Get m1×m2 picture blocks of k1×k2 size. Dislodge the mean value of the picture block, the output behind dislodging the mean value of Li:(2)A¯i=a¯i,1,a¯i,2,⋯,a¯i,m1,m2.In formula, each column of the matrixA¯i represents a block of image, and each column contains k1×k2 elements. There are m1×m2 columns in total. After performing the above operations separately for all N training images, a new data matrix A was obtained: A=A¯1,A¯2,⋯,A¯N∈Rk1k2×L, and A has N×m1×m2 columns. Then, the A matrix was PCA and the ahead Li eigenvectors of the eigenvector matrix W were taken as the convolutional kernel of the filter group.(3)WLi=mak1k2qlAAT∈Rk1k2,l=1,2,⋯,Li.In formula,qlAAT represents the l-th eigenvector of the matrix AAT. mak1k2 is a function, representing rearranging each of the Li eigenvectors into the matrix. Each eigenvector contains k1×k2 elements, amount to get Li convolutional nuclei of length k1 and width k2. Finally, for each input image L, the Li convolutional nuclei were filtered separately. Thus, the first layer of the PCA filter group is completed.


### 2.3.2. Second Layer: PCA Filter Layer 2

The second layer of the PCA filter group is the same principle as the first layer. This yields the convolutional kernel of the second layer:(4)WLi2=mak1k2ql2BBT∈Rk1k2,l2=1,2,⋯,Li2.For each input imageLi2 in the second layer, the PCA filter group is all complete through the filter WLi2 output features.Finally, theLi and Li2 feature mappings are obtained in the same way as CNN. PCANet is characterized by these L1 mapping features, so it can provide a reliable data for the film and television animation video image processing [20]. PCANet uses learning to get multilayer network filters. After the input video image is filtered through two layers of filters, it can have very high-dimensional data output and can be regarded as the input of video image characteristics of the film and television animation and be used for the reconstruction of high-resolution video image of the film and television animation [21].Therefore, when PCANet extracts the features of film and television animation video images, it is actually a direct processing of the pixels of the film and television animation video images, the operation stage has joined the process of blocking, and the number of film and television animation video image block output from the deep network has increased [22]. PCANet uses the deep network learning process to extract the features of the animation video image, and the video image features extracted by PCANet and the features obtained by artificial rules are more abundant in detailed information and more prominent in texture structure, which provides rich prior knowledge for subsequent reconstruction and fills in the details of the animation video image of low-resolution film and television so as to facilitate the reconstruction of the animation video image of super-resolution film and television.


## 2.3.1. First Layer: PCA Filter Layer 1

For theN training picture LiN with size of m1m2, PCANet selects a k1×k2 window, and each training image is compared by row and column to obtain the local features of the image. Get m1×m2 picture blocks of k1×k2 size. Dislodge the mean value of the picture block, the output behind dislodging the mean value of Li:(2)A¯i=a¯i,1,a¯i,2,⋯,a¯i,m1,m2.In formula, each column of the matrixA¯i represents a block of image, and each column contains k1×k2 elements. There are m1×m2 columns in total. After performing the above operations separately for all N training images, a new data matrix A was obtained: A=A¯1,A¯2,⋯,A¯N∈Rk1k2×L, and A has N×m1×m2 columns. Then, the A matrix was PCA and the ahead Li eigenvectors of the eigenvector matrix W were taken as the convolutional kernel of the filter group.(3)WLi=mak1k2qlAAT∈Rk1k2,l=1,2,⋯,Li.In formula,qlAAT represents the l-th eigenvector of the matrix AAT. mak1k2 is a function, representing rearranging each of the Li eigenvectors into the matrix. Each eigenvector contains k1×k2 elements, amount to get Li convolutional nuclei of length k1 and width k2. Finally, for each input image L, the Li convolutional nuclei were filtered separately. Thus, the first layer of the PCA filter group is completed.


## 2.3.2. Second Layer: PCA Filter Layer 2

The second layer of the PCA filter group is the same principle as the first layer. This yields the convolutional kernel of the second layer:(4)WLi2=mak1k2ql2BBT∈Rk1k2,l2=1,2,⋯,Li2.For each input imageLi2 in the second layer, the PCA filter group is all complete through the filter WLi2 output features.Finally, theLi and Li2 feature mappings are obtained in the same way as CNN. PCANet is characterized by these L1 mapping features, so it can provide a reliable data for the film and television animation video image processing [20]. PCANet uses learning to get multilayer network filters. After the input video image is filtered through two layers of filters, it can have very high-dimensional data output and can be regarded as the input of video image characteristics of the film and television animation and be used for the reconstruction of high-resolution video image of the film and television animation [21].Therefore, when PCANet extracts the features of film and television animation video images, it is actually a direct processing of the pixels of the film and television animation video images, the operation stage has joined the process of blocking, and the number of film and television animation video image block output from the deep network has increased [22]. PCANet uses the deep network learning process to extract the features of the animation video image, and the video image features extracted by PCANet and the features obtained by artificial rules are more abundant in detailed information and more prominent in texture structure, which provides rich prior knowledge for subsequent reconstruction and fills in the details of the animation video image of low-resolution film and television so as to facilitate the reconstruction of the animation video image of super-resolution film and television.


## 2.4. Image Reconstruction Method of Multiframe Animation Video Based on Visual Communication

Combining the advantages of PCANet depth network and sparse representation-based reconstruction method, this paper proposes a visual communication-based multiframe animation video image reconstruction method [23, 24]. For the multiframe animation video image reconstruction method, it is assumed that the high-resolution image and the low-resolution image are sparse expressions for their respective dictionaries, and then, the image sample features are obtained by PCANet depth network. Dh represents the dictionary feature of a high-resolution image, and D1 represents the dictionary feature of a low-resolution image. In the stage of high-resolution image reconstruction, the low-resolution image is processed in the same way, the deep-seated feature is extracted by PCANet, the sparse representation of D1 above the low-resolution dictionary feature of the high-resolution image is obtained, the coefficients expressed by the sparse D1 feature of the low-resolution image are directly applied on Dh, and the corresponding high-resolution feature image is obtained [25]. Low-resolution video animation images are used to achieve high-resolution reconstruction. Through the PCANet depth network, we can get better film and TV animation video image features than the nondepth network. The deep feature dictionary can also improve the description ability of the feature dictionary and improve the quality of film and TV animation video image reconstruction significantly [26].K blurred film and TV animation video image need to be sampled in the training data set, which is adjusted to the same size to get the corresponding low-resolution film and TV animation video image, which is combined into a model sample pair: T=Xh,X1, Xh=xhii=1k represents high-resolution features, and X1=xhii=1k represents low-resolution features. Compute the matrix into blocks for all samples in the data set, and select a sliding window of size k1×k2, (normally, the pixel square window of the film and television animation video image used is 3, 5, or 7). After feature extraction for all the film and television animation video images is carried out through the aforesaid sliding window, the new data matrix X of column N×m×n can be obtained, and each column of the matrix represents a film and television animation video image block with a total of k1×k2 elements.To obtain the training sample ofi high-resolution animation video image, the formula is(5)X¯hi=x¯hi,1,x¯hi,2,⋯,x¯hi,mn.Features were extracted with the above data matrixX, and the extracted features were regarded as feature samples in SCSR model and substituted into dictionary features of PCANet.Suppose thatThiL represents the results of the high-resolution animated video image after sparse coding, the H· function is regarded as a unit step function, the results of sparse coding are quantized, the histogram coding is completed, and the deep detail features of the high-resolution animated video image are extracted, that is, [27, 28](6)Fhi=BhistThi1,⋯,BhistThiL1T∈R2L1L1B.Similarly, it is inferred that through the same processing process as the high-resolution film and television animation video image, the results of extracting the deep-seated detail features of the low-resolution film and television animation video image are given, namely,(7)Fli=BhistThi1,⋯,BhistThiL1T∈R2L1L1B.Here,Fhi and Fli on behalf of the film and television animation video image feature extraction results; Bhist on behalf of the histogram coding; and B on behalf of the film and television animation video image segmentation block number of samples.In this paper, the dictionary is trained in the SCSR framework by combining the sparse coding method. The goal is to obtain a set of dictionary pairsDh and D1 that can represent complex feature samples. Make K have the same sparse representation on Dh and D1 for the deep-level detail features Fhi and Fli generated by film, television, animation, and video images, and Fhi and Fli have the same description coefficient, that is,(8)Dh,a=Fhi−Dh⋅a+∑i=1Kλiαi,D1,a=Fli−D1⋅a+∑i=1Kλiαi.In the above formula,a=aii=1k represents sparse matrix and λi represents equilibrium coefficient [29]. In order to make the high-resolution film and television animation video image features and low-resolution film and television animation video image features have the same sparse description method as their respective dictionaries, the combined training method is adopted through formula (5) and (6), that is,(9)Dh,D1,α=1NFhi−Dh⋅a+1MFli−D1⋅a+∑i=1Kλiαi.In the above formula,N and M, respectively, represent the dimension rearrangement of the column vectors by the element values of high- and low-resolution feature blocks of film, television, and animation video images, and 1/N and 1/M are the cost between Dh and D1 of balanced formula (9). In order to facilitate subsequent calculation, formula (10) is reconstituted:(10)Dh,a=∑i=1Kλi′αi,(11)DC=1/NDh1/MD1,XC=1/NFh1/MF1,λI′=1N+1Mλi.Equation (11) is solved by iteration. Given dictionary DC, calculate the sparse representation coefficient ai of each data sample FC on DC, obtain matrix a=aii=1k, and finally update dictionary DC through a.After obtaining the dictionary pairDC, the reconstruction of LR film and television animation video image Y and HR film and television animation video image X can be obtained by using the high-resolution film and television animation video image reconstruction method based on sparse regular model.In the stage of reconstructing the video image of film and television animation, some noise exists in the video image of film and television animation due to the interference of external environment noise, and block effect and blurred artifact will appear in the reconstructed video image of film and television animation [30]. Considering that the conventional back-projection model cannot guarantee the quality of the reconstructed image, the details of the image can be better preserved by matching the similar blocks between the image and the image without the prior constraints of partial similarity. Relative to the image block effect and blurred artifacts after the reconstruction, the nonlocal similarity empirical constraint is introduced to optimize the HR image based on the global optimization of back-projection. The global and nonglobal constraint models in this paper are as follows [31, 32]:(12)X∗=argminXSHX−Y22+cX−X022+γI−WX22.In the above formula,S represents sampling operation, H represents fuzzy filtering, X−X022 represents global constraint term, I−WX22 represents nonlocal self-similarity constraint term, I represents identity matrix, c and γ represent normalization parameters, W represents nonlocal weight matrix, and the element formula in W is as follows:(13)Wij=1ziexp−Nxi−Nxj22h.In the above formula,Nxi represents the i-th film and television animation video image block in the film and television animation video image, xj represents the searched film and television animation video image block similar to Nxi, h represents the attenuation factor, and zi represents the normalized value.(14)zi=∑jexp−Nxi−Nxj22h.


## 2.5. Dynamic Recognition of Frame Features of Film, Television, and Animation Video Images

### 2.5.1. Frame Feature Extraction of Video Image under Gray Projection

The first step of frame feature extraction is to analyze the features of gray level and detail in the video image based on wavelet transform and then to extract the feature of the video image by gray projection [33]. Finally, the problem of frame feature extraction of film and television animation video image evolves into the problem of foreground and background classification of film and television animation video image, and the separation coefficient is determined by the ratio function of the variance of feature distribution of film and television animation video image in the foreground and background region. The process of extracting frame feature of film and television animation video image is as follows:The input of preprocessed grayscale animation video images shall be represented byfkx,y, the grayscale image shall be decomposed by Mallat algorithm with wavelet, and a grayscale pyramid Lks shall be established. According to the high-frequency component, the decomposed grayscale image shall be built into detail pyramid Oks,d, the size shall be represented by s∈0,N, and the three detail directions of the video image shall be represented by d∈HL,LH,HH. The establishment of the original video grayscale image shall be completed by the pyramid Lks and detail pyramid Oks,d calculated in the above process, and the multiple features of two detail features can be obtained simultaneously [34].In a video image conveyed visually, the local contrast of a certain image at different positions within a certain range is determined by the difference between scales, so as to improve the contrast effect of the animation and video images. The formula is as follows:(15)DOGx,y,σc,σs=12πσc2exp−r22σc2−12πσs2exp−r22σs2,where r represents the feature contrast measure, σc represents the range of feature area, and σs represents the range of film, television, and animation video image suppression area. Fc represents the coarse-scale film and television animation video image, which can suppress the features other than the target area [35]. Fs represents the fine-scale film and television animation video image, which can describe the detail features of the target area, and then the scale difference between Fc and Fs is shown in the following equation:(16)Fc,s=FcΘFs.Fs adjusts the difference value to the film and television animation video image area with the same scale as Fc, which is represented by Lkc and Lks, and subtracts each point to obtain the corresponding absolute values Okc,d and Oks,d, so as to obtain the gray-level features and detail features of the film and television animation video image. The formula is as follows:(17)L^kc,s=LkcΘLks,O^kc,s,d=Okc,dΘOks,d.Gki,j represents the gray value of the i,j-th pixel in the film and television animation video image, d^x and d^y represent the evaluation estimator between the film and television animation video images, and the image feature display diagram is calculated according to the translation estimator, as shown in the following equation:(18)M^ki,j=Gki,j−Gk−mi−d^y,j−d^x.In the formula,Gk−m⋅ represents the translation difference, the normalized function No is used to unify the scale of the image, and then a group of weighting factors α, β, and γ are determined to complete the weighted fusion of the video image through the above method. The formula is shown in the following equation:(19)Sk=α⋅NL^k⋅β⋅NO^k⋅γ⋅NM^k,where NL^k represents grayscale, NO^k represents detail, and NM^k represents the normalization function of motion feature image and represents the feature value of film and television animation video image frame extracted at last.


### 2.5.2. Dynamic Identification

Dynamic recognition methods mainly include global and local recognition. Because the dimension of video image is high, it is difficult to identify the whole video image by global method, and there are noise interference and information occlusion in the image after dynamic recognition. Therefore, in order to improve the efficiency of dynamic recognition, local recognition method is adopted [36]. This method takes K-L (Karhunen–Loeve) transformation as the main core and uses the similarity between evaluation features to realize dynamic recognition.K-L transform is based on the statistical characteristics of the transformation, through the incoming vector orthogonal transform and the outgoing vector to decouple the relevance of the data, which is the best way in the sense of variance.Suppose,f1 represents the N×M-dimensional matrix, Γ represents the sample statistic Γ=Γ1,Γ2,Γ3…ΓL, NM×1 represents the dimension vector, and the average value μ of Γ is calculated and obtained from the set of L sample values, as shown in the following equation:(20)μ=EΓ.Its variance matrixCΓ is shown in the following equation:(21)CΓ=EΓ−μΓ−μT.λi represents the eigenvalue of the variance matrix, and Φi represents the eigenvector of the variance matrix. L−1 eigenvectors and their corresponding eigenvalues are obtained, as shown in (19):(22)CΓΦi=λiΦi,0≤i≤L−1.The order of feature vectorΦi is based on the order of the size of feature values. The first m eigenvectors are determined and then normalized to form a change matrix ℜ. Then, the transformation matrix is used to transform vector Γi into vector ℑ in row m through (20):(23)ℑ=Γi×ℜ.Thus, achieve the effect of dimensionality reduction, and effectively complete the film and television animation video image enhancement design.


## 2.5.1. Frame Feature Extraction of Video Image under Gray Projection

The first step of frame feature extraction is to analyze the features of gray level and detail in the video image based on wavelet transform and then to extract the feature of the video image by gray projection [33]. Finally, the problem of frame feature extraction of film and television animation video image evolves into the problem of foreground and background classification of film and television animation video image, and the separation coefficient is determined by the ratio function of the variance of feature distribution of film and television animation video image in the foreground and background region. The process of extracting frame feature of film and television animation video image is as follows:The input of preprocessed grayscale animation video images shall be represented byfkx,y, the grayscale image shall be decomposed by Mallat algorithm with wavelet, and a grayscale pyramid Lks shall be established. According to the high-frequency component, the decomposed grayscale image shall be built into detail pyramid Oks,d, the size shall be represented by s∈0,N, and the three detail directions of the video image shall be represented by d∈HL,LH,HH. The establishment of the original video grayscale image shall be completed by the pyramid Lks and detail pyramid Oks,d calculated in the above process, and the multiple features of two detail features can be obtained simultaneously [34].In a video image conveyed visually, the local contrast of a certain image at different positions within a certain range is determined by the difference between scales, so as to improve the contrast effect of the animation and video images. The formula is as follows:(15)DOGx,y,σc,σs=12πσc2exp−r22σc2−12πσs2exp−r22σs2,where r represents the feature contrast measure, σc represents the range of feature area, and σs represents the range of film, television, and animation video image suppression area. Fc represents the coarse-scale film and television animation video image, which can suppress the features other than the target area [35]. Fs represents the fine-scale film and television animation video image, which can describe the detail features of the target area, and then the scale difference between Fc and Fs is shown in the following equation:(16)Fc,s=FcΘFs.Fs adjusts the difference value to the film and television animation video image area with the same scale as Fc, which is represented by Lkc and Lks, and subtracts each point to obtain the corresponding absolute values Okc,d and Oks,d, so as to obtain the gray-level features and detail features of the film and television animation video image. The formula is as follows:(17)L^kc,s=LkcΘLks,O^kc,s,d=Okc,dΘOks,d.Gki,j represents the gray value of the i,j-th pixel in the film and television animation video image, d^x and d^y represent the evaluation estimator between the film and television animation video images, and the image feature display diagram is calculated according to the translation estimator, as shown in the following equation:(18)M^ki,j=Gki,j−Gk−mi−d^y,j−d^x.In the formula,Gk−m⋅ represents the translation difference, the normalized function No is used to unify the scale of the image, and then a group of weighting factors α, β, and γ are determined to complete the weighted fusion of the video image through the above method. The formula is shown in the following equation:(19)Sk=α⋅NL^k⋅β⋅NO^k⋅γ⋅NM^k,where NL^k represents grayscale, NO^k represents detail, and NM^k represents the normalization function of motion feature image and represents the feature value of film and television animation video image frame extracted at last.


## 2.5.2. Dynamic Identification

Dynamic recognition methods mainly include global and local recognition. Because the dimension of video image is high, it is difficult to identify the whole video image by global method, and there are noise interference and information occlusion in the image after dynamic recognition. Therefore, in order to improve the efficiency of dynamic recognition, local recognition method is adopted [36]. This method takes K-L (Karhunen–Loeve) transformation as the main core and uses the similarity between evaluation features to realize dynamic recognition.K-L transform is based on the statistical characteristics of the transformation, through the incoming vector orthogonal transform and the outgoing vector to decouple the relevance of the data, which is the best way in the sense of variance.Suppose,f1 represents the N×M-dimensional matrix, Γ represents the sample statistic Γ=Γ1,Γ2,Γ3…ΓL, NM×1 represents the dimension vector, and the average value μ of Γ is calculated and obtained from the set of L sample values, as shown in the following equation:(20)μ=EΓ.Its variance matrixCΓ is shown in the following equation:(21)CΓ=EΓ−μΓ−μT.λi represents the eigenvalue of the variance matrix, and Φi represents the eigenvector of the variance matrix. L−1 eigenvectors and their corresponding eigenvalues are obtained, as shown in (19):(22)CΓΦi=λiΦi,0≤i≤L−1.The order of feature vectorΦi is based on the order of the size of feature values. The first m eigenvectors are determined and then normalized to form a change matrix ℜ. Then, the transformation matrix is used to transform vector Γi into vector ℑ in row m through (20):(23)ℑ=Γi×ℜ.Thus, achieve the effect of dimensionality reduction, and effectively complete the film and television animation video image enhancement design.


## 3. Experimental Results and Analysis

The simulation environment is Pentium m1.60 Ghz CPU and 760 m RAM. The dual-core Intel second-generation core processor OptiPlex 3010 is used as the main frequency, the system is win10 flagship 32 bits, and the simulation software is MATLAB 2020 B. In order to prove the effect of the method in this paper, it is compared with current advanced visual communication methods of animation images (the plane visual communication design method based on graphic beautification technology and the visual communication design method of animated character image in virtual reality environment).


### 3.1. Comparative Analysis of Visual Communication Image Reconstruction Effects under Different Methods

To make the experimental results more intuitive, two animated video images of 512×512 pixels shall be selected as reference animated video images, as shown in Figures3 and 4(a), and the simulation experiment shall be carried out with the relevant simulation experimental tools. If we use Gaussian fuzzy model, set the Gaussian filter of 3×3 region invariant, set its sampling factor to 4, add Gaussian noise to all low-resolution images, and satisfy the signal-to-noise ratio of 30 dB. Figures 3(a) and 4(a) are the reference film and television animation video images, Figures 3(b) and 4(b) are the reconstructions of film and television animation video images by using the visual communication design method of virtual reality environment animation character images, Figures 3(c) and 4(c) are the reconstructions of film and television animation video images by using the graphic beautification technology-based graphic visual communication design method, and Figures 3(d) and 4(d) are the reconstructions of this method.Figure 3
Simulation results. (a) Video image sample of film and television animation. (b) Visual communication design method of animated character image in virtual reality environment. (c) Graphic visual communication design method based on graphic beautification technology. (d) Paper method.
(a)(b)(c)(d)Figure 4
Simulation results. (a) Video image sample of film and television animation. (b) Visual communication design method of animated character image in virtual reality environment. (c) Graphic visual communication design method based on graphic beautification technology. (d) Paper method.
(a)(b)(c)(d)According to Figures3 and 4, it can be seen that the visual communication design method of VR environment animated character image cannot avoid blurring edges and the reconstruction effect is not good. The method of plane visual communication design based on graphic beautification technology has a large error when matching some pixels, which leads to the lack of rich and clear details of the final reconstructed animation video image, and the reconstructed effect is inferior to the visual communication design method of virtual reality animation image. Compared with the other two methods, the proposed method has obvious advantages in the reconstruction of high-resolution animation video images.


### 3.2. Comparative Analysis of Recognition Rate

Compared with the visual communication design method based on VR environment animation and graphic landscaping technology, the effectiveness of visual communication video image dynamic recognition is tested. First, according to the actual situation, 50 kinds of license plate Chinese characters are segmented into two kinds of film and TV animation video images, which are divided into 10 sets of fuzzy similar Chinese characters according to the special structure features of Chinese characters, and then recognized. There are 270 fuzzy film and TV animation video images, and the recognition rates of the two methods are shown in Table1.Table 1
Comparison and analysis of recognition rate.
MethodFilm animation video image resolutionCharacteristic dimensionRecognition rate (%)Identification time (s)Visual communication design method of animated character image in virtual reality environment32×167062.21.8Graphic visual communication design method based on graphic beautification technology32×166267.51.7Proposed method32×169591.00.9As can be seen from Table1, the dynamic recognition rate of the proposed method is 91%, which is higher than other methods. The dynamic recognition rate of the graphic beautification technology-based graphic visual communication design method is 62.2%, and the dynamic recognition rate of the virtual reality environment animation figure visual communication design method is 67.5% for the Chinese character images with the same resolution and blurring degree of film and television animation video images. This is mainly due to the fact that the graphic visual communication design method based on graphic beautification technology and the virtual reality environment animation figure visual communication design method do not take into account the influence of illumination color on film and television animation video images, so that the feature dimension is reduced. At the same time, in order to prevent overlapping areas, 2 × 1 block is used as a block at the time of establishing a block, which also reduces the dimension, but when constructing a histogram, the gradient of each cell is divided into 9 parts. According to the experimental analysis of Dalal, if the area is reduced at this time, the feature dimension can be reduced, but the description ability is also reduced, and the computational complexity is increased. The advantage of the proposed method in recognition rate is that it arranges the eigenvalues in an orderly way and determines the eigenvectors of the eigenvalues as Chinese characters. This method not only reduces the feature dimension, but also retains the key information of the animation video image. In the process of feature extraction, it highlights the main details of the animation video image, deepens the description of the feature, and effectively improves the recognition rate.


### 3.3. Space-Time Performance Test

Taking the visual communication design method of animated character images in virtual reality environment proposed in reference [3] and the plane visual communication design method based on graphic beautification technology proposed in reference [4] as the comparison method, and taking the grassland texture sample synthesis as an example, the temporal and spatial performance of this method and the comparison method are compared. The results are shown in Tables 2 and 3.Table 2
Time performance simulation results.
Number of triangular meshesSynthesis time of this method (s)Visual communication design method of animated character image in virtual reality environment (s)Graphic visual communication design method based on graphic beautification technology (s)5122.116.912.810242.722.416.715362.023.215.020482.434.676.225602.651.126.630723.587.390735843.892.288.340963.2167.2135.4Table 3
Space performance simulation results.
Number of triangular meshesThe size of the synthesized image is determined by this method (MB)Image size under visual communication design method of animated character image in virtual reality environment (MB)Image size after image synthesis based on graphic beautification technology (MB)5120.371.361.7810241.222.582.8115361.194.274.8920481.925.175.7425600.797.337.6330721.279.1710.0835841.1711.1814.2740962.0414.9320.06Analysis of Table2 shows that the length of time of the three methods used in 3D visual communication is different. The length of time of the suggested method is below 3.8 s, the length of time of the visual communication design method of animated character image in virtual reality environment is up to 14.93 s, and the length of time of the graphic visual communication design method based on graphic beautification technology is up to 20.06 s. The length of time of the suggested method is smaller than that in VR environment. Compared with the two comparison methods, this method has obvious advantages in time. This is because this 3D visual communication animation video images through stitching, projection mapping, and animation video image frame texture synthesis projection, resulting in packaging. There is no need to preprocess the texture sample to improve the efficiency of texture synthesis.Analysis of Table3 shows that the size of the animation video image after the three methods is quite different. The size of the synthesized image that is determined by this method is below 3.8 MB, the image size under visual communication design method of animated character image in virtual reality environment is up to 14.93 MB, and the image size under image synthesis based on graphic beautification technology is up to 20.06 MB. The size of the synthesized image that is determined by the proposed method is smaller than other methods. This is because the present method constructs the scale factor fields for 3-dimensional transformations. Based on this, the identified and extracted video image frame feature scale is smaller and occupies less space.


### 3.4. Real Example Experiment of Video Image Reconstruction

In order to reflect the performance of this method in practice, the video image reconstruction performance is tested. The 500 images from the Lion King animated video were selected as subjects and iterated 200 times to test the peak signal-to-noise ratio of the HD reconstructed image, and the results are shown in Figure5:Figure 5
Peak SNR of the HD reconstructed images.As shown in Figure5, the image peak signal-to-noise ratio of the present method is 31.2dB–40.9 dB, which is higher than the original image, proving that this method meets the practical needs of high-resolution image reconstruction.


## 3.1. Comparative Analysis of Visual Communication Image Reconstruction Effects under Different Methods

To make the experimental results more intuitive, two animated video images of 512×512 pixels shall be selected as reference animated video images, as shown in Figures3 and 4(a), and the simulation experiment shall be carried out with the relevant simulation experimental tools. If we use Gaussian fuzzy model, set the Gaussian filter of 3×3 region invariant, set its sampling factor to 4, add Gaussian noise to all low-resolution images, and satisfy the signal-to-noise ratio of 30 dB. Figures 3(a) and 4(a) are the reference film and television animation video images, Figures 3(b) and 4(b) are the reconstructions of film and television animation video images by using the visual communication design method of virtual reality environment animation character images, Figures 3(c) and 4(c) are the reconstructions of film and television animation video images by using the graphic beautification technology-based graphic visual communication design method, and Figures 3(d) and 4(d) are the reconstructions of this method.Figure 3
Simulation results. (a) Video image sample of film and television animation. (b) Visual communication design method of animated character image in virtual reality environment. (c) Graphic visual communication design method based on graphic beautification technology. (d) Paper method.
(a)(b)(c)(d)Figure 4
Simulation results. (a) Video image sample of film and television animation. (b) Visual communication design method of animated character image in virtual reality environment. (c) Graphic visual communication design method based on graphic beautification technology. (d) Paper method.
(a)(b)(c)(d)According to Figures3 and 4, it can be seen that the visual communication design method of VR environment animated character image cannot avoid blurring edges and the reconstruction effect is not good. The method of plane visual communication design based on graphic beautification technology has a large error when matching some pixels, which leads to the lack of rich and clear details of the final reconstructed animation video image, and the reconstructed effect is inferior to the visual communication design method of virtual reality animation image. Compared with the other two methods, the proposed method has obvious advantages in the reconstruction of high-resolution animation video images.


## 3.2. Comparative Analysis of Recognition Rate

Compared with the visual communication design method based on VR environment animation and graphic landscaping technology, the effectiveness of visual communication video image dynamic recognition is tested. First, according to the actual situation, 50 kinds of license plate Chinese characters are segmented into two kinds of film and TV animation video images, which are divided into 10 sets of fuzzy similar Chinese characters according to the special structure features of Chinese characters, and then recognized. There are 270 fuzzy film and TV animation video images, and the recognition rates of the two methods are shown in Table1.Table 1
Comparison and analysis of recognition rate.
MethodFilm animation video image resolutionCharacteristic dimensionRecognition rate (%)Identification time (s)Visual communication design method of animated character image in virtual reality environment32×167062.21.8Graphic visual communication design method based on graphic beautification technology32×166267.51.7Proposed method32×169591.00.9As can be seen from Table1, the dynamic recognition rate of the proposed method is 91%, which is higher than other methods. The dynamic recognition rate of the graphic beautification technology-based graphic visual communication design method is 62.2%, and the dynamic recognition rate of the virtual reality environment animation figure visual communication design method is 67.5% for the Chinese character images with the same resolution and blurring degree of film and television animation video images. This is mainly due to the fact that the graphic visual communication design method based on graphic beautification technology and the virtual reality environment animation figure visual communication design method do not take into account the influence of illumination color on film and television animation video images, so that the feature dimension is reduced. At the same time, in order to prevent overlapping areas, 2 × 1 block is used as a block at the time of establishing a block, which also reduces the dimension, but when constructing a histogram, the gradient of each cell is divided into 9 parts. According to the experimental analysis of Dalal, if the area is reduced at this time, the feature dimension can be reduced, but the description ability is also reduced, and the computational complexity is increased. The advantage of the proposed method in recognition rate is that it arranges the eigenvalues in an orderly way and determines the eigenvectors of the eigenvalues as Chinese characters. This method not only reduces the feature dimension, but also retains the key information of the animation video image. In the process of feature extraction, it highlights the main details of the animation video image, deepens the description of the feature, and effectively improves the recognition rate.


## 3.3. Space-Time Performance Test

Taking the visual communication design method of animated character images in virtual reality environment proposed in reference [3] and the plane visual communication design method based on graphic beautification technology proposed in reference [4] as the comparison method, and taking the grassland texture sample synthesis as an example, the temporal and spatial performance of this method and the comparison method are compared. The results are shown in Tables 2 and 3.Table 2
Time performance simulation results.
Number of triangular meshesSynthesis time of this method (s)Visual communication design method of animated character image in virtual reality environment (s)Graphic visual communication design method based on graphic beautification technology (s)5122.116.912.810242.722.416.715362.023.215.020482.434.676.225602.651.126.630723.587.390735843.892.288.340963.2167.2135.4Table 3
Space performance simulation results.
Number of triangular meshesThe size of the synthesized image is determined by this method (MB)Image size under visual communication design method of animated character image in virtual reality environment (MB)Image size after image synthesis based on graphic beautification technology (MB)5120.371.361.7810241.222.582.8115361.194.274.8920481.925.175.7425600.797.337.6330721.279.1710.0835841.1711.1814.2740962.0414.9320.06Analysis of Table2 shows that the length of time of the three methods used in 3D visual communication is different. The length of time of the suggested method is below 3.8 s, the length of time of the visual communication design method of animated character image in virtual reality environment is up to 14.93 s, and the length of time of the graphic visual communication design method based on graphic beautification technology is up to 20.06 s. The length of time of the suggested method is smaller than that in VR environment. Compared with the two comparison methods, this method has obvious advantages in time. This is because this 3D visual communication animation video images through stitching, projection mapping, and animation video image frame texture synthesis projection, resulting in packaging. There is no need to preprocess the texture sample to improve the efficiency of texture synthesis.Analysis of Table3 shows that the size of the animation video image after the three methods is quite different. The size of the synthesized image that is determined by this method is below 3.8 MB, the image size under visual communication design method of animated character image in virtual reality environment is up to 14.93 MB, and the image size under image synthesis based on graphic beautification technology is up to 20.06 MB. The size of the synthesized image that is determined by the proposed method is smaller than other methods. This is because the present method constructs the scale factor fields for 3-dimensional transformations. Based on this, the identified and extracted video image frame feature scale is smaller and occupies less space.


## 3.4. Real Example Experiment of Video Image Reconstruction

In order to reflect the performance of this method in practice, the video image reconstruction performance is tested. The 500 images from the Lion King animated video were selected as subjects and iterated 200 times to test the peak signal-to-noise ratio of the HD reconstructed image, and the results are shown in Figure5:Figure 5
Peak SNR of the HD reconstructed images.As shown in Figure5, the image peak signal-to-noise ratio of the present method is 31.2dB–40.9 dB, which is higher than the original image, proving that this method meets the practical needs of high-resolution image reconstruction.


## 4. Conclusion

A new animation design method based on 3D visual communication technology is designed to solve the problem of poor visual effect in the existing image visual communication technology. Build a video processing process under 3D visual communication technology; based on the visual distance from a 2D images to a 3D scene, compute the scaling factor for the 3D scene transformation; building a deep learning-based PCANet model, images were used to filter for processing by using the model and to extract the characteristics of the film and television animation video images; deep features of the image samples were acquired using the PCAN deep network; create a low-resolution feature dictionary for high-resolution images; using a high-resolution video image reconstruction method based on a sparse rule model, realize the reconstruction of animated video images; nonlocal similarity empirical constraints are also introduced to optimize the HR images; analyze grayscale and detail features based on wavelet transform; extract the features of the video images; with the K-L (Karhunen–Loeve) transformation as the core, the similarity between the picture features is used to dynamically identify the film and television animation video images, and to complete the high-precision film and television animation design. The experimental results show that the proposed method can improve the visual communication effect of animation and video images, with small time cost, small space capacity, and good application performance.



---

*Source: 6461538-2022-01-05.xml*