# Target Tracking Algorithm in Football Match Video Based on Deep Learning

Authors: Wei Zhao
Journal: Discrete Dynamics in Nature and Society
 (2022)

---

## Abstract

After the introduction of online learning mechanism, the traditional target tracking algorithm in football game video based on TLD has good tracking ability, but it will lose the target when the target is seriously obscured. Therefore, a soccer game video target tracking algorithm based on deep learning is proposed. The target detection algorithm of GoogLeNet-LSTM is used for faltung to obtain the feature mapping array. After processing, a high reliability candidate box for training and matching is obtained, and the feature maps of the detection results are collected to obtain the depth features required for tracking. Scale space discriminant tracking algorithm and Markov Monte Carlo algorithm are used to track single target or multi-target, respectively. Experimental results show that the average frame rate of the algorithm is maintained above 35 Hz, and the tracking time is about 12.5 s. The average center position deviation index is 39, the average coverage index is 40, and the resource utilization is low. The algorithm can track the target in the football game video well.


---

## Body

## 1. Introduction

In modern life, sports video is the important video that is popular among the majority of viewers. It has a large proportion in existing TV programs and the Internet [1, 2]. With the continuous improvement of people’s quality of life and the rapid advancement of technology, people’s demands for sports video are also rising. In terms of sports competition viewing, passive and flat viewing methods will gradually fail to meet the requirements of TV viewers [3–5]. The broadcasters need to add various visual effects to meet the visual requirements of the audience. In terms of game analysis, the team coach needs to extract relevant data from the football game video to assist the coach in researching the tactics. In terms of commercial applications, the broadcasters also need to more fully explore the commercial value of the football game broadcast. These need to analyze the video data of the game and process the game images for different requirements in order to meet the requirements of the game video [6–8]. Among the many sports competitions, football matches have the largest number of viewers and the highest level of attention. Therefore, the detection, extraction, location, and tracking of moving targets in the video have high practical and practical significance.The extraction and tracking of targets in the football game video are hot spots in the current sports field image and video processing. The technology required covers many areas of image processing analysis and computer vision. In general, football match video scene consists of background and goal, where the goal is the important part of the video, which contains important information. Therefore, quickly and efficiently segmenting objects in video and tracking the target of interest are the bases for subsequent image analysis [9].Although the research of target tracking has made great progress and breakthrough to some extent, the robust target tracking algorithm has been full of challenges due to the complexity of the environment and the influence of target deformation. The core problem of target tracking is feature representation. The early features are manually selected, and the appropriate features are selected according to the different application scenarios, but the effect is far from meeting the actual needs. Since the advent of deep learning technology, the field of computer vision has developed rapidly, and deep learning techniques were first used for image classification problems [10–12]. In recent years, the multi-target tracking algorithm based on deep learning has also made some breakthroughs. Multi-target tracking is the very challenging research direction in the field of computer vision and has a wide range of practical applications, for example, intelligent video monitoring control, abnormal behavior analysis, and mobile robot research. Traditional multi-target tracking algorithms tend to have poor tracking performance due to poor target detection. Depth-based learning detectors can achieve better results, which in turn improves tracking accuracy. Therefore, how to achieve effective combination of target tracking and deep learning has become the focus of researchers.Traditional target tracking algorithms have many problems. For example, the block-based scale-adaptive CSK rigid body target tracking algorithm proposed in Document 4 does not consider the confidence of the candidate box, and the tracking result has low precision. The KCF (kernelized correlation filter)-based tracking algorithm in Document 5 is only applicable to single-target tracking and has limited limitations. The TLD tracking algorithm proposed in the literature 6 causes the target to be lost when the target is severely occluded. The new target tracking algorithm that combines SIFT (scale-invariant features) and compression features is proposed in Document 7. This algorithm has poor effect on feature extraction, which results in lower center position error and coverage, and higher resource occupancy rate of the algorithm. Deep learning is a new research direction in the field of machine learning. It is introduced into machine learning to make it closer to the original goal—artificial intelligence (AI). Deep learning is the internal law and representation level of learning sample data. The information obtained in the learning process is very helpful to the interpretation of data such as text, image, and sound. Its ultimate goal is to make the machine have the ability of analysis and learning like human beings, and can recognize characters, images, sounds, and other data. Deep learning is a complex machine learning algorithm, which has achieved far more results in speech and image recognition than previous related technologies.In response to the above problems, the target tracking algorithm in the football match video based on deep learning is proposed in this paper. GoogLeNet is used to perform convolution to obtain the feature map array through target detection algorithm-based GoogLeNet + LSTM. After processing, candidate boxes of high confidence used to perform training and matching are obtained to achieve target detection. The feature map of the detection result is pooled to obtain the depth feature required for tracking. According to this feature, the discriminant scale space tracking algorithm and the Markov Monte Carlo algorithm are used to achieve single-target or multi-target tracking.


## 2. Materials and Methods

### 2.1. Target Detection-Based GoogLeNet + LSTM

Target detection is the basis of the multi-target tracking algorithm based on data association. The GoogLeNet + LSTM framework is used for target detection for problems such as small targets and occlusions in football video. First use GoogLeNet for convolution. In the last layer, the 1 × 1024 × 15 × 20 feature map array is obtained and transposed into 300 × 1024 feature map array. Each 1024-dimensional vector corresponds to the area of 139 × 139 in the original picture.The 300 × 1024 feature map array is obtained by GoogLeNet convolution, and then, each 1024-dimensional vector is processed in parallel by the LSTM sub-module. The hidden state of each output goes through two different fully connected layers: the position and width of direct output box, and the confidence of this box through the softmax layer. The LSTM sub-module has a total of five such units; that is, each input can predict 5 boxes and confidences. In the training, the frame is concentrated at the 64 × 64 position in the center of the sensing area, and the confidence is ranked from high to low.After processing, five detection frames corresponding to 64 × 64 small blocks in the original image and confidence levels can be obtained. The processing of the sub-module needs to filter all the detection frames of the video frame and then remove the frame with low confidence by the given thresholds. Finally, detection result can be obtained [13–17].The specific process is as follows: if the candidate box intersects with the determined frame, the candidate box is removed. A determined box removes at most one candidate box. In the above matching, the cost is expressed asm,d, m means whether the two intersect, the value is 0,1, and d is the Manhattan distance between the two boxes. The importance of m is greater than that of d; that is, the result obtained by the two matching schemes is first compared with the size of m. If the conclusion cannot be reached, the size of d is compared. The Hungarian algorithm is used to find the least costly match [18–20]. Assume that the filter’s confidence threshold is 0.5, then those boxes with the confidence below 0.5 are removed.In order to effectively train the target detection model, the following training method is adopted: more candidate boxes are obtained in the LSTM sub-module [21, 22], but there are detection errors.There are three types of errors [23, 24]:(1)
Point out the place that is not the tip of the person.(2)
The difference between the predicted and the true value frame positions.(3)
Multiple prediction frames are generated for the same target.The lower confidence level is assigned to the candidate box to prevent the occurrence of Case 1. The error is corrected to avoid the occurrence of Case 2; the lower confidence is given to the prediction boxes generated by the same target to eliminate the problem of Case 3.The loss function of the model training is(1)LG,C,f=α∑i=1Glposbposi,b^posfi+∑j=1Clcb^posj,f−1j,where G is the true value of the box, C is the candidate box, f is the matching algorithm, bposi means the i th box in the truth box, b^posj means the b^posj th box in the to-be-selected box, lpos is the Manhattan distance between the two, and lc is the cross-entropy loss, which is the softmax loss in the corresponding network [25–27]. The first term of this loss function represents the position error of the candidate box and the matching truth box, the latter represents the confidence of the candidate box, and α adjusts the balance between the two losses.The matching algorithm is the Hungarian algorithm, and the comparison function used is(2)Δbi,b^j=oij,rj,dij,where oij is 0,1. If the center of the to-be-selected box falls in the true value box, it is 0; otherwise it is 1. rj is the sequence number generated for the candidate box. The goal is to have high confidence frame first generated when matching [28–30]. Therefore, when matching the same target, the lower the ranking is, the lower the cost is [31, 32]; dij is the distance between the two boxes, that is, the distance error.The target detection results in the football match video are obtained by the detection algorithm-based GoogLeNet + LSTM. Based on this, deep learning is used to extract depth features.


### 2.2. Extraction of Depth Features

The corresponding box position obtained in the upper section is the position of the human head in the video, which is enlarged by certain scale to cover the whole body [33]. After obtaining the position and size of the target frame, the feature map array obtained by the last layer convolution of GoogleNet is used to extract features. The depth features of each target detected can be obtained by pooling the feature map, because each feature is highly abstract and can well characterize the appearance characteristics of the target in the football match video.The feature of the proposed algorithm is that the feature map is used for pooling to obtain the depth features required for target tracking without re-training. Therefore, under the premise that the real-time performance of the target tracking algorithm is unchanged, the accuracy of target tracking in the football game video is improved.


### 2.3. Single-Target Detection-Based DSST

The discriminant scale spatial tracking algorithm is simply referred to as DSST tracking algorithm. After obtaining the depth features, the DSST algorithm is used to track the single target in the video. DSST combines the two-dimensional positional filter with one-dimensional scaled filter. The candidate position is first determined by using the two-dimensional position correlation filter, and this area is used as reference area for the one-dimensional scale filter calculation. In this way, candidate blocks of different scales are obtained, and the scale with high matching degree is searched. The principle of scale selection is as follows:(3)anP×anR,n∈−S−12,…S−12,where P and R are the width and height of the target in the previous frame; a is the setting factor, and its value is set as 1.02; and S indicates the number of scales, with the setting of 33. The scale in the formula is not linear relationship, but only the detection process from fine to coarse and from inside to outside.In extracting image features and generating filters, MOSSE correlation filters are employed [34]. In this way, a series of image blocks are extracted from the target as training samples, which are, respectively, recorded as y1,y2,y3,⋯,yn. The corresponding filter response values are Gaussian functions, which are, respectively, recorded as g1,g2,g3,⋯,gn. The peak is at the center, and the end result is to find a filter that meets the minimum mean square error.The MOSSE optimal correlation filter formula is(4)ε=∑j=1tht∗yj−gj2=1MNHtYj−Gj2,where G is Gaussian function, ∗ represents complex conjugate, and Ht means the minimum value of the filter. The right equal sign is derived from the Parseval theorem. The right side of the equal sign is the frequency domain equation, and the left side is the airspace equation. This calculation can be used to transform the problem from spatial domain solution to frequency domain solution. In the frequency domain, the minimum value of the filter is as follows:(5)Ht=∑j=1tGj∑j=1tYj.After the correlation filter is obtained, the determination of the target position of the next frame is determined by the functional response of the correlation score [35]. The area with high response value is the new target position, and the response formula is(6)x=Y−1HtZ.In this algorithm, (4) uses the extracted depth feature and Gaussian function G to obtain the correlation filter H. t indicates the response time. When a new frame is input, the feature Z extracted by the image block is used as an input to calculate with the correlation filter H using (5), and the response score x is obtained to get the candidate target [36].DSST designs the inputy of the image into the feature vector of the d dimension. The input signal y represents a certain image block of the input image. The optimal correlation filter H is established by the MOSSE idea. The formula is as follows:(7)ε=∑t=1dhl∗yl−g2+λ∑t=1dhl2,where l is one dimension of the feature and λ is regular coefficient, and the solution of the obtained minimum value is as follows:(8)Hl=G¯Yl∑k=1dY¯kYk+λ=AtlBt.Since the pixel points in the image block directly solve thed×d-dimensional linear equation, the calculation amount is too large and time consuming. Therefore, a robust approximate solution is obtained by updating the numerator and the denominator in the above equation. The formula is rewritten as follows:(9)Atl=1−ηAt−1l+ηG¯tYtl,Bt=1−ηBt−1+η∑k=1dY¯tkYtl,where η is learning rate. The position of the target in the new frame, that is, the maximum response value of the correlation filter, can be obtained by(10)x=Y−1∑l=1dA¯lZlB+λ.The DSST algorithm uses the dual correlation filter to track the single target in football match video. The algorithm is more portable and efficient, but the problem still exists. When tracking multiple targets, the occlusion of the target will inevitably reduce the accuracy of the tracking, and the interference discrimination of similar targets is not strong. Therefore, the Markov Monte Carlo (HDDMCMC) algorithm is adopted when tracking multiple targets in the football match video.


### 2.4. Multi-Target Tracking Based on HDDMCMC Algorithm

#### 2.4.1. MCMC Algorithm in the Segment

In the multi-target tracking algorithm, considering the stability and continuity of motion (the same target in the front and rear frame video data), the appearance characteristics will not change drastically.In the intra-segment MCMC algorithm, the depth feature in Section2.2 is used to measure the similarity of the target trajectory.Each detection target is treated as a node and is described by the intra-segment timet,t+T. Suppose the set of nodes of the video frame in t is Nt=Nt1,Nt2,Nt3,⋯,Nti,⋯,NtNt−1,NtNt, and the posterior probability Pw|D is as (11)Pw|D=Pτ1,τ2,τ3,…,τK|D=∏k=1K∏n=1Nk−1PNn+1k|Nnk×∏k=1Ke−1/lk×e−τ0,where Nnk and Nn+1k represent the nth and n + 1th nodes in the kth pedestrian trajectory, respectively. PNn+1k|Nnk is the similarity of two nodes, and it can be calculated by the cosine of the angle of the two-node depth feature. lk is the length of different tracks, and τ0 represents the number of false alarms to ensure that the false alarm rate is low.


#### 2.4.2. Inter-Segment MCMC Algorithm

The data used are mainly the target trajectory generated by the MCMC algorithm in the segment. The main actions taken by the algorithm include fusion, splitting, and switching operations. After passing the intra-segment MCMC algorithm, many more reliable target trajectories are generated. At this time, if there is a case where the same target trajectory is broken, it is caused by unstable detection data. Therefore, the purpose of the inter-segment MCMC is to further combine the target trajectory data of the two time periods. In the current state, the posterior probability is updated as follows:(12)Pw|D=Pτ1,τ2,τ3,…,τK|D=∏k=1K∏n=1Nk−1PNn+1k|Nnk×∏k=1Ke−1/lk,where false alarm factors are no longer considered because they are mainly used to divide the target trajectory [37]. For fusion operations, the allowed time interval is set as tgap=10 and the frame difference at the junction between the track segments of the two targets cannot exceed 6. The standard deviation of the probability is set to 3σ=sizedti. In this way, the unit that can be transferred between different states is a relatively complete target trajectory segment that has been generated previously [38–40].The inter-segment MCMC algorithm moves the target that has gone out of the video scene out of the current data set. The current data set is assumed to beτ′. After the MCMC gets the trajectory in the next segment, it is matched by the inter-segment MCMC algorithm. That is to continue to build on the previous target data, combined with the current target data, to further data integration to optimize. The entire algorithm is continuously performed in such a sliding manner.


## 2.1. Target Detection-Based GoogLeNet + LSTM

Target detection is the basis of the multi-target tracking algorithm based on data association. The GoogLeNet + LSTM framework is used for target detection for problems such as small targets and occlusions in football video. First use GoogLeNet for convolution. In the last layer, the 1 × 1024 × 15 × 20 feature map array is obtained and transposed into 300 × 1024 feature map array. Each 1024-dimensional vector corresponds to the area of 139 × 139 in the original picture.The 300 × 1024 feature map array is obtained by GoogLeNet convolution, and then, each 1024-dimensional vector is processed in parallel by the LSTM sub-module. The hidden state of each output goes through two different fully connected layers: the position and width of direct output box, and the confidence of this box through the softmax layer. The LSTM sub-module has a total of five such units; that is, each input can predict 5 boxes and confidences. In the training, the frame is concentrated at the 64 × 64 position in the center of the sensing area, and the confidence is ranked from high to low.After processing, five detection frames corresponding to 64 × 64 small blocks in the original image and confidence levels can be obtained. The processing of the sub-module needs to filter all the detection frames of the video frame and then remove the frame with low confidence by the given thresholds. Finally, detection result can be obtained [13–17].The specific process is as follows: if the candidate box intersects with the determined frame, the candidate box is removed. A determined box removes at most one candidate box. In the above matching, the cost is expressed asm,d, m means whether the two intersect, the value is 0,1, and d is the Manhattan distance between the two boxes. The importance of m is greater than that of d; that is, the result obtained by the two matching schemes is first compared with the size of m. If the conclusion cannot be reached, the size of d is compared. The Hungarian algorithm is used to find the least costly match [18–20]. Assume that the filter’s confidence threshold is 0.5, then those boxes with the confidence below 0.5 are removed.In order to effectively train the target detection model, the following training method is adopted: more candidate boxes are obtained in the LSTM sub-module [21, 22], but there are detection errors.There are three types of errors [23, 24]:(1)
Point out the place that is not the tip of the person.(2)
The difference between the predicted and the true value frame positions.(3)
Multiple prediction frames are generated for the same target.The lower confidence level is assigned to the candidate box to prevent the occurrence of Case 1. The error is corrected to avoid the occurrence of Case 2; the lower confidence is given to the prediction boxes generated by the same target to eliminate the problem of Case 3.The loss function of the model training is(1)LG,C,f=α∑i=1Glposbposi,b^posfi+∑j=1Clcb^posj,f−1j,where G is the true value of the box, C is the candidate box, f is the matching algorithm, bposi means the i th box in the truth box, b^posj means the b^posj th box in the to-be-selected box, lpos is the Manhattan distance between the two, and lc is the cross-entropy loss, which is the softmax loss in the corresponding network [25–27]. The first term of this loss function represents the position error of the candidate box and the matching truth box, the latter represents the confidence of the candidate box, and α adjusts the balance between the two losses.The matching algorithm is the Hungarian algorithm, and the comparison function used is(2)Δbi,b^j=oij,rj,dij,where oij is 0,1. If the center of the to-be-selected box falls in the true value box, it is 0; otherwise it is 1. rj is the sequence number generated for the candidate box. The goal is to have high confidence frame first generated when matching [28–30]. Therefore, when matching the same target, the lower the ranking is, the lower the cost is [31, 32]; dij is the distance between the two boxes, that is, the distance error.The target detection results in the football match video are obtained by the detection algorithm-based GoogLeNet + LSTM. Based on this, deep learning is used to extract depth features.


## 2.2. Extraction of Depth Features

The corresponding box position obtained in the upper section is the position of the human head in the video, which is enlarged by certain scale to cover the whole body [33]. After obtaining the position and size of the target frame, the feature map array obtained by the last layer convolution of GoogleNet is used to extract features. The depth features of each target detected can be obtained by pooling the feature map, because each feature is highly abstract and can well characterize the appearance characteristics of the target in the football match video.The feature of the proposed algorithm is that the feature map is used for pooling to obtain the depth features required for target tracking without re-training. Therefore, under the premise that the real-time performance of the target tracking algorithm is unchanged, the accuracy of target tracking in the football game video is improved.


## 2.3. Single-Target Detection-Based DSST

The discriminant scale spatial tracking algorithm is simply referred to as DSST tracking algorithm. After obtaining the depth features, the DSST algorithm is used to track the single target in the video. DSST combines the two-dimensional positional filter with one-dimensional scaled filter. The candidate position is first determined by using the two-dimensional position correlation filter, and this area is used as reference area for the one-dimensional scale filter calculation. In this way, candidate blocks of different scales are obtained, and the scale with high matching degree is searched. The principle of scale selection is as follows:(3)anP×anR,n∈−S−12,…S−12,where P and R are the width and height of the target in the previous frame; a is the setting factor, and its value is set as 1.02; and S indicates the number of scales, with the setting of 33. The scale in the formula is not linear relationship, but only the detection process from fine to coarse and from inside to outside.In extracting image features and generating filters, MOSSE correlation filters are employed [34]. In this way, a series of image blocks are extracted from the target as training samples, which are, respectively, recorded as y1,y2,y3,⋯,yn. The corresponding filter response values are Gaussian functions, which are, respectively, recorded as g1,g2,g3,⋯,gn. The peak is at the center, and the end result is to find a filter that meets the minimum mean square error.The MOSSE optimal correlation filter formula is(4)ε=∑j=1tht∗yj−gj2=1MNHtYj−Gj2,where G is Gaussian function, ∗ represents complex conjugate, and Ht means the minimum value of the filter. The right equal sign is derived from the Parseval theorem. The right side of the equal sign is the frequency domain equation, and the left side is the airspace equation. This calculation can be used to transform the problem from spatial domain solution to frequency domain solution. In the frequency domain, the minimum value of the filter is as follows:(5)Ht=∑j=1tGj∑j=1tYj.After the correlation filter is obtained, the determination of the target position of the next frame is determined by the functional response of the correlation score [35]. The area with high response value is the new target position, and the response formula is(6)x=Y−1HtZ.In this algorithm, (4) uses the extracted depth feature and Gaussian function G to obtain the correlation filter H. t indicates the response time. When a new frame is input, the feature Z extracted by the image block is used as an input to calculate with the correlation filter H using (5), and the response score x is obtained to get the candidate target [36].DSST designs the inputy of the image into the feature vector of the d dimension. The input signal y represents a certain image block of the input image. The optimal correlation filter H is established by the MOSSE idea. The formula is as follows:(7)ε=∑t=1dhl∗yl−g2+λ∑t=1dhl2,where l is one dimension of the feature and λ is regular coefficient, and the solution of the obtained minimum value is as follows:(8)Hl=G¯Yl∑k=1dY¯kYk+λ=AtlBt.Since the pixel points in the image block directly solve thed×d-dimensional linear equation, the calculation amount is too large and time consuming. Therefore, a robust approximate solution is obtained by updating the numerator and the denominator in the above equation. The formula is rewritten as follows:(9)Atl=1−ηAt−1l+ηG¯tYtl,Bt=1−ηBt−1+η∑k=1dY¯tkYtl,where η is learning rate. The position of the target in the new frame, that is, the maximum response value of the correlation filter, can be obtained by(10)x=Y−1∑l=1dA¯lZlB+λ.The DSST algorithm uses the dual correlation filter to track the single target in football match video. The algorithm is more portable and efficient, but the problem still exists. When tracking multiple targets, the occlusion of the target will inevitably reduce the accuracy of the tracking, and the interference discrimination of similar targets is not strong. Therefore, the Markov Monte Carlo (HDDMCMC) algorithm is adopted when tracking multiple targets in the football match video.


## 2.4. Multi-Target Tracking Based on HDDMCMC Algorithm

### 2.4.1. MCMC Algorithm in the Segment

In the multi-target tracking algorithm, considering the stability and continuity of motion (the same target in the front and rear frame video data), the appearance characteristics will not change drastically.In the intra-segment MCMC algorithm, the depth feature in Section2.2 is used to measure the similarity of the target trajectory.Each detection target is treated as a node and is described by the intra-segment timet,t+T. Suppose the set of nodes of the video frame in t is Nt=Nt1,Nt2,Nt3,⋯,Nti,⋯,NtNt−1,NtNt, and the posterior probability Pw|D is as (11)Pw|D=Pτ1,τ2,τ3,…,τK|D=∏k=1K∏n=1Nk−1PNn+1k|Nnk×∏k=1Ke−1/lk×e−τ0,where Nnk and Nn+1k represent the nth and n + 1th nodes in the kth pedestrian trajectory, respectively. PNn+1k|Nnk is the similarity of two nodes, and it can be calculated by the cosine of the angle of the two-node depth feature. lk is the length of different tracks, and τ0 represents the number of false alarms to ensure that the false alarm rate is low.


### 2.4.2. Inter-Segment MCMC Algorithm

The data used are mainly the target trajectory generated by the MCMC algorithm in the segment. The main actions taken by the algorithm include fusion, splitting, and switching operations. After passing the intra-segment MCMC algorithm, many more reliable target trajectories are generated. At this time, if there is a case where the same target trajectory is broken, it is caused by unstable detection data. Therefore, the purpose of the inter-segment MCMC is to further combine the target trajectory data of the two time periods. In the current state, the posterior probability is updated as follows:(12)Pw|D=Pτ1,τ2,τ3,…,τK|D=∏k=1K∏n=1Nk−1PNn+1k|Nnk×∏k=1Ke−1/lk,where false alarm factors are no longer considered because they are mainly used to divide the target trajectory [37]. For fusion operations, the allowed time interval is set as tgap=10 and the frame difference at the junction between the track segments of the two targets cannot exceed 6. The standard deviation of the probability is set to 3σ=sizedti. In this way, the unit that can be transferred between different states is a relatively complete target trajectory segment that has been generated previously [38–40].The inter-segment MCMC algorithm moves the target that has gone out of the video scene out of the current data set. The current data set is assumed to beτ′. After the MCMC gets the trajectory in the next segment, it is matched by the inter-segment MCMC algorithm. That is to continue to build on the previous target data, combined with the current target data, to further data integration to optimize. The entire algorithm is continuously performed in such a sliding manner.


## 2.4.1. MCMC Algorithm in the Segment

In the multi-target tracking algorithm, considering the stability and continuity of motion (the same target in the front and rear frame video data), the appearance characteristics will not change drastically.In the intra-segment MCMC algorithm, the depth feature in Section2.2 is used to measure the similarity of the target trajectory.Each detection target is treated as a node and is described by the intra-segment timet,t+T. Suppose the set of nodes of the video frame in t is Nt=Nt1,Nt2,Nt3,⋯,Nti,⋯,NtNt−1,NtNt, and the posterior probability Pw|D is as (11)Pw|D=Pτ1,τ2,τ3,…,τK|D=∏k=1K∏n=1Nk−1PNn+1k|Nnk×∏k=1Ke−1/lk×e−τ0,where Nnk and Nn+1k represent the nth and n + 1th nodes in the kth pedestrian trajectory, respectively. PNn+1k|Nnk is the similarity of two nodes, and it can be calculated by the cosine of the angle of the two-node depth feature. lk is the length of different tracks, and τ0 represents the number of false alarms to ensure that the false alarm rate is low.


## 2.4.2. Inter-Segment MCMC Algorithm

The data used are mainly the target trajectory generated by the MCMC algorithm in the segment. The main actions taken by the algorithm include fusion, splitting, and switching operations. After passing the intra-segment MCMC algorithm, many more reliable target trajectories are generated. At this time, if there is a case where the same target trajectory is broken, it is caused by unstable detection data. Therefore, the purpose of the inter-segment MCMC is to further combine the target trajectory data of the two time periods. In the current state, the posterior probability is updated as follows:(12)Pw|D=Pτ1,τ2,τ3,…,τK|D=∏k=1K∏n=1Nk−1PNn+1k|Nnk×∏k=1Ke−1/lk,where false alarm factors are no longer considered because they are mainly used to divide the target trajectory [37]. For fusion operations, the allowed time interval is set as tgap=10 and the frame difference at the junction between the track segments of the two targets cannot exceed 6. The standard deviation of the probability is set to 3σ=sizedti. In this way, the unit that can be transferred between different states is a relatively complete target trajectory segment that has been generated previously [38–40].The inter-segment MCMC algorithm moves the target that has gone out of the video scene out of the current data set. The current data set is assumed to beτ′. After the MCMC gets the trajectory in the next segment, it is matched by the inter-segment MCMC algorithm. That is to continue to build on the previous target data, combined with the current target data, to further data integration to optimize. The entire algorithm is continuously performed in such a sliding manner.


## 3. Results

In order to verify the superiority of each aspect of the proposed algorithm, it is compared with some traditional algorithms such as CSK, KCF, Struck, CT, and TLD. The experimental object is the video of football match. The threshold set by the accuracy is 20 pixels, and the threshold of the success rate is set ast0=0.5. The results are shown in Tables 1 and 2.Table 1
Accuracy of different algorithms and comparison results.
Tracking algorithmVideo sequenceCSK algorithmKCF algorithmStruck algorithmCT algorithmTLD algorithmAlgorithm in this paper10.491.770.460.350.690.7820.480.800.390.370.820.8430.560.760.420.350.430.8040.450.810.480.400.630.8250.560.820.470.420.840.8360.460.170.450.430.320.8870.260.230.410.380.520.7780.350.880.430.390.830.84Table 2
Comparison of success rates of different algorithms.
Tracking algorithmVideo sequenceCSK algorithmKCF algorithmStruck algorithmCT algorithmTLD algorithmAlgorithm in this paper10.401.520.520.320.420.7120.450.460.460.280.780.6830.280.450.350.300.370.7540.330.530.530.310.460.6750.290.470.410.280.390.8160.400.480.380.250.440.4870.340.460.460.180.360.5280.450.530.320.330.410.63By comparison, the accuracy of the algorithm is up to 0.88, and the success rate is up to 0.81. Although the effect of this algorithm is not optimal for some video sequences, the algorithm is robust to the overall performance. When the target is partially occluded, the algorithm can still accurately track the target.The center position error refers to the center deviation of the tracking frame from the real target frame, and the coverage ratio is the proportion of the intersection of the tracking frame and the real target frame in the merged portion. In order to evaluate the tracking performance of different algorithms on the entire video series, the experiment will use the average center position deviation and average coverage as indicators to test, and the results are shown in Tables3 and 4.Table 3
Average center position deviation of different algorithms (pixel).
Video sequenceCSK algorithmKCF algorithmStruck algorithmCT algorithmTLD algorithmAlgorithm in this paper1121.618—103.862.112.029.9276.7—7.040.310.9386.7165.4—82.43.03.5427.875.6—30.55.53.6518.918.810.419.414.213.06134.6104.314.3125.320.411.6775.1181.6—90.312.816.08212.3154.8—212.77.09.7Table 4
Average coverage of different algorithms (%).
Video sequenceCSK algorithm/%KCF algorithm/%Struck algorithm/%CT algorithm/%TLD algorithm/%Algorithm in this paper/%120.860.3—20.835.450.9262.21.0—69.137.249.6322.57.5—20.576.377.3441.241.2—34.272.385.3532.435.572.032.152.760.864.110.741.62.548.039.6724.110.2—30.574.671.5813.529.4—12.173.760.4It can be seen from Tables3 and 4 that among the eight tracking video sequences, the average center position deviation index of the algorithm has three groups of best and two groups of two; the average coverage has two groups of best and four groups of second. The experiment used the scoring method to evaluate the two indicators separately. The rule is to sort the two indicators according to their performance from high to low, and then score them in 6, 5, 4, 3, 2, and 1. Each video sequence is scored in turn, and finally, they are summed and used as their final result, as shown in Figure 1.Figure 1
Performance comparison between average center position deviation and average coverage rate of different algorithms.Analysis of Figure1 shows that the algorithm scores 39 points on the average center position deviation and 40 points on the average coverage rate, which are better than other algorithms. This shows that the algorithm is better in the listed tracking algorithms.The video frame rate is a measure used to measure the number of displayed frames and reflects the smoothness of the tracking results. The average frame rate of the eight video sequences is compared using different algorithms, and the results are shown in Table5.Table 5
Average frame rate comparison results of different algorithms (Hz).
Video sequenceCSK algorithm/HzKCF algorithm/HzStruck algorithm/HzCT algorithm/HzTLD algorithm/HzAlgorithm in this paper/Hz125.327.6—27.324.638.2220.825.3—26.928.435.9324.621.7—29.224.837.6422.722.4—30.629.340.4526.820.819.931.427.239.3624.523.222.728.430.638.6723.924.5—2933.740.2821.223.6—30.125.537.5Analysis Table5 can be obtained that the average frame rate of the algorithm in this paper is higher than other algorithms, both above 35 Hz. This shows that the tracking results using the algorithm of this paper are more fluent.In order to verify the efficiency of the algorithm, the iterations and time consumption of different algorithms are compared, respectively, and the results are described in Figure2.Figure 2
Comparison of efficiency of different tracking algorithms. (a) Comparison of iterations. (b) Time consumption contrast.
(a)(b)It can be seen from Figure2 that the iteration number of the algorithm is similar to the number of CT algorithms, with an average of 1–2 times, which is significantly lower than the CSK algorithm. In the comparison of time consumption, the time consumed by the algorithm is similar to the CSK algorithm, with an average of 12.5 s, which is significantly lower than the CT algorithm. The comparison results show that the tracking efficiency of the algorithm is higher.To verify the stability of the proposed algorithm, three algorithms are used to track the target in the same experimental environment. The average outage probability of different algorithms is compared, and the results are shown in Table6.Table 6
Comparison of average outage probability of different location systems.
Average signal-to-noise ratio/dBAlgorithm in this paperCSK algorithmCT algorithm0–50.0120.0140.0115–100.0140.0140.01510–150.0170.0160.01815–200.2640.3830.46120–250.2970.4550.51825–300.3060.4980.62430–350.3250.5340.65935–400.3300.6070.76840–450.3840.7110.83945–500.4220.7930.972Average value0.23710.40250.4885In order to more clearly show the stability of the algorithms, the data in Table6 are described by the implementation of the line graph, as shown in Figure 3.Figure 3
Comparison of average outage probability of different location systems.Analysis of Table6 and Figure 3 shows that the average outage probability of the algorithm is 0.2371, which is lower than the other two algorithms. The experimental results show that the proposed algorithm has better stability when tracking the target in the football match video.In order to test the resource occupancy rate of the proposed algorithm, it compares and analyzes the target detection, feature extraction, single-target tracking, and multi-target tracking. The results are shown in Table7.Table 7
Resource occupancy ratio of different platforms/%.
Object detectionFeature extractionSingle-target trackingMulti-target trackingAlgorithm in this paperCPU occupancy rate/%29263134Memory usage%971317CSK algorithmCPU occupancy rate/%69666470Memory usage%39333441CT algorithmCPU occupancy rate/%65646872Memory usage%37293339It can be seen from Table7 that the CPU and memory usage of the proposed algorithm are 26%–34% and 7%–17%, respectively. The usages of the CSK algorithm are 64%–70% and 33%–41%, respectively. Those of the CT algorithm are 64%–72% and 29%–39%, respectively. The experimental results show that compared with the other two algorithms, the algorithm of this paper tracks the resource occupancy rate of the target in the football match video which is low.


## 4. Discussion

The accuracy and success rate of the algorithm are as high as 0.88 and 0.81, respectively; the average center position deviation index and the average coverage index are 39 and 40 points, respectively; the average frame rate is maintained above 35 Hz, and the tracking time is about 12.5 s. These data show that the proposed algorithm outperforms other algorithms in performing target tracking. The reason is the use of deep learning techniques in this paper. Deep learning is artificial neural network that simulates the human brain’s analysis of things. By simulating the human brain to acquire data and parse it, this structure can better learn the essential characteristics of objects. The main ideas of deep learning target tracking are as follows: first, construct a deep learning model to train standard data sets and obtain more accurate target feature information. Then, use this model for target matching and positioning to achieve efficient target tracking. Depth features can more accurately reflect the appearance characteristics of moving objects than traditional features such as scale-invariant features (SIFT). Therefore, the algorithm of this paper greatly improves the accuracy of target tracking. At the same time, it combines the discriminant scale space algorithm and the Markov Monte Carlo algorithm to track the targets in the football video to ensure efficient tracking of single targets while achieving accurate tracking of multiple targets.


## 5. Conclusions

With the rapid development of computer technology, deep learning has become a big weapon for video target tracking. Deep learning technology has the advantages of high precision, wide application range, and strong stability. Aiming at the traditional target tracking algorithm in the football match video, there is the defect that the target will be lost when the target is severely occluded. A target tracking algorithm based on deep learning football game video is proposed. Combined with deep learning and target tracking technology to track the target, the experimental results show that the tracking success rate, required time, and average frame rate of the proposed algorithm are 0.81, 12.5 s, and 35 Hz, respectively. The average center position deviation index and the average coverage index are 39 and 40 points, respectively, and the resource occupancy rate is low. This shows that the algorithm can well track the targets in the football match video. In the future research, the information technology model is used to further improve the accuracy of football game video target tracking and reduce the defect of losing the target when the target is seriously blocked [41–45].



---

*Source: 2769606-2022-05-31.xml*