Two dimensional moving average filter

Abstract

A two dimensional moving averaging filter is provided using a computational element coupled to a memory means which contains an electronic version of a two dimensional array of pixel values with N rows and M columns and a temporary memory buffer having a dimension of M columns by R+1 rows that is operatively coupled to receive data from the array. Each of the M columns within the temporary memory buffer is summed and the summated column values are placed into the “R+1” row of the temporary memory wherein a neighborhood filter is formed by secondly summing a predetermined number, “C”, of the summated column values such that the neighborhood filter contains a summation for a neighborhood the pixel array values of “R” rows by “C” columns. The summated neighborhood is averaged by dividing by the number of elements within the neighborhood (R×C) to gain an averaged center to the neighborhood filter and this averaged center is placed into its representative position of the pixel value that is currently being filtered within the two dimensional array. The neighborhood filter is then moved to the next pixel position to be filtered by adding a new summated column value from the “R+” row of the temporary memory buffer to the neighborhood filter and subtracting an oldest summated column value within the R+1 row from the neighborhood filter. After processing an entire row, the oldest row is subtracted from the extra row summation and the next sequential row is added to the extra row.