Skip to main content
SpringerLink
Log in

Hash–Like Fractal Image Compression with Linear Execution Time

  • Conference paper
  • First Online:
Pattern Recognition and Image Analysis (IbPRIA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2652))

Included in the following conference series:

Abstract

The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison, in which actual full block comparison is preceded by a very fast hash–like search of those domains close to a given range block, resulting in a performance linear with respect to the number of pixels. Once the algorithm is detailed, its results will be compared against other state–of–the–art methods in FIC.

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

Access this chapter

Log in via an institution
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. Fisher, Y.: Fractal Image Compression–Theory and Application. Springer, New York (1994)

    MATH  Google Scholar 

  2. Hurtgen, B., Stiller, C.: Fast hierarchical codebook search for fractal coding of still images. In: Proc. EOS/SPIE Visual Communications PACS Medical Applications 1993, Berlin, Germany (1993)

    Google Scholar 

  3. Miyahara, M., Kotani, K., Algazi, V.R.: Objective picture quality scale (PQS) for image coding. IEEE Trans. in Communications 46, 1215–1226 (1998)

    Article  Google Scholar 

  4. Polvere, M., Nappi, M.: Speed up in fractal image coding: comparison of methods. IEEE Trans. Image Processing 9, 1002–1009 (2000)

    Article  Google Scholar 

  5. Saupe, D.: Fractal image compression by multidimensional nearest neighbor search. In: Proc. DCC 1995 Data Compression Conf. (March 1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. de Ingeniería Informática and Instituto de Ingeniería del Conocimiento, Universidad Autónoma de Madrid, 28049, Madrid, Spain

    Kostadin Koroutchev & José R. Dorronsoro

Authors
  1. Kostadin Koroutchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José R. Dorronsoro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Unitat de Gràfics i Visió per Ordinador Departament de Ciències Matemàtiques i Informàtica, Universitat de les Illes Balears Edifici Anselm Turmeda, Ctra. de Valldemossa km 7,5, 07122, Palma de Mallorca, Spain

    Francisco José Perales

  2. FEUP - Faculdade de Engenharia, Universidade do Porto, Rua Dr. Roberto Frias, 4200-465, Porto, Portugal

    Aurélio J. C. Campilho

  3. Departamento de Ciencias da la Computacíon e I.A., Universidad de Granada, E.T. S. Ing. Informática, 18071, Granada, Spain

    Nicolás Pérez de la Blanca

  4. Dept. System Engineering and Automation, Universitat Politècnica de Catalunya (UPC) Barcelona, Spain

    Alberto Sanfeliu

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koroutchev, K., Dorronsoro, J.R. (2003). Hash–Like Fractal Image Compression with Linear Execution Time. In: Perales, F.J., Campilho, A.J.C., de la Blanca, N.P., Sanfeliu, A. (eds) Pattern Recognition and Image Analysis. IbPRIA 2003. Lecture Notes in Computer Science, vol 2652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44871-6_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44871-6_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40217-6

  • Online ISBN: 978-3-540-44871-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation