Stairstep interpolation
From Wikipedia, the free encyclopedia
| This article does not cite any references or sources. (June 2008) Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed. |
| The introduction to this article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style. |
In mathematics, stairstep interpolation is a general method for interpolating functions. The key idea is to interpolate multiple times in small increments using any interpolation algorithm that is better than nearest-neighbor interpolation, such as bilinear interpolation, and bicubic interpolation.
In image processing, a common scenario is to interpolate an image by using a bicubic interpolation which increases the image size by no more than 10% (110% of the original size) at a time until the desired size is reached. The idea is that interpolating multiple times by a small amount is often better than interpolating from source to final destination.
[edit] See also
- Anti-aliasing
- Bézier surface
- Bilinear interpolation
- Cubic Hermite spline, the one-dimensional analogue of bicubic spline
- Lanczos resampling
- Sinc filter
- Spline interpolation
- bicubic interpolation

