Nearest Neighbor Value Interpolation

  • Olivier R
  • Hanqiang C
N/ACitations
Citations of this article
134Readers
Mendeley users who have this article in their library.

Abstract

This paper presents the nearest neighbor value (NNV) algorithm for high resolution (H.R.) image interpolation. The difference between the proposed algorithm and conventional nearest neighbor algorithm is that the concept applied, to estimate the missing pixel value, is guided by the nearest value rather than the distance. In other words, the proposed concept selects one pixel, among four directly surrounding the empty location, whose value is almost equal to the value generated by the conventional bilinear interpolation algorithm. The proposed method demonstrated higher performances in terms of H.R. when compared to the conventional interpolation algorithms mentioned.

Cite

CITATION STYLE

APA

Olivier, R., & Hanqiang, C. (2012). Nearest Neighbor Value Interpolation. International Journal of Advanced Computer Science and Applications, 3(4). https://doi.org/10.14569/ijacsa.2012.030405

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free