deletions | additions       diff --git a/subsection_Video_Graph_Data_Structure__.tex b/subsection_Video_Graph_Data_Structure__.tex  index f9ecb20..d0f1840 100644  --- a/subsection_Video_Graph_Data_Structure__.tex  +++ b/subsection_Video_Graph_Data_Structure__.tex 
...
\subsection{Video Graph Data Structure}  A video sequence is partitioned into a set of non-overlapping supervoxel regions $S = \{s_0,s_1,..,s_N\}$.   The supervoxel is mapped into graph: $f_{map}: S \mapto \mapsto  G(V,E)$, where each node $e_i$ has following attributes: \begin{itemize}  \item $size_i$ : the total number of cells making up the region $s_i$, $\mathbb{R}$.  \item $min_i$ : the minimum most location of 3D bounding box point in cell-coordinate $\mathbb{R}^3$.