Skip to main content

Interpolating Polynomials

  • Chapter
Data Compression
  • 170 Accesses

Abstract

This appendix shows how to predict the value of a pixel from those of 16 of its near neighbors by means of a two-dimensional interpolating polynomial. The results are used in Table 4.31. The main idea is to consider the 16 neighbor pixels as 4x4 equally spaced points on a surface (where the value of a pixel is interpreted as the height of the surface) and to use polynomials to find the mathematical expression of a surface P(u, w) that goes through all 16 points. The value of the pixel at the center of the 4x4 group can then be predicted by calculating the height of the center point P(.5, .5) of the surface. Mathematically, this surface is the two-dimensional polynomial interpolation of the 16 points.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

Salomon, D. (1998). Interpolating Polynomials. In: Data Compression. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2939-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2939-9_14

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-98280-9

  • Online ISBN: 978-1-4757-2939-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics