Jump to content

Nearest neighbor value interpolation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Citation bot (talk | contribs) at 22:16, 21 April 2022 (Alter: template type. Add: s2cid, doi. | Use this bot. Report bugs. | Suggested by Abductive | Category:Articles with topics of unclear notability from November 2021 | #UCB_Category 322/630). 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. 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,[1] the first work presented at the fourth International Workshop on Advanced Computational Intelligence,[2] was based only on the pixel value corresponding to the smallest absolute difference[3] 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. ^ "China National Knowledge Infrastructure". Retrieved May 9, 2012.
  2. ^ "IWACI 2011". Archived from the original on August 3, 2012. Retrieved October 19, 2011.
  3. ^ "MENDELEY". doi:10.1109/IWACI.2011.6160045. S2CID 14887648. Retrieved February 2012. {{cite journal}}: Check date values in: |accessdate= (help); Cite journal requires |journal= (help)