C. Rukundo Olivier. International Journal of Advanced Computer Science and Applications(IJACSA), (2012)
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.
%0 Journal Article
%1 IJACSA.2012.030405
%A Rukundo Olivier, Cao Hanqiang
%D 2012
%J International Journal of Advanced Computer Science and Applications(IJACSA)
%K bicubic; bilinear; image interpolation. nearest; neighbor value;
%N 4
%T Nearest Neighbor Value Interpolation
%U http://ijacsa.thesai.org/
%V 3
%X 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.
@article{IJACSA.2012.030405,
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.},
added-at = {2014-02-21T08:00:08.000+0100},
author = {{Rukundo Olivier}, Cao Hanqiang},
biburl = {https://www.bibsonomy.org/bibtex/24ec377dc53ef614fb0555d72488cc6ab/thesaiorg},
interhash = {e82fac353c56c54798b1e093eafecd38},
intrahash = {4ec377dc53ef614fb0555d72488cc6ab},
journal = {International Journal of Advanced Computer Science and Applications(IJACSA)},
keywords = {bicubic; bilinear; image interpolation. nearest; neighbor value;},
number = 4,
timestamp = {2014-02-21T08:00:08.000+0100},
title = {{Nearest Neighbor Value Interpolation}},
url = {http://ijacsa.thesai.org/},
volume = 3,
year = 2012
}