Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Iterative polynomial interpolation and data compression

Abstract

In this paper we look at some iterative interpolation schemes and investigate how they may be used in data compression. In particular, we use the pointwise polynomial interpolation method to decompose discrete data into a sequence of difference vectors. By compressing these differences, one can store an approximation to the data within a specified tolerance using a fraction of the original storage space (the larger the tolerance, the smaller the fraction).

We review the iterative interpolation scheme, describe the decomposition algorithm and present some numerical examples. The numerical results are that the best compression rate (ratio of non-zero data in the approximation to the data in the original) is often attained by using cubic polynomials and in some cases polynomials of higher degree.

This is a preview of subscription content, log in to check access.

References

  1. [1]

    E. Arge and M. DÆhlen, Data dependent subdivision, preprint (1992).

  2. [2]

    C. Chui,An Introduction to Wavelets (Academic Press, Boston, 1992).

  3. [3]

    G. Deslauriers and S. Dubuc, Symmetric iterative interpolation processes, Constr. Appr. 5 (1989) 49–68.

  4. [4]

    R.A. deVore, B. Jawerth and B. Lucier, Surface compression, preprint (1991).

  5. [5]

    R.A. deVore, B. Jawerth and B. Lucier, Image processing through wavelet transform coding, preprint (1991).

  6. [6]

    S. Dubuc, Interpolation through an iterative scheme, J. Math. Anal. Appl. 114 (1986) 185–204.

  7. [7]

    N. Dyn, D. Levin and J. Gregory, A 4-point interpolatory subdivision scheme for curve design, Comp. Aided Geom. Des. 4 (1987) 257–268.

  8. [8]

    M. DÆhlen and T. Lyche, Decomposition of splines,Mathematical Methods, CAGD and Image Processing, eds. T. Lyche and L. Schumaker (Academic Press, Boston, 1992) pp. 135–160.

  9. [9]

    M.S. Floater, Pointwise polynomial interpolation, Research Report, SINTEF-SI, Oslo (1992).

  10. [10]

    T.A. Foley, Interpolation and approximation of 3-D and 4-D scattered data, Comp. Math. App. 13 (1987) 711–740.

  11. [11]

    S. Mallat, Multiresolution approximations and wavelet orthonormal bases ofL 2(ℓ), Trans. Amer. Math. Soc. 315 (1989) 69–87.

  12. [12]

    Y. Meyer,Ondelettes et Opérateurs (Hermann, Paris, 1990).

  13. [13]

    M.J.D. Powell,Approximation Theory and Methods (Cambridge University Press, Cambridge, 1981).

  14. [14]

    O. Rioul, Simple regularity criteria for subdivision schemes, SIAM J. Math. Anal. (1992), to appear.

Download references

Author information

Additional information

This work was supported by The Royal Norwegian Council for Scientific and Industrial Research (NTNF).

Rights and permissions

Reprints and Permissions

About this article

Cite this article

DÆhlen, M., Floater, M. Iterative polynomial interpolation and data compression. Numer Algor 5, 165–177 (1993). https://doi.org/10.1007/BF02215679

Download citation

Keywords

  • Interpolation Method
  • Storage Space
  • Data Compression
  • Interpolation Scheme
  • Polynomial Interpolation