Bicubic interpolation

From Wikipedia, the free encyclopedia

In numerical analysis, a branch of mathematics, bicubic interpolation is one of the most common multivariate interpolation methods in two dimensions. With this method, the value f(x, y) of a function f at a point (x, y) is computed as a weighted average of the nearest sixteen samples in a rectangular grid (a 4x4 array). Here, two cubic interpolation polynomials, one for each plane direction, are used.

1 Properties
2 Formula
3 Use in computer graphics
4 See also
5 External links

[edit] Properties

Bicubic interpolation results in an interpolating function which is continuous, has continuous first partial derivatives, and has continuous cross derivatives everywhere.

[edit] Formula

The introduction to this article provides insufficient context for those unfamiliar with the subject matter.
Please help improve the introduction to meet Wikipedia's layout standards. You can discuss the issue on the talk page.

The bicubic interpolation is calculated as follows:

a 00 + a 10 x + a 01 y + a 20 x 2 + a 11 x y + a 02 y 2 + a 21 x 2 y + a 12 x y 2 + a 22 x 2 y 2 + a 30 x 3 + a 03 y 3 + a 31 x 3 y + a 13 x y 3 + a 32 x 3 y 2 + a 23 x 2 y 3 + a 33 x 3 y 3

Or, in more compact form:

$\sum_{i=0}^3 \sum_{j=0}^3 a_{ij} x^i y^j$

The procedure used to calculate the coefficients $a i j$ depends on the interpolated data source properties. If we are interpolating a function with known derivatives, the common approach is to use the height at the four vertices, together with three derivatives at each vertex. The first derivatives $h' x$ and $h' y$ express the slope of the surface in the x and y directions, while the second (cross) derivative $h'' x y$ represents the slope in both x and y. In terms of solving the coefficients of the formula, these values can be expressed by differentiating the x and y vectors independently, and then consecutively. For each of the vertices of the grid cell, the local coordinates (at 0,0, 1,0, 0,1 and 1,1) can be input into these equations to generate the 16 equations to solve.

[edit] Use in computer graphics

The bicubic algorithm is frequently used for scaling images and video for display. It preserves fine detail better than the predominant bilinear algorithm.