# Research on Fast Compensation Algorithm for Interframe Motion of Multimedia Video Based on Manhattan Distance

Authors: Ning Li; Shuai Wan
Journal: Journal of Mathematics
 (2022)

---

## Abstract

To improve the video quality, aiming at the problems of low peak signal-to-noise ratio, poor visual effect, and low bit rate of traditional methods, this paper proposes a fast compensation algorithm for the interframe motion of multimedia video based on Manhattan distance. The absolute median difference based on wavelet transform is used to estimate the multimedia video noise. According to the Gaussian noise variance estimation result, the active noise mixing forensics algorithm is used to preprocess the original video for noise mixing, and the fuzzy C-means clustering method is used to smoothly process the noisy multimedia video and obtain significant information from the multimedia video. The block-based motion idea is to divide each frame of the video sequence into nonoverlapping macroblocks, find the best position of the block corresponding to the current frame in the reference frame according to the specific search range and specific rules, and obtain the relative Manhattan distance between the current frame and the background of multimedia video using the Manhattan distance calculation formula. Then, the motion between the multimedia video frames is compensated. The experimental results show that the algorithm in this paper has a high peak signal-to-noise ratio and a high bit rate, which effectively improves the visual effect of the video.


---

## Body

## 1. Introduction

In recent years, with the rapid development of multimedia and network technology, video, image, computer vision, multimedia database, and computer network technology are increasingly integrated, covering all aspects of the national economy and social life. Video processing, video coding, and video communication, which are in the core position, have become the frontier fields and hot topics of information and communication engineering [1]. Among them, with the gradual penetration of multimedia, the boundaries among videos, graphics, computer vision, multimedia database, and computer network become blurred, making video processing a multi-disciplinary research field [2]. At present, video processing has been at the core of multimedia technology [3]. At the same time, with the rapid development of video technology, the research of motion compensation between multimedia video frames is very important and necessary. Therefore, video interframe motion compensation plays an important role in many technologies included in video processing [4].As one of the classic problems in the field of image and video processing, video interframe motion compensation is widely used in video frame rate improvement, slow video production, and virtual view synthesis. At present, the commonly used interframe motion compensation method of the video image is to intensively match the input image pairs based on the optical flow field estimation algorithm and interpolate the input image pixel by pixel using the obtained dense matching information to synthesize the intermediate frame image. As the optical flow field estimation itself is an ill-conditioned problem, especially in the case of weak image texture or occlusion, the effect is poor, and the peak signal-to-noise ratio is low. The existing methods often face difficulties in practical application. In recent years, the method based on deep learning has attracted extensive attention and has achieved remarkable results in many computer vision problems, such as target classification, face recognition, and so on. However, the key to the success of this method is to use a large number of training samples to train the appropriate depth neural network, which has the problems of long compensation time and low bit rate. In addition, reference [5] proposes a deep convolution neural network algorithm to realize image interframe compensation. Firstly, the image interframe compensation model is constructed according to the deep convolution neural network. Secondly, the image features of the compensation model are extracted by sparse self-coding and linear decoding. Then, the image features are mapped by a multilayer convolution neural network. Finally, the image frame resolution is reconstructed according to the sparse algorithm to compensate for the image frame. The experimental results show that the image frame compensation method based on a deep convolution neural network can effectively solve the problem of image loss, however, the bit rate is low and the application effect is poor.To improve the peak signal-to-noise ratio, the visual effect, and the bit rate of multimedia video images, a fast interframe motion compensation algorithm based on the Manhattan distance is proposed in this paper. Section2 of this paper presents the processing of the multimedia video. In Section 3, the multimedia video interframe motion fast compensation algorithm is presented. Section 4 proposes the simulation experiments that verify the strength of our method, and the conclusion is given in Section 5.


## 2. Multimedia Video Preprocessing

### 2.1. Gaussian Noise Variance Estimation

For the noise level mixed in the multimedia video, this paper adopts the variance to measure. Use the absolute median difference based on the wavelet transform [6] to estimate the Gaussian noise standard deviation of a noisy multimedia video A:(1)∂^=MADxa∗1−SyS.xa represents the first-level fine-scale wavelet coefficients of the multimedia video A. The MAD operator is defined as follows:(2)MADxa=MedE1KwW1.Med⋅ represents the median of the input vector. The fast wavelet transform ensures the high execution rate of the MAD operator, making it suitable for the batch estimation of the Gaussian noise variance of video frames [7]. The specific Gaussian noise variance estimation formula is as follows:(3)σa2=IrRr/∂^2ωs.Ir represents the high frequency information of the video. Rr represents the low frequency information of the video. ωs represents the amount of noise in the video.


### 2.2. Active Noise Mixing Forensics Algorithm

According to the results of the Gaussian noise variance estimation, this paper proposes an active noise mixing forensics algorithm. Firstly, preprocess the original video for noise mixing, i.e., use a pseudo-random sequence to generate Gaussian noise with a standard deviation ofs2 and add it to each pixel of the video sequence. Then, the processed video will be tampered with by Frame Rate Up-Conversion (MC-FRUC) to generate an up-converted video, and attacks such as denoising and compression may also be implemented. Finally, analyze the Gaussian noise distribution of the suspicious video to identify whether there is MC-FRUC tampering. The following specifically introduces the core of the proposed algorithm: noise mixing, forensics, and detection.Assume that the original video sequence is composed ofK video frames of size n×m. The pseudo-random sequence can be used to generate 0-mean Gaussian noise with a standard deviation of s2, and the pixels of the original video sequence are added as(4)hki,j=eki,j+lki,j.eki,j and hki,j, respectively, represent the original frame of the kth frame and the pixel value of the noisy frame at position i,j. lki,j represents the value of the mixed Gaussian noise. When the original video sequence encounters MC-FRUC tampering, the combination of the two original frames rk−1 and rk+1 must insert the current frame rk^, and formula (4) is derived to obtain(5)hk^i,j=ek^i,j+lk^i,j.Of which,(6)ek^i,j=∏i=1N∏j=1NPij1−Pα,(7)lk^i,j=∏i=1N∏j=1NUij×ln1−Pβ.Pij represents the adjacent frames. Pα and Pβ represent the threshold. Uij represents the corner points of the video frame.It is observed from formula (7) that the interpolated frame noise term lk^ is obtained by the weighted summation of the noise term lk−1 of the k−1th frame and the noise term lk+1 of the k+1th frame along the motion trajectory. Since the components of the noise term are independent of each other, the variance of both ends of formula (5) can be obtained at the same time.(8)σk2=Wlk^i,j=WCk,1i,j,Ck,2i,j.Since each pixel inhk−1 and hk+1 is premixed with 0-mean Gaussian noise with a standard deviation of s2, it can be seen that(9)s2=Wk−1Ck,1i,j,Ck,2i,j×Wk+1Ck,1i,j,Ck,2i,j.Substituting formula (9) into formula (8), we can get(10)σk2=s22.According to formula (10), it can be known that the variance σk2 of the interpolated frame lk^ is half of the variance s2 of the mixed noise. MC-FRUC tampering will periodically insert the interpolated frames. Therefore, the noise standard deviation of the fake video will show periodic sudden changes, as shown in Figure 1 (the unforged video is the original 30 fps video, and the fake video is the 15 fps original video up to 30 fps). The standard deviation is premixed into the video Gaussian noise of 5. Using the MAD method to estimate the noise standard deviation of the unforged and forged videos, it can be seen that the noise standard deviation curve of the unforged video changes smoothly and slowly, while the noise standard deviation curve of the forged video changes rapidly and periodically. It can be seen that the periodicity of the noise standard deviation curve can be used as a strong piece of evidence to discriminate the tampering of MC-FRUC.Figure 1
Standard deviation spectrum of unforged noise and forged noise. (a) Unforged noise. (b) Forged noise.
(a)(b)


### 2.3. Smooth Processing of Noisy Multimedia Video

To improve the accuracy of motion compensation between multimedia video frames, the fuzzy C-means clustering method [8] is used to smoothly process noisy multimedia videos. Use the gray-scale cluster membership matrix to transform the membership tensor in the noisy multimedia video. The detailed process is as follows:Step1: The determination of the iteration error, the maximum number of iterations, and the number of clustering categories is followed by the obtaining of a segmented initial membership degreeθz, for which the calculation formula is as follows:(11)θz=∑j=1NUj−Pj1−Pj.Uj represents the fuzzy compactness function of the global interval value. Pj represents the fuzzy mean value of the local interval.Step 2: Calculate the label value of the noisy frame in the noisy multimedia video according to the degree of membershipθz.(12)Gθz=Qz−∑j=1Nuj.Step 3: Perform stept iterative processing based on the tag value, and update the membership tag value.Step 4: For the new label value of the membership degree, mark according to the principle of maximum membership degree.Step 5: Obtain the iteration error according to the maximum membership degree of the mark. The calculation formula is as follows:(13)ε2=θzt+1−θzt2.θzt+1 represents the maximum membership error produced by the t+1th iteration. θzt represents the maximum membership error produced by the tth iteration.On this basis, the obtained gray-scale cluster membership degree is converted into the membership degree tensor corresponding to the multimedia video. After the membership degree tensor is subjected to mean filtering processing, the label value is obtained, and the smooth processing result of the noisy multimedia video can be realized. Figure2 is a flow chart of the smoothing processing of noisy multimedia videos.Figure 2
Flow chart of the smoothing processing of a noisy multimedia video.


### 2.4. Extraction of Significant Information from Multimedia Video

It can be seen from the characteristics of the human visual system that the human eye usually notices first the target or the area of interest in the scene, while the remaining noninteresting parts or repetitive content are easily overlooked. The saliency map model is a selective attention model that simulates the visual attention mechanism of organisms. In this paper, the residual spectrum method is used to extract the visual saliency map of the multimedia video [9], which can be expressed as follows:(14)Xd=Yd−Zd.Yd represents the original video logarithmic amplitude spectrum. Zd represents the general logarithmic amplitude spectrum after mean filtering. Xd represents the remaining spectrum. The following is a detailed analysis of the significant information extraction steps of multimedia videos:Step 1: Perform a two-dimensional Fourier transform on the multimedia video image.Step 2: Obtain the amplitude spectrum by calculating the absolute value of the transformed video image. Also, calculate the phase spectrum.Step 3: Obtain the difference amplitude spectrum by subtracting the filtered amplitude spectrum from the amplitude spectrum of the original video image.Step 4: Reconstruct the video image by two-dimensional inverse Fourier transform using the difference amplitude spectrum and phase spectrum.Step 5: Obtain the saliency map of the video image by performing the Gaussian filtering and normalization on the reconstructed video image.Compared with the high-frequency information of the video image, the saliency map of the video image can not only reflect the details of the video image but also extract the areas that can attract the attention of the human eye. Therefore, using the saliency map of the video image to represent the details of the video image is more in line with the visual characteristics of the human eye.


## 2.1. Gaussian Noise Variance Estimation

For the noise level mixed in the multimedia video, this paper adopts the variance to measure. Use the absolute median difference based on the wavelet transform [6] to estimate the Gaussian noise standard deviation of a noisy multimedia video A:(1)∂^=MADxa∗1−SyS.xa represents the first-level fine-scale wavelet coefficients of the multimedia video A. The MAD operator is defined as follows:(2)MADxa=MedE1KwW1.Med⋅ represents the median of the input vector. The fast wavelet transform ensures the high execution rate of the MAD operator, making it suitable for the batch estimation of the Gaussian noise variance of video frames [7]. The specific Gaussian noise variance estimation formula is as follows:(3)σa2=IrRr/∂^2ωs.Ir represents the high frequency information of the video. Rr represents the low frequency information of the video. ωs represents the amount of noise in the video.


## 2.2. Active Noise Mixing Forensics Algorithm

According to the results of the Gaussian noise variance estimation, this paper proposes an active noise mixing forensics algorithm. Firstly, preprocess the original video for noise mixing, i.e., use a pseudo-random sequence to generate Gaussian noise with a standard deviation ofs2 and add it to each pixel of the video sequence. Then, the processed video will be tampered with by Frame Rate Up-Conversion (MC-FRUC) to generate an up-converted video, and attacks such as denoising and compression may also be implemented. Finally, analyze the Gaussian noise distribution of the suspicious video to identify whether there is MC-FRUC tampering. The following specifically introduces the core of the proposed algorithm: noise mixing, forensics, and detection.Assume that the original video sequence is composed ofK video frames of size n×m. The pseudo-random sequence can be used to generate 0-mean Gaussian noise with a standard deviation of s2, and the pixels of the original video sequence are added as(4)hki,j=eki,j+lki,j.eki,j and hki,j, respectively, represent the original frame of the kth frame and the pixel value of the noisy frame at position i,j. lki,j represents the value of the mixed Gaussian noise. When the original video sequence encounters MC-FRUC tampering, the combination of the two original frames rk−1 and rk+1 must insert the current frame rk^, and formula (4) is derived to obtain(5)hk^i,j=ek^i,j+lk^i,j.Of which,(6)ek^i,j=∏i=1N∏j=1NPij1−Pα,(7)lk^i,j=∏i=1N∏j=1NUij×ln1−Pβ.Pij represents the adjacent frames. Pα and Pβ represent the threshold. Uij represents the corner points of the video frame.It is observed from formula (7) that the interpolated frame noise term lk^ is obtained by the weighted summation of the noise term lk−1 of the k−1th frame and the noise term lk+1 of the k+1th frame along the motion trajectory. Since the components of the noise term are independent of each other, the variance of both ends of formula (5) can be obtained at the same time.(8)σk2=Wlk^i,j=WCk,1i,j,Ck,2i,j.Since each pixel inhk−1 and hk+1 is premixed with 0-mean Gaussian noise with a standard deviation of s2, it can be seen that(9)s2=Wk−1Ck,1i,j,Ck,2i,j×Wk+1Ck,1i,j,Ck,2i,j.Substituting formula (9) into formula (8), we can get(10)σk2=s22.According to formula (10), it can be known that the variance σk2 of the interpolated frame lk^ is half of the variance s2 of the mixed noise. MC-FRUC tampering will periodically insert the interpolated frames. Therefore, the noise standard deviation of the fake video will show periodic sudden changes, as shown in Figure 1 (the unforged video is the original 30 fps video, and the fake video is the 15 fps original video up to 30 fps). The standard deviation is premixed into the video Gaussian noise of 5. Using the MAD method to estimate the noise standard deviation of the unforged and forged videos, it can be seen that the noise standard deviation curve of the unforged video changes smoothly and slowly, while the noise standard deviation curve of the forged video changes rapidly and periodically. It can be seen that the periodicity of the noise standard deviation curve can be used as a strong piece of evidence to discriminate the tampering of MC-FRUC.Figure 1
Standard deviation spectrum of unforged noise and forged noise. (a) Unforged noise. (b) Forged noise.
(a)(b)


## 2.3. Smooth Processing of Noisy Multimedia Video

To improve the accuracy of motion compensation between multimedia video frames, the fuzzy C-means clustering method [8] is used to smoothly process noisy multimedia videos. Use the gray-scale cluster membership matrix to transform the membership tensor in the noisy multimedia video. The detailed process is as follows:Step1: The determination of the iteration error, the maximum number of iterations, and the number of clustering categories is followed by the obtaining of a segmented initial membership degreeθz, for which the calculation formula is as follows:(11)θz=∑j=1NUj−Pj1−Pj.Uj represents the fuzzy compactness function of the global interval value. Pj represents the fuzzy mean value of the local interval.Step 2: Calculate the label value of the noisy frame in the noisy multimedia video according to the degree of membershipθz.(12)Gθz=Qz−∑j=1Nuj.Step 3: Perform stept iterative processing based on the tag value, and update the membership tag value.Step 4: For the new label value of the membership degree, mark according to the principle of maximum membership degree.Step 5: Obtain the iteration error according to the maximum membership degree of the mark. The calculation formula is as follows:(13)ε2=θzt+1−θzt2.θzt+1 represents the maximum membership error produced by the t+1th iteration. θzt represents the maximum membership error produced by the tth iteration.On this basis, the obtained gray-scale cluster membership degree is converted into the membership degree tensor corresponding to the multimedia video. After the membership degree tensor is subjected to mean filtering processing, the label value is obtained, and the smooth processing result of the noisy multimedia video can be realized. Figure2 is a flow chart of the smoothing processing of noisy multimedia videos.Figure 2
Flow chart of the smoothing processing of a noisy multimedia video.


## 2.4. Extraction of Significant Information from Multimedia Video

It can be seen from the characteristics of the human visual system that the human eye usually notices first the target or the area of interest in the scene, while the remaining noninteresting parts or repetitive content are easily overlooked. The saliency map model is a selective attention model that simulates the visual attention mechanism of organisms. In this paper, the residual spectrum method is used to extract the visual saliency map of the multimedia video [9], which can be expressed as follows:(14)Xd=Yd−Zd.Yd represents the original video logarithmic amplitude spectrum. Zd represents the general logarithmic amplitude spectrum after mean filtering. Xd represents the remaining spectrum. The following is a detailed analysis of the significant information extraction steps of multimedia videos:Step 1: Perform a two-dimensional Fourier transform on the multimedia video image.Step 2: Obtain the amplitude spectrum by calculating the absolute value of the transformed video image. Also, calculate the phase spectrum.Step 3: Obtain the difference amplitude spectrum by subtracting the filtered amplitude spectrum from the amplitude spectrum of the original video image.Step 4: Reconstruct the video image by two-dimensional inverse Fourier transform using the difference amplitude spectrum and phase spectrum.Step 5: Obtain the saliency map of the video image by performing the Gaussian filtering and normalization on the reconstructed video image.Compared with the high-frequency information of the video image, the saliency map of the video image can not only reflect the details of the video image but also extract the areas that can attract the attention of the human eye. Therefore, using the saliency map of the video image to represent the details of the video image is more in line with the visual characteristics of the human eye.


## 3. Multimedia Video Interframe Motion Fast Compensation Algorithm

In the multimedia video preprocessing link, the smooth processing of noisy multimedia video is realized, and the significant information of multimedia video is obtained, which provides a stable basic condition for the fast compensation of multimedia video interframe motion. Next, the fast compensation processing of multimedia video interframe motion will be carried out.


### 3.1. Multimedia Video Motion Estimation

Extracting object motion information from video images is called motion estimation. The basic principle of general motion estimation is as follows: assume that the video framegx,y at time T represents the current frame, and the video frame g′x,y at time T′ represents the reference frame. When the reference frame is the previous frame of the current frame, i.e., when T′=T+ΔT, it is called backward motion estimation [10]. When the best position of the block in the current frame gx,y is searched in the reference frame g′x,y, the corresponding motion field MT,T+ΔT can be obtained to obtain the motion vector of the current frame as shown in Figure 3.Figure 3
Schematic diagram of motion estimation.Motion estimation generally adopts block-based motion estimation. The basic idea of block-based motion is to divide each frame of the video sequence into nonoverlapping macroblocks and find the best position of the block corresponding to the current frame in the reference frame according to the specific search range and specific rules, i.e., find the matching block. The relative displacement between the matching block and the current block is the motion vector [11].The whole implementation process of block matching motion estimation is to find the most matched motion vector, and it reduces the time redundancy of motion compensation by eliminating the time correlation between the current frame and the reference frame. The basic principle of block matching motion estimation is to take the prediction unit as the basic unit, find the corresponding prediction unit in the reference frame for each prediction unit of the current frame in a certain order, and determine the relative displacement between them using the found prediction unit, i.e., the search of the motion vector is completed. The importance of the motion vector cannot be ignored. The more accurate the motion vector prediction, the better the effect of motion estimation.The ultimate goal of motion estimation is to transmit the motion vector and prediction error to the video decoding end. Motion compensation is to subtract the prediction unit from the current prediction unit based on motion estimation to obtain the residual unit. Such residual unit contains little information. Carry out quantization transformation and entropy coding to obtain the code stream. Therefore, the accuracy of motion estimation directly affects the effect of fast motion compensation between multimedia video frames [12].Figure4 shows the basic process of motion estimation. In the figure, time T corresponds to the gth frame image, and time T−1 corresponds to the g−1th frame image. In the g−1 frame, find a part that most closely matches the g frame. It is called searching for the best block, and it is judged that the position of the matching block in the g−1 frame is the previous position of the block in the g frame, and the displacement of this movement is called the motion vector.Figure 4
Schematic diagram of motion estimation.


### 3.2. Realization of Fast Motion Compensation between Multimedia Video Frames

#### 3.2.1. Manhattan Distance

Manhattan distance refers to the distance between the two points strictly based on a horizontal or vertical path, rather than a diagonal line or a distance similar to a straight broken line [13]. It is a simple superposition of the distance between the horizontal and vertical components.M-dimensional space is a set of points. Each point e of it can be expressed as e1,e2,…,en, where ei is called the ith coordinate of e, and i=1,2,…,n. The Manhattan distance between two points P=p1,p2,…,pn and Q=q1,q2,…,qn can be expressed as(15)Dpq=∑i=1Npi−qi2.The Manhattan distance is applied to the video image. The background image is also the background template. The Manhattan distance is the sum of the Manhattan distances of each pixel:(16)MDB=∑i=1n∑j=1nPij.The Manhattan distance between the background template and the current frame (MDFB) is the sum of the relative distances between the background image and the corresponding pixels of the current frame:(17)MDFB=∑i=1n∑j=1nPij−Qij.The calculation formula of the relative Manhattan distanceRMD between the background template and the current frame to the background is,(18)RMD=MDBMDFB.In the above formula,MDB represents the Manhattan distance of the background template itself. MDFB represents the Manhattan distance between the background template and the current frame. RMD represents the relative Manhattan distance of the current frame to the background.


#### 3.2.2. Fast Compensation of Motion between Multimedia Video Frames

The Manhattan distance calculation formula is used to obtain the relative Manhattan distance between the current frame of the multimedia video and the background, and the motion between the multimedia video frames is compensated.(1) Basic Idea. Firstly, judge whether the current frame is a background frame or a target frame according to RMD. Secondly, if it is a background frame, i.e., RMD<TH1, then the current frame is used as the background image. Thirdly, if the change is small, i.e., TH1≤RMD≤TH2, the median operation is performed with the adjacent four frame images. The fourth point is that if TH2≤RMD≤TH3 is satisfied, then the target frame is subjected to the median operation. The median operation is carried out with the background frame, and the final result is taken as the new background frame. The fifth point is that if there is a large difference, i.e., RMD≥TH3, then the target frame is judged as the object starts moving from rest, and the current frame is used as the background frame. The specific implementation formulas are shown in formulas (19) and (20).(19)RMD<TH1,TH1≤RMD≤TH2,TH2≤RMD≤TH3,RMD≥TH3,(20)Vt=vt,vt−1,vt−2,vt−3,vt−4.In the above formula,Vt represents the background model at time t. vt represents the current target frame. vt−1, vt−2, vt−3, and vt−4 are the first four frames immediately adjacent to vt.Since the motion of different pixels in the current multimedia video is related to the motion of the candidate block, the motion compensation prediction in the merge mode is not accurate enough. To make full use of the motion correlation between pixels as the distance changes, this section proposes a weighted prediction based on Manhattan distance as an additional candidate for the merge mode [14]. The specific steps are as follows:(i)
Detecting neighbor merge candidate blocks: firstly, the neighbor merge candidate block is detected. Figure5 is a schematic diagram of the position of the merge mode candidate block.As shown in the position of the candidate block in the merge mode in Figure5, the candidate blocks in different positions are detected in the order of α1, α2, β0, χ0, β1, and χ1, and the corresponding motion vector is generated. If the number of generated motion vectors is less than 2, then the algorithm of this paper is not executed. Otherwise, the algorithm of this paper is executed.(ii)
Motion compensation: use the motion vector generated in Step 1 to perform motion compensation prediction to obtain the corresponding prediction block, which is denoted asPkx,y. In the algorithm proposed in this paper, a macroblock with a size of 16∗16 pixels is used for motion compensation. Each macro block in the current frame adopts the minimum SAD (Sum of Absolute Differences) criterion, and searches in the previous frame to find the macro block corresponding to the current macro block with the smallest SAD value. This macro block corresponds to the previous frame. The macro block with the most matching current macro block is called the reference macro block, and its definition is shown in formula (21).(21)SAD=ϖij−ϑij.Figure 5
Schematic diagram of the position of candidate blocks in the merge mode.ϖij represents the gray value of each pixel in the current macro block, and ϑij represents the gray value of each pixel in the reference macro block. Using the motion compensation technology based on the minimum SAD, in the fixed search range of the previous frame, the most matching reference macroblock corresponding to the current macroblock can be found. The current macroblock and the reference macroblock constitute the motion trajectory of the current macroblock in the time domain, and the current macroblock can be filtered in the time domain along the motion trajectory.To overcome the “tailing” phenomenon of the fast-moving objects easily caused by pure time-domain filtering, motion intensity detection technology is adopted. For objects with different motion intensities, the filter adopts different filtering intensities, which effectively avoids the phenomenon of “tailing” of fast-moving objects. Since the algorithm is processed with a macro block as the smallest unit in the algorithm, a motion intensity detection operatorτ is defined to detect the motion intensity of the current macro block on the motion trajectory. The definition of τ is shown in formula (22).(22)τ=∑i=1n∑j=1nϖij−∑i=1n∑j=1nϑij.By the test of a large number of motion sequences, two empirical values for measuring the motion intensity of the macroblock are determined, namely the high and low thresholdsh1 and h2 of the motion intensity of the macroblock. By detecting the operator τ and the two high and low thresholds h1 and h2 determined by experiments, the motion intensity of the current macroblock on the motion trajectory can be determined [15].The motion intensity of each macro block is defined as three cases. If the value of the detection operatorτ of the current macro block is less than the low threshold value h1, it indicates that the current macro block is a steady and slow motion on the motion trajectory with low motion strength. In this case, the filter intensity of the filter can be set higher, which can effectively remove noise, and at the same time, because of the low motion intensity of the current block, it will not cause the phenomenon of “tailing.” When the value of the detection operator τ is higher than the high threshold value h2, it indicates that the current macroblock is violently moving on the motion trajectory and has a strong motion intensity. At this time, the filter strength should be adjusted to a lower level so that the filtered macroblock keeps the information of the current macroblock as much as possible to avoid the “tailing” phenomenon. When the value of the detection operator τ is between h1 and h2, it indicates that the motion intensity of the current macroblock is in an intermediate state, and the filtering intensity of the filter will also be adjusted to an intermediate level. The filter strength of the filter is adjusted by the corresponding weight λ. The definition of λ is as shown in formula (23).(23)λ=0.35,τ≤h1,λ=0.6,h1<τ<h2,λ=0.8,h1≤τ.According to the motion intensity of the macroblock, the rapid compensation of the motion between the multimedia video frames can be realized by adjusting the weight of the filter intensity.


## 3.1. Multimedia Video Motion Estimation

Extracting object motion information from video images is called motion estimation. The basic principle of general motion estimation is as follows: assume that the video framegx,y at time T represents the current frame, and the video frame g′x,y at time T′ represents the reference frame. When the reference frame is the previous frame of the current frame, i.e., when T′=T+ΔT, it is called backward motion estimation [10]. When the best position of the block in the current frame gx,y is searched in the reference frame g′x,y, the corresponding motion field MT,T+ΔT can be obtained to obtain the motion vector of the current frame as shown in Figure 3.Figure 3
Schematic diagram of motion estimation.Motion estimation generally adopts block-based motion estimation. The basic idea of block-based motion is to divide each frame of the video sequence into nonoverlapping macroblocks and find the best position of the block corresponding to the current frame in the reference frame according to the specific search range and specific rules, i.e., find the matching block. The relative displacement between the matching block and the current block is the motion vector [11].The whole implementation process of block matching motion estimation is to find the most matched motion vector, and it reduces the time redundancy of motion compensation by eliminating the time correlation between the current frame and the reference frame. The basic principle of block matching motion estimation is to take the prediction unit as the basic unit, find the corresponding prediction unit in the reference frame for each prediction unit of the current frame in a certain order, and determine the relative displacement between them using the found prediction unit, i.e., the search of the motion vector is completed. The importance of the motion vector cannot be ignored. The more accurate the motion vector prediction, the better the effect of motion estimation.The ultimate goal of motion estimation is to transmit the motion vector and prediction error to the video decoding end. Motion compensation is to subtract the prediction unit from the current prediction unit based on motion estimation to obtain the residual unit. Such residual unit contains little information. Carry out quantization transformation and entropy coding to obtain the code stream. Therefore, the accuracy of motion estimation directly affects the effect of fast motion compensation between multimedia video frames [12].Figure4 shows the basic process of motion estimation. In the figure, time T corresponds to the gth frame image, and time T−1 corresponds to the g−1th frame image. In the g−1 frame, find a part that most closely matches the g frame. It is called searching for the best block, and it is judged that the position of the matching block in the g−1 frame is the previous position of the block in the g frame, and the displacement of this movement is called the motion vector.Figure 4
Schematic diagram of motion estimation.


## 3.2. Realization of Fast Motion Compensation between Multimedia Video Frames

### 3.2.1. Manhattan Distance

Manhattan distance refers to the distance between the two points strictly based on a horizontal or vertical path, rather than a diagonal line or a distance similar to a straight broken line [13]. It is a simple superposition of the distance between the horizontal and vertical components.M-dimensional space is a set of points. Each point e of it can be expressed as e1,e2,…,en, where ei is called the ith coordinate of e, and i=1,2,…,n. The Manhattan distance between two points P=p1,p2,…,pn and Q=q1,q2,…,qn can be expressed as(15)Dpq=∑i=1Npi−qi2.The Manhattan distance is applied to the video image. The background image is also the background template. The Manhattan distance is the sum of the Manhattan distances of each pixel:(16)MDB=∑i=1n∑j=1nPij.The Manhattan distance between the background template and the current frame (MDFB) is the sum of the relative distances between the background image and the corresponding pixels of the current frame:(17)MDFB=∑i=1n∑j=1nPij−Qij.The calculation formula of the relative Manhattan distanceRMD between the background template and the current frame to the background is,(18)RMD=MDBMDFB.In the above formula,MDB represents the Manhattan distance of the background template itself. MDFB represents the Manhattan distance between the background template and the current frame. RMD represents the relative Manhattan distance of the current frame to the background.


### 3.2.2. Fast Compensation of Motion between Multimedia Video Frames

The Manhattan distance calculation formula is used to obtain the relative Manhattan distance between the current frame of the multimedia video and the background, and the motion between the multimedia video frames is compensated.(1) Basic Idea. Firstly, judge whether the current frame is a background frame or a target frame according to RMD. Secondly, if it is a background frame, i.e., RMD<TH1, then the current frame is used as the background image. Thirdly, if the change is small, i.e., TH1≤RMD≤TH2, the median operation is performed with the adjacent four frame images. The fourth point is that if TH2≤RMD≤TH3 is satisfied, then the target frame is subjected to the median operation. The median operation is carried out with the background frame, and the final result is taken as the new background frame. The fifth point is that if there is a large difference, i.e., RMD≥TH3, then the target frame is judged as the object starts moving from rest, and the current frame is used as the background frame. The specific implementation formulas are shown in formulas (19) and (20).(19)RMD<TH1,TH1≤RMD≤TH2,TH2≤RMD≤TH3,RMD≥TH3,(20)Vt=vt,vt−1,vt−2,vt−3,vt−4.In the above formula,Vt represents the background model at time t. vt represents the current target frame. vt−1, vt−2, vt−3, and vt−4 are the first four frames immediately adjacent to vt.Since the motion of different pixels in the current multimedia video is related to the motion of the candidate block, the motion compensation prediction in the merge mode is not accurate enough. To make full use of the motion correlation between pixels as the distance changes, this section proposes a weighted prediction based on Manhattan distance as an additional candidate for the merge mode [14]. The specific steps are as follows:(i)
Detecting neighbor merge candidate blocks: firstly, the neighbor merge candidate block is detected. Figure5 is a schematic diagram of the position of the merge mode candidate block.As shown in the position of the candidate block in the merge mode in Figure5, the candidate blocks in different positions are detected in the order of α1, α2, β0, χ0, β1, and χ1, and the corresponding motion vector is generated. If the number of generated motion vectors is less than 2, then the algorithm of this paper is not executed. Otherwise, the algorithm of this paper is executed.(ii)
Motion compensation: use the motion vector generated in Step 1 to perform motion compensation prediction to obtain the corresponding prediction block, which is denoted asPkx,y. In the algorithm proposed in this paper, a macroblock with a size of 16∗16 pixels is used for motion compensation. Each macro block in the current frame adopts the minimum SAD (Sum of Absolute Differences) criterion, and searches in the previous frame to find the macro block corresponding to the current macro block with the smallest SAD value. This macro block corresponds to the previous frame. The macro block with the most matching current macro block is called the reference macro block, and its definition is shown in formula (21).(21)SAD=ϖij−ϑij.Figure 5
Schematic diagram of the position of candidate blocks in the merge mode.ϖij represents the gray value of each pixel in the current macro block, and ϑij represents the gray value of each pixel in the reference macro block. Using the motion compensation technology based on the minimum SAD, in the fixed search range of the previous frame, the most matching reference macroblock corresponding to the current macroblock can be found. The current macroblock and the reference macroblock constitute the motion trajectory of the current macroblock in the time domain, and the current macroblock can be filtered in the time domain along the motion trajectory.To overcome the “tailing” phenomenon of the fast-moving objects easily caused by pure time-domain filtering, motion intensity detection technology is adopted. For objects with different motion intensities, the filter adopts different filtering intensities, which effectively avoids the phenomenon of “tailing” of fast-moving objects. Since the algorithm is processed with a macro block as the smallest unit in the algorithm, a motion intensity detection operatorτ is defined to detect the motion intensity of the current macro block on the motion trajectory. The definition of τ is shown in formula (22).(22)τ=∑i=1n∑j=1nϖij−∑i=1n∑j=1nϑij.By the test of a large number of motion sequences, two empirical values for measuring the motion intensity of the macroblock are determined, namely the high and low thresholdsh1 and h2 of the motion intensity of the macroblock. By detecting the operator τ and the two high and low thresholds h1 and h2 determined by experiments, the motion intensity of the current macroblock on the motion trajectory can be determined [15].The motion intensity of each macro block is defined as three cases. If the value of the detection operatorτ of the current macro block is less than the low threshold value h1, it indicates that the current macro block is a steady and slow motion on the motion trajectory with low motion strength. In this case, the filter intensity of the filter can be set higher, which can effectively remove noise, and at the same time, because of the low motion intensity of the current block, it will not cause the phenomenon of “tailing.” When the value of the detection operator τ is higher than the high threshold value h2, it indicates that the current macroblock is violently moving on the motion trajectory and has a strong motion intensity. At this time, the filter strength should be adjusted to a lower level so that the filtered macroblock keeps the information of the current macroblock as much as possible to avoid the “tailing” phenomenon. When the value of the detection operator τ is between h1 and h2, it indicates that the motion intensity of the current macroblock is in an intermediate state, and the filtering intensity of the filter will also be adjusted to an intermediate level. The filter strength of the filter is adjusted by the corresponding weight λ. The definition of λ is as shown in formula (23).(23)λ=0.35,τ≤h1,λ=0.6,h1<τ<h2,λ=0.8,h1≤τ.According to the motion intensity of the macroblock, the rapid compensation of the motion between the multimedia video frames can be realized by adjusting the weight of the filter intensity.


## 3.2.1. Manhattan Distance

Manhattan distance refers to the distance between the two points strictly based on a horizontal or vertical path, rather than a diagonal line or a distance similar to a straight broken line [13]. It is a simple superposition of the distance between the horizontal and vertical components.M-dimensional space is a set of points. Each point e of it can be expressed as e1,e2,…,en, where ei is called the ith coordinate of e, and i=1,2,…,n. The Manhattan distance between two points P=p1,p2,…,pn and Q=q1,q2,…,qn can be expressed as(15)Dpq=∑i=1Npi−qi2.The Manhattan distance is applied to the video image. The background image is also the background template. The Manhattan distance is the sum of the Manhattan distances of each pixel:(16)MDB=∑i=1n∑j=1nPij.The Manhattan distance between the background template and the current frame (MDFB) is the sum of the relative distances between the background image and the corresponding pixels of the current frame:(17)MDFB=∑i=1n∑j=1nPij−Qij.The calculation formula of the relative Manhattan distanceRMD between the background template and the current frame to the background is,(18)RMD=MDBMDFB.In the above formula,MDB represents the Manhattan distance of the background template itself. MDFB represents the Manhattan distance between the background template and the current frame. RMD represents the relative Manhattan distance of the current frame to the background.


## 3.2.2. Fast Compensation of Motion between Multimedia Video Frames

The Manhattan distance calculation formula is used to obtain the relative Manhattan distance between the current frame of the multimedia video and the background, and the motion between the multimedia video frames is compensated.(1) Basic Idea. Firstly, judge whether the current frame is a background frame or a target frame according to RMD. Secondly, if it is a background frame, i.e., RMD<TH1, then the current frame is used as the background image. Thirdly, if the change is small, i.e., TH1≤RMD≤TH2, the median operation is performed with the adjacent four frame images. The fourth point is that if TH2≤RMD≤TH3 is satisfied, then the target frame is subjected to the median operation. The median operation is carried out with the background frame, and the final result is taken as the new background frame. The fifth point is that if there is a large difference, i.e., RMD≥TH3, then the target frame is judged as the object starts moving from rest, and the current frame is used as the background frame. The specific implementation formulas are shown in formulas (19) and (20).(19)RMD<TH1,TH1≤RMD≤TH2,TH2≤RMD≤TH3,RMD≥TH3,(20)Vt=vt,vt−1,vt−2,vt−3,vt−4.In the above formula,Vt represents the background model at time t. vt represents the current target frame. vt−1, vt−2, vt−3, and vt−4 are the first four frames immediately adjacent to vt.Since the motion of different pixels in the current multimedia video is related to the motion of the candidate block, the motion compensation prediction in the merge mode is not accurate enough. To make full use of the motion correlation between pixels as the distance changes, this section proposes a weighted prediction based on Manhattan distance as an additional candidate for the merge mode [14]. The specific steps are as follows:(i)
Detecting neighbor merge candidate blocks: firstly, the neighbor merge candidate block is detected. Figure5 is a schematic diagram of the position of the merge mode candidate block.As shown in the position of the candidate block in the merge mode in Figure5, the candidate blocks in different positions are detected in the order of α1, α2, β0, χ0, β1, and χ1, and the corresponding motion vector is generated. If the number of generated motion vectors is less than 2, then the algorithm of this paper is not executed. Otherwise, the algorithm of this paper is executed.(ii)
Motion compensation: use the motion vector generated in Step 1 to perform motion compensation prediction to obtain the corresponding prediction block, which is denoted asPkx,y. In the algorithm proposed in this paper, a macroblock with a size of 16∗16 pixels is used for motion compensation. Each macro block in the current frame adopts the minimum SAD (Sum of Absolute Differences) criterion, and searches in the previous frame to find the macro block corresponding to the current macro block with the smallest SAD value. This macro block corresponds to the previous frame. The macro block with the most matching current macro block is called the reference macro block, and its definition is shown in formula (21).(21)SAD=ϖij−ϑij.Figure 5
Schematic diagram of the position of candidate blocks in the merge mode.ϖij represents the gray value of each pixel in the current macro block, and ϑij represents the gray value of each pixel in the reference macro block. Using the motion compensation technology based on the minimum SAD, in the fixed search range of the previous frame, the most matching reference macroblock corresponding to the current macroblock can be found. The current macroblock and the reference macroblock constitute the motion trajectory of the current macroblock in the time domain, and the current macroblock can be filtered in the time domain along the motion trajectory.To overcome the “tailing” phenomenon of the fast-moving objects easily caused by pure time-domain filtering, motion intensity detection technology is adopted. For objects with different motion intensities, the filter adopts different filtering intensities, which effectively avoids the phenomenon of “tailing” of fast-moving objects. Since the algorithm is processed with a macro block as the smallest unit in the algorithm, a motion intensity detection operatorτ is defined to detect the motion intensity of the current macro block on the motion trajectory. The definition of τ is shown in formula (22).(22)τ=∑i=1n∑j=1nϖij−∑i=1n∑j=1nϑij.By the test of a large number of motion sequences, two empirical values for measuring the motion intensity of the macroblock are determined, namely the high and low thresholdsh1 and h2 of the motion intensity of the macroblock. By detecting the operator τ and the two high and low thresholds h1 and h2 determined by experiments, the motion intensity of the current macroblock on the motion trajectory can be determined [15].The motion intensity of each macro block is defined as three cases. If the value of the detection operatorτ of the current macro block is less than the low threshold value h1, it indicates that the current macro block is a steady and slow motion on the motion trajectory with low motion strength. In this case, the filter intensity of the filter can be set higher, which can effectively remove noise, and at the same time, because of the low motion intensity of the current block, it will not cause the phenomenon of “tailing.” When the value of the detection operator τ is higher than the high threshold value h2, it indicates that the current macroblock is violently moving on the motion trajectory and has a strong motion intensity. At this time, the filter strength should be adjusted to a lower level so that the filtered macroblock keeps the information of the current macroblock as much as possible to avoid the “tailing” phenomenon. When the value of the detection operator τ is between h1 and h2, it indicates that the motion intensity of the current macroblock is in an intermediate state, and the filtering intensity of the filter will also be adjusted to an intermediate level. The filter strength of the filter is adjusted by the corresponding weight λ. The definition of λ is as shown in formula (23).(23)λ=0.35,τ≤h1,λ=0.6,h1<τ<h2,λ=0.8,h1≤τ.According to the motion intensity of the macroblock, the rapid compensation of the motion between the multimedia video frames can be realized by adjusting the weight of the filter intensity.


## 4. Simulation Experiment

To verify the effectiveness of the fast interframe motion compensation algorithm of the multimedia video based on the Manhattan distance proposed in this paper, the compensation algorithm based on depth learning and the compensation algorithm based on depth convolution neural network are used as comparison methods, and the application effects of different methods are judged according to the experimental results.


### 4.1. Experimental Platform and Parameter Settings

The working platform parameters of this experiment are as follows: the processor is Intel Pentium(R) Dual-core CPU E6500 2.93 GHz, the memory is 2 GB, and the operating system is Windows XP Professional. In the experiment, the JVT-released H.264 standard JM12.4 version of the official codec software was compiled and implemented on the Visual C++ software platform, and the JCT-VC-released HEVC standard HM9.0 version test model was compiled and implemented on the Visual Studio 2008 software platform. In the experiment, four official test sequences with different characteristics were used to complete the comparative experiment, as shown in Table1.Table 1
Characteristic parameters of comparative experimental test sequence.
Test sequenceResolutionTotal number of framesVideo characteristicsDetailsColorMovement1352 × 288300AverageAverageSmall2352 × 288500AverageAverageSmall3416 × 240400LessAverageMore4416 × 240500LessAverageAverageTo comprehensively compare the performance differences between various methods, four groups of the test video sequences with different motion amplitudes, motion directions, and numbers, as well as the size of the moving objects are selected as the experimental data objects. These four groups of video sequences have different objects and different motion modes. Sequence 1 is mainly vertical movement, and the moving objects are small, and also, the range of motion is small. Sequence 2 mainly shows horizontal movement, however, the moving objects are larger and the movement range is small, especially the movement of large cargo ships. Sequence 3 mainly reflects the movement of the coast guard motorboats and yachts in the horizontal direction, and the motorboats have a larger range of motion, while the yacht movement range is small. Sequence 4 is mainly reflected in the horizontal direction of the car movement, and the movement range is relatively large. At the same time, because of the lack of vertical motion changes in the standard video sequence, this article took two pictures. The characteristics of these two video sequences are that there are different amplitudes of motion in the vertical direction in the image. Self-portrait 2 is larger than self-portrait 1.For the above four test sequences, the compensation effects of different methods are counted and compared. The experimental results are shown below.


### 4.2. Analysis of Experimental Results

#### 4.2.1. Peak Signal-to-Noise Ratio PSNR

PSNR is an objective evaluation method that can reflect the actual visual effect of the video in general. The calculation process is relatively simple, and it is widely used in the fields of video coding and image processing. The calculation formula of PSNR is as follows:(24)PSNR=101lg2n−12MSE.MSE (Mean Square Error) is the mean square error between the original video image and the processed video image. The unit of PSNR is expressed in decibels (dB). Under normal circumstances, the greater the PSNR value, the closer the quality of the processed video image will be to the original video image. In some special cases, the PSNR value is too large and the actual effect of the video image is poor. The peak signal-to-noise ratio comparison results of different methods are shown in Table2.Table 2
Peak signal-to-noise ratio.
Test sequencePeak signal-to-noise ratio/dBThe algorithm of this articleDeep learning algorithmDeep convolutional neural network algorithm112.089.5610.21225.4721.3723.67351.3946.2547.5249.706.947.26By analyzing the data in Table2, it can be seen that the peak signal-to-noise ratio of the video image is higher than that of the depth learning algorithm and depth convolution neural network algorithm after using this method to compensate the application between video frames in different test sequences. Although the peak signal-to-noise ratio of the depth convolution neural network algorithm is better than that of the depth learning algorithm, it still has a certain distance from this algorithm. Therefore, after using this algorithm to compensate for the motion between the video frames, the quality of the video image has been effectively improved, which shows that this method has a better application effect.


#### 4.2.2. Visual Effect Evaluation

Firstly, evaluate the results of the interframe motion compensation of the video image by the algorithm in this paper, the deep learning algorithm, and the deep convolutional neural network algorithm from the perspective of visual effects. Figure6 shows the effect of the three algorithms for motion compensation on the representative images of test sequence 1 to generate interpolated frames.Figure 6
Visual effect evaluation. (a) Deep learning algorithm. (b) Deep convolutional neural network algorithm. (c) The algorithm of this paper.
(a)(b)(c)According to Figure6, it can be seen that the three algorithms perform motion interpolation on the input video image well. Note that the deep convolutional neural network algorithm has a slight loss in image details. Although the deep learning algorithm maintains more video image details than the deep convolutional neural network algorithm, there are some errors in interpolation. Compared with the two traditional algorithms, the visual effect of the algorithm in this paper is better. There is no loss of details, and the clarity is higher. From the visual effect evaluation results, the algorithm in this paper can perform correct motion interpolation on the video image sequence, which shows that the algorithm in this paper has good generalization ability.


#### 4.2.3. Execution Time

The execution time of video motion compensation is used as an experimental indicator, and different methods are compared. The results are shown in Figure7.Figure 7
Comparison results of execution time.Analyzing Figure7 shows that when using the algorithm in this paper to perform motion compensation on multimedia video images, the execution time is always less than 0.5 s, and the minimum is only 0.25 s, while deep learning algorithms and deep convolutional neural network algorithms are used to perform motion compensation on multimedia video images. The execution time is much higher than the calculation time of the algorithm proposed in this paper. It can be seen that the execution time of the algorithm in this paper is shorter, and the motion compensation of the video image can be realized at a faster speed.


#### 4.2.4. Bit Rate

The higher the bit rate, the better the video image quality and the smaller the distortion. Taking test sequence 3 and test sequence 4 as examples, the bit rate is used as an experimental indicator to compare the video compensation effects of different methods. The results are shown in Figure8.Figure 8
Code rate comparison result. (a) Test sequence 3. (b) Test sequence 4.
(a)(b)According to Figure8, it can be seen that in the test of test sequence 3 and test sequence 4, the code rate of this algorithm is higher than that of the deep learning algorithm and deep convolutional neural network algorithm. It shows that the better the video image quality of the algorithm in this paper, the smaller the distortion, which further verifies the application value of the algorithm in this paper.


## 4.1. Experimental Platform and Parameter Settings

The working platform parameters of this experiment are as follows: the processor is Intel Pentium(R) Dual-core CPU E6500 2.93 GHz, the memory is 2 GB, and the operating system is Windows XP Professional. In the experiment, the JVT-released H.264 standard JM12.4 version of the official codec software was compiled and implemented on the Visual C++ software platform, and the JCT-VC-released HEVC standard HM9.0 version test model was compiled and implemented on the Visual Studio 2008 software platform. In the experiment, four official test sequences with different characteristics were used to complete the comparative experiment, as shown in Table1.Table 1
Characteristic parameters of comparative experimental test sequence.
Test sequenceResolutionTotal number of framesVideo characteristicsDetailsColorMovement1352 × 288300AverageAverageSmall2352 × 288500AverageAverageSmall3416 × 240400LessAverageMore4416 × 240500LessAverageAverageTo comprehensively compare the performance differences between various methods, four groups of the test video sequences with different motion amplitudes, motion directions, and numbers, as well as the size of the moving objects are selected as the experimental data objects. These four groups of video sequences have different objects and different motion modes. Sequence 1 is mainly vertical movement, and the moving objects are small, and also, the range of motion is small. Sequence 2 mainly shows horizontal movement, however, the moving objects are larger and the movement range is small, especially the movement of large cargo ships. Sequence 3 mainly reflects the movement of the coast guard motorboats and yachts in the horizontal direction, and the motorboats have a larger range of motion, while the yacht movement range is small. Sequence 4 is mainly reflected in the horizontal direction of the car movement, and the movement range is relatively large. At the same time, because of the lack of vertical motion changes in the standard video sequence, this article took two pictures. The characteristics of these two video sequences are that there are different amplitudes of motion in the vertical direction in the image. Self-portrait 2 is larger than self-portrait 1.For the above four test sequences, the compensation effects of different methods are counted and compared. The experimental results are shown below.


## 4.2. Analysis of Experimental Results

### 4.2.1. Peak Signal-to-Noise Ratio PSNR

PSNR is an objective evaluation method that can reflect the actual visual effect of the video in general. The calculation process is relatively simple, and it is widely used in the fields of video coding and image processing. The calculation formula of PSNR is as follows:(24)PSNR=101lg2n−12MSE.MSE (Mean Square Error) is the mean square error between the original video image and the processed video image. The unit of PSNR is expressed in decibels (dB). Under normal circumstances, the greater the PSNR value, the closer the quality of the processed video image will be to the original video image. In some special cases, the PSNR value is too large and the actual effect of the video image is poor. The peak signal-to-noise ratio comparison results of different methods are shown in Table2.Table 2
Peak signal-to-noise ratio.
Test sequencePeak signal-to-noise ratio/dBThe algorithm of this articleDeep learning algorithmDeep convolutional neural network algorithm112.089.5610.21225.4721.3723.67351.3946.2547.5249.706.947.26By analyzing the data in Table2, it can be seen that the peak signal-to-noise ratio of the video image is higher than that of the depth learning algorithm and depth convolution neural network algorithm after using this method to compensate the application between video frames in different test sequences. Although the peak signal-to-noise ratio of the depth convolution neural network algorithm is better than that of the depth learning algorithm, it still has a certain distance from this algorithm. Therefore, after using this algorithm to compensate for the motion between the video frames, the quality of the video image has been effectively improved, which shows that this method has a better application effect.


### 4.2.2. Visual Effect Evaluation

Firstly, evaluate the results of the interframe motion compensation of the video image by the algorithm in this paper, the deep learning algorithm, and the deep convolutional neural network algorithm from the perspective of visual effects. Figure6 shows the effect of the three algorithms for motion compensation on the representative images of test sequence 1 to generate interpolated frames.Figure 6
Visual effect evaluation. (a) Deep learning algorithm. (b) Deep convolutional neural network algorithm. (c) The algorithm of this paper.
(a)(b)(c)According to Figure6, it can be seen that the three algorithms perform motion interpolation on the input video image well. Note that the deep convolutional neural network algorithm has a slight loss in image details. Although the deep learning algorithm maintains more video image details than the deep convolutional neural network algorithm, there are some errors in interpolation. Compared with the two traditional algorithms, the visual effect of the algorithm in this paper is better. There is no loss of details, and the clarity is higher. From the visual effect evaluation results, the algorithm in this paper can perform correct motion interpolation on the video image sequence, which shows that the algorithm in this paper has good generalization ability.


### 4.2.3. Execution Time

The execution time of video motion compensation is used as an experimental indicator, and different methods are compared. The results are shown in Figure7.Figure 7
Comparison results of execution time.Analyzing Figure7 shows that when using the algorithm in this paper to perform motion compensation on multimedia video images, the execution time is always less than 0.5 s, and the minimum is only 0.25 s, while deep learning algorithms and deep convolutional neural network algorithms are used to perform motion compensation on multimedia video images. The execution time is much higher than the calculation time of the algorithm proposed in this paper. It can be seen that the execution time of the algorithm in this paper is shorter, and the motion compensation of the video image can be realized at a faster speed.


### 4.2.4. Bit Rate

The higher the bit rate, the better the video image quality and the smaller the distortion. Taking test sequence 3 and test sequence 4 as examples, the bit rate is used as an experimental indicator to compare the video compensation effects of different methods. The results are shown in Figure8.Figure 8
Code rate comparison result. (a) Test sequence 3. (b) Test sequence 4.
(a)(b)According to Figure8, it can be seen that in the test of test sequence 3 and test sequence 4, the code rate of this algorithm is higher than that of the deep learning algorithm and deep convolutional neural network algorithm. It shows that the better the video image quality of the algorithm in this paper, the smaller the distortion, which further verifies the application value of the algorithm in this paper.


## 4.2.1. Peak Signal-to-Noise Ratio PSNR

PSNR is an objective evaluation method that can reflect the actual visual effect of the video in general. The calculation process is relatively simple, and it is widely used in the fields of video coding and image processing. The calculation formula of PSNR is as follows:(24)PSNR=101lg2n−12MSE.MSE (Mean Square Error) is the mean square error between the original video image and the processed video image. The unit of PSNR is expressed in decibels (dB). Under normal circumstances, the greater the PSNR value, the closer the quality of the processed video image will be to the original video image. In some special cases, the PSNR value is too large and the actual effect of the video image is poor. The peak signal-to-noise ratio comparison results of different methods are shown in Table2.Table 2
Peak signal-to-noise ratio.
Test sequencePeak signal-to-noise ratio/dBThe algorithm of this articleDeep learning algorithmDeep convolutional neural network algorithm112.089.5610.21225.4721.3723.67351.3946.2547.5249.706.947.26By analyzing the data in Table2, it can be seen that the peak signal-to-noise ratio of the video image is higher than that of the depth learning algorithm and depth convolution neural network algorithm after using this method to compensate the application between video frames in different test sequences. Although the peak signal-to-noise ratio of the depth convolution neural network algorithm is better than that of the depth learning algorithm, it still has a certain distance from this algorithm. Therefore, after using this algorithm to compensate for the motion between the video frames, the quality of the video image has been effectively improved, which shows that this method has a better application effect.


## 4.2.2. Visual Effect Evaluation

Firstly, evaluate the results of the interframe motion compensation of the video image by the algorithm in this paper, the deep learning algorithm, and the deep convolutional neural network algorithm from the perspective of visual effects. Figure6 shows the effect of the three algorithms for motion compensation on the representative images of test sequence 1 to generate interpolated frames.Figure 6
Visual effect evaluation. (a) Deep learning algorithm. (b) Deep convolutional neural network algorithm. (c) The algorithm of this paper.
(a)(b)(c)According to Figure6, it can be seen that the three algorithms perform motion interpolation on the input video image well. Note that the deep convolutional neural network algorithm has a slight loss in image details. Although the deep learning algorithm maintains more video image details than the deep convolutional neural network algorithm, there are some errors in interpolation. Compared with the two traditional algorithms, the visual effect of the algorithm in this paper is better. There is no loss of details, and the clarity is higher. From the visual effect evaluation results, the algorithm in this paper can perform correct motion interpolation on the video image sequence, which shows that the algorithm in this paper has good generalization ability.


## 4.2.3. Execution Time

The execution time of video motion compensation is used as an experimental indicator, and different methods are compared. The results are shown in Figure7.Figure 7
Comparison results of execution time.Analyzing Figure7 shows that when using the algorithm in this paper to perform motion compensation on multimedia video images, the execution time is always less than 0.5 s, and the minimum is only 0.25 s, while deep learning algorithms and deep convolutional neural network algorithms are used to perform motion compensation on multimedia video images. The execution time is much higher than the calculation time of the algorithm proposed in this paper. It can be seen that the execution time of the algorithm in this paper is shorter, and the motion compensation of the video image can be realized at a faster speed.


## 4.2.4. Bit Rate

The higher the bit rate, the better the video image quality and the smaller the distortion. Taking test sequence 3 and test sequence 4 as examples, the bit rate is used as an experimental indicator to compare the video compensation effects of different methods. The results are shown in Figure8.Figure 8
Code rate comparison result. (a) Test sequence 3. (b) Test sequence 4.
(a)(b)According to Figure8, it can be seen that in the test of test sequence 3 and test sequence 4, the code rate of this algorithm is higher than that of the deep learning algorithm and deep convolutional neural network algorithm. It shows that the better the video image quality of the algorithm in this paper, the smaller the distortion, which further verifies the application value of the algorithm in this paper.


## 5. Conclusion

To solve the problems of low peak signal-to-noise ratio, poor visual effect, and low bit rate in traditional methods, this paper proposed a fast compensation algorithm for motion between multimedia video frames based on Manhattan distance. The purpose of denoising and extracting significant information from the video image was achieved by the preprocessing of the video image. To this end, the block-based motion idea was the division of each frame of the video sequence into nonoverlapping macroblocks. Moreover, the best position of the block corresponding to the current frame was found. Furthermore, the current frame of the multimedia video was obtained with the Manhattan distance calculation formula. Then, the compensation of the relative Manhattan distance between the backgrounds was pushed forward for the motion between the multimedia video frames. Finally, the experimental results were analyzed, which verified that the proposed algorithm has a high peak signal-to-noise ratio, a higher bit rate, and a better video visual effect.



---

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