deletions | additions       diff --git a/section_Methods_The_simplest_form__.tex b/section_Methods_The_simplest_form__.tex  index c8e5f70..c4f48fa 100644  --- a/section_Methods_The_simplest_form__.tex  +++ b/section_Methods_The_simplest_form__.tex 
...
\section{Methods}  The simplest form of the algorithm was used for all the results in this paper. For results derived from monochrome images each pixel is defined by three values;  two coordinates $i$ and $j$ are $j$,  the row and column positions of the pixel respectively, and a single value $k$ that is the value of the pixel on the gray-scale from 0 (black) to 1 (white). Images are processed on a pixel-by-pixel basis and the \textsc{skv} value of each pixels is calculated thus: \begin{enumerate}  \item assemble the vector $\vec{k}_{j}$ of values for a horizontal window of $n$ contiguous pixels $k_{[i,j; i,j+1; i,j+n-1]}$  \item repeat with $\vec{k}_{i}$, a vector of values for a vertical window of $n$ pixels $k_{[i,j; i+1,j; i+n-1,j]}$