Psy 221 Project Report
Block matching algorithm
The "block matching" algorithm is a little more complicated than other
algorithms we have considered so far. We define the color gravity to
be the average of all the (horizontallly or vertically,
or diagonally) neighboring green pixel values. At each pixel,
we choose the color value of one of its neighbors to be the estimate for the
missing color value at that pixel. More specifically, we choose the
neighbor whose color gravity is closest to that of the pixel under
consideration (the missing value of which we are trying to estimate).