SYSTEM AND METHOD FOR PLAYER REIDENTIFICATION IN BROADCAST VIDEO

Abstract

A system and method of re-identifying players in a broadcast video feed are provided herein. A computing system retrieves a broadcast video feed for a sporting event. The broadcast video feed includes a plurality of video frames. The computing system generates a plurality of tracks based on the plurality of video frames. Each track includes a plurality of image patches associated with at least one player. Each image patch of the plurality of image patches is a subset of the corresponding frame of the plurality of video frames. For each track, the computing system generates a gallery of image patches. A jersey number of each player is visible in each image patch of the gallery. The computing system matches, via a convolutional autoencoder, tracks across galleries. The computing system measures, via a neural network, a similarity score for each matched track and associates two tracks based on the measured similarity.

Description

FIELD OF THE DISCLOSURE

The present disclosure generally relates to system and method for player reidentification in broadcast video.

BACKGROUND

Player tracking data has been implemented for a number of years in a number of sports for both team and player analysis. Conventional player tracking systems, however, require sports analytics companies to install fixed cameras in each venue in which a team plays. This constraint has limited the scalability of player tracking systems, as well as limited data collection to currently played matches. Further, such constraint provides a significant cost to sports analytics companies due to the costs associated with installing hardware in the requisite arenas, as well as maintaining such hardware.

SUMMARY

In some embodiments, a method of re-identifying players in a broadcast video feed is disclosed herein. A computing system retrieves a broadcast video feed for a sporting event. The broadcast video feed includes a plurality of video frames. The computing system generates a plurality of tracks based on the plurality of video frames. Each track includes a plurality of image patches associated with at least one player. Each image patch of the plurality of image patches is a subset of the corresponding frame of the plurality of video frames. For each track, the computing system generates a gallery of image patches. A jersey number of each player is visible in each image patch of the gallery. The computing system matches, via a convolutional autoencoder, tracks across galleries. The computing system measures, via a neural network, a similarity score for each matched track. The computing system associates two tracks based on the measured similarity.

In some embodiments, a system for re-identifying players in a broadcast video feed is disclosed herein. The system includes a processor and a memory. The memory has programming instructions stored thereon, which, when executed by the processor, performs one or more operations. The one or more operations include retrieving a broadcast video feed for a sporting event. The broadcast video feed includes a plurality of video frames. The one or more operations further include generating a plurality of tracks based on the plurality of video frames. Each track includes a plurality of image patches associated with at least one player. Each image patch of the plurality of image patches is a subset of the corresponding frame of the plurality of video frames. The one or more operations further include generating, for each track, a gallery of image patches. A jersey number of each player is visible in each image patch of the gallery. The one or more operations further include matching, via a convolutional autoencoder, tracks across galleries. The one or more operations further include measuring, via a neural network, a similarity score for each matched track. The one or more operations further include associating two tracks based on the measured similarity.

In some embodiments, a non-transitory computer readable medium is disclosed herein. The non-transitory computer readable medium includes one or more sequences of instructions that, when executed by one or more processors, perform one or more operations. The one or more operations include retrieving a broadcast video feed for a sporting event. The broadcast video feed includes a plurality of video frames. The one or more operations further include generating a plurality of tracks based on the plurality of video frames. Each track includes a plurality of image patches associated with at least one player. Each image patch of the plurality of image patches is a subset of the corresponding frame of the plurality of video frames. The one or more operations further include generating, for each track, a gallery of image patches. A jersey number of each player is visible in each image patch of the gallery. The one or more operations further include matching, via a convolutional autoencoder, tracks across galleries. The one or more operations further include measuring, via a neural network, a similarity score for each matched track. The one or more operations further include associating two tracks based on the measured similarity.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above recited features of the present disclosure can be understood in detail, a more particular description of the disclosure, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrated only typical embodiments of this disclosure and are therefore not to be considered limiting of its scope, for the disclosure may admit to other equally effective embodiments.

FIG. 1 is a block diagram illustrating a computing environment, according to example embodiments.

FIG. 2 is a block diagram illustrating a computing environment, according to example embodiments.

FIG. 3 is a block diagram illustrating aspects of operations discussed above and below in conjunction with FIG. 2 and FIGS. 4-10, according to example embodiments.

FIG. 4 is a flow diagram illustrating a method of generating player tracks, according to example embodiments.

FIG. 5 is a flow diagram illustrating a method of generating trackable frames, according to example embodiments.

FIG. 6 is a block diagram illustrating aspects of operations discussed above in conjunction with FIG. 5, according to example embodiments.

FIG. 7 is a flow diagram illustrating a method of calibrating a camera for each trackable frame, according to example embodiments.

FIG. 8 is a block diagram illustrating aspects of operations discussed above in conjunction with FIG. 7, according to example embodiments.

FIG. 9 is a flow diagram illustrating a method of tracking players, according to example embodiments.

FIG. 10 is a flow diagram illustrating a method of tracking players, according to example embodiments.

FIG. 11 is a block diagram illustrating aspects of operations discussed above in conjunction with FIG. 10, according to example embodiments.

FIG. 12 is a block diagram illustrating architecture of re-identification agent, according to example embodiments.

FIG. 13A is a block diagram illustrating a computing device, according to example embodiments.

FIG. 13B is a block diagram illustrating a computing device, according to example embodiments.

To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures. It is contemplated that elements disclosed in one embodiment may be beneficially utilized on other embodiments without specific recitation.

DETAILED DESCRIPTION

In the last decade, vision-based tracking systems have been widely deployed in many professional sports leagues to capture the positional information of players in a match. This data may be used to generate fine-grained trajectories which are valuable for coaches and experts to analyze and train their players. Although players can be detected quite well in every frame, an issue arises in conventional systems due to the amount of manual annotation needed from gaps between player trajectories. The majority of these gaps may be caused by player occlusion or players wandering out-of-scene.

One or more techniques disclosed herein improve upon conventional systems by providing a system capable of generating fine-grained player trajectories despite player occlusion or the player wandering out-of-scene. For example, one or more techniques disclosed herein may be directed to operations associated with recognizing and associating a person at different physical locations overtime, after that person had been previously observed elsewhere. The problem solved by the techniques described herein are compounded in the domain of team sports because, unlike ordinary surveillance, players' appearances are not discriminative. The techniques described herein overcome this challenge by leveraging player jersey (or uniform) information to aid in identifying players. However, because players constantly change their orientations during the course of the game, simply using jersey information is not a trivial task. To accurately identify player trajectories, the present system may identify frames of video with visible jersey numbers and may associate identities using a deep neural network.

FIG. 1 is a block diagram illustrating a computing environment 100, according to example embodiments. Computing environment 100 may include camera system 102, organization computing system 104, and one or more client devices 108 communicating via network 105.

Network 105 may be of any suitable type, including individual connections via the Internet, such as cellular or Wi-Fi networks. In some embodiments, network 105 may connect terminals, services, and mobile devices using direct connections, such as radio frequency identification (RFID), near-field communication (NFC), Bluetooth™, low-energy Bluetooth™ (BLE), Wi-Fi™ ZigBee™, ambient backscatter communication (ABC) protocols, USB, WAN, or LAN. Because the information transmitted may be personal or confidential, security concerns may dictate one or more of these types of connection be encrypted or otherwise secured. In some embodiments, however, the information being transmitted may be less personal, and therefore, the network connections may be selected for convenience over security.

Network 105 may include any type of computer networking arrangement used to exchange data or information. For example, network 105 may be the Internet, a private data network, virtual private network using a public network and/or other suitable connection(s) that enables components in computing environment 100 to send and receive information between the components of environment 100.

Camera system 102 may be positioned in a venue 106. For example, venue 106 may be configured to host a sporting event that includes one or more agents 112. Camera system 102 may be configured to capture the motions of all agents (i.e., players) on the playing surface, as well as one or more other objects of relevance (e.g., ball, referees, etc.). In some embodiments, camera system 102 may be an optically-based system using, for example, a plurality of fixed cameras. For example, a system of six stationary, calibrated cameras, which project the three-dimensional locations of players and the ball onto a two-dimensional overhead view of the court may be used. In another example, a mix of stationary and non-stationary cameras may be used to capture motions of all agents on the playing surface as well as one or more objects of relevance. As those skilled in the art recognize, utilization of such camera system (e.g., camera system 102) may result in many different camera views of the court (e.g., high sideline view, free-throw line view, huddle view, face-off view, end zone view, etc.). Generally, camera system 102 may be utilized for the broadcast feed of a given match. Each frame of the broadcast feed may be stored in a game file 110.

Camera system 102 may be configured to communicate with organization computing system 104 via network 105. Organization computing system 104 may be configured to manage and analyze the broadcast feed captured by camera system 102. Organization computing system 104 may include at least a web client application server 114, a data store 118, an auto-clipping agent 120, a data set generator 122, a camera calibrator 124, a player tracking agent 126, and an interface agent 128. Each of auto-clipping agent 120, data set generator 122, camera calibrator 124, player tracking agent 126, and interface agent 128 may be comprised of one or more software modules. The one or more software modules may be collections of code or instructions stored on a media (e.g., memory of organization computing system 104) that represent a series of machine instructions (e.g., program code) that implements one or more algorithmic steps. Such machine instructions may be the actual computer code the processor of organization computing system 104 interprets to implement the instructions or, alternatively, may be a higher level of coding of the instructions that is interpreted to obtain the actual computer code. The one or more software modules may also include one or more hardware components. One or more aspects of an example algorithm may be performed by the hardware components (e.g., circuitry) itself, rather as a result of the instructions.

Data store 118 may be configured to store one or more game files 124. Each game file 124 may include the broadcast data of a given match. For example, the broadcast data may a plurality of video frames captured by camera system 102.

Auto-clipping agent 120 may be configured parse the broadcast feed of a given match to identify a unified view of the match. In other words, auto-clipping agent 120 may be configured to parse the broadcast feed to identify all frames of information that are captured from the same view. In one example, such as in the sport of basketball, the unified view may be a high sideline view. Auto-clipping agent 120 may clip or segment the broadcast feed (e.g., video) into its constituent parts (e.g., difference scenes in a movie, commercials from a match, etc.). To generate a unified view, auto-clipping agent 120 may identify those parts that capture the same view (e.g., high sideline view). Accordingly, auto-clipping agent 120 may remove all (or a portion) of untrackable parts of the broadcast feed (e.g., player close-ups, commercials, half-time shows, etc.). The unified view may be stored as a set of trackable frames in a database.

Data set generator 122 may be configured to generate a plurality of data sets from the trackable frames. In some embodiments, data set generator 122 may be configured to identify body pose information. For example, data set generator 122 may utilize body pose information to detect players in the trackable frames. In some embodiments, data set generator 122 may be configured to further track the movement of a ball or puck in the trackable frames. In some embodiments, data set generator 122 may be configured to segment the playing surface in which the event is taking place to identify one or more markings of the playing surface. For example, data set generator 122 may be configured to identify court (e.g., basketball, tennis, etc.) markings, field (e.g., baseball, football, soccer, rugby, etc.) markings, ice (e.g., hockey) markings, and the like. The plurality of data sets generated by data set generator 122 may be subsequently used by camera calibrator 124 for calibrating the cameras of each camera system 102.

Camera calibrator 124 may be configured to calibrate the cameras of camera system 102. For example, camera calibrator 124 may be configured to project players detected in the trackable frames to real world coordinates for further analysis. Because cameras in camera systems 102 are constantly moving in order to focus on the ball or key plays, such cameras are unable to be pre-calibrated. Camera calibrator 124 may be configured to improve or optimize player projection parameters using a homography matrix.

Player tracking agent 126 may be configured to generate tracks for each player on the playing surface. For example, player tracking agent 126 may leverage player pose detections, camera calibration, and broadcast frames to generate such tracks. In some embodiments, player tracking agent 126 may further be configured to generate tracks for each player, even if, for example, the player is currently out of a trackable frame. For example, player tracking agent 126 may utilize body pose information to link players that have left the frame of view.

Interface agent 128 may be configured to generate one or more graphical representations corresponding to the tracks for each player generated by player tracking agent 126. For example, interface agent 128 may be configured to generate one or more graphical user interfaces (GUIs) that include graphical representations of player tracking each prediction generated by player tracking agent 126.

Client device 108 may be in communication with organization computing system 104 via network 105. Client device 108 may be operated by a user. For example, client device 108 may be a mobile device, a tablet, a desktop computer, or any computing system having the capabilities described herein. Users may include, but are not limited to, individuals such as, for example, subscribers, clients, prospective clients, or customers of an entity associated with organization computing system 104, such as individuals who have obtained, will obtain, or may obtain a product, service, or consultation from an entity associated with organization computing system 104.

Client device 108 may include at least application 132. Application 132 may be representative of a web browser that allows access to a website or a stand-alone application. Client device 108 may access application 132 to access one or more functionalities of organization computing system 104. Client device 108 may communicate over network 105 to request a webpage, for example, from web client application server 114 of organization computing system 104. For example, client device 108 may be configured to execute application 132 to access content managed by web client application server 114. The content that is displayed to client device 108 may be transmitted from web client application server 114 to client device 108, and subsequently processed by application 132 for display through a graphical user interface (GUI) of client device 108.

FIG. 2 is a block diagram illustrating a computing environment 200, according to example embodiments. As illustrated, computing environment 200 includes auto-clipping agent 120, data set generator 122, camera calibrator 124, and player tracking agent 126 communicating via network 205.

Network 205 may be of any suitable type, including individual connections via the Internet, such as cellular or Wi-Fi networks. In some embodiments, network 205 may connect terminals, services, and mobile devices using direct connections, such as radio frequency identification (RFID), near-field communication (NFC), Bluetooth™, low-energy Bluetooth™ (BLE), Wi-Fi™ ZigBee™, ambient backscatter communication (ABC) protocols, USB, WAN, or LAN. Because the information transmitted may be personal or confidential, security concerns may dictate one or more of these types of connection be encrypted or otherwise secured. In some embodiments, however, the information being transmitted may be less personal, and therefore, the network connections may be selected for convenience over security.

Network 205 may include any type of computer networking arrangement used to exchange data or information. For example, network 205 may be the Internet, a private data network, virtual private network using a public network and/or other suitable connection(s) that enables components in computing environment 200 to send and receive information between the components of environment 200.

Auto-clipping agent 120 may include principal component analysis (PCA) agent 202, clustering model 204, and neural network 206. As recited above, when trying to understand and extract data from a broadcast feed, auto-clipping agent 120 may be used to clip or segment the video into its constituent parts. In some embodiments, auto-clipping agent 120 may focus on separating a predefined, unified view (e.g., a high sideline view) from all other parts of the broadcast stream.

PCA agent 202 may be configured to utilize a PCA analysis to perform per frame feature extraction from the broadcast feed. For example, given a pre-recorded video, PCA agent 202 may extract a frame every X-seconds (e.g., 10 seconds) to build a PCA model of the video. In some embodiments, PCA agent 202 may generate the PCA model using incremental PCA, through which PCA agent 202 may select a top subset of components (e.g., top 120 components) to generate the PCA model. PCA agent 202 may be further configured to extract one frame every X seconds (e.g., one second) from the broadcast stream and compress the frames using PCA model. In some embodiments, PCA agent 202 may utilize PCA model to compress the frames into 120-dimensional form. For example, PCA agent 202 may solve for the principal components in a per video manner and keep the top 100 components per frame to ensure accurate clipping.

Clustering model 204 may be configured to the cluster the top subset of components into clusters. For example, clustering model 204 may be configured to center, normalize, and cluster the top 120 components into a plurality of clusters. In some embodiments, for clustering of compressed frames, clustering model 204 may implement k-means clustering. In some embodiments, clustering model 204 may set k=9 clusters. K-means clustering attempts to take some data x={x₁, x₂, . . . , x_n} and divide it into k subsets, S={S₁, S₂, . . . S_k} by optimizing:

$\underset{S}{\arg \min }\sum _j^k\sum _{x\in S_j}{x-{\mu }_j}^2$

where μ_j is the mean of the data in the set S_j. In other words, clustering model 204 attempts to find clusters with the smallest inter-cluster variance using k-means clustering techniques. Clustering model 204 may label each frame with its respective cluster number (e.g., cluster 1, cluster 2, . . . , cluster k).

Neural network 206 may be configured to classify each frame as trackable or untrackable. A trackable frame may be representative of a frame that includes captures the unified view (e.g., high sideline view). An untrackable frame may be representative of a frame that does not capture the unified view. To train neural network 206, an input data set that includes thousands of frames pre-labeled as trackable or untrackable that are run through the PCA model may be used. Each compressed frame and label pair (i.e., cluster number and trackable/untrackable) may be provided to neural network 206 for training.

In some embodiments, neural network 206 may include four layers. The four layers may include an input layer, two hidden layers, and an output layer. In some embodiments, input layer may include 120 units. In some embodiments, each hidden layer may include 240 units. In some embodiments, output layer may include two units. The input layer and each hidden layer may use sigmoid activation functions. The output layer may use a SoftMax activation function. To train neural network 206, auto-clipping agent 120 may reduce (e.g., minimize) the binary cross-entropy loss between the predicted label for sample and the true label y_j by:

$H=-\frac{1}{N}\sum _j^N{y}_j\log y+\left(1-y_j\right)\log \left(1-\widehat{y_J}\right)$

Accordingly, once trained, neural network 206 may be configured to classify each frame as untrackable or trackable. As such, each frame may have two labels: a cluster number and trackable/untrackable classification. Auto-clipping agent 120 may utilize the two labels to determine if a given cluster is deemed trackable or untrackable. For example, if auto-clipping agent 120 determines that a threshold number of frames in a cluster are considered trackable (e.g., 80%), auto-clipping agent 120 may conclude that all frames in the cluster are trackable. Further, if auto-clipping agent 120 determines that less than a threshold number of frames in a cluster are considered untrackable (e.g., 30% and below), auto-clipping agent 120 may conclude that all frames in the cluster are untrackable. Still further, if auto-clipping agent 120 determines that a certain number of frames in a cluster are considered trackable (e.g., between 30% and 80%), auto-clipping agent 120 may request that an administrator further analyze the cluster. Once each frame is classified, auto-clipping agent 120 may clip or segment the trackable frames. Auto-clipping agent 120 may store the segments of trackable frames in database 205 associated therewith.

Data set generator 122 may be configured to generate a plurality of data sets from auto-clipping agent 120. As illustrated, data set generator 122 may include pose detector 212, ball detector 214, and playing surface segmenter 216. Pose detector 212 may be configured to detect players within the broadcast feed. Data set generator 122 may provide, as input, to pose detector 212 both the trackable frames stored in database 205 as well as the broadcast video feed. In some embodiments, pose detector 212 may implement Open Pose to generate body pose data to detect players in the broadcast feed and the trackable frames. In some embodiments, pose detector 212 may implement sensors positioned on players to capture body pose information. Generally, pose detector 212 may use any means to obtain body pose information from the broadcast video feed and the trackable frame. The output from pose detector 212 may be pose data stored in database 215 associated with data set generator 122.

Ball detector 214 may be configured to detect and track the ball (or puck) within the broadcast feed. Data set generator 122 may provide, as input, to ball detector 214 both the trackable frames stored in database 205 and the broadcast video feed. In some embodiments, ball detector 214 may utilize a faster region-convolutional neural network (R-CNN) to detect and track the ball in the trackable frames and broadcast video feed. Faster R-CNN is a regional proposal based network. Faster R-CNN uses a convolutional neural network to propose a region of interest, and then classifies the object in each region of interest. Because it is a single unified network, the regions of interest and the classification steps may improve each other, thus allowing the classification to handle objects of various sizes. The output from ball detector 214 may be ball detection data stored in database 215 associated with data set generator 122.

Playing surface segmenter 216 may be configured to identify playing surface markings in the broadcast feed. Data set generator 122 may provide, as input, to playing surface segmenter 216 both trackable frames stored in database 205 and the broadcast video feed. In some embodiments, playing surface segmenter 216 may be configured to utilize a neural network to identify playing surface markings. The output from playing surface segmenter 216 may be playing surface markings stored in database 215 associated with data set generator 122.

Camera calibrator 124 may be configured to address the issue of moving camera calibration in sports. Camera calibrator 124 may include spatial transfer network 224 and optical flow module 226. Camera calibrator 124 may receive, as input, segmented playing surface information generated by playing surface segmenter 216, the trackable clip information, and posed information. Given such inputs, camera calibrator 124 may be configured to project coordinates in the image frame to real-world coordinates for tracking analysis.

Keyframe matching module 224 may receive, as input, output from playing surface segmenter 216 and a set of templates. For each frame, keyframe matching module 224 may match the output from playing surface segmenter 216 to a template. Those frames that are able to match to a given template are considered keyframes. In some embodiments, keyframe matching module 224 may implement a neural network to match the one or more frames. In some embodiments, keyframe matching module 224 may implement cross-correlation to match the one or more frames.

Spatial transformer network (STN) 224 may be configured to receive, as input, the identified keyframes from keyframe matching module 224. STN 224 may implement a neural network to fit a playing surface model to segmentation information of the playing surface. By fitting the playing surface model to such output, STN 224 may generate homography matrices for each keyframe.

Optical flow module 226 may be configured to identify the pattern of motion of objects from one trackable frame to another. In some embodiments, optical flow module 226 may receive, as input, trackable frame information and body pose information for players in each trackable frame. Optical flow module 226 may use body pose information to remove players from the trackable frame information. Once removed, optical flow module 226 may determine the motion between frames to identify the motion of a camera between successive frames. In other words, optical flow module 226 may identify the flow field from one frame to the next.

Optical flow module 226 and STN 224 may work in conjunction to generate a homography matrix. For example, optical flow module 226 and STN 224 may generate a homography matrix for each trackable frame, such that a camera may be calibrated for each frame. The homography matrix may be used to project the track or position of players into real-world coordinates. For example, the homography matrix may indicate a 2-dimensional to 2-dimensional transform, which may be used to project the players' locations from image coordinates to the real world coordinates on the playing surface.

Player tracking agent 126 may be configured to generate a track for each player in a match. Player tracking agent 126 may include neural network 232 and re-identification agent 232. Player tracking agent 126 may receive, as input, trackable frames, pose data, calibration data, and broadcast video frames. In a first phase, player tracking agent 126 may match pairs of player patches, which may be derived from pose information, based on appearance and distance. For example, let H be the player patch of the j^th player at time t, and let I_j^t={x_j^t,y_j^t,w_j^t,h_j^t} be the image coordinates x_j^t, y_j^t, the width w_j^t, and the height h_j^t of the j^th player at time t. Using this, player tracking agent 126 may associate any pair of detections using the appearance cross correlation C_ij^t=H_i^t*H_j^t+1 and L_ij^t=∥I_i^t−I_j^t+1∥₂² by finding:

$\arg \underset{\mathrm{ij}}{\max }\left(C_{ij}^t+L_{ij}^t\right)$

where I is the bounding box positions (x,y), width w, and height h; C is the cross correlation between the image patches (e.g., image cutout using a bounding box) and measures similarity between two image patches; and L is a measure of the difference (e.g., distance) between two bounding boxes I.

Performing this for every pair may generate a large set of short tracklets. The end points of these tracklets may then be associated with each other based on motion consistency and color histogram similarity.

For example, let v_i be the extrapolated velocity from the end of the i^th tracklet and v_j be the velocity extrapolated from the beginning of the j^th tracklet. Then c_ij=v_i·v_j may represent the motion consistency score. Furthermore, let p(h)_i represent the likelihood of a color h being present in an image patch i. Player tracking agent 126 may measure the color histogram similarity using Bhattacharyya distance:

D _B(p_i,p_j)=−ln(BC(p_i,p_j)) with BC(p_i,p_j)=Σ_h√{square root over (p_i(h)p_j(h))}

Recall, tracking agent 120 finds the matching pair of tracklets by finding:

$\arg \underset{\mathrm{ij}}{\max }\left(c_{ij}+D_B\left(p_i,p_j\right)\right).$

Solving for every pair of broken tracklets may result in a set of clean tracklets, while leaving some tracklets with large, i.e., many frames, gaps. To connect the large gaps, player tracking agent may augment affinity measures to include a motion field estimation, which may account for the change of player direction that occurs over many frames.

The motion field may be a vector field that represents the velocity magnitude and direction as a vector on each location on the playing surface. Given the known velocity of a number of players on the playing surface, the full motion field may be generated using cubic spline interpolation. For example, let X_i={x_i^t}_tε(0,T) to be the court position of a player i at every time t. Then, there may exist a pair of points that have a displacement d_i^λ(x_i^t)=x_i^t−x_i^t+1 if λ<T. Accordingly, the motion field may then be:

$V\left(x,\lambda \right)=G\left(x,5\right)*\sum _i{d}_i^{\lambda }\left(x_i^t\right),$

where G(x,5) may be a Gaussian kernel with standard deviation equal to about five feet. In other words, motion field may be a Gaussian blur of all displacements.

Neural network 232 may be used to predict player trajectories given ground truth player trajectories. Given a set of ground truth player trajectories, X_i, the velocity of each player at each frame may be calculated, which may provide the ground truth motion field for neural network 232 to learn. For example, given a set of ground truth player trajectories X_i, player tracking agent 126 may be configured to generate the set {circumflex over (V)}(x,λ), where {circumflex over (V)}(x,λ) may be the predicted motion field. Neural network 232 may be trained, for example, to minimize ∥V(x,λ)−{circumflex over (V)}(x,λ)∥₂². Player trajectory agent may then generate the affinity score for any tracking gap of size λ by:

K _ij +=V(x,λ)·d_ij

where d_ij=x_i^t−x_j^t+λ is the displacement vector between all broken tracks with a gap size of λ.

Re-identification agent 234 may be configured to link players that have left the frame of view. Re-identification agent 234 may include track generator 236, conditional autoencoder 240, and Siamese network 242.

Track generator 236 may be configured to generate a gallery of tracks. Track generator 236 may receive a plurality of tracks from database 205. For each track X, there may include a player identity label y, and for each player patch I, pose information p may be provided by the pose detection stage. Given a set of player tracks, track generator 236 may build a gallery for each track where the jersey number of a player (or some other static feature) is always visible. The body pose information generated by data set generator 122 allows track generator 236 to determine a player's orientation. For example, track generator 236 may utilize a heuristic method, which may use the normalized shoulder width to determine the orientation:

$S_{\mathrm{orient}}=\frac{{l_{Lsh\mathrm{oulder}}-l_{Rsh\mathrm{oulder}}}_2}{{l_{Neck}-l_{Hip}}_2}$

where l may represent the location of one body part. The width of shoulder may be normalized by the length of the torso so that the effect of scale may be eliminated. As two shoulders should be apart when a player faces towards or backwards from the camera, track generator 236 may use those patches whose S_orient is larger than a threshold to build the gallery. After this stage, each track X_n, may include a gallery:

G _n ={I _i |S _orient,i>thresh}∀I_i∈X_n

Conditional autoencoder 240 may be configured to identify one or more features in each track. For example, unlike conventional approaches to re-identification issues, players in team sports may have very similar appearance features, such as clothing style, clothing color, and skin color. One of the more intuitive differences may be the jersey number that may be shown at the front and/or back side of each jersey. In order to capture those specific features, conditional autoencoder 240 may be trained to identify such features.

In some embodiments, conditional autoencoder 240 may be a three-layer convolutional autoencoder, where the kernel sizes may be 3×3 for all three layers, in which there are 64, 128, 128 channels respectively. Those hyper-parameters may be tuned to ensure that jersey number may be recognized from the reconstructed images so that the desired features may be learned in the autoencoder. In some embodiments, f(I_i) may be used to denote the features that are learned from image i.

Use of conditional autoencoder 240 improves upon conventional processes for a variety of reasons. First, there is typically not enough training data for every player because some players only play a very short time in each game. Second, different teams can have the same jersey colors and jersey numbers, so classifying those players may be difficult.

Siamese network 242 may be used to measure the similarity between two image patches. For example, Siamese network 242 may be trained to measure the similarity between two image patches based on their feature representations f(I). Given two image patches, their feature representations f(I_i) and f(I_j) may be flattened, connected, and input into a perception network. In some embodiments, L₂ norm may be used to connect the two sub-networks of f(I_i) and f(I_j). In some embodiments, perception network may include three layers, which include may 1024, 512, and 216 hidden units, respectively. Such network may be used to measure the similarity s(I_i,I_j) between every pair of image patches of the two tracks that have no time overlapping. In order to increase the robustness of the prediction, the final similarity score of the two tracks may be the average of all pairwise scores in their respective galleries:

$S\left(x_n,x_m\right)=\frac{1}{❘G_n❘❘G_m❘}\sum _{i\in G_n,j\in G_m}s\left(I_i,I_j\right)$

This similarity score may be computed for every two tracks that do not have time overlapping. If the score is higher than some threshold, those two tracks may be associated.

FIG. 3 is a block diagram 300 illustrating aspects of operations discussed above and below in conjunction with FIG. 2 and FIGS. 4-10, according to example embodiments. Block diagram 300 may illustrate the overall workflow of organization computing system 104 in generating player tracking information. Block diagram 300 may include set of operations 302-308. Set of operations 302 may be directed to generating trackable frames (e.g., Method 500 in FIG. 5). Set of operations 304 may be directed to generating one or more data sets from trackable frames (e.g., operations performed by data set generator 122). Set of operations 306 may be directed to camera calibration operations (e.g., Method 700 in FIG. 7). Set of operations 308 may be directed to generating and predicting player tracks (e.g., Method 900 if FIG. 9 and Method 1000 in FIG. 10).

FIG. 4 is a flow diagram illustrating a method 400 of generating player tracks, according to example embodiments. Method 400 may begin at step 402.

At step 402, organization computing system 104 may receive (or retrieve) a broadcast feed for an event. In some embodiments, the broadcast feed may be a live feed received in real-time (or near real-time) from camera system 102. In some embodiments, the broadcast feed may be a broadcast feed of a game that has concluded. Generally, the broadcast feed may include a plurality of frames of video data. Each frame may capture a different camera perspective.

At step 404, organization computing system 104 may segment the broadcast feed into a unified view. For example, auto-clipping agent 120 may be configured to parse the plurality of frames of data in the broadcast feed to segment the trackable frames from the untrackable frames. Generally, trackable frames may include those frames that are directed to a unified view. For example, the unified view may be considered a high sideline view. In other examples, the unified view may be an endzone view. In other examples, the unified view may be a top camera view.

At step 406, organization computing system 104 may generate a plurality of data sets from the trackable frames (i.e., the unified view). For example, fata set generator 122 may be configured to generate a plurality of data sets based on trackable clips received from auto-clipping agent 120. In some embodiments, pose detector 212 may be configured to detect players within the broadcast feed. Data set generator 122 may provide, as input, to pose detector 212 both the trackable frames stored in database 205 as well as the broadcast video feed. The output from pose detector 212 may be pose data stored in database 215 associated with data set generator 122.

Ball detector 214 may be configured to detect and track the ball (or puck) within the broadcast feed. Data set generator 122 may provide, as input, to ball detector 214 both the trackable frames stored in database 205 and the broadcast video feed. In some embodiments, ball detector 214 may utilize a faster R-CNN to detect and track the ball in the trackable frames and broadcast video feed. The output from ball detector 214 may be ball detection data stored in database 215 associated with data set generator 122.

Playing surface segmenter 216 may be configured to identify playing surface markings in the broadcast feed. Data set generator 122 may provide, as input, to playing surface segmenter 216 both trackable frames stored in database 205 and the broadcast video feed. In some embodiments, playing surface segmenter 216 may be configured to utilize a neural network to identify playing surface markings. The output from playing surface segmenter 216 may be playing surface markings stored in database 215 associated with data set generator 122.

Accordingly, data set generator 120 may generate information directed to player location, ball location, and portions of the court in all trackable frames for further analysis.

At step 408, organization computing system 104 may calibrate the camera in each trackable frame based on the data sets generated in step 406. For example, camera calibrator 124 may be configured to calibrate the camera in each trackable frame by generating a homography matrix, using the trackable frames and body pose information. The homography matrix allows camera calibrator 124 to take those trajectories of each player in a given frame and project those trajectories into real-world coordinates. By projection player position and trajectories into real world coordinates for each frame, camera calibrator 124 may ensure that the camera is calibrated for each frame.

At step 410, organization computing system 104 may be configured to generate or predict a track for each player. For example, player tracking agent 126 may be configured to generate or predict a track for each player in a match. Player tracking agent 126 may receive, as input, trackable frames, pose data, calibration data, and broadcast video frames. Using such inputs, player tracking agent 126 may be configured to construct player motion throughout a given match. Further, player tracking agent 126 may be configured to predict player trajectories given previous motion of each player.

FIG. 5 is a flow diagram illustrating a method 500 of generating trackable frames, according to example embodiments. Method 500 may correspond to operation 404 discussed above in conjunction with FIG. 4. Method 500 may begin at step 502.

At step 502, organization computing system 104 may receive (or retrieve) a broadcast feed for an event. In some embodiments, the broadcast feed may be a live feed received in real-time (or near real-time) from camera system 102. In some embodiments, the broadcast feed may be a broadcast feed of a game that has concluded. Generally, the broadcast feed may include a plurality of frames of video data. Each frame may capture a different camera perspective.

At step 504, organization computing system 104 may generate a set of frames for image classification. For example, auto-clipping agent 120 may utilize a PCA analysis to perform per frame feature extraction from the broadcast feed. Given, for example, a pre-recorded video, auto-clipping agent 120 may extract a frame every X-seconds (e.g., 10 seconds) to build a PCA model of the video. In some embodiments, auto-clipping agent 120 may generate the PCA model using incremental PCA, through which auto-clipping agent 120 may select a top subset of components (e.g., top 120 components) to generate the PCA model. Auto-clipping agent 120 may be further configured to extract one frame every X seconds (e.g., one second) from the broadcast stream and compress the frames using PCA model. In some embodiments, auto-clipping agent 120 may utilize PCA model to compress the frames into 120-dimensional form. For example, auto-clipping agent 120 may solve for the principal components in a per video manner and keep the top 100 components per frame to ensure accurate clipping. Such subset of compressed frames may be considered the set of frames for image classification. In other words, PCA model may be used to compress each frame to a small vector, so that clustering can be conducted on the frames more efficiently. The compression may be conducted by selecting the top N components from PCA model to represent the frame. In some examples, N may be 100.

At step 506, organization computing system 104 may assign each frame in the set of frames to a given cluster. For example, auto-clipping agent 120 may be configured to center, normalize, and cluster the top 120 components into a plurality of clusters. In some embodiments, for clustering of compressed frames, auto-clipping agent 120 may implement k-means clustering. In some embodiments, auto-clipping agent 120 may set k=9 clusters. K-means clustering attempts to take some data x={x₁, x₂, . . . , x_n} and divide it into k subsets, S={S₁, S₂, . . . S_k} by optimizing:

$\underset{S}{\arg \min }\sum _j^k\sum _{x\in S_j}{x-{\mu }_j}^2$

where μ_j is the mean of the data in the set S_j. In other words, clustering model 204 attempts to find clusters with the smallest inter-cluster variance using k-means clustering techniques. Clustering model 204 may label each frame with its respective cluster number (e.g., cluster 1, cluster 2, . . . , cluster k).

At step 508, organization computing system 104 may classify each frame as trackable or untrackable. For example, auto-clipping agent 120 may utilize a neural network to classify each frame as trackable or untrackable. A trackable frame may be representative of a frame that includes captures the unified view (e.g., high sideline view). An untrackable frame may be representative of a frame that does not capture the unified view. To train the neural network (e.g., neural network 206), an input data set that includes thousands of frames pre-labeled as trackable or untrackable that are run through the PCA model may be used. Each compressed frame and label pair (i.e., cluster number and trackable/untrackable) may be provided to neural network for training. Accordingly, once trained, auto-clipping agent 120 may classify each frame as untrackable or trackable. As such, each frame may have two labels: a cluster number and trackable/untrackable classification.

At step 510, organization computing system 104 may compare each cluster to a threshold. For example, auto-clipping agent 120 may utilize the two labels to determine if a given cluster is deemed trackable or untrackable. In some embodiments, f auto-clipping agent 120 determines that a threshold number of frames in a cluster are considered trackable (e.g., 80%), auto-clipping agent 120 may conclude that all frames in the cluster are trackable. Further, if auto-clipping agent 120 determines that less than a threshold number of frames in a cluster are considered untrackable (e.g., 30% and below), auto-clipping agent 120 may conclude that all frames in the cluster are untrackable. Still further, if auto-clipping agent 120 determines that a certain number of frames in a cluster are considered trackable (e.g., between 30% and 80%), auto-clipping agent 120 may request that an administrator further analyze the cluster.

If at step 510 organization computing system 104 determines that greater than a threshold number of frames in the cluster are trackable, then at step 512 auto-clipping agent 120 may classify the cluster as trackable.

If, however, at step 510 organization computing system 104 determines that less than a threshold number of frames in the cluster are trackable, then at step 514, auto-clipping agent 120 may classify the cluster as untrackable.

FIG. 6 is a block diagram 600 illustrating aspects of operations discussed above in conjunction with method 500, according to example embodiments. As shown, block diagram 600 may include a plurality of sets of operations 602-608.

At set of operations 602, video data (e.g., broadcast video) may be provided to auto-clipping agent 120. Auto-clipping agent 120 may extract frames from the video. In some embodiments, auto-clipping agent 120 may extract frames from the video at a low frame rate. An incremental PCA algorithm may be used by auto-clipping agent to select the top 120 components (e.g., frames) from the set of frames extracted by auto-clipping agent 120. Such operations may generate a video specific PCA model.

At set of operations 604, video data (e.g., broadcast video) may be provided to auto-clipping agent 120. Auto-clipping agent 120 may extract frames from the video. In some embodiments, auto-clipping agent 120 may extract frames from the video at a medium frame rate. The video specific PCA model may be used by auto-clipping agent 120 to compress the frames extracted by auto-clipping agent 120.

At set of operations 606, the compressed frames and a pre-selected number of desired clusters may be provided to auto-clipping agent 120. Auto-clipping agent 120 may utilize k-means clustering techniques to group the frames into one or more clusters, as set forth by the pre-selected number of desired clusters. Auto-clipping agent 120 may assign a cluster label to each compressed frames. Auto-clipping agent 120 may further be configured to classify each frame as trackable or untrackable. Auto-clipping agent 120 may label each respective frame as such.

At set of operations 608, auto-clipping agent 120 may analyze each cluster to determine if the cluster includes at least a threshold number of trackable frames. For example, as illustrated, if 80% of the frames of a cluster are classified as trackable, then auto-clipping agent 120 may consider the entire cluster as trackable. If, however, less than 80% of a cluster is classified as trackable, auto-clipping agent may determine if at least a second threshold number of frames in a cluster are trackable. For example, is illustrated if 70% of the frames of a cluster are classified as untrackable, auto-clipping agent 120 may consider the entire cluster trackable. If, however, less than 70% of the frames of the cluster are classified as untrackable, i.e., between 30% and 70% trackable, then human annotation may be requested.

FIG. 7 is a flow diagram illustrating a method 700 of calibrating a camera for each trackable frame, according to example embodiments. Method 700 may correspond to operation 408 discussed above in conjunction with FIG. 4. Method 700 may begin at step 702.

At step 702, organization computing system 104 may retrieve video data and pose data for analysis. For example, camera calibrator 124 may retrieve from database 205 the trackable frames for a given match and pose data for players in each trackable frame. Following step 702, camera calibrator 124 may execute two parallel processes to generate homography matrix for each frame. Accordingly, the following operations are not meant to be discussed as being performed sequentially, but may instead be performed in parallel or sequentially.

At step 704, organization computing system 104 may remove players from each trackable frame. For example, camera calibrator 124 may parse each trackable frame retrieved from database 205 to identify one or more players contained therein. Camera calibrator 124 may remove the players from each trackable frame using the pose data retrieved from database 205. For example, camera calibrator 124 may identify those pixels corresponding to pose data and remove the identified pixels from a given trackable frame.

At step 706, organization computing system 104 may identify the motion of objects (e.g., surfaces, edges, etc.) between successive trackable frames. For example, camera calibrator 124 may analyze successive trackable frames, with players removed therefrom, to determine the motion of objects from one frame to the next. In other words, optical flow module 226 may identify the flow field between successive trackable frames.

At step 708, organization computing system 104 may match an output from playing surface segmenter 216 to a set of templates. For example, camera calibrator 124 may match one or more frames in which the image of the playing surface is clear to one or more templates. Camera calibrator 124 may parse the set of trackable clips to identify those clips that provide a clear picture of the playing surface and the markings therein. Based on the selected clips, camera calibrator 124 may compare such images to playing surface templates. Each template may represent a different camera perspective of the playing surface. Those frames that are able to match to a given template are considered keyframes. In some embodiments, camera calibrator 124 may implement a neural network to match the one or more frames. In some embodiments, camera calibrator 124 may implement cross-correlation to match the one or more frames.

At step 710, organization computing system 104 may fit a playing surface model to each keyframe. For example, camera calibrator 124 may be configured to receive, as input, the identified keyframes. Camera calibrator 124 may implement a neural network to fit a playing surface model to segmentation information of the playing surface. By fitting the playing surface model to such output, camera calibrator 124 may generate homography matrices for each keyframe.

At step 712, organization computing system 104 may generate a homography matrix for each trackable frame. For example, camera calibrator 124 may utilize the flow fields identified in step 706 and the homography matrices for each key frame to generate a homography matrix for each frame. The homography matrix may be used to project the track or position of players into real-world coordinates. For example, given the geometric transform represented by the homography matrix, camera calibrator 124 may use his transform to project the location of players on the image to real-world coordinates on the playing surface.

At step 714, organization computing system 104 may calibrate each camera based on the homography matrix.

FIG. 8 is a block diagram 800 illustrating aspects of operations discussed above in conjunction with method 700, according to example embodiments. As shown, block diagram 800 may include inputs 802, a first set of operations 804, and a second set of operations 806. First set of operations 804 and second set of operations 806 may be performed in parallel.

Inputs 802 may include video clips 808 and pose detection 810. In some embodiments, video clips 808 may correspond to trackable frames generated by auto-clipping agent 120. In some embodiments, pose detection 810 may correspond to pose data generated by pose detector 212. As illustrated, only video clips 808 may be provided as input to first set of operations 804; both video clips 804 and post detection 810 may be provided as input to second set of operations 806.

First set of operations 804 may include semantic segmentation 812, keyframe matching 814, and STN fitting 816. At semantic segmentation 812, playing surface segmenter 216 may be configured to identify playing surface markings in a broadcast feed. In some embodiments, playing surface segmenter 216 may be configured to utilize a neural network to identify playing surface markings. Such segmentation information may be performed in advance and provided to camera calibration 124 from database 215. At keyframe matching 814, keyframe matching module 224 may be configured to match one or more frames in which the image of the playing surface is clear to one or more templates. At STN fitting 816, STN 226 may implement a neural network to fit a playing surface model to segmentation information of the playing surface. By fitting the playing surface model to such output, STN 224 may generate homography matrices for each keyframe.

Second set of operations 806 may include camera motion estimation 818. At camera flow estimation 818, optical flow module 226 may be configured to identify the pattern of motion of objects from one trackable frame to another. For example, optical flow module 226 may use body pose information to remove players from the trackable frame information. Once removed, optical flow module 226 may determine the motion between frames to identify the motion of a camera between successive frames.

First set of operations 804 and second set of operations 806 may lead to homography interpolation 816. Optical flow module 226 and STN 224 may work in conjunction to generate a homography matrix for each trackable frame, such that a camera may be calibrated for each frame. The homography matrix may be used to project the track or position of players into real-world coordinates.

FIG. 9 is a flow diagram illustrating a method 900 of tracking players, according to example embodiments. Method 900 may correspond to operation 410 discussed above in conjunction with FIG. 4. Method 900 may begin at step 902.

At step 902, organization computing system 104 may retrieve a plurality of trackable frames for a match. Each of the plurality of trackable frames may include one or more sets of metadata associated therewith. Such metadata may include, for example, body pose information and camera calibration data. In some embodiments, player tracking agent 126 may further retrieve broadcast video data.

At step 904, organization computing system 104 may generate a set of short tracklets. For example, player tracking agent 126 may match pairs of player patches, which may be derived from pose information, based on appearance and distance to generate a set of short tracklets. For example, let H be the player patch of the j^th player at time t, and let I_j^t={x_j^t,y_j^t,w_j^t,h_j^t} be the image coordinates x_j^t,y_j^t, the width w_j^t, and the height h_j^t of the j^th player at time t. Using this, player tracking agent 126 may associated any pair of detections using the appearance cross correlation C_ij^t=H_j^t*H_j^t+1 and L_ij^t=∥I_i^t−I_j^t+1∥₂² by finding:

$\arg \underset{\mathrm{ij}}{\max }\left(C_{ij}^t+L_{ij}^t\right).$

Performing this for every pair may generate a set of short tracklets. The end points of these tracklets may then be associated with each other based on motion consistency and color histogram similarity.

For example, let vg be the extrapolated velocity from the end of the i^th tracklet and v_j be the velocity extrapolated from the beginning of the j^th tracklet. Then c_ij=v_i·v_j may represent the motion consistency score. Furthermore, let p(h)_i represent the likelihood of a color h being present in an image patch i. Player tracking agent 126 may measure the color histogram similarity using Bhattacharyya distance:

D _B(p_i,p_j)=−ln(BC(p_i,p_j)) with BC(p_i,p_j)=Σ_h√{square root over (p_i(h)p_j(h))}

At step 906, organization computing system 104 may connect gaps between each set of short tracklets. For example, recall that tracking agent 120 finds the matching pair of tracklets by finding:

$\arg \underset{\mathrm{ij}}{\max }\left(c_{ij}+D_B\left(p_i,p_j\right)\right).$

Solving for every pair of broken tracklets may result in a set of clean tracklets, while leaving some tracklets with large, i.e., many frames, gaps. To connect the large gaps, player tracking agent 126 may augment affinity measures to include a motion field estimation, which may account for the change of player direction that occurs over many frames.

The motion field may be a vector field which measures what direction a player at a point on the playing surface x would be after some time λ. For example, let X_i={x_i^t}_t∈(0,T) to be the court position of a player i at every time t. Then, there may exist a pair of points that have a displacement d_i^λ(x_i^t)=x_i^t−x_i^t+1 if λ<T. Accordingly, the motion field may then be:

$V\left(x,\lambda \right)=G\left(x,5\right)*\sum _i{d}_i^{\lambda }\left(x_i^t\right),$

where G(x,5) may be a Gaussian kernel with standard deviation equal to about five feet. In other words, motion field may be a Gaussian blur of all displacements.

At step 908, organization computing system 104 may predict a motion of an agent based on the motion field. For example, player tracking system 126 may use a neural network (e.g., neural network 232) to predict player trajectories given ground truth player trajectory. Given a set of ground truth player trajectories X_i, player tracking agent 126 may be configured to generate the set {circumflex over (V)}(x,λ), where {circumflex over (V)}(x,λ) may be the predicted motion field. Player tracking agent 126 may train neural network 232 to reduce (e.g., minimize) ∥V(x,λ)−{circumflex over (V)}(x,λ)∥₂². Player tracking agent 126 may then generate the affinity score for any tracking gap of size λ by:

K _ij =V(x,λ)·d_ij

where d_ij=x_i^t−x_j^t+λ is the displacement vector between all broken tracks with a gap size of λ. Accordingly, player tracking agent 126 may solve for the matching pairs as recited above. For example, given the affinity score, player tracking agent 126 may assign every pair of broken tracks using a Hungarian algorithm. The Hungarian algorithm (e.g., Kuhn-Munkres) may optimize the best set of matches under a constraint that all pairs are to be matched.

At step 910, organization computing system 104 may output a graphical representation of the prediction. For example, interface agent 128 may be configured to generate one or more graphical representations corresponding to the tracks for each player generated by player tracking agent 126. For example, interface agent 128 may be configured to generate one or more graphical user interfaces (GUIs) that include graphical representations of player tracking each prediction generated by player tracking agent 126.

In some situations, during the course of a match, players or agents have the tendency to wander outside of the point-of-view of camera. Such issue may present itself during an injury, lack of hustle by a player, quick turnover, quick transition from offense to defense, and the like. Accordingly, a player in a first trackable frame may no longer be in a successive second or third trackable frame. Player tracking agent 126 may address this issue via re-identification agent 234.

FIG. 10 is a flow diagram illustrating a method 1000 of tracking players, according to example embodiments. Method 1000 may correspond to operation 410 discussed above in conjunction with FIG. 4. Method 1000 may begin at step 1002.

At step 1002, organization computing system 104 may retrieve a plurality of trackable frames for a match. Each of the plurality of trackable frames may include one or more sets of metadata associated therewith. Such metadata may include, for example, body pose information and camera calibration data. In some embodiments, player tracking agent 126 may further retrieve broadcast video data.

At step 1004, organization computing system 104 may identify a subset of short tracks in which a player has left the camera's line of vision. Each track may include a plurality of image patches associated with at least one player. An image patch may refer to a subset of a corresponding frame of a plurality of trackable frames. In some embodiments, each track X may include a player identity label y. In some embodiments, each player patch I in a given track X may include pose information generated by data set generator 122. For example, given an input video, pose detection, and trackable frames, re-identification agent 234 may generate a track collection that includes a lot of short broken tracks of players.

At step 1006, organization computing system 104 may generate a gallery for each track. For example, given those small tracks, re-identification agent 234 may build a gallery for each track. Re-identification agent 234 may build a gallery for each track where the jersey number of a player (or some other static feature) is always visible. The body pose information generated by data set generator 122 allows re-identification agent 234 to determine each player's orientation. For example, re-identification agent 234 may utilize a heuristic method, which may use the normalized shoulder width to determine the orientation:

$S_{\mathrm{orient}}=\frac{{l_{Lsh\mathrm{oulder}}-l_{Rsh\mathrm{oulder}}}_2}{{l_{Neck}-l_{Hip}}_2}$

where l may represent the location of one body part. The width of shoulder may be normalized by the length of the torso so that the effect of scale may be eliminated. As two shoulders should be apart when a player faces towards or backwards from the camera, re-identification agent 234 may use those patches whose S_orient is larger than a threshold to build the gallery. Accordingly, each track X_n, may include a gallery:

G _n ={I _i |S _orient,i>thresh}∀I_i∈X_n

At step 1008, organization computing system 104 may match tracks using a convolutional autoencoder. For example, re-identification agent 234 may use conditional autoencoder (e.g., conditional autoencoder 240) to identify one or more features in each track. For example, unlike conventional approaches to re-identification issues, players in team sports may have very similar appearance features, such as clothing style, clothing color, and skin color. One of the more intuitive differences may be the jersey number that may be shown at the front and/or back side of each jersey. In order to capture those specific features, re-identification agent 234 may train conditional autoencoder to identify such features.

In some embodiments, conditional autoencoder may be a three-layer convolutional autoencoder, where the kernel sizes may be 3×3 for all three layers, in which there are 64, 128, 128 channels respectively. Those hyper-parameters may be tuned to ensure that jersey number may be recognized from the reconstructed images so that the desired features may be learned in the autoencoder. In some embodiments, f(I_i) may be used to denote the features that are learned from image i.

Using a specific example, re-identification agent 234 may identify a first track that corresponds to a first player. Using conditional autoencoder 240, re-identification agent 234 may learn a first set of jersey features associated with the first track, based on for example, a first set of image patches included or associated with the first track. Re-identification agent 234 may further identify a second track that may initially correspond to a second player. Using conditional autoencoder 240, re-identification agent 234 may learn a second set of jersey features associated with the second track, based on, for example, a second set of image patches included or associated with the second track.

At step 1010, organization computing system 104 may measure a similarity between matched tracks using a Siamese network. For example, re-identification agent 234 may train Siamese network (e.g., Siamese network 242) to measure the similarity between two image patches based on their feature representations f(I). Given two image patches, their feature representations f(I_i) and f(I_j) may be flattened, connected, and fed into a perception network. In some embodiments, L₂ norm may be used to connect the two sub-networks of f(I_i) and f(I_j). In some embodiments, perception network may include three layers, which include 1024, 512, and 216 hidden units, respectively. Such network may be used to measure the similarity s(I_i,I_j) between every pair of image patches of the two tracks that have no time overlapping. In order to increase the robustness of the prediction, the final similarity score of the two tracks may be the average of all pairwise scores in their respective galleries:

$S\left(x_n,x_m\right)=\frac{1}{❘G_n❘❘G_m❘}\sum _{i\in G_n,j\in G_m}s\left(I_i,I_j\right)$

Continuing with the aforementioned example, re-identification agent 234 may utilize Siamese network 242 to compute a similarity score between the first set of learned jersey features and the second set of learned jersey features.

At step 1012, organization computing system 104 may associate the tracks, if their similarity score is higher than a predetermined threshold. For example, re-identification agent 234 may compute a similarity score be computed for every two tracks that do not have time overlapping. If the score is higher than some threshold, re-identification agent 234 may associate those two tracks may.

Continuing with the above example, re-identification agent 234 may associated with first track and the second track if, for example, the similarity score generated by Siamese network 242 is at least higher than a threshold value. Assuming the similarity score is higher than the threshold value, re-identification agent 234 may determine that the first player in the first track and the second player in the second track are indeed one in the same.

FIG. 11 is a block diagram 1100 illustrating aspects of operations discussed above in conjunction with method 1000, according to example embodiments.

As shown block diagram 1100 may include input video 1102, pose detection 1104, player tracking 1106, track collection 1108, gallery building and pairwise matching 1110, and track connection 1112. Block diagram 1100 illustrates a general pipeline of method 1000 provided above.

Given input video 1102, pose detection information 1104 (e.g., generated by pose detector 212), and player tracking information 1106 (e.g., generated by one or more of player tracking agent 126, auto-clipping agent 120, and camera calibrator 124), re-identification agent 234 may generate track collection 1108. Each track collection 1108 may include a plurality of short broken tracks (e.g., track 1114) of players. Each track 1114 may include one or more image patches 1116 contained therein. Given the tracks 1114, re-identification agent 234 may generate a gallery 1110 for each track. For example, gallery 1110 may include those image patches 1118 in a given track that include an image of a player in which their orientation satisfies a threshold value. In other words, re-identification agent 234 may generate gallery 1110 for each track 1114 that includes image patches 1118 of each player, such that the player's number may be visible in each frame. Image patches 1118 may be a subset of image patches 1116. Re-identification agent 234 may then pairwise match each frame to compute a similarity score via Siamese network. For example, as illustrated, re-identification agent 234 may match a first frame from track 2 with a second frame from track 1 and feed the frames into Siamese network.

Re-identification agent 234 may then connect tracks 1112 based on the similarity scores. For example, if the similarity score of two frames exceed some threshold, re-identification agent 234 may connect or associate those tracks.

FIG. 12 is a block diagram illustrating architecture 1200 of Siamese network 242 of re-identification agent 234, according to example embodiments. As illustrated, Siamese network 242 may include two sub-networks 1202, 1204, and a perception network 1205.

Each of two sub-networks 1202, 1204 may be configured similarly. For example, sub-network 1202 may include a first convolutional layer 1206, a second convolutional layer 1208, and a third convolutional layer 1210. First sub-network 1202 may receive, as input, a player patch I₁ and output a set of features learned from player patch I₁ (denoted f(I₁)). Sub-network 1204 may include a first convolutional layer 1216, a second convolutional layer 1218, and a third convolutional layer 1220. Second sub-network 1204 may receive, as input, a player patch I₂ and may output a set of features learned from player patch I₂ (denoted f(I₂)). The output from sub-network 1202 and sub-network 1204 may be an encoded representation of the respective player patches I₁, I₂. In some embodiments, the output from sub-network 1202 and sub-network 1204 may be followed by a flatten operation, which may generate respective feature vectors f(I₁) and f(I₂), respectively. In some embodiments, each feature vector f(I₁) and f(I₂) may include 10240 units. In some embodiments, the L2 norm of f(I₁) and f(I₂) may be computed and used as input to perception network 1205.

Perception network 1205 may include three layers 1222-1226. In some embodiments, layer 1222 may include 1024 hidden units. In some embodiments, layer 1224 may include 512 hidden units. In some embodiments, layer 1226 may include 256 hidden units. Perception network 1205 may output a similarity score between image patches I₁ and I₂.

FIG. 13A illustrates a system bus computing system architecture 1300, according to example embodiments. System 1300 may be representative of at least a portion of organization computing system 104. One or more components of system 1300 may be in electrical communication with each other using a bus 1305. System 1300 may include a processing unit (CPU or processor) 1310 and a system bus 1305 that couples various system components including the system memory 1315, such as read only memory (ROM) 1320 and random access memory (RAM) 1325, to processor 1310. System 1300 may include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of processor 1310. System 1300 may copy data from memory 1315 and/or storage device 1330 to cache 1312 for quick access by processor 1310. In this way, cache 1312 may provide a performance boost that avoids processor 1310 delays while waiting for data. These and other modules may control or be configured to control processor 1310 to perform various actions. Other system memory 1315 may be available for use as well. Memory 1315 may include multiple different types of memory with different performance characteristics. Processor 1310 may include any general purpose processor and a hardware module or software module, such as service 11332, service 21334, and service 31336 stored in storage device 1330, configured to control processor 1310 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. Processor 1310 may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric.

To enable user interaction with the computing device 1300, an input device 1345 may represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 1335 may also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems may enable a user to provide multiple types of input to communicate with computing device 1300. Communications interface 1340 may generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.

Storage device 1330 may be a non-volatile memory and may be a hard disk or other types of computer readable media which may store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 1325, read only memory (ROM) 1320, and hybrids thereof.

Storage device 1330 may include services 1332, 1334, and 1336 for controlling the processor 1310. Other hardware or software modules are contemplated. Storage device 1330 may be connected to system bus 1305. In one aspect, a hardware module that performs a particular function may include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as processor 1310, bus 1305, display 1335, and so forth, to carry out the function.

FIG. 13B illustrates a computer system 1350 having a chipset architecture that may represent at least a portion of organization computing system 104. Computer system 1350 may be an example of computer hardware, software, and firmware that may be used to implement the disclosed technology. System 1350 may include a processor 1355, representative of any number of physically and/or logically distinct resources capable of executing software, firmware, and hardware configured to perform identified computations. Processor 1355 may communicate with a chipset 1360 that may control input to and output from processor 1355. In this example, chipset 1360 outputs information to output 1365, such as a display, and may read and write information to storage device 1370, which may include magnetic media, and solid state media, for example. Chipset 1360 may also read data from and write data to RAM 1375. A bridge 1380 for interfacing with a variety of user interface components 1385 may be provided for interfacing with chipset 1360. Such user interface components 1385 may include a keyboard, a microphone, touch detection and processing circuitry, a pointing device, such as a mouse, and so on. In general, inputs to system 1350 may come from any of a variety of sources, machine generated and/or human generated.

Chipset 1360 may also interface with one or more communication interfaces 1390 that may have different physical interfaces. Such communication interfaces may include interfaces for wired and wireless local area networks, for broadband wireless networks, as well as personal area networks. Some applications of the methods for generating, displaying, and using the GUI disclosed herein may include receiving ordered datasets over the physical interface or be generated by the machine itself by processor 1355 analyzing data stored in storage 1370 or 1375. Further, the machine may receive inputs from a user through user interface components 1385 and execute appropriate functions, such as browsing functions by interpreting these inputs using processor 1355.

It may be appreciated that example systems 1300 and 1350 may have more than one processor 1310 or be part of a group or cluster of computing devices networked together to provide greater processing capability.

While the foregoing is directed to embodiments described herein, other and further embodiments may be devised without departing from the basic scope thereof. For example, aspects of the present disclosure may be implemented in hardware or software or a combination of hardware and software. One embodiment described herein may be implemented as a program product for use with a computer system. The program(s) of the program product define functions of the embodiments (including the methods described herein) and can be contained on a variety of computer-readable storage media. Illustrative computer-readable storage media include, but are not limited to: (i) non-writable storage media (e.g., read-only memory (ROM) devices within a computer, such as CD-ROM disks readably by a CD-ROM drive, flash memory, ROM chips, or any type of solid-state non-volatile memory) on which information is permanently stored; and (ii) writable storage media (e.g., floppy disks within a diskette drive or hard-disk drive or any type of solid state random-access memory) on which alterable information is stored. Such computer-readable storage media, when carrying computer-readable instructions that direct the functions of the disclosed embodiments, are embodiments of the present disclosure.

It will be appreciated to those skilled in the art that the preceding examples are exemplary and not limiting. It is intended that all permutations, enhancements, equivalents, and improvements thereto are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present disclosure. It is therefore intended that the following appended claims include all such modifications, permutations, and equivalents as fall within the true spirit and scope of these teachings.

Claims

1-20. (canceled)

21. A computer-implemented method for presenting a customized highlight show to a user, the computer-implemented method comprising: receiving, by one or more processors, source content corresponding to one or more events;receiving, by the one or more processors, a user selection of a first attribute corresponding to the source content;selecting, by the one or more processors, a subset of the source content based on the first attribute, wherein the subset comprises a plurality of highlight segments depicting one or more portions of the source content;determining, by the one or more processors, one or more user preferences for a plurality of transitions, the one or more user preferences indicating whether to include a spoiler transition or a discreet transition as a transition for an upcoming segment;generating, by the one or more processors, the transition between a first highlight segment and a second highlight segment of the plurality of highlight segments based on the one or more user preferences, the transition including the spoiler transition or the discreet transition;generating, by the one or more processors, a highlight show comprising the subset and the transition; anddisplaying, by the one or more processors, the highlight show on a user interface.

22. The computer-implemented method of claim 21, the computer-implemented method further comprising: receiving, by the one or more processors, a user interaction with the highlight show; anddisplaying, by the one or more processors, an updated user interface based on the user interaction.

23. The computer-implemented method of claim 21, wherein determining the one or more user preferences is based on at least one of: receiving the one or more user preferences from the user, observing behavior and actions corresponding to the user, receiving the one or more user preferences from a user profile, creating one or more inferences based on content viewed by the user, receiving the one or more user preferences from a database, or one or more user demographics.

24. The computer-implemented method of claim 21, wherein the one or more user preferences includes a highlight show length, wherein the highlight show length is determined by at least one of: receiving the highlight show length from the user, analyzing previous user viewing habits, or analyzing one or more industry standards.

25. The computer-implemented method of claim 24, wherein receiving the highlight show length from the user includes: displaying, by the one or more processors, a plurality of highlight show lengths on the user interface; andreceiving, by the one or more processors, a user length selection via the user interface of the highlight show length.

26. The computer-implemented method of claim 21, wherein the first attribute includes at least one of: a team corresponding to the one or more events, a player corresponding to the one or more events, a coach corresponding to the team, one or more penalties corresponding to the one or more events, a length of the one or more events, a statistic corresponding to the one or more events, or a play type corresponding to the one or more events.

27. The computer-implemented method of claim 21, the computer-implemented method further comprising: generating, by the one or more processors, content corresponding to the highlight show; anddisplaying, by the one or more processors, the content on the user interface.

28. A computer system for presenting a customized highlight show to a user, the computer system comprising: a memory having processor-readable instructions stored therein; andone or more processors configured to access the memory and execute the processor-readable instructions, which when executed by the one or more processors configures the one or more processors to perform a plurality of functions, including functions for: receiving source content corresponding to one or more events;receiving a user selection of a first attribute corresponding to the source content;selecting a subset of the source content based on the first attribute, wherein the subset comprises a plurality of highlight segments depicting one or more portions of the source content;determining one or more user preferences for a plurality of transitions, the one or more user preferences indicating whether to include a spoiler transition or a discreet transition as a transition for an upcoming segment;generating the transition between a first highlight segment and a second highlight segment of the plurality of highlight segments based on the one or more user preferences, the transition including the spoiler transition or the discreet transition;generating a highlight show comprising the subset and the transition; anddisplaying the highlight show on a user interface.

29. The computer system of claim 28, the functions further comprising: receiving a user interaction with the highlight show; anddisplaying an updated user interface based on the user interaction.

30. The computer system of claim 28, wherein determining the one or more user preferences is based on at least one of: receiving the one or more user preferences from the user, observing behavior and actions corresponding to the user, receiving the one or more user preferences from a user profile, creating one or more inferences based on content viewed by the user, receiving the one or more user preferences from a database, or one or more user demographics.

31. The computer system of claim 28, wherein the one or more user preferences includes a highlight show length, wherein the highlight show length is determined by at least one of: receiving the highlight show length from the user, analyzing previous user viewing habits, or analyzing one or more industry standards.

32. The computer system of claim 31, wherein receiving the highlight show length from the user includes: displaying a plurality of highlight show lengths on the user interface; andreceiving a user length selection via the user interface of the highlight show length.

33. The computer system of claim 28, wherein the first attribute includes at least one of: a team corresponding to the one or more events, a player corresponding to the one or more events, a coach corresponding to the team, one or more penalties corresponding to the one or more events, a length of the one or more events, a statistic corresponding to the one or more events, or a play type corresponding to the one or more events.

34. The computer system of claim 28, the functions further comprising: generating content corresponding to the highlight show; anddisplaying the content on the user interface.

35. A non-transitory computer-readable medium containing instructions for presenting a customized highlight show to a user, the instructions comprising: receiving, by one or more processors, source content corresponding to one or more events;receiving, by the one or more processors, a user selection of a first attribute corresponding to the source content;selecting, by the one or more processors, a subset of the source content based on the first attribute, wherein the subset comprises a plurality of highlight segments depicting one or more portions of the source content;determining, by the one or more processors, one or more user preferences for a plurality of transitions, the one or more user preferences indicating whether to include a spoiler transition or a discreet transition as a transition for an upcoming segment;generating, by the one or more processors, the transition between a first highlight segment and a second highlight segment of the plurality of highlight segments based on the one or more user preferences, the transition including the spoiler transition or the discreet transition;generating, by the one or more processors, a highlight show comprising the subset and the transition; anddisplaying, by the one or more processors, the highlight show on a user interface.

36. The non-transitory computer-readable medium of claim 35, the instructions further comprising: receiving, by the one or more processors, a user interaction with the highlight show; anddisplaying, by the one or more processors, an updated user interface based on the user interaction.

37. The non-transitory computer-readable medium of claim 35, wherein determining the one or more user preferences is based on at least one of: receiving the one or more user preferences from the user, observing behavior and actions corresponding to the user, receiving the one or more user preferences from a user profile, creating one or more inferences based on content viewed by the user, receiving the one or more user preferences from a database, or one or more user demographics.

38. The non-transitory computer-readable medium of claim 35, wherein the one or more user preferences includes a highlight show length, wherein the highlight show length is determined by at least one of: receiving the highlight show length from the user, analyzing previous user viewing habits, or analyzing one or more industry standards.

39. The non-transitory computer-readable medium of claim 38, wherein receiving the highlight show length from the user includes: displaying, by the one or more processors, a plurality of highlight show lengths on the user interface; andreceiving, by the one or more processors, a user length selection via the user interface of the highlight show length.

40. The non-transitory computer-readable medium of claim 35, wherein the first attribute includes at least one of: a team corresponding to the one or more events, a player corresponding to the one or more events, a coach corresponding to the team, one or more penalties corresponding to the one or more events, a length of the one or more events, a statistic corresponding to the one or more events, or a play type corresponding to the one or more events.