Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Nearest-neighbor interpolation

Known as: Nearest neighbor interpolation, Point sampling, Nearest-neighbour interpolation 
Nearest-neighbor interpolation (also known as proximal interpolation or, in some contexts, point sampling) is a simple method of multivariate… Expand
Wikipedia

Related topics

Related topics

25 relations
3D renderingAdventure Game StudioBicubic interpolationDemosaicing
Expand

Broader (1)

Interpolation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Quantum image scaling using nearest neighbor interpolation
  • Nan Jiang, Luo Wang
  • Quantum Inf. Process.
  • 2015
    • Corpus ID: 1023223
Although image scaling algorithms in classical image processing have been extensively studied and widely used as basic image… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2015
2015
Quantum image scaling up based on nearest-neighbor interpolation with integer scaling ratio
Quantum image processing is one of the most active fields in quantum computation and quantum information processing. Some… Expand
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Nearest Neighbor Value Interpolation
This paper presents the nearest neighbor value (NNV) algorithm for high resolution (H.R.) image interpolation. The difference… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Learning a hierarchy of discriminative space-time neighborhood features for human action recognition
Recent work shows how to use local spatio-temporal features to learn models of realistic human actions from video. However… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In defense of Nearest-Neighbor based image classification
State-of-the-art image classification methods require an intensive learning/training stage (using SVM, Boosting, etc.) In… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Distance browsing in spatial databases
We compare two different techniques for browsing through a collection of spatial objects stored in an R-tree spatial data… Expand
  • figure 25
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Recommendation as Classification: Using Social and Content-Based Information in Recommendation
Methionine5-enkephalin sulfoxides and sulfones having agonist activity at opiate receptors are disclosed herein. These sulfoxides… Expand
  • table 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Two algorithms for nearest-neighbor search in high dimensions
Representing data as points in a high-dimensional space, so as to use geometric methods for indexing, is an algorithmic technique… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Stochastic sampling in computer graphics
Ray tracing, ray casting, and other forms of point sampling are important techniques in computer graphics, but their usefulness… Expand
  • figure 1
  • figure 2
  • figure 6
  • figure 5
  • figure 7
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE