deletions | additions       diff --git a/section_Methods_subsection_Algorithm_For__.tex b/section_Methods_subsection_Algorithm_For__.tex  index 0333b57..6cd67e8 100644  --- a/section_Methods_subsection_Algorithm_For__.tex  +++ b/section_Methods_subsection_Algorithm_For__.tex 
...
\item hence the working window size is $n = 2 \cdot m+1$ even when this differs from $w$ by one  \item assemble the vector $\vec{k}_{j}$ of values for a horizontal window of $n$ contiguous pixels $k_{[i,j-m \: : \: i,j+m]}$  \item repeat with $\vec{k}_{i}$, a vector of values for a vertical window of $n$ pixels $k_{[i-m,j \: : \: i+m,j]}$  \item both vectors are normalized, so they can be treated as distributions, and the Skewness $\gamma$ of each distribution, \textit{i.e.} distribution (\textit{i.e.} a measure of  the asymmetry in the gray-scale values in both direction, direction)  is calculated, $\gamma_j$ and $\gamma_i$ \item the \textsc{skv} value of the pixel is the larger of the two values $\max(\gamma_j, \gamma_i)$  \end{enumerate}