Smoothing algorithm in Multi Pascal
Posted on 1998-11-18
To improve the visual quality of an image represented as two-dimensional aary of pixel values, a smoothing algorithm is sometimes applied. A simple smoothing algorithm is to replace the value of each pixel by the average of its immediate neighbors. Each pixel has 8 immediate neighbors, inclluding the diagonal neighbors. This algorithm replaces the value at each pixel by the average of 9 pixels, consisting of itself and the 8 neighbors.
So, how to write and run a parallel programming(simulate as it running on parallel processors) to apply the smmothing technique and to simplify shouldn't modify the pixels along the 4 outer boundaries of the image array.