this is for holding javascript data
Martin Coath edited section_Methods_subsection_Algorithm_For__.tex
about 8 years ago
Commit id: 3daa1b958d099b46ff14b47148a91f77197b1af3
deletions | additions
diff --git a/section_Methods_subsection_Algorithm_For__.tex b/section_Methods_subsection_Algorithm_For__.tex
index 0a59011..5d33508 100644
--- a/section_Methods_subsection_Algorithm_For__.tex
+++ b/section_Methods_subsection_Algorithm_For__.tex
...
\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.} a measure of the asymmetry in the gray-scale values in both direction) is calculated, $\gamma_j$ and $\gamma_i$
\item the \textsc{skv} value of the pixel is the larger of the two values
$\mean(\gamma_j, \gamma_i)$ $\frac{\gamma_j + \gamma_i}{2}$
\end{enumerate}
In order to compare results from a range of pictures the window size will not be reported in pixels, but as the number of windows along the longest side of the image. For example, if a picture is 640 $\times$ 480 pixels and the \textsc{skv} is calculated with a window size of 64 pixels then this will be written as \textsc{skv}$_{10}$ as there are 10 windows along the longest side.