Skip to search formSkip to main contentSkip to account menu

Bicubic interpolation

Known as: Bicubic resampling, Bicubic filtering, Bi-cubic interpolation 
In mathematics, bicubic interpolation is an extension of cubic interpolation for interpolating data points on a two dimensional regular grid. The… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
AcutanceBilinear filteringChasys Draw IESClipping (signal processing)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Improvements On Bicubic Image Interpolation
Bicubic algorithm has the advantages of more accurate image magnification and faster processing speed. Nowadays, bicubic… 
Highly Cited
2001
Highly Cited
2001
Some Improvements of the Fast Marching Method
The fast marching method published by Sethian [Proc. Natl. Acad. Sci. USA, 93 (1996), pp. 1591--1595] is an optimally efficient… 
Highly Cited
1992
Highly Cited
1992
Bayesian Estimation of Motion Vector Fields
A stochastic approach to the estimation of 2D motion vector fields from time-varying images is presented. The formulation… 
Highly Cited
1987
Highly Cited
1987
Efficient algorithms for 3D scan-conversion of parametric curves, surfaces, and volumes
Three-dimensional (3D) scan-conversion algorithms, that scan-convert 3D parametric objects into their discrete voxelmap… 
Highly Cited
1987
Highly Cited
1987
Local surface interpolation with Bézier patches
Highly Cited
1987
Highly Cited
1987
3D scan-conversion algorithms for voxel-based graphics
An assortment of algorithms, termed three-dimensional (3D) scan-conversion algorithms, is presented. These algorithms scan… 
Highly Cited
1987
Highly Cited
1987
Adaptive forward differencing for rendering curves and surfaces
An adaptive forward differencing algorithm is presented for rapid rendering of cubic curves and bicubic surfaces. This method… 
Highly Cited
1984
Highly Cited
1984
Implicit representation of parametric curves and surfaces
Highly Cited
1982
Highly Cited
1982
The Construction of Multivariate Polynomials with Preassigned Zeros
We present an algorithm for constructing a basis of the ideal of all polynomials, which vanish at a preassigned set of points {y1… 
Highly Cited
1974
Highly Cited
1974
A method of bivariate interpolation and smooth surface fitting based on local procedures
A method is designed for interpolating values given at points of a rectangular grid in a plane by a smooth bivariate function z… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)