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