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
Patent•
14 May 1991TL;DR: In this paper, a row interpolator receives image pixel values, retrieves interpolation coefficients from the memory, and produces interpolated pixel values by interpolating in a row direction.
Abstract: An interpolator for enlarging or reducing a digital image includes an interpolation coefficient memory containing interpolation coefficients representing a one dimension interpolation kernel. A row interpolator receives image pixel values, retrieves interpolation coefficients from the memory, and produces interpolated pixel values by interpolating in a row direction. A column interpolator receives multiple rows of interpolated pixel values from the row interpolator, retrieves interpolation coefficients from the memory, and produces rows of interpolated pixel values by interpolating in a column direction.
57 citations
01 Jan 1998
TL;DR: This paper constructs a subdivision algorithm with some negative weights producing G 2-surfaces, which are piecewise bicubic and are flat at their extraordinary points.
Abstract: In this paper we present a method to optimize the smoothness order of subdivision algorithms generating surfaces of arbitrary topology. In particular we construct a subdivision algorithm with some negative weights producing G 2-surfaces. These surfaces are piecewise bicubic and are flat at their extraordinary points. The underlying ideas can also be used to improve the smoothness order of subdivision algorithms for surfaces of higher degree or triangular nets.
56 citations
TL;DR: The main ingredient is a homogeneous reduction algorithm which orthogonalizes leading terms instead of completely canceling them, which allows for an extension of Buchberger's algorithm to construct these H-bases algorithmically.
Abstract: The paper is concerned with a construction for H-bases of polynomial ideals without relying on term orders. The main ingredient is a homogeneous reduction algorithm which orthogonalizes leading terms instead of completely canceling them. This allows for an extension of Buchberger's algorithm to construct these H-bases algorithmically. In addition, the close connection of this approach to minimal degree interpolation, and in particular to the least interpolation scheme due to de Boor and Ron, is pointed out.
56 citations
TL;DR: In this article, it was shown that interpolation at the midpoint of a data record yields the minimum interpolation error for an autoregressive process and infinite length interpolators are simply derived.
Abstract: Using a well-known form for the inverse of a symmetric Toeplitz matrix, some results in linear interpolation theory are derived. For an autoregressive process it is shown that interpolation at the mid-point of a data record yields the minimum interpolation error. Also, some results for infinite length interpolators are simply derived.
56 citations
TL;DR: An innovative interpolator is presented that performs high quality 2/spl times/interpolation on both synthetic and real world images and provides edge-sensitive data interpolation so that sharp- and artifacts-free images are obtained at a reasonable computational cost.
Abstract: In this paper, we present an innovative interpolator that performs high quality 2/spl times/interpolation on both synthetic and real world images. Its structure, which is based on a rational operator, provides edge-sensitive data interpolation so that sharp- and artifacts-free images are obtained at a reasonable computational cost.
56 citations