# Sports Video Augmented Reality Real-Time Image Analysis of Mobile Devices

Authors: Hui Wang; Meng Wang; Peng Zhao
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

Sports video is loved by the audience because of its unique charm, so it has high research value and application value to analyze and study the video data of competition. Based on the background of football match, this paper studies the football detection and tracking algorithm in football game video and analyzes the real-time image of real-time mobile devices in sports video augmented reality. Firstly, the image is preprocessed by image graying, image denoising, image binarization, and so on. Secondly, Hough transform is used to locate and detect football, and according to the characteristics of football, Hough transform is improved. Based on the good performance of SIFT algorithm in feature matching, a football tracking algorithm based on SIFT feature matching is proposed, which matches the detected football with the sample football. The simulation results show that the improved Hough transform can effectively detect football and has good antijamming performance. And the designed football tracking algorithm based on SIFT feature matching can accurately track the football trajectory; therefore, the football detection and tracking algorithm designed in this paper is suitable for real-time football monitoring and tracking.


---

## Body

## 1. Introduction

Nowadays, more and more people accept various kinds of information in the form of multimedia data, which requires the storage and analysis of various multimedia data. Because the most important way for humans to perceive and understand the world is vision, visual information is the most important information in multimedia data, which contains the largest amount of information. In multimedia data, visual information is represented as image data and video data. The analysis and processing of image and video data is a hot issue in real-time image analysis of augmented reality mobile devices. In most cases, the moving target in a video sequence is the most concerning part of human eyes. In fact, the biggest feature of video image is that it has rich original data, strong correlation between adjacent near frames, and dynamic time-varying mode in time domain, which makes moving objects easy to detect, segment, and recognize. Compared with static images, the greatest advantage of image sequence and video is to capture motion information.The object detection and tracking algorithm of video image began in the middle of the 20th century. At that time, people began to study the computer representation of object image and developed optical character recognition (OCR) system, license plate recognition system in fixed scene, and so on. By the end of the 20th century, face detection, vehicle detection, and aviation military target detection have become popular research fields.At present, many national departments and scholars have done a lot of research on motion target analysis and its technology. In 1997, the Defense Advanced Research Projects Agency of the United States established the Visual Surveillance and Monitoring (VSAM) system, which was led by Carnegie Mellon University Robot and participated by Sarnoff Company and so on [1]. The system can be used for battlefield situation analysis, safety monitoring in important places, and monitoring of refugee flow. From 1998 to 2002, a system named ADVISOR was developed and studied by the French National Institute of Computer Science and Control, the University of Reading, and the University of Kingston in the United Kingdom under the support of the IST (Information Society Technology) research institute. The system improves the management level of public transport network by establishing an intelligent monitoring system and guarantees personal and property safety [2]. In addition, there are also Maryland University real-time visual monitoring system W4 [3], the video surveillance technology project AVITRACK, and the intelligent embedded system ObjectVideo, which are jointly studied by the European Union and Austria. It also shows that, with the development of society, the demand for sport target analysis is higher and higher.Video moving object analysis system can be widely used in public safety protection, such as regional monitoring, terrain matching, urban safety, and traffic management. However, in reality, the background is most complex and changeable, such as the brightness change of light, the movement of objects in the background, or the existence of objects similar to the characteristics of the target, shadow problem, target occlusion, and so on. All these have brought some difficulties to the accurate detection and tracking of the target.In modern life, sports video is a kind of important video loved by the majority of the audience, which occupies a large proportion in the existing television programs and the Internet. With the continuous improvement of people’s quality of life and the rapid progress of science and technology, all aspects of sports video requirements are also rising. For example, in the aspect of watching sports matches, now this passive, flat viewing mode will gradually fail to meet the demands of television viewers. Broadcasters need to add various visual special effects to meet the visual requirements of the audience. In many sports competitions, football matches have the largest number of spectators and the highest degree of concern. Therefore, detecting, extracting, locating, and tracking the moving objects in football matches video have very high practical value and practical significance.Target extraction and tracking in video is a hotspot in image and video processing. The technology applied covers many fields of image processing analysis and computer vision. Generally speaking, a video scene is composed of background and target, in which target is an important part of video sequence and contains important information. Therefore, fast and effective segmentation of objects in video and tracking of interesting objects are the basis of subsequent video image analysis.The core of augmented reality mobile devices is to realize the seamless integration of virtual objects (3D models, videos, images, audio, etc.) and real scenes. How to make the virtual objects and real scenes reach an agreement on time, location, and illumination is a technical difficulty. In recent years, with the continuous improvement of hardware and software of mobile devices, augmented reality technology can be applied to mobile devices. However, mobile devices are usually limited by memory, computing power, communication speed, hardware architecture, and other aspects. How to research the technology suitable for mobile devices on the original basis has become a research hotspot in the field of augmented reality.In the past two decades, researchers have done a lot of research on video analysis and processing and put forward many valuable theories and methods. Sports video has a certain structure and regularity. The analysis and research of sports video have high theoretical value and wide application value, which makes sports video attracted the attention of many scholars [4–6]. In the analysis and processing of football video, players and football are two very important goals. In many applications, it is urgent to detect and track players and football, such as event detection, tactical analysis, automatic summary generation, and target-based video compression. As a hot issue in video and sequence image processing, detection and tracking has always attracted the attention of researchers. In recent years, many famous universities and research institutes at home and abroad have made in-depth research on football video analysis and processing technology and put forward some effective methods for football video target detection and tracking.It is a very challenging task to detect and track football effectively in football videos. The main reasons include the following: (1) In football videos, the number of pixels occupied by football targets is small. (2) The position and direction of the camera are always changing, so the football movement in football video includes the movement of the ball itself and the movement of the camera. (3) Because of the influence of the light and the speed of the ball, the color, size, and shape of the football will change, so it is difficult to build an effective model to detect and track the ball. (4) When soccer is tied to the ground or shielded by players, it is more difficult to detect and track [7–10].In this paper, the detection and tracking of football is studied, and an algorithm of football detection and tracking in football matches video is proposed, which can in real time analyze football matches video images. The work of this paper is as follows:(1)
The image is preprocessed by image grayscale, image denoising, and image binarization, and an improved median filtering method is proposed.(2)
Hough transform is used to locate and detect football, and according to the characteristics of football, Hough transform is improved.(3)
Based on the good performance of SIFT algorithm in feature matching, a football tracking algorithm based on SIFT feature matching is proposed, which matches the detected football with the sample football.


## 2. Proposed Method

### 2.1. Image Preprocessing

#### 2.1.1. Image Denoising

In video image processing, the main noise comes from image sensors. There are two kinds of noises from image sensors: salt-and-pepper noise and Gauss noise [11, 12]. In order to eliminate sensor noise, there are two kinds of mean filtering [13] and median filtering [14]. In this paper, an improved median filtering method is used to denoise the system from the point of view of real-time performance and detection effect.For the traditional median filtering algorithm, if the number of pixels in the sliding window isn, each window needs to be compared nn−2/2 times, and the time complexity is On2. In general filtering algorithm, the window needs to be sorted once every time it moves. If image size is N×N, the time complexity of the whole algorithm is On2N2.In this paper, an improved median filtering algorithm is used to improve the real-time performance of soccer video processing, in which the time complexity of each sliding window isOn, and the overall time complexity is OnN2, which meets the real-time requirements of volleyball video detection.For illustrative purposes, the pixels in the3×3 window are defined as P0−P8, respectively, as shown in Table 1.Table 1
Pixel sort order.
Zeroth columnsFirst columnsSecond columnsZeroth linesP0P1P2First linesP3P4P5Second linesP6P7P8The process of implementation of the algorithm is as follows: first, the maximum, median, and minimum values in each column are calculated, and the maximum, median, and minimum groups can be obtained. The calculation process is as follows:Max group:Max0=maxP0P3P6, Max1=maxP1P4P7, Max2=maxP2P5P8.Middle-value group:Med0=medP0P3P6, Med1=medP1P4P7, Med2=medP2P5P8.Minimum group:Min0=minP0P3P6, Min1=minP1P4P7, Min2=minP2P5P8.It is concluded that the maximum value and the minimum value in the maximum value group and the minimum value group must be the maximum and minimum values of the nine-pixel values, the maximum value in the median group is at least 5 pixels, and the minimum value is less than 5 pixels. If the median in the maximum group is at least 5 pixels, and the median in the minimum group is less than 5 pixels, then(1)Maxmin=minMax0,Max1,Max2,Medmed=medMed0,Med1,Med2,Minmax=maxMin0,Min1,Min2,Winmed=medMaxmin,Medmed,Minmax,and with this algorithm, the number of median calculations is nearly twice as much as that of the traditional algorithm, and it is very suitable for image smoothing in video sequence.


#### 2.1.2. Image Binarization

Among many image segmentation methods, binarization is a simple and effective method. The purpose of binarization of image [15–17] is to separate the moving object from the background in the image and to provide the basis for the subsequent classification, detection, and recognition. Set the input image as gx,y and the output image as gbx,y; then,(2)gbx,y=1,gx,y≥T,0,gx,y<T,where T represents the threshold of binary processing. In actual processing, the background is represented by 255 and the moving object is represented by 0. The process of binarization is relatively simple, and the key problem is the selection method of binarization. In this paper, the OTSU algorithm is used to improve the selection of binarization image threshold.


### 2.2. Research on Soccer Location Detection

Hough transform essentially transforms the spatial domain of an image into a parametric space and describes the curve of an image in a parametric form satisfied by most of the pixels. In the process of geometric image detection, standard Hough transform (SHT) requires the following steps to achieve detection [18–21]:(1)
Allocate buffer: the process is to allocate the parameter buffer to prepare the mapping.(2)
Parameter space transformation: the feature points are scanned, and each feature point satisfying a specific relationship corresponds to the parameter space.(3)
Accumulation and storage: the image parameters satisfying the specific relationship are accumulated and stored, and the pixels satisfying the specific relationship in the image space are added together.(4)
The location of the largest point on the plane of the location parameter, which is the parameter of the image on the original image.The equation of known circle is(3)x−g2+y−h2=r2,where g,h is the center of a circle and r is the radius. The formula represents the equation of the circle. Because it is in the image space, the point x,y is regarded as an unknown number, and the center g,h and radius r are regarded as known numbers. If the image in image space coordinate system x−y is mapped to three-dimensional parametric space g−h−r, the equation of circle in parametric space is as follows:(4)g−x2+h−y2=r2.In the parameter space, the known and unknown parameters are reversed, the coordinate information of the feature pointsx,y becomes known, and the corresponding center g,h and radius r are unknown. After transformation, each effective feature point x,y in the image space corresponds to a cone in the parameter space one by one. Different points on the same circle in the image space correspond to the same point of intersection of cones in the parameter space. This process records the number of repeated points with the same parameters by initializing a three-dimensional accumulator in the parameter space. The expression is as follows:(5)Ag,h,r=Ag,h,r+1,where Ag,h,r represents a three-dimensional accumulator, counting every three-element array g,h,r and accumulating the results. By setting a threshold, when the value of the accumulator exceeds the threshold, the point is considered to be the center coordinate of the circle in the image space.After preprocessing the video frame, the Hough transform is realized. However, directly using SHT to perform loop detection on an image requires mapping the pixels of the entire image into the parameter space and then making judgments point by point, which affects the efficiency and accuracy of the algorithm. Therefore, the basic idea of this paper is to replace multiple loops with multidimensional arrays while reducing the dimensionality of the accumulator. At this point, we need to know the radius of the circle to be detected; that is, the circle radiusr must fall in the range of rmin,rmax. It is known that, in the image space, the circle can have the following parameter expression:(6)x=g+rcosθ,y=h+rsinθ.Symbolθ is the angle between the point x,y and the line of the point and the x-axis. The corresponding point in the image space is mapped to the parameter space, and the formula of the circle is as follows:(7)a=g−rcosθ,b=h−rsinθ.The specific steps for improvement are as follows:(1)
After the image is preprocessed, the initial Hough array matrix in the pixel space is used to set the initial variables, and according to the actual position of the circle, it is determined that its radius isrmin,rmax, and the step length is θ.(2)
According to the parametric formula (5), the value of calculation a,b is set as a nonnegative integer, and the valid value is recorded to determine the index value of the Hough array.(3)
Hough arrays are constructed according to Hough index values, which are mainly realized by accumulators. At this time, the number of layers of the arrays isrmin−rmax.(4)
In the Hough array, the layer with the largest accumulative value is found, which corresponds to the circle with the largest number of pixels in the image space, and the corresponding radius of the array is the radiusr of the circle.(5)
The center of the circle is obtained. The mean value of all thea,b in the maximum value layer is the center of the circle.


### 2.3. Research on Soccer Tracking Algorithm

In this paper, based on the good performance of SIFT algorithm in feature matching, a football tracking algorithm based on SIFT feature matching is proposed, which matches the detected football with the sample football. Firstly, SIFT feature points need to be extracted. The details are as follows:


#### 2.3.1. Detection of Extreme Points in Scale Space

In scale space, the concept of local extreme contains two meanings: one is image space extreme; that is, the extreme points are local extreme points in 9 points of3×3 neighborhood on the same level; the other is scale-space extreme, that is, the local extreme points of 27 points in the neighborhood 3×3 of the point and its corresponding points in two adjacent layers. To sum up, the extraction steps of scale-space extreme points are as follows.Step 1.
The input imageIp,q is convoluted with the Gauss function Gp,q,σ to generate the corresponding scale space Lp,q,σ, which is represented by a Gauss pyramid.Step 2.
Subtract the two adjacent layers of the Gauss Pyramid to generate the Gauss differential PyramidDp,q,σ.Step 3.
In the Gaussian difference pyramid, the maximum or minimum point in the neighborhood of the same layer3×3 and the neighborhood of the adjacent layer 3×3 is detected.


#### 2.3.2. Precise Location of Key Points

The image data stored by computer are discrete pixel value, but the extreme point of discrete data may not be the extreme point of real continuous space. Therefore, it is necessary to fit the DOG function in scale space with a three-dimensional quadratic curve, so that the extremum points can be accurately located at subpixel level. For a general differentiable function, the extreme point is the point whose first derivative is 0. So the Taylor expansion of Gauss difference function DOG in scale space is as follows:(8)DP=D+∂DT∂PP+12PT∂2DT∂P2P.Solve the derivative, and let∂Dp/∂P=0; then, the maximum point obtained in the image row, column, and scale of the three directions offset is(9)P^=∂DT∂P∂2DT∂P2.Since the DOG function is expanded at the origin of the extreme pointP=p,q,σ, the range of offset in three directions is found to be between 0 and 1. Formula (5) is substituted into formula (4):(10)DP^=D+12∂DT∂PP^.Lowe’s experiment shows that, for the extreme point ofDP^<0.3, it is considered as an unstable candidate with low contrast and is eliminated.In order to obtain stable subpixel accurate positioning coordinates of key points, the following positioning criteria are adopted in this paper:(1)
If the three components ofP^ (i.e., the offset in the row, column, and scale directions of the image) are less than 0.5, then the point is regarded as the extreme point, and the noninteger coordinate value after the offset is taken as the precise positioning coordinate of the key point.(2)
If a component is greater than or equal to 0.5, it means that the real extreme point is closer to the detection point of another integer; then the coordinates of the extreme point in this direction are moved to an integer coordinate value in the offset direction.(3)
Repeat the above operations (Taylor expansion and offset calculation) until the offset of a detection point is found to satisfy three component values less than 0.5. The number of repeated operations is not greater than 5; otherwise, it is considered unstable.For two-dimensional discrete data images, the key points of the Hessian matrix are(11)K=DppDpqDpqDqq.The derivative is estimated by the difference between adjacent sampling points; that is,Dpp=Ip,q+1+Ip,q−1−2∗Ip,qDqq=Ip,q+1+Ip−1,q−2∗Ip,q,Dpq=Ip+1,q+1−Ip+1,q−1−Ip−1,q+1+Ip−1,q−1/4, Ip,q represents the size of the pixel value at coordinate p,q.α is a larger eigenvalue of K and β is a smaller eigenvalue. For the two-order matrix K, the trace of the matrix is(12)TrK=Dpp+Dqq=α+β.The determinant of the matrix is(13)DetK=DppDqq−Dpq2=αβ.In order to avoid directly calculating these eigenvalues, we only consider the ratio between them to represent the ratio of the principal curvature of the extreme point. Letr=α/β; then,(14)TrK2DetK=α+β2αβ=r+12r.It can be seen that the upper form reaches the minimum when the eigenvalues ofα and β are equal and increases with the increase of r. So the intensity of the edge response can be expressed by the size of formula 10. The larger the value, the stronger the edge response. Lowe recommends that the value of r be 10. When the Hessian matrix of the extreme point satisfies TrK2/DetK<r+12/r,r=10, the extreme point is retained; otherwise, it is considered to be the extreme value of the edge response which is easy to be affected by noise and so on.


#### 2.3.3. Key Point Assignment

The direction of the feature points will be used in the key point descriptor, so the characteristics of the feature points need to be described. We assign a direction to each feature point. The gradient direction distribution of the neighborhood pixels of the key points is used to assign direction parameters to each key point, so that the operator has rotation invariance.(15)mp,q=Lp+1,q−Lp−1,q2+Lp,q+1−Lp,q−12,θp,q=arctanLp,q+1−Lp,q−1Lp+1,q−Lp−1,q.Formulas (11) and (12) are the formulas for the modulus and direction of gradient at p,q. The scale used by L is the scale of each key point.In practical calculation, when the direction is the weight and the gradient is the weight value, for the convenience of calculation and statistics, we use 0.5 as the dividing line to take integers to both sides of the radian direction angle which exists in decimal form. For example, 1.25 takes 1 and 2.75 takes 3. With this method, the angles can be grouped into 8 arrays of 0–7, and the corresponding gradient values can be added up as the important data for subsequent calculation and matching.


#### 2.3.4. Generating Key Points Descriptors

After obtaining the local feature points, the key step is to use the local feature points to describe the information of the surrounding area, which can reduce the impact of the key points by perspective, rotation, illumination, and so on. By assigning the direction of the key points, we have been able to get the main direction of the key points. Then we rotate the region to the main direction within a certain radius with the key point as the center of the circle, so that the key point has rotation invariance. When describing, the region is divided into4∗4 subregions. In each subregion, the gradient histogram of 8 directions is used to make statistics. From this, a descriptor of 4∗4∗8=128 dimension is formed. We call this descriptor of 128 dimensions a SIFT descriptor.After extracting SIFT feature points, in order to determine whether a sample in the tracking sample set is the same target as the football detected in the current frame, this paper uses the matching degree of the two to measure, that is, matching degree. Assuming that the tracking sampleMik has N1 SIFT feature points and the target detected in the k+1 frame image has N2 SIFT feature points. The matching point pair of the SIFT features is N, and the matching degree rate is calculated according to the following formula:(16)Rate=NmaxN1,N2.According to whether the matching degree is greater than the matching thresholdTR, the current detection target and the corresponding sample are tracked for the same target. Dice similarity coefficient calculation formula is as follows:(17)DICE=2SEG∩GTSEG+GT,y=αWy+β1X−Wβ2X+ε,lngdpit=a0+a1du∗dt+∑i=1NbjXu+εu.Video coefficient calculation formula is as follows:(18)SEN=SEG∩GTGT,lssim=1−2μxμy+C12σxy+C2μx2+μy2+C1σx2+σy2+C2,ψ=∑x=1θVx=∑x=1ϑWx∑1nWℑSx.VOE coefficient calculation formula is as follows:(19)VOE=1−SEG∩GTSEG∪GT,U2=s−p1−kx2,x−p2−k1−x2.RVD coefficient calculation formula is as follows:(20)RVD=100%×1−SEG−GTGT.When Dice, Jaccard, and SEN are close to 1, it means that the segmentation result is closer to the expert annotated image; when RVD and VOE are close to 0, it means that the segmentation error is small or there is basically no segmentation error. Among them, Dice is used to express the similarity between the network segmentation map and the expert's annotation map, and it is a very important segmentation image evaluation coefficient.


## 2.1. Image Preprocessing

### 2.1.1. Image Denoising

In video image processing, the main noise comes from image sensors. There are two kinds of noises from image sensors: salt-and-pepper noise and Gauss noise [11, 12]. In order to eliminate sensor noise, there are two kinds of mean filtering [13] and median filtering [14]. In this paper, an improved median filtering method is used to denoise the system from the point of view of real-time performance and detection effect.For the traditional median filtering algorithm, if the number of pixels in the sliding window isn, each window needs to be compared nn−2/2 times, and the time complexity is On2. In general filtering algorithm, the window needs to be sorted once every time it moves. If image size is N×N, the time complexity of the whole algorithm is On2N2.In this paper, an improved median filtering algorithm is used to improve the real-time performance of soccer video processing, in which the time complexity of each sliding window isOn, and the overall time complexity is OnN2, which meets the real-time requirements of volleyball video detection.For illustrative purposes, the pixels in the3×3 window are defined as P0−P8, respectively, as shown in Table 1.Table 1
Pixel sort order.
Zeroth columnsFirst columnsSecond columnsZeroth linesP0P1P2First linesP3P4P5Second linesP6P7P8The process of implementation of the algorithm is as follows: first, the maximum, median, and minimum values in each column are calculated, and the maximum, median, and minimum groups can be obtained. The calculation process is as follows:Max group:Max0=maxP0P3P6, Max1=maxP1P4P7, Max2=maxP2P5P8.Middle-value group:Med0=medP0P3P6, Med1=medP1P4P7, Med2=medP2P5P8.Minimum group:Min0=minP0P3P6, Min1=minP1P4P7, Min2=minP2P5P8.It is concluded that the maximum value and the minimum value in the maximum value group and the minimum value group must be the maximum and minimum values of the nine-pixel values, the maximum value in the median group is at least 5 pixels, and the minimum value is less than 5 pixels. If the median in the maximum group is at least 5 pixels, and the median in the minimum group is less than 5 pixels, then(1)Maxmin=minMax0,Max1,Max2,Medmed=medMed0,Med1,Med2,Minmax=maxMin0,Min1,Min2,Winmed=medMaxmin,Medmed,Minmax,and with this algorithm, the number of median calculations is nearly twice as much as that of the traditional algorithm, and it is very suitable for image smoothing in video sequence.


### 2.1.2. Image Binarization

Among many image segmentation methods, binarization is a simple and effective method. The purpose of binarization of image [15–17] is to separate the moving object from the background in the image and to provide the basis for the subsequent classification, detection, and recognition. Set the input image as gx,y and the output image as gbx,y; then,(2)gbx,y=1,gx,y≥T,0,gx,y<T,where T represents the threshold of binary processing. In actual processing, the background is represented by 255 and the moving object is represented by 0. The process of binarization is relatively simple, and the key problem is the selection method of binarization. In this paper, the OTSU algorithm is used to improve the selection of binarization image threshold.


## 2.1.1. Image Denoising

In video image processing, the main noise comes from image sensors. There are two kinds of noises from image sensors: salt-and-pepper noise and Gauss noise [11, 12]. In order to eliminate sensor noise, there are two kinds of mean filtering [13] and median filtering [14]. In this paper, an improved median filtering method is used to denoise the system from the point of view of real-time performance and detection effect.For the traditional median filtering algorithm, if the number of pixels in the sliding window isn, each window needs to be compared nn−2/2 times, and the time complexity is On2. In general filtering algorithm, the window needs to be sorted once every time it moves. If image size is N×N, the time complexity of the whole algorithm is On2N2.In this paper, an improved median filtering algorithm is used to improve the real-time performance of soccer video processing, in which the time complexity of each sliding window isOn, and the overall time complexity is OnN2, which meets the real-time requirements of volleyball video detection.For illustrative purposes, the pixels in the3×3 window are defined as P0−P8, respectively, as shown in Table 1.Table 1
Pixel sort order.
Zeroth columnsFirst columnsSecond columnsZeroth linesP0P1P2First linesP3P4P5Second linesP6P7P8The process of implementation of the algorithm is as follows: first, the maximum, median, and minimum values in each column are calculated, and the maximum, median, and minimum groups can be obtained. The calculation process is as follows:Max group:Max0=maxP0P3P6, Max1=maxP1P4P7, Max2=maxP2P5P8.Middle-value group:Med0=medP0P3P6, Med1=medP1P4P7, Med2=medP2P5P8.Minimum group:Min0=minP0P3P6, Min1=minP1P4P7, Min2=minP2P5P8.It is concluded that the maximum value and the minimum value in the maximum value group and the minimum value group must be the maximum and minimum values of the nine-pixel values, the maximum value in the median group is at least 5 pixels, and the minimum value is less than 5 pixels. If the median in the maximum group is at least 5 pixels, and the median in the minimum group is less than 5 pixels, then(1)Maxmin=minMax0,Max1,Max2,Medmed=medMed0,Med1,Med2,Minmax=maxMin0,Min1,Min2,Winmed=medMaxmin,Medmed,Minmax,and with this algorithm, the number of median calculations is nearly twice as much as that of the traditional algorithm, and it is very suitable for image smoothing in video sequence.


## 2.1.2. Image Binarization

Among many image segmentation methods, binarization is a simple and effective method. The purpose of binarization of image [15–17] is to separate the moving object from the background in the image and to provide the basis for the subsequent classification, detection, and recognition. Set the input image as gx,y and the output image as gbx,y; then,(2)gbx,y=1,gx,y≥T,0,gx,y<T,where T represents the threshold of binary processing. In actual processing, the background is represented by 255 and the moving object is represented by 0. The process of binarization is relatively simple, and the key problem is the selection method of binarization. In this paper, the OTSU algorithm is used to improve the selection of binarization image threshold.


## 2.2. Research on Soccer Location Detection

Hough transform essentially transforms the spatial domain of an image into a parametric space and describes the curve of an image in a parametric form satisfied by most of the pixels. In the process of geometric image detection, standard Hough transform (SHT) requires the following steps to achieve detection [18–21]:(1)
Allocate buffer: the process is to allocate the parameter buffer to prepare the mapping.(2)
Parameter space transformation: the feature points are scanned, and each feature point satisfying a specific relationship corresponds to the parameter space.(3)
Accumulation and storage: the image parameters satisfying the specific relationship are accumulated and stored, and the pixels satisfying the specific relationship in the image space are added together.(4)
The location of the largest point on the plane of the location parameter, which is the parameter of the image on the original image.The equation of known circle is(3)x−g2+y−h2=r2,where g,h is the center of a circle and r is the radius. The formula represents the equation of the circle. Because it is in the image space, the point x,y is regarded as an unknown number, and the center g,h and radius r are regarded as known numbers. If the image in image space coordinate system x−y is mapped to three-dimensional parametric space g−h−r, the equation of circle in parametric space is as follows:(4)g−x2+h−y2=r2.In the parameter space, the known and unknown parameters are reversed, the coordinate information of the feature pointsx,y becomes known, and the corresponding center g,h and radius r are unknown. After transformation, each effective feature point x,y in the image space corresponds to a cone in the parameter space one by one. Different points on the same circle in the image space correspond to the same point of intersection of cones in the parameter space. This process records the number of repeated points with the same parameters by initializing a three-dimensional accumulator in the parameter space. The expression is as follows:(5)Ag,h,r=Ag,h,r+1,where Ag,h,r represents a three-dimensional accumulator, counting every three-element array g,h,r and accumulating the results. By setting a threshold, when the value of the accumulator exceeds the threshold, the point is considered to be the center coordinate of the circle in the image space.After preprocessing the video frame, the Hough transform is realized. However, directly using SHT to perform loop detection on an image requires mapping the pixels of the entire image into the parameter space and then making judgments point by point, which affects the efficiency and accuracy of the algorithm. Therefore, the basic idea of this paper is to replace multiple loops with multidimensional arrays while reducing the dimensionality of the accumulator. At this point, we need to know the radius of the circle to be detected; that is, the circle radiusr must fall in the range of rmin,rmax. It is known that, in the image space, the circle can have the following parameter expression:(6)x=g+rcosθ,y=h+rsinθ.Symbolθ is the angle between the point x,y and the line of the point and the x-axis. The corresponding point in the image space is mapped to the parameter space, and the formula of the circle is as follows:(7)a=g−rcosθ,b=h−rsinθ.The specific steps for improvement are as follows:(1)
After the image is preprocessed, the initial Hough array matrix in the pixel space is used to set the initial variables, and according to the actual position of the circle, it is determined that its radius isrmin,rmax, and the step length is θ.(2)
According to the parametric formula (5), the value of calculation a,b is set as a nonnegative integer, and the valid value is recorded to determine the index value of the Hough array.(3)
Hough arrays are constructed according to Hough index values, which are mainly realized by accumulators. At this time, the number of layers of the arrays isrmin−rmax.(4)
In the Hough array, the layer with the largest accumulative value is found, which corresponds to the circle with the largest number of pixels in the image space, and the corresponding radius of the array is the radiusr of the circle.(5)
The center of the circle is obtained. The mean value of all thea,b in the maximum value layer is the center of the circle.


## 2.3. Research on Soccer Tracking Algorithm

In this paper, based on the good performance of SIFT algorithm in feature matching, a football tracking algorithm based on SIFT feature matching is proposed, which matches the detected football with the sample football. Firstly, SIFT feature points need to be extracted. The details are as follows:


### 2.3.1. Detection of Extreme Points in Scale Space

In scale space, the concept of local extreme contains two meanings: one is image space extreme; that is, the extreme points are local extreme points in 9 points of3×3 neighborhood on the same level; the other is scale-space extreme, that is, the local extreme points of 27 points in the neighborhood 3×3 of the point and its corresponding points in two adjacent layers. To sum up, the extraction steps of scale-space extreme points are as follows.Step 1.
The input imageIp,q is convoluted with the Gauss function Gp,q,σ to generate the corresponding scale space Lp,q,σ, which is represented by a Gauss pyramid.Step 2.
Subtract the two adjacent layers of the Gauss Pyramid to generate the Gauss differential PyramidDp,q,σ.Step 3.
In the Gaussian difference pyramid, the maximum or minimum point in the neighborhood of the same layer3×3 and the neighborhood of the adjacent layer 3×3 is detected.


### 2.3.2. Precise Location of Key Points

The image data stored by computer are discrete pixel value, but the extreme point of discrete data may not be the extreme point of real continuous space. Therefore, it is necessary to fit the DOG function in scale space with a three-dimensional quadratic curve, so that the extremum points can be accurately located at subpixel level. For a general differentiable function, the extreme point is the point whose first derivative is 0. So the Taylor expansion of Gauss difference function DOG in scale space is as follows:(8)DP=D+∂DT∂PP+12PT∂2DT∂P2P.Solve the derivative, and let∂Dp/∂P=0; then, the maximum point obtained in the image row, column, and scale of the three directions offset is(9)P^=∂DT∂P∂2DT∂P2.Since the DOG function is expanded at the origin of the extreme pointP=p,q,σ, the range of offset in three directions is found to be between 0 and 1. Formula (5) is substituted into formula (4):(10)DP^=D+12∂DT∂PP^.Lowe’s experiment shows that, for the extreme point ofDP^<0.3, it is considered as an unstable candidate with low contrast and is eliminated.In order to obtain stable subpixel accurate positioning coordinates of key points, the following positioning criteria are adopted in this paper:(1)
If the three components ofP^ (i.e., the offset in the row, column, and scale directions of the image) are less than 0.5, then the point is regarded as the extreme point, and the noninteger coordinate value after the offset is taken as the precise positioning coordinate of the key point.(2)
If a component is greater than or equal to 0.5, it means that the real extreme point is closer to the detection point of another integer; then the coordinates of the extreme point in this direction are moved to an integer coordinate value in the offset direction.(3)
Repeat the above operations (Taylor expansion and offset calculation) until the offset of a detection point is found to satisfy three component values less than 0.5. The number of repeated operations is not greater than 5; otherwise, it is considered unstable.For two-dimensional discrete data images, the key points of the Hessian matrix are(11)K=DppDpqDpqDqq.The derivative is estimated by the difference between adjacent sampling points; that is,Dpp=Ip,q+1+Ip,q−1−2∗Ip,qDqq=Ip,q+1+Ip−1,q−2∗Ip,q,Dpq=Ip+1,q+1−Ip+1,q−1−Ip−1,q+1+Ip−1,q−1/4, Ip,q represents the size of the pixel value at coordinate p,q.α is a larger eigenvalue of K and β is a smaller eigenvalue. For the two-order matrix K, the trace of the matrix is(12)TrK=Dpp+Dqq=α+β.The determinant of the matrix is(13)DetK=DppDqq−Dpq2=αβ.In order to avoid directly calculating these eigenvalues, we only consider the ratio between them to represent the ratio of the principal curvature of the extreme point. Letr=α/β; then,(14)TrK2DetK=α+β2αβ=r+12r.It can be seen that the upper form reaches the minimum when the eigenvalues ofα and β are equal and increases with the increase of r. So the intensity of the edge response can be expressed by the size of formula 10. The larger the value, the stronger the edge response. Lowe recommends that the value of r be 10. When the Hessian matrix of the extreme point satisfies TrK2/DetK<r+12/r,r=10, the extreme point is retained; otherwise, it is considered to be the extreme value of the edge response which is easy to be affected by noise and so on.


### 2.3.3. Key Point Assignment

The direction of the feature points will be used in the key point descriptor, so the characteristics of the feature points need to be described. We assign a direction to each feature point. The gradient direction distribution of the neighborhood pixels of the key points is used to assign direction parameters to each key point, so that the operator has rotation invariance.(15)mp,q=Lp+1,q−Lp−1,q2+Lp,q+1−Lp,q−12,θp,q=arctanLp,q+1−Lp,q−1Lp+1,q−Lp−1,q.Formulas (11) and (12) are the formulas for the modulus and direction of gradient at p,q. The scale used by L is the scale of each key point.In practical calculation, when the direction is the weight and the gradient is the weight value, for the convenience of calculation and statistics, we use 0.5 as the dividing line to take integers to both sides of the radian direction angle which exists in decimal form. For example, 1.25 takes 1 and 2.75 takes 3. With this method, the angles can be grouped into 8 arrays of 0–7, and the corresponding gradient values can be added up as the important data for subsequent calculation and matching.


### 2.3.4. Generating Key Points Descriptors

After obtaining the local feature points, the key step is to use the local feature points to describe the information of the surrounding area, which can reduce the impact of the key points by perspective, rotation, illumination, and so on. By assigning the direction of the key points, we have been able to get the main direction of the key points. Then we rotate the region to the main direction within a certain radius with the key point as the center of the circle, so that the key point has rotation invariance. When describing, the region is divided into4∗4 subregions. In each subregion, the gradient histogram of 8 directions is used to make statistics. From this, a descriptor of 4∗4∗8=128 dimension is formed. We call this descriptor of 128 dimensions a SIFT descriptor.After extracting SIFT feature points, in order to determine whether a sample in the tracking sample set is the same target as the football detected in the current frame, this paper uses the matching degree of the two to measure, that is, matching degree. Assuming that the tracking sampleMik has N1 SIFT feature points and the target detected in the k+1 frame image has N2 SIFT feature points. The matching point pair of the SIFT features is N, and the matching degree rate is calculated according to the following formula:(16)Rate=NmaxN1,N2.According to whether the matching degree is greater than the matching thresholdTR, the current detection target and the corresponding sample are tracked for the same target. Dice similarity coefficient calculation formula is as follows:(17)DICE=2SEG∩GTSEG+GT,y=αWy+β1X−Wβ2X+ε,lngdpit=a0+a1du∗dt+∑i=1NbjXu+εu.Video coefficient calculation formula is as follows:(18)SEN=SEG∩GTGT,lssim=1−2μxμy+C12σxy+C2μx2+μy2+C1σx2+σy2+C2,ψ=∑x=1θVx=∑x=1ϑWx∑1nWℑSx.VOE coefficient calculation formula is as follows:(19)VOE=1−SEG∩GTSEG∪GT,U2=s−p1−kx2,x−p2−k1−x2.RVD coefficient calculation formula is as follows:(20)RVD=100%×1−SEG−GTGT.When Dice, Jaccard, and SEN are close to 1, it means that the segmentation result is closer to the expert annotated image; when RVD and VOE are close to 0, it means that the segmentation error is small or there is basically no segmentation error. Among them, Dice is used to express the similarity between the network segmentation map and the expert's annotation map, and it is a very important segmentation image evaluation coefficient.


## 2.3.1. Detection of Extreme Points in Scale Space

In scale space, the concept of local extreme contains two meanings: one is image space extreme; that is, the extreme points are local extreme points in 9 points of3×3 neighborhood on the same level; the other is scale-space extreme, that is, the local extreme points of 27 points in the neighborhood 3×3 of the point and its corresponding points in two adjacent layers. To sum up, the extraction steps of scale-space extreme points are as follows.Step 1.
The input imageIp,q is convoluted with the Gauss function Gp,q,σ to generate the corresponding scale space Lp,q,σ, which is represented by a Gauss pyramid.Step 2.
Subtract the two adjacent layers of the Gauss Pyramid to generate the Gauss differential PyramidDp,q,σ.Step 3.
In the Gaussian difference pyramid, the maximum or minimum point in the neighborhood of the same layer3×3 and the neighborhood of the adjacent layer 3×3 is detected.


## 2.3.2. Precise Location of Key Points

The image data stored by computer are discrete pixel value, but the extreme point of discrete data may not be the extreme point of real continuous space. Therefore, it is necessary to fit the DOG function in scale space with a three-dimensional quadratic curve, so that the extremum points can be accurately located at subpixel level. For a general differentiable function, the extreme point is the point whose first derivative is 0. So the Taylor expansion of Gauss difference function DOG in scale space is as follows:(8)DP=D+∂DT∂PP+12PT∂2DT∂P2P.Solve the derivative, and let∂Dp/∂P=0; then, the maximum point obtained in the image row, column, and scale of the three directions offset is(9)P^=∂DT∂P∂2DT∂P2.Since the DOG function is expanded at the origin of the extreme pointP=p,q,σ, the range of offset in three directions is found to be between 0 and 1. Formula (5) is substituted into formula (4):(10)DP^=D+12∂DT∂PP^.Lowe’s experiment shows that, for the extreme point ofDP^<0.3, it is considered as an unstable candidate with low contrast and is eliminated.In order to obtain stable subpixel accurate positioning coordinates of key points, the following positioning criteria are adopted in this paper:(1)
If the three components ofP^ (i.e., the offset in the row, column, and scale directions of the image) are less than 0.5, then the point is regarded as the extreme point, and the noninteger coordinate value after the offset is taken as the precise positioning coordinate of the key point.(2)
If a component is greater than or equal to 0.5, it means that the real extreme point is closer to the detection point of another integer; then the coordinates of the extreme point in this direction are moved to an integer coordinate value in the offset direction.(3)
Repeat the above operations (Taylor expansion and offset calculation) until the offset of a detection point is found to satisfy three component values less than 0.5. The number of repeated operations is not greater than 5; otherwise, it is considered unstable.For two-dimensional discrete data images, the key points of the Hessian matrix are(11)K=DppDpqDpqDqq.The derivative is estimated by the difference between adjacent sampling points; that is,Dpp=Ip,q+1+Ip,q−1−2∗Ip,qDqq=Ip,q+1+Ip−1,q−2∗Ip,q,Dpq=Ip+1,q+1−Ip+1,q−1−Ip−1,q+1+Ip−1,q−1/4, Ip,q represents the size of the pixel value at coordinate p,q.α is a larger eigenvalue of K and β is a smaller eigenvalue. For the two-order matrix K, the trace of the matrix is(12)TrK=Dpp+Dqq=α+β.The determinant of the matrix is(13)DetK=DppDqq−Dpq2=αβ.In order to avoid directly calculating these eigenvalues, we only consider the ratio between them to represent the ratio of the principal curvature of the extreme point. Letr=α/β; then,(14)TrK2DetK=α+β2αβ=r+12r.It can be seen that the upper form reaches the minimum when the eigenvalues ofα and β are equal and increases with the increase of r. So the intensity of the edge response can be expressed by the size of formula 10. The larger the value, the stronger the edge response. Lowe recommends that the value of r be 10. When the Hessian matrix of the extreme point satisfies TrK2/DetK<r+12/r,r=10, the extreme point is retained; otherwise, it is considered to be the extreme value of the edge response which is easy to be affected by noise and so on.


## 2.3.3. Key Point Assignment

The direction of the feature points will be used in the key point descriptor, so the characteristics of the feature points need to be described. We assign a direction to each feature point. The gradient direction distribution of the neighborhood pixels of the key points is used to assign direction parameters to each key point, so that the operator has rotation invariance.(15)mp,q=Lp+1,q−Lp−1,q2+Lp,q+1−Lp,q−12,θp,q=arctanLp,q+1−Lp,q−1Lp+1,q−Lp−1,q.Formulas (11) and (12) are the formulas for the modulus and direction of gradient at p,q. The scale used by L is the scale of each key point.In practical calculation, when the direction is the weight and the gradient is the weight value, for the convenience of calculation and statistics, we use 0.5 as the dividing line to take integers to both sides of the radian direction angle which exists in decimal form. For example, 1.25 takes 1 and 2.75 takes 3. With this method, the angles can be grouped into 8 arrays of 0–7, and the corresponding gradient values can be added up as the important data for subsequent calculation and matching.


## 2.3.4. Generating Key Points Descriptors

After obtaining the local feature points, the key step is to use the local feature points to describe the information of the surrounding area, which can reduce the impact of the key points by perspective, rotation, illumination, and so on. By assigning the direction of the key points, we have been able to get the main direction of the key points. Then we rotate the region to the main direction within a certain radius with the key point as the center of the circle, so that the key point has rotation invariance. When describing, the region is divided into4∗4 subregions. In each subregion, the gradient histogram of 8 directions is used to make statistics. From this, a descriptor of 4∗4∗8=128 dimension is formed. We call this descriptor of 128 dimensions a SIFT descriptor.After extracting SIFT feature points, in order to determine whether a sample in the tracking sample set is the same target as the football detected in the current frame, this paper uses the matching degree of the two to measure, that is, matching degree. Assuming that the tracking sampleMik has N1 SIFT feature points and the target detected in the k+1 frame image has N2 SIFT feature points. The matching point pair of the SIFT features is N, and the matching degree rate is calculated according to the following formula:(16)Rate=NmaxN1,N2.According to whether the matching degree is greater than the matching thresholdTR, the current detection target and the corresponding sample are tracked for the same target. Dice similarity coefficient calculation formula is as follows:(17)DICE=2SEG∩GTSEG+GT,y=αWy+β1X−Wβ2X+ε,lngdpit=a0+a1du∗dt+∑i=1NbjXu+εu.Video coefficient calculation formula is as follows:(18)SEN=SEG∩GTGT,lssim=1−2μxμy+C12σxy+C2μx2+μy2+C1σx2+σy2+C2,ψ=∑x=1θVx=∑x=1ϑWx∑1nWℑSx.VOE coefficient calculation formula is as follows:(19)VOE=1−SEG∩GTSEG∪GT,U2=s−p1−kx2,x−p2−k1−x2.RVD coefficient calculation formula is as follows:(20)RVD=100%×1−SEG−GTGT.When Dice, Jaccard, and SEN are close to 1, it means that the segmentation result is closer to the expert annotated image; when RVD and VOE are close to 0, it means that the segmentation error is small or there is basically no segmentation error. Among them, Dice is used to express the similarity between the network segmentation map and the expert's annotation map, and it is a very important segmentation image evaluation coefficient.


## 3. Experiments

In this paper, SIFT algorithm is used to track football, but now there are many SIFT algorithm derivatives, whose performance is not inferior to SIFT algorithm, such as PCA-SIFT, GLOH, and SURF. In this paper, the performance comparison of four algorithms is given, and the reason why SIFT algorithm is chosen to track football is explained by comparison. The performance comparison results are shown in Table2.Table 2
Performance comparison of four algorithms.
SIFT algorithmPCA-SIFT algorithmGLOH algorithmSURF algorithmAntiscaleGoodPreferablyGoodCommonlyAntirotationGoodPreferablyGoodCommonlyAntilightCommonlyPreferablyCommonlyGoodAntiaffinePreferablyPreferablyPreferablyCommonlyTime efficiencyCommonlyCommonlyCommonlyGoodUniversalityGoodCommonlyCommonlyGoodBecause the projection matrix of each generation descriptor must have a set of representative and similar image learning in advance, the generated projection rectangle is only valid for the same type of image key descriptor. As a result, the applicability of PCA-SIFT is far less than that of SIFT algorithm, and the formation of SIFT descriptor has nothing to do with image type, which is suitable for almost all images and easy to form and develop. In GLOH algorithm, because it also uses PCA technology to reduce the dimension of the feature vector, it also needs to obtain the projection matrix through representative image learning in advance. The function of the algorithm is not strong. The time efficiency of sift-sift is slightly better than that of PCA-SIFT. In the implementation of SURF algorithm, integral image and box filter are used to approximate the Gauss Laplace transform, which leads to the loss of image details. As a result, the uniqueness of the descriptor of the neighborhood information of the interest point is much worse than that of the SIFT descriptor, which leads to the poor matching effect and the processing ability of the complex scene cannot meet the requirements. Based on the above analysis, SIFT algorithm is applied to real-time video tracking of football match.


## 4. Discussion

Before the simulation experiment in this paper, we need to preprocess the video frame object to enhance the image feature information. Firstly, the image is grayed, and the result is shown in Figure1, where Figure 1(a) is the original image and Figure 1(b) is the result of graying. From Figure 1, we can see that the image information is basically preserved, but the image is dimensionality reduced from three dimensions to two dimensions.Figure 1
Grayscale processing. (a) Original image. (b) Grayscale image.
(a)(b)As shown in Table3, in this paper, we improve the traditional median filter processing, effectively save processing time, and enhance the processing results. It is helpful for image detection and tracking in the later stage of football. In this paper, we simulate and analyze the gray image with Gauss noise. The original pixels, probability output, pixel prediction, and output pixels of the three colors of red, blue, and yellow are, respectively, given in the table. It can be seen that the probability of yellow is the highest at 92%, while the original pixels, predicted pixels, and output pixels of yellow are the lowest at 280, 8%, and 390, respectively.Table 3
Gaussian noise simulation and analysis of grayscale images.
ColorRaw pixelsProbability output (%)Pixel prediction (%)Output pixelRed2908515450Blue3107723420Yellow280928390As can be seen from Figure2, the improved median filter noise processing proposed can effectively restore the gray image information. Avoid noise effects during processing.Figure 2
Comparison of video effects after image processing.As can be seen from Table4, the data information is blurred after adding Gauss noise, which is disadvantageous to the subsequent image processing. Although the traditional median filter has a certain effect on noise filtering with Gauss noise image, the effect is not obvious.Table 4
The traditional median filter processing.
MedianFilteringDenoiseDimensionsA-treatmentGrayscale48.576.1112.799.266.3Processing56.871.467.386.392.6Simulate91.289.888.676.763.4Tracking63.249.399.649.332.3Football82.449.391.339.591.3As can be seen from Table5, we use the traditional median filter to denoise and the improved median filter to denoise. The results are shown in Figure 3. Figure 3(a) is the grayscale image, Figure 3(b) is the image after adding Gauss noise, Figure 3(c) is the result of traditional median filtering, and Figure 3(d) is the result of improved median filtering in this paper.Table 5
Comparison of denoising effects between traditional median filter and improved median filter.
NumberClear (%)Carry out (%)Accurate prediction (%)ReliableA928094YB897672NC757484YD887990YFigure 3
Filtering processing of grayscale image. (a) Grayscale image, (b) adding Gauss noise, (c) traditional median filtering processing, and (d) improved median filtering processing.
(a)(b)(c)(d)Image binarization processing results are shown in Figure3. It can be seen that the image after the binarization process has less data calculation and the sensitive area of the image is obviously prominent. This shows that reducing the gray level of the entire image to a two-valued dimension can greatly simplify the subsequent feature extraction algorithm. The results are shown in Figure 4.Figure 4
Binary processing after filtering. (a) Filtered result graph. (b) Binary processing result graph.
(a)(b)After the preprocessing results, first of all, the football detection is simulated to illustrate the performance of the proposed football detection algorithm. In this paper, Hough transform is used to detect the location of football. According to the characteristics of football, Hough transform is improved. The Hough transform before and after the improvement is used to detect football. The number of times is 100. The average comparison of the results is shown in Table6.Table 6
Comparison of test results before and after Hough improvement.
Football radiusAverage accuracy rate (%)Average detection time (s)Standard Hough1190.14.1Improved Hough1193.51.5As can be seen from Figure5, based on the good performance of SIFT algorithm in feature matching, a football tracking algorithm based on SIFT feature matching is proposed, which matches the detected football with the sample football. The football tracking algorithm designed in this paper is compared with other methods such as optical flow method and background modeling method. As can be seen from Table 7, the football tracking in video is 100 times and the average is obtained.Figure 5
Comparison of class algorithms HTCL and OEA.Table 7
Comparison and analysis of several tracking methods.
Football radiusAverage tracking accuracy (%)Average tracking time (s)Optical flow1186.70.78Background modeling method1188.11.25Method of this paper1192.90.21As can be seen from Figure6, the tracking accuracy is 6.2% higher than that of the optical flow method and 4.8% higher than that of the background modeling method. As shown in Table 8, the tracking time is 0.57 s shorter than that of the optical flow method and 1.04 s shorter than that of the background modeling method.Figure 6
The performance of the proposed football detection algorithm.Table 8
The influence of redundant information in video on computational efficiency.
ItemAlgorithm proposedMethod proposedVerifiedSubsetsVideo sequence148.576.1112.799.275.9256.871.467.386.375.2391.289.888.676.779.848384.975.74084.4560302076.120684.88483.679.282.2As shown in Figure7, in order to verify the effectiveness of the algorithm proposed in this paper, the method proposed in this paper is verified on the data set. As shown in Table 9, the data set contains a total of two subsets, each of which contains a training video sequence and a test video sequence.Figure 7
Test video sequence contains one or more abnormal events.Table 9
Judge abnormalities in the region of interest in the video.
Pic2GenomicDescriptiveRadiologistImagingLipoma4.32.422.822.92Diversity impact2.54.424.184.3L-conditions3.51.835.455.41Tumor4.52.824.835.44Treatment2.92.983.451.23.38As shown in Figure8, the shooting scene this time is on the campus walkway, and the training video sequence is shown in Table 10, All events are normal events, each test video sequence contains one or more abnormal events, and frame level and pixel level are provided.Figure 8
Incorporating appearance features to further improve the scope.Table 10
Test results of each method on UsED2 subset.
ItemLate relapsePatient survival rateEarly relapse patientsLipoma patientsAblation therapyEarly4.32.423.73.4Timely2.54.425.66.5Improve3.51.836.43.4Effective4.52.854.39.2Predict5.92.66.41.93.7Relapse3.84.62.69.26.21The test results are shown in Figure10, and the histogram is drawn as shown in Figure 9. Combining Figures 10 and 9, we can see that the soccer tracking algorithm based on SIFT feature matching in this paper is superior to the existing optical flow method and background modeling method in both tracking accuracy and tracking time.Figure 9
Bar graph of comparative analysis of several tracking methods.
(a)(b)Figure 10
Test results of each method on the subset.


## 5. Conclusions

With the rapid development of multimedia information, the research on video data processing has higher theoretical significance and commercial value. This paper takes the most watched football video among sports videos as the analysis object. The football detection and tracking algorithm in football video is studied, and the football video image is analyzed in real time. In order to achieve enhanced display of mobile devices based on real-time image analysis, this paper designs a football detection method based on improved Hough changes and a method based on SIFT features after preprocessing the image gray image denoising and image binarization. In the simulation experiment, image preprocessing, football detection, and football tracking were analyzed, respectively. The results show the effectiveness and superiority of the improved Hough change football detection method and the football tracking algorithm based on SIFT feature matching. This also shows that the proposed football detection and tracking algorithm is suitable for real-time football monitoring and tracking [22].



---

*Source: 9963524-2021-06-09.xml*