Jump to content

Nearest neighbor value interpolation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rjwilmsi (talk | contribs) at 08:30, 28 March 2017 (top: Journal cites:, using AWB (12149)). 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][2][3] 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,[4] the first work presented at the fourth International Workshop on Advanced Computational Intelligence,[5] was based only on the pixel value corresponding to the smallest absolute difference[6] 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. ^ "Getcited". Retrieved May 1, 2012.
  2. ^ "Nearest Neighbor Value Interpolation". International Journal of Advanced Computer Science and Applications. 3. 2012. doi:10.14569/IJACSA.2012.030405.
  3. ^ "Copernicus". Retrieved May 1, 2012.
  4. ^ "China National Knowledge Infrastructure". Retrieved May 9, 2012.
  5. ^ "IWACI 2011". Retrieved October 19, 2011.
  6. ^ "MENDELEY". Retrieved February 2012. {{cite web}}: Check date values in: |accessdate= (help)