Bilinear interpolation

In mathematics, bilinear interpolation is an extension of linear interpolation for interpolating functions of two variables on a regular grid. The key idea is to perform linear interpolation first in one direction, and then in the other direction.

The four red dots show the data points and the green dot is the point at which we want to interpolate.

Example of bilinear interpolation on the unit square with the z-values 0, 1, 1 and 0.5 as indicated. Interpolated values in between represented by colour.

Suppose that we want to find the value of the unknown function f at the point P = (x, y). It is assumed that we know the value of f at the four points Q₁₁ = (x₁, y₁), Q₁₂ = (x₁, y₂), Q₂₁ = (x₂, y₁), and Q₂₂ = (x₂, y₂).

We first do linear interpolation in the x-direction. This yields

$f(R_{1})\approx {\frac {x_{2}-x}{x_{2}-x_{1}}}f(Q_{11})+{\frac {x-x_{1}}{x_{2}-x_{1}}}f(Q_{21})\quad {\mbox{where}}\quad R_{1}=(x,y_{1}),$

 

$f(R_{2})\approx {\frac {x_{2}-x}{x_{2}-x_{1}}}f(Q_{12})+{\frac {x-x_{1}}{x_{2}-x_{1}}}f(Q_{22})\quad {\mbox{where}}\quad R_{2}=(x,y_{2}).$

We proceed by interpolating in the y-direction.

$f(P)\approx {\frac {y_{2}-y}{y_{2}-y_{1}}}f(R_{1})+{\frac {y-y_{1}}{y_{2}-y_{1}}}f(R_{2}).$

This gives us the desired estimate of f(x, y).

${\begin{aligned}f(x,y)&\approx {\frac {f(Q_{11})}{(x_{2}-x_{1})(y_{2}-y_{1})}}(x_{2}-x)(y_{2}-y)\\&+{\frac {f(Q_{21})}{(x_{2}-x_{1})(y_{2}-y_{1})}}(x-x_{1})(y_{2}-y)\\&+{\frac {f(Q_{12})}{(x_{2}-x_{1})(y_{2}-y_{1})}}(x_{2}-x)(y-y_{1})\\&+{\frac {f(Q_{22})}{(x_{2}-x_{1})(y_{2}-y_{1})}}(x-x_{1})(y-y_{1}).\end{aligned}}$

If we choose a coordinate system in which the four points where f is known are (0, 0), (0, 1), (1, 0), and (1, 1), then the interpolation formula simplifies to

$f(x,y)\approx f(0,0)\,(1-x)(1-y)+f(1,0)\,x(1-y)+f(0,1)\,(1-x)y+f(1,1)xy.$

Or equivalently, in matrix operations:

$f(x,y)\approx {\begin{bmatrix}1-x&x\end{bmatrix}}{\begin{bmatrix}f(0,0)&f(0,1)\\f(1,0)&f(1,1)\end{bmatrix}}{\begin{bmatrix}1-y\\y\end{bmatrix}}$

Contrary to what the name suggests, the interpolant is not linear. Instead, it is of the form

$(a_{1}x+a_{2})(a_{3}y+a_{4}),\,$

so it is a product of two linear functions. Alternatively, the interpolant can be written as

$b_{1}+b_{2}x+b_{3}y+b_{4}xy\,$

where

$b_{1}=f(0,0)\,$

$b_{2}=f(1,0)-f(0,0)\,$

$b_{3}=f(0,1)-f(0,0)\,$

$b_{4}=f(0,0)-f(1,0)-f(0,1)+f(1,1).\,$

In both cases, the number of constants (four) correspond to the number of data points where f is given. The interpolant is linear along lines parallel to either the $x$ or the $y$ direction, equivalently if $x$ or $y$ is set constant. Along any other straight line, the interpolant is quadratic.

The result of bilinear interpolation is independent of the order of interpolation. If we had first performed the linear interpolation in the y-direction and then in the x-direction, the resulting approximation would be the same.

The obvious extension of bilinear interpolation to three dimensions is called trilinear interpolation.

In Image Processing

In computer vision, bilinear interpolation is the one of the basic interpolatoin techniques.

It is "a texture mapping technique that produces a reasonably realistic image, also known as "bilinear filtering" and "bilinear texture mapping." An algorithm is used to map a screen pixel location to a corresponding point on the texture map. A weighted average of the attributes (color, alpha, etc.) of the four surrounding texels is computed and applied to the screen pixel. This process is repeated for each pixel forming the object being textured"Bilinear interpolation definition

When an image needs to be scaled-up, each pixel of the original image needs to be moved in certain direction based on scale constant. However, when scaling up an image, there are pixels (i.e. Hole) that are not assigned to appropriate pixel values. In this case, those holes should be assigned to appropriate image vlues so that the output image does not have non-value pixels.

Typically, bilinear interpolation can be used where perfect image transformation, matching and imaging is impossible so that it can calculates and assgin appropriate image vlues to pixels. Unlike, other interpolation techniques such as Nearest Neighbor Interpolation, Cubic interpolation In order to find appropritate image values for a specific pixel, Bilinear Interpolation, uses 4 nearest pixel values which are located in diagonal direction from that specific pixel.

In an image, we want to find the image value for pixel P(r, c) wheree 'r' represents row and 'c' is for column. Then, image value for this pixel can be represented as I(r₁, c1).

File:Bilinear Interpolation.png

image value of X, A, B, C and D represent I, I1, I2, I3 and I4 in the above description respectively

In bilinear interpolation image values of 4 nearest points can be represented as followings, I1(r₀, c₀), I2(r₀, c₁), I3(r₁, c₀), I4(r₁, c₁)

in bilinear Interpolation, 4 pixels are weighted differenctly based on the disstance from pixel P(r,c) and the sum of those weighted value will the desired image value for specific pixel location.

This gives us the desired estimate image value I for the pixel P(r, c).

${\begin{aligned}I=\approx (1-a)(1-b)I_{1}+a(1-b)I_{2}+(1-a)bI_{3}+abI_{4}\end{aligned}}$

Where a and b are the horizontal and vertical distances from the pixel P(r, c) to P1(r₀, c₀). The equation clearly shows that pixels which are more close the P(r,c) gets more weight. Vertical and horizontal weighs are independent to each other. By putting more weight on close pixels, bilinear interpolation can produce smoother output image.

• Original image
  Original image
• 3 times scaled-up image using Bilinear Interpolation
  3 times scaled-up image using Bilinear Interpolation

See also

• Bicubic interpolation
• Trilinear interpolation
• Spline interpolation
• Lanczos resampling
• Bilinear surface
• Stairstep interpolation