scispace - formally typeset
Search or ask a question

Showing papers on "Bicubic interpolation published in 1976"


Book ChapterDOI
01 Jan 1976
TL;DR: In this article, the authors introduce some basic notation and definitions of interpolation spaces and discuss a few general results on the Aronszajn-Gagliardo theorem.
Abstract: In this chapter we introduce some basic notation and definitions. We discuss a few general results on interpolation spaces. The most important one is the Aronszajn-Gagliardo theorem.

540 citations



Journal ArticleDOI
TL;DR: Polygonal interpolation proves as a useful and versatile tool for approximation of general functions as compared with classical interpolation methods in quality of approximation and computational expense.

11 citations


Journal ArticleDOI
TL;DR: In this paper, a method for fitting smoothed bicubic splines to data given in a regular rectangular grid is suggested, and the complete algorithm for computing the functional values and its derivatives at arbitrary points is presented.
Abstract: A computational method for fitting smoothed bicubic splines to data given in a regular rectangular grid is suggested. The one-dimensional spline fit has well defined smoothness properties. These are duplicated for a two-dimensional approximation by solving the corresponding variational problem. The complete algorithm for computing the functional values and its derivatives at arbitrary points is presented. The posibilities of the method are demonstrated on an example from geomagnetic surveys.

11 citations


Journal ArticleDOI
A. Inselberg1
TL;DR: A generalization of cubic spline interpolation with vertical slopes at some knots is proposed in this article, and an existence theorem including an algorithm for constructing such generalized splines is proved.
Abstract: A generalization of cubic spline interpolation with vertical slopes at some knots is proposed An existence theorem including an algorithm for constructing such generalized splines is proved The resulting splines are obtained in closed form and they are partition invariant

5 citations


Dissertation
01 Jan 1976
TL;DR: Two modifications of the cubic interpolation process are presented, so as to improve the robustness of the method and force the process to converge in a reasonable number of iterations.
Abstract: : In this paper, the numerical solution of the problem of minimizing a unimodal function f(alpha) is considered, where alpha is a scalar. Two modifications of the cubic interpolation process are presented, so as to improve the robustness of the method and force the process to converge in a reasonable number of iterations. An alternative to the cubic interpolation process is also presented. This is a Lagrange interpolation scheme in which the quadratic approximation to the derivative of the function is considered. The coefficients of the quadratic are determined from the values of the slope at three points: alpha sub 1, alpha sub 2, and alpha sub 3 = (alpha sub 1 + alpha sub 2)/2, where alpha sub 1 and alpha sub 2 are the endpoints of the interval of interpolation.

4 citations



01 Sep 1976
TL;DR: In this article, the impact of registration on image compression and classification is explored, using the nearest neighbor, bilinear interpolation and bicubic interpolation techniques on LANDSAT image data.
Abstract: Geographical correction effects on LANDSAT image data are identified, using the nearest neighbor, bilinear interpolation and bicubic interpolation techniques. Potential impacts of registration on image compression and classification are explored.

1 citations


01 Jan 1976
TL;DR: In this article, an interpolation scheme based on piecewise cubic polynomials with the Gaussian points as interpolation points is analyzed, and optimal order a priori estimates for the interpolation error in the maximum norm are obtained.
Abstract: An interpolation scheme based on piecewise cubic polynomials with the Gaussian points as interpolation points is analyzed. Optimal order a priori estimates are obtained for the interpolation error in the maximum norm.

1 citations



Journal ArticleDOI
B. Dimsdale1, R. M. Burkley1
TL;DR: Nonparametric bicubic patch surfaces are used and experimental data suggest that computer costs are comparable to, or somewhat lower than, the costs for processing tabulated cylinder surfaces.
Abstract: Parametric bicubic patch surfaces have been used for some time in manufacture and design. It is convenient to have such surfaces available as standard numerical control surfaces using the APT programming language. A major drawback is that they are costly to use for data processing of numerical control programs. If, however, nonparametric bicubics are used, computer time, and hence cost, can be reduced dramatically. This paper details a strategy and algorithms for this purpose. Experimental data suggest that computer costs are comparable to, or somewhat lower than, the costs for processing tabulated cylinder surfaces.