Skip to main content

Banach Constructor and Image Compression

  • Conference paper
Theoretical Foundations of Computer Vision

Part of the book series: Computing Supplement ((COMPUTING,volume 11))

  • 167 Accesses

Abstract

Banach Constructor and Image Compression. The Banach constructor is defined as a concept unifying special cases of deterministic fractal modeling. The fractal compression of digital images is presented as a Banach constructor defined by a patchwork. The patchwork concept is a formal mathematical model which allowed for: a compact definition of the fractal operator, specification of a condition for its contractivity (for all v norms, 1 ≤ v ≤ ∞), and formulating conditions ensuring the required fidelity of the reconstructed image. Fast fractal compression algorithm (FFC) is based on patchworks which are affine (with contrast and scaling fixed), sparse, and local. Formulas for the best fit, affine, contrast fixed transforms which perform the best fit of two digital patches, are given for v norms with v = 1, v = 2, and v = ∞. Experiments confirm superiority of quadratic norm at quality-time tradeoff.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Banach, S.: Oeuvres, Vol. I and Vol. II. Warszawa: Polish Scientific Publishers 1978.

    Google Scholar 

  2. Barnsley, M.: Fractals everywhere. San Diego: Academic Press 1988.

    MATH  Google Scholar 

  3. Barnsley, M., Hurd, L.: Fractal image compression. Wellesley: AK Peters 1993.

    MATH  Google Scholar 

  4. Beaumont, J.: Image data compression using fractal techniques. BT Techn. J. 9, 93–108 (1991).

    Google Scholar 

  5. Dugundi, J., Granas, A.: Fixed point theory. Warszawa: Polish Scientific Publishers 1982.

    Google Scholar 

  6. Goldshlager, L.: Short algorithms for space filling curves. Software Pract. Exp. 11, 99–100 (1981).

    Article  Google Scholar 

  7. Jacobs, E., Fisher, Y., Boss, R.: Image compression: a study of the iterated transform method. Signal Proc. 29, 251–263 (1992).

    Article  MATH  Google Scholar 

  8. Jacquin, A.: Image coding based on a fractal theory of iterated contractive image transformations. IEEE Trans. Image Proc. 1, 18–30 (1992).

    Article  Google Scholar 

  9. Hutchinson, J.: Fractals and self-similarity. Indiana Univ. J. Math. 30, 713–747 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  10. Peitgen, H., Jurgens, H., Saupe, D.: Chaos and fractals. New York: Springer 1992 (Appendix written by Y. Fisher).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Wien

About this paper

Cite this paper

Skarbek, W. (1996). Banach Constructor and Image Compression. In: Kropatsch, W., Klette, R., Solina, F., Albrecht, R. (eds) Theoretical Foundations of Computer Vision. Computing Supplement, vol 11. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6586-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6586-7_10

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82730-7

  • Online ISBN: 978-3-7091-6586-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics