deletions | additions       diff --git a/section_Introduction_begin_enumerate_item__.tex b/section_Introduction_begin_enumerate_item__.tex  index 57e1214..233c57f 100644  --- a/section_Introduction_begin_enumerate_item__.tex  +++ b/section_Introduction_begin_enumerate_item__.tex 
...
\item motivation for the development of a MI based metric  \end{enumerate}  The current works on soccer match analysis used extra high level data and annotation (such as whoscored, transfertmark) which require human annotation and so preprocessing. In this project we limited our input to the video of a match filmed with a multi-camera system. We focus on an unsupervised classification of the players based on clustering of  their trajectories extracting which are extracted  automatically from the video of a match during a short period of time using clustering method. time.  This information is deeply woven into the fabric of team strategy analysis since it is related to the global placing of the players and the centers of the cluster may correspond to the leader of the game at that period. Thus we managed to find patterns in the paths of the players clustering players trajectories. The problem of tracking players with multiple camera have been achieved consistently for instance  in \cite{Ben_Shitrit_2011} even if their paths may intersect over long period of time. On another hand the clustering process is closely linked to the choice of a metric between the object we want to classify: there here  the players' trajectories. Most of the time the metrics used are based on euclidian metric. However euclidian metric are irrelevant to compare trajectories mainly because it doesn't take the time parameter into account. So, in our case, a relevant clustering process should be decomposed into 2 parts: \begin{itemize}  \item Compute the distances matrix between the trajectories   \item Use a general clustering algorithm which is independent of the metric used  \end{itemize}  Hence we used the clustering algorithm described in [?] whichonly  take a distance matrix as single  input. Furthermore it automatically selected selects  the clusters' center centers  and the number of clusters. Our contribution consist of a relevant similarity measure between trajectories which allows the clustering of the players' trajectories according to the interdependency of their path.  Yet only discrete trajectories are available in the form of array which can be of different sizes with different time discretization or with different speed.Then the clustering of those trajectories require a proper metric so as to cluster the players' trajectories.