Martin Coath edited section_Methods_subsection_Algorithm_For__.tex  about 8 years ago

Commit id: 1f07005b73ca15f0d460a670f2299816254a05f2

deletions | additions      

       

\begin{enumerate}  \item the number of pixels $m$ corresponding to half the required window size $w$ is calculated: $m = \mathrm{floor}(\frac{w}{2})$  \item hence the working window size $n$ is always odd and equal to $2m+1$ even when this differs from $w$ by one  \item assemble extract  the horizontal vector $\vec{k}_{h}$ of values for a window of $n$ pixels around the current position  $k_{[i,j-m \: : \: i,j+m]}$ \item repeat with $\vec{k}_{v}$, a vector of values for a vertical windowof $n$ pixels  $k_{[i-m,j \: : \: i+m,j]}$ \item both vectors are normalized, so they can be treated as distributions, and the skewness of each distribution (\textit{i.e.} a measure of the asymmetry in the gray-scale values in both direction) is calculated, $\gamma_h$ and $\gamma_v$  \item the \textsc{skv} value of the pixel $\gamma_{i,j}$ is the mean of the two values $\frac{\gamma_h + \gamma_v}{2}$  \end{enumerate}