Jump to content

Nearest neighbor value interpolation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by WikiCleanerBot (talk | contribs) at 10:19, 9 October 2022 (v2.05b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics applied to computer graphics, nearest neighbor value interpolation is an advanced method of image interpolation.[1] This method uses the pixel value corresponding to the smallest absolute difference when a set of four known value pixels has no mode. Proposed by Olivier Rukundo in 2012 in his PhD dissertation,[2] the first work [3]presented at the fourth International Workshop on Advanced Computational Intelligence,[4] was based only on the pixel value corresponding to the smallest absolute difference[5] to achieve high resolution and visually pleasant image. This approach was since upgraded to deal with a wider class of image interpolation artefacts which reduce the quality of image, and as a result, several future developments have emerged, drawing on various aspects of the pixel value corresponding to the smallest absolute difference.

References

  1. ^ "LU Research Portal". Retrieved September 30, 2022.
  2. ^ "China National Knowledge Infrastructure". Retrieved May 9, 2012.
  3. ^ "IEEE Xplore". Retrieved September 30, 2022.
  4. ^ "IWACI 2011". Archived from the original on August 3, 2012. Retrieved October 19, 2011.
  5. ^ "MENDELEY". The Fourth International Workshop on Advanced Computational Intelligence. doi:10.1109/IWACI.2011.6160045. S2CID 14887648. Retrieved May 17, 2012.