--- a/writeup/techreport.tex	Mon May 03 18:38:58 2010 -0400
+++ b/writeup/techreport.tex	Mon May 03 18:43:24 2010 -0400
@@ -169,7 +169,7 @@
 
 This filter permuts neighbouring pixels. It selects first $\frac{complexity}{3}$ pixels randomly in the image. Each of them are then sequentially
 exchanged to one other pixel in its $V4$ neighbourhood. Number of exchanges to the left, right, top, bottom are equal or does not differ from more than 1
-if the number of selected pixel is not a multiple of 4. 
+if the number of selected pixels is not a multiple of 4. 
 
 It has has a probability of not being applied, at all, of 80\%.
 
@@ -206,7 +206,7 @@
 For each image we sample uniformly from $3$ to $3 + 10 \times complexity$ pixels that will be averaging centers
 between the original image and the filtered one.
 We initialize to zero a mask matrix of the image size. For each selected pixel we add to the mask the averaging window centered to it.
-The final image is computed from the following element-wise operation: $\frac{image + filtered_image \times mask}{mask+1}$.
+The final image is computed from the following element-wise operation: $\frac{image + filtered image \times mask}{mask+1}$.
 
 This filter has a probability of not being applied, at all, of 75\%.