Topic
Bicubic interpolation
About: Bicubic interpolation is a research topic. Over the lifetime, 3348 publications have been published within this topic receiving 73126 citations.
Papers published on a yearly basis
Papers
More filters
11 citations
TL;DR: In this article, the authors developed a new approach to the problem of real-time interpolation of digital signals using local cubic polynomial interpolative routines known as cubic spline functions.
Abstract: Deals with the development of a new approach to the problem of real-time interpolation of digital signals. Whereas the traditional methods of performing this operation make use of digital filters (FIR or IIR), this approach utilizes local cubic polynomial interpolative routines known as cubic spline functions. By using cubic splines, an algorithm has been obtained which can be implemented in a simple and economical way, yielding the desired real-time interpolator. The properties of this system include conceptual and structural simplicity, local control, speed of operation, and versatility.
11 citations
TL;DR: In this article, a wide class of sufficient conditions that admit a G1 cubic spline interpolant is determined, and the existence requirements are based upon geometric properties of data entirely, and can be easily verified in advance.
Abstract: In this paper, geometric interpolation by G1 cubic spline is studied. A wide class of sufficient conditions that admit a G1 cubic spline interpolant is determined. In particular, convex data as well as data with inflection points are included. The existence requirements are based upon geometric properties of data entirely, and can be easily verified in advance. The algorithm that carries out the verification is added.
11 citations
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
TL;DR: A quasi interpolation framework that attains the optimal approximation-order of Voronoi splines for reconstruction of volumetric data sampled on general lattices and presents visual and numerical experiments that demonstrate the improved accuracy of reconstruction across lattices, using the quasi interpolations framework.
Abstract: We present a quasi interpolation framework that attains the optimal approximation-order of Voronoi splines for reconstruction of volumetric data sampled on general lattices. The quasi interpolation framework of Voronoi splines provides an unbiased reconstruction method across various lattices. Therefore this framework allows us to analyze and contrast the sampling-theoretic performance of general lattices, using signal reconstruction, in an unbiased manner. Our quasi interpolation methodology is implemented as an efficient FIR filter that can be applied online or as a preprocessing step. We present visual and numerical experiments that demonstrate the improved accuracy of reconstruction across lattices, using the quasi interpolation framework.
11 citations