Nearest Neighbor Value Interpolation

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.

6 pages, 11 figures, 2 tables

Cited by in corpus (11)

• ASF-YOLO: A Novel YOLO Model with Attentional Scale Sequence Fusion for Cell Instance Segmentation
• Review: Deep Learning in Electron Microscopy
• Effects of Image Size on Deep Learning
• Normalized Weighting Schemes for Image Interpolation Algorithms
• Recovery of Missing Sensor Data by Reconstructing Time-varying Graph Signals
• Effects of Improved Floor Function on the Accuracy of Bilinear Interpolation Algorithm
• Software Implementation of Optimized Bicubic Interpolated Scan Conversion in Echocardiography
• Investigation of the neutron imaging applications using fine-grained nuclear emulsion
• Anysize GAN: A solution to the image-warping problem
• Quantum Image Rotation by an arbitrary angle
• A Markov Reward Process-Based Approach to Spatial Interpolation