Bicubic interpolation

About: Bicubic interpolation is a research topic. Over the lifetime, 3348 publications have been published within this topic receiving 73126 citations.

Design of piecewise weighted linear interpolation based on even-odd decomposition and its application to image resizing

Abstract: In this paper, an image interpolation method based on even-odd decomposition (EOD) is proposed. An input signal for interpolation is decomposed to even and odd vectors by EOD. And then different interpolation methods are applied to even and odd vectors, respectively. This paper presents an analysis on the two vectors and new design methods for them. Also, based on the new design method, a signal flow graph of the proposed method is provided and compared with the CCI method in terms of complexity. To evaluate the proposed method, we conduct experiments and complexity comparison. The results indicate that the proposed interpolation method does not only outperform the existing method in terms of objective and subjective image quality but also requires less complexity.

Determination of Reaction Rates by the Use of Cubic Spline Interpolation

Abstract: The differential method of van't Hoff is a powerful method for kinetic data analysis if accurate rates of reaction can be found. Differentiation methods reported in the literature are inadequate, particularly when applied to data which is unequally spaced or which is subject to random error. A need is therefore expressed for a general numerical method of differentiation which can be readily applied in kinetic analysis. This paper suggests the use of the cubic spline, an interpolation method which overcomes the difficulties of other methods and gives exceptionally accurate derivatives. The theory of the cubic spline, its properties, and uses are discussed. Its application to experimental data is demonstrated and its performance is quantitatively compared with better known but less accurate methods.

Algorithm 623: Interpolation on the Surface of a Sphere

Abstract: Received July 1983; revised July 1984; accepted July 1984 Funding for this research was provided jointly by the National Science Foundation's Ecosystem Program under Interagency Agreement DEB-8115316 with the Ecological Science Division and the Mathematics Development Program in Techmcal Applications, Computer Sciences at Oak Ridge National Laboratory. Author's present address: Department of Computer Sciences, North Texas State University, P.O. Box 13886, Denton, TX 76203. Permission to copy without fee all or part of this material is granted provided that the copies are not made or &stributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. © 1984 0098-3500/84/1200-0437 $00.75

Local motion-adaptive interpolation technique based on block matching algorithms

Abstract: Interpolation techniques based on block-by-block motion compensation algorithms are studied for the video conference/video telephone signals. In this paper, we propose the local motion-adaptive interpolation technique, which can be used in the codec using a motion compensated coding-block matching algorithm (MCC-BMA). Computer simulation results at 2:1 subsampling rate of the proposed local motion-adaptive interpolation techniques combined with the conventional three-step search algorithm and the fast BMA using integral projections are given.