Fractal image compression performance synthesis through HV partitioning

@article{Rajkumar2006FractalIC,
  title={Fractal image compression performance synthesis through HV partitioning},
  author={W.S. Rajkumar and M. V. Kulkarni and Manikrao L. Dhore and Suresh N. Mali},
  journal={2006 International Conference on Advanced Computing and Communications},
  year={2006},
  pages={636-637}
}
  • W.S. RajkumarM. Kulkarni S. Mali
  • Published 1 December 2006
  • Computer Science
  • 2006 International Conference on Advanced Computing and Communications
This paper gives the information about fractal image compression which is an efficient technique for compactly coding images, in which an image is encoded by a contractive transformation whose fixed point is close to the original image, and then is decoded by using an iterative procedure. A fractal coder partitions an image into blocks that are coded via self-references to other parts of the image itself. The most commonly used partitioning method is the quadtree partition. We are using the HV… 
1 Citations

Figures from this paper

Image Compression based on Quadtree and Polynomial

The test results indicate that the suggested method can lead to promising performance due to simplicity and efficiency in terms of overcoming the limitations of predictive coding and fixed block size.

References

SHOWING 1-7 OF 7 REFERENCES

Evolutionary fractal image compression

  • D. SaupeM. Ruhl
  • Computer Science
    Proceedings of 3rd IEEE International Conference on Image Processing
  • 1996
It is shown that a far better rate-distortion curve can be obtained with this approach as compared to traditional quad-tree partitionings.

Fractal image compression: theory and application

Working C code for a fractal encoding/decoding scheme capable of encoding images in a few seconds, decoding at arbitrary resolution, and achieving high compression rations is proposed.

Fractal encoding with HV partitions

In this chapter we describe a way to partition images that gives significantly better results. The method, which we call fractal encoding with HV partitioning, also includes several optimizations in

Fractal Image Compression — Theory and Application, Springer-Verlag

  • New York,
  • 1994

Region-Based Fractal Image Compression Hannes Hartenstein, Associate Member, IEEE, Matthias Ruhl, and Dietmar Saupe

  • IEEE TRANSACTIONS ON IMAGE PROCESSING
  • 2000

Fractal Image Compression and the Inverse Problem of Recurrent Iterated Function Systems " John C

  • Fractal Image Compression and the Inverse Problem of Recurrent Iterated Function Systems " John C
  • 1995

Evolutionary fractal image compression Dietmar Saupe

  • IEEE International Conference on Image Processing (ICIP'96)
  • 1996