Evolutionary fractal image compression

  title={Evolutionary fractal image compression},
  author={Dietmar Saupe and Matthias Ruhl},
  journal={Proceedings of 3rd IEEE International Conference on Image Processing},
  pages={129-132 vol.1}
  • D. SaupeM. Ruhl
  • Published 16 September 1996
  • Computer Science
  • Proceedings of 3rd IEEE International Conference on Image Processing
This paper introduces evolutionary computing to fractal image compression. In fractal image compression a partitioning of the image into ranges is required. We propose to use evolutionary computing to find good partitionings. Here ranges are connected sets of small square image blocks. Populations consist of N/sub p/ configurations, each of which is a partitioning with a fractal code. In the evolution each configuration produces /spl sigma/ children who inherit their parent partitionings except… 

Figures and Tables from this paper

Adaptive partitionings for fractal image compression

This paper shows how conventional acceleration techniques and a deterministic version of the evolution reduce the time-complexity of the method without degrading the encoding quality and reports on techniques to improve the rate-distortion performance.

Optimal fractal image coding

  • DongSheng CaiM. Hirobe
  • Computer Science
    Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)
  • 1999
This report discusses an optimal fractal image coding minimizing the Lagrangian cost function J(partition)=Distortion (partition)+/spl lambda/Rate(Partition) and concludes that this code would require less data and thus less disk space to store and less time to transmit.

Region-based fractal image compression using deterministic search

  • M. BreazuG. Toderean
  • Computer Science
    Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)
  • 1998
Experimental results prove that the proposed deterministic search method for finding the blocks to be merged in fractal image compression yields a better rate-distortion curve than the classic quadtree partitioning scheme.

Partitioned fractal image compression for binary images using genetic algorithms

  • A. AggarwalR. Kunal
  • Computer Science
    Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.
  • 2005
The paper presents a novel approach for pre-processing of binary images, which helps in subsequent application of the genetic algorithm in a parallel manner and reduces the computational time, while

Fractal image compression performance synthesis through HV partitioning

Fractal image compression is given 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.

Cost-based region growing for fractal image compression

This work investigates image partitionings that are derived by a merge process starting with a uniform partition and discusses merging criteria that depend on variance or collage error and on the Euclidean length of the partition boundaries.

Genetic adaptive coding optimization applied to fractal image compression

This paper presents a fractal image compression method that utilized a genetic optimization algorithm for optimal domain block selection and produced an optimal iterated function system (IFS) representation of the source image within a few generations in a robust and efficient manner.

The New Progress in Research Approach of Fractal Image Compression

The fractal image compression is a lossy encoding method which is based on Iterated Function System and self-similarity characteristics and there are still many problems in the field need to be solved for the difficulty to realize the IFS encoding automatically.

Fractal image compression with HV an emerging technique of image compression

This work partitions an image into blocks that are coded via self-references to other parts of the image itself via the quad tree partition and is using the HV partitioning scheme to obtain the range blocks.

Fractal Image Compression - An Introductory Overview

This paper has chosen the similarity to a particular variant of vector quantization as the most direct approach to fractal image compression and surveys some of the advanced concepts such as fast decoding, hybrid methods, and adaptive partitionings.



Region-based fractal image compression using heuristic search

Work carried out on fractal (or attractor) image compression relies on the assumption that image redundancy can be efficiently exploited through self-transformability and greatly increases the compression ratios achieved over traditional block-based partitionings.

Fractal image compression based on Delaunay triangulation and vector quantization

The aim is to reduce the number of comparisons between the two sets of blocks involved in fractal image compression by keeping only the best representative triangles in the domain blocks set.

Lossless acceleration of fractal image compression by fast convolution

  • D. SaupeH. Hartenstein
  • Computer Science
    Proceedings of 3rd IEEE International Conference on Image Processing
  • 1996
The first empirical experiments analyzing the performance benefits of the convolution approach to fractal image compression depending on image size, range size, and codebook size show acceleration factors for large ranges up to 23, outperforming all other currently known lossless acceleration methods for such range sizes.

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

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.

Image coding based on a fractal theory of iterated contractive image transformations

  • A. Jacquin
  • Computer Science
    IEEE Trans. Image Process.
  • 1992
The author proposes an independent and novel approach to image coding, based on a fractal theory of iterated transformations, that relies on the assumption that image redundancy can be efficiently exploited through self-transformability on a block-wise basis and approximates an original image by a Fractal image.

Image compression: A study of the iterated transform method

Attractor Coding of Images

This paper presents a new method for attractor coding of images. A contractive transformation, T is deened in a piecewise manner from a given image by aane mappings over triangular image regions. The

Partitioning complexity issue for iterated functions systems based image coding

LTS1 Reference LTS-CONF-1994-012 Record created on 2006-06-14, modified on 2016-08-08.

Frac - tal image coding techniques and contraction operators

  • Nieuw Arch . Wisk .
  • 1992