“…Create a 3 × 3 square region, defined by (j,k) = (y-1,x-1) to (y+1,x+1). If the pixel is noise-free pixel (α 1 (j,k)=0), add this pixel to h 3 , i.e., noise-free pixel (α 1 (j 1 ,k)=0) and remove them from h 7 , i.e., h 7 (D(j 1 ,k))←h 7 (D(j 1 ,k))-1 At the bottom row (i.e., j 2 =y+3), find noise-free pixel (α 1 (j 2 ,k)=0) and add them to h 7 , i.e., h 7 (D(j 2 ,k))←h 7 (D(j 2 ,k))+1…”