Ardo Illaste edited Results.md  about 10 years ago

Commit id: 437e094d74bcb35536a3a37e84330c78a9b7b3d0

deletions | additions      

       

## Pixel by pixel event classification  The algorithm is presented schematically on figure 1. Each subroutine is explained in detail below.  ### Image preprocessing  The only preprocessing step used is convolving the image with a \((2n+1)\times(2n+1)\) kernel where the center element is \(1/(n+1)\) and the k-th layer surrounding the center is made up of values \(1/(8k(n+1))\). \(1/(8k\cdot(n+1))\).  For example, when n=1 the kernel would be \[  \left( \begin{array}{ccc}  1/16 & 1/16 & 1/16\\\\