You are on page 1of 25

Sampling and Interpolation

Prof. Jyotsna Singh


Multimedia Research Lab, Division of ECE
Netaji subhas University of Technology
Sector 3, Dwarka, New Delhi-78
Interpolation
Types of Interpolation kernel
Nearest Neighbor interpolation
This method simply determines the “nearest” neighbouring
pixel, and assumes the intensity value of it.
Geometric transformations
Bilinear Interpolation
• Each data point can be calculated using the simple slope-
intercept formula

y (i ) − y (a ) x(i ) − x(a )
=
y (b) − y (a ) x(b) − x(a)
x(i) − x(a)
y (i) = y (a) +  ( y (b) − y (a))
x(b) − x(a)
y (i ) = y (a) + (1 − W )  ( y (b) − y (a))
y (i ) = W  y (a ) + (1 − W ) y (b)
Up-sampling using bilinear interpolation
We are simply creating the new pixel in the target image from a
weighted average of its 4 nearest neighboring pixels in the source
image.
The weights: h, 1-h, w, 1-w are
determined by the relative position of
the new pixel compared to its
neighbors.
Cubic interpolation

You might also like