Nearest neighbor value interpolation
 | The topic of this article may not meet Wikipedia's general notability guideline. (November 2021) |
In mathematics applied to computer graphics, nearest neighbor value interpolation is an advanced algorithm for digital image interpolation[1], proposed by Dr. Olivier Rukundo [2], in 2012, as part of his Ph.D. dissertation [3]. Unlike the traditional nearest neighbor interpolation, the proposed image interpolation algorithm uses the pixel value corresponding to the smallest absolute difference when a set of four known value pixels has no mode. One of the most closely related algorithm was presented at the fourth International Workshop on Advanced Computational Intelligence,[4], and that algorithm only exploited the pixel value corresponding to the smallest absolute difference to interpolate smaller sized-images and make them bigger to allow get a closer view of image objects details. This approach was since upgraded to deal with a wider class of image interpolation artefacts, that reduced the quality of interpolated images, and as a result, several future developments have emerged, drawing on various aspects of the pixel value corresponding to the smallest absolute difference.
References
- ^ "International Journal of Advanced Computer Science and Applications". Retrieved November 8, 2012.
- ^ "Google Scholar". Retrieved November 8, 2012.
- ^ "China National Knowledge Infrastructure". Retrieved May 9, 2012.
- ^ "IEEE". Retrieved October 19, 2011.