NEAREST NEIGHBOR INTERPOLATION
Nearest neighbor is the most basic and requires the least processing time of all the interpolation algorithms because it only considers one pixel — the closest one to the interpolated point. This has the effect of simply making each pixel bigger.
BILINEAR INTERPOLATION
The diagram to the left is for a case when all known pixel distances are equal, so the interpolated value is simply their sum divided by four. Bilinear interpolation considers the closest 2x2 neighborhood of known pixel values surrounding the unknown pixel. It then takes a weighted average of these 4 pixels to arrive at its final interpolated value. This results in much smoother looking images than nearest neighbor.
BICUBIC INTERPOLATION
source: http://www.cambridgeincolour.com/tutorials/image-interpolation.htm
No comments:
Post a Comment
Hi All, Please leave a comment. ^_^