Nearest neighbor value interpolation

Four neighbor locations around an empty location E

In mathematics applied to computer graphics, nearest neighbor value interpolation is an advanced method of image interpolation. This method fills the empty location with pixel value corresponding to the smallest absolute difference when a set of four known pixels or neighbors has no mode.[citation needed]

Proposed by Olivier Rukundo[1] in his PhD dissertation,[2][3] the preliminary work[4] 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.

As of 2025, the nearest neighbor value interpolation work has been widely cited in the scientific community, with over 300 citations in Google Scholar, along over 100 citations in the Web of Science database.[citation needed] The method has been referenced in multiple peer-reviewed journal articles spanning fields such as image processing, signal processing, deep learning and medical imaging. Some notable studies that have cited or discussed this approach include:


References

  1. ^ "University of Limerick". 17 December 2024. Retrieved February 23, 2025.
  2. ^ "Lund University". Retrieved June 7, 2021.
  3. ^ "China National Knowledge Infrastructure". Retrieved May 9, 2012.
  4. ^ Rukundo, Olivier; Wu, Kaining; Cao, Hanqiang (October 2011). "Image interpolation based on the pixel value corresponding to the smallest absolute difference". The Fourth International Workshop on Advanced Computational Intelligence. pp. 432–435. doi:10.1109/IWACI.2011.6160045. ISBN 978-1-61284-374-2. S2CID 14887648.
  5. ^ "IWACI 2011". Retrieved October 19, 2011.{{cite web}}: CS1 maint: deprecated archival service (link)
  6. ^ Rukundo, Olivier; Wu, Kaining; Cao, Hanqiang (2011). "Image interpolation based on the pixel value corresponding to the smallest absolute difference". The Fourth International Workshop on Advanced Computational Intelligence. pp. 432–435. doi:10.1109/IWACI.2011.6160045. ISBN 978-1-61284-374-2. S2CID 14887648. Retrieved May 17, 2012.
  7. ^ Wang, Xiang; Wang, Yumiao; Guo, Shisheng; Kong, Lingjiang; Cui, Guolong (2023). "Capsule Network With Multiscale Feature Fusion for Hidden Human Activity Classification". IEEE Transactions on Instrumentation and Measurement. 72: 1–12. Bibcode:2023ITIM...7238749W. doi:10.1109/TIM.2023.3238749.
  8. ^ Bagheri, Saghar; Do, Tam Thuc; Cheung, Gene; Ortega, Antonio (2024). "Spectral Graph Learning With Core Eigenvectors Prior via Iterative GLASSO and Projection". IEEE Transactions on Signal Processing. 72: 3958. Bibcode:2024ITSP...72.3958B. doi:10.1109/TSP.2024.3446453.
  9. ^ Lin, Fanzhao; Ge, Shiming; Bao, Kexin; Yan, Chenggang; Zeng, Dan (2024). "Learning Shape-Biased Representations for Infrared Small Target Detection". IEEE Transactions on Multimedia. 26: 4681. Bibcode:2024ITMm...26.4681L. doi:10.1109/TMM.2023.3325743.
  10. ^ "High-Resolution 3D Abdominal Segmentation With Random Patch Network Fusion". Medical Image Analysis. 69. 2021.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.