deletions | additions       diff --git a/Results.md b/Results.md  index 9e86b3e..7b2c2df 100644  --- a/Results.md  +++ b/Results.md 
...
## 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))\). For example, when n=2 n=1  the kernel would be \[  \left( \begin{array}{ccc}  a 1/16  & b 1/16  & c\\\\  d 1/16\\\\  1/16  & e 1/2  & f\\\\  g 1/16\\\\  1/16  & h 1/16  & i 1/16  \end{array} \right) \]  ### Region detection  The method works by fitting fluorescence signal from each