A Parallel ASIC Architecture for Efficient Fractal Image Coding

  title={A Parallel ASIC Architecture for Efficient Fractal Image Coding},
  author={Kevin P. Acken and Mary Jane Irwin and Robert Michael Owens},
  journal={Journal of VLSI signal processing systems for signal, image and video technology},
  • K. Acken, M. Irwin, R. Owens
  • Published 1 July 1998
  • Computer Science
  • Journal of VLSI signal processing systems for signal, image and video technology
Fractal image coding is a compression technique with many promising features, but it has been primarily placed in the class of archival coding algorithms due to its computationally expensive encoding algorithm. Though fractal coding has been extensively optimized for speed, it is still not practical for real-time applications on most sequential machines. The problem with fractal coding lies in the large amount of pixel block comparisons that are required, which makes fractal coding better… 
Low-Delay Parallel Architecture for Fractal Image Compression
An efficient hardware architecture for implementing fractal image compression (FIC) algorithm aimed toward image compression with improved encoding speed and utilizes the benefits of isometric transformation without requiring additional cycles for every single matching operation.
VHDL design for hardware assistance of fractal image compression
Simulations of the design suggest that an actual hardware implementation would be about one thousand times faster than a general purpose microprocessor based on similar IC technology, reducing the time required to optimally compress a 256 X 256 image using 8 X 8 range blocks from a few minutes to a fraction of a second.
High-Speed Fractal Image Compression Featuring Deep Data Pipelining Strategy
Experimental results suggest that the proposed architecture is able to encode a $1024\times 1024$ size image in 10.8 ms with PSNR and CR averaging at 27 dB and 34:1, respectively, which is comparable to the state-of-the-art fractal processors.
Hardware Architecture of a Decoder for Fractal Image Compression
This paper has proposed efficient hardware of a decoder for the fractal image compression and Controlled parallelism has been incorporated to speed up the decoding process.
Real-time implementation of Fractal Image Compression in low cost FPGA
A new parallel architecture is proposed for implementing a full-search FIC coding synthesized on a low-cost FPGA and optimized at circuit level in order to achieve a near real-time operation.
Hardware implementation of quadtree based fractal image decoder
This paper presents a simple hardware architecture for quadtree(QT) partitioning based fractal image decoder that spends less than 3 ms to decode a image of size 256 × 256 with average image quality exceeding 33dB.
VLSI design of fast fractal image encoder
A fast search based architecture for fractal image encoder, which efficiently exploits parallelism, is proposed, which can be considered as a successful approach for real time application for image compression.
Acceleration of Fractal Image Compression Using the Hardware-Software Co-design Methodology
A Hardware-Software Co-Design (HSC) of FIC which improves the compression time, obtaining an acceleration factor between 6.6 and 8.5.
Real time fractal image coder based on characteristic vector matching


An architectural design for parallel fractal compression
This paper takes a known quad-tree fractal encoding algorithm and design an ASIC parallel image processing array that can encode reasonably sized gray-scale images in real-time and includes novel optimizations that result in speed improvements at the algorithmic, architectural, and circuit levels.
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.
Fractal image compression via nearest neighbor search
The theory developed here shows that this basic procedure of fractal image compression is equivalent to multi-dimensional nearest neighbor search in a space of feature vectors so that both image quality and compression ratio can be improved at reduced computation time.
Fractal image compression
Design of an ASIC architecture for high speed fractal image compression
The design and performance evaluation of an ASIC dedicated to fractal image compression and the obtained speed-up is 300 times with respect to the direct execution of the compression algorithm on a 100 MHz Pentium platform.
A micro-grained VLSI signal processor
  • M. Irwin, R. Owens
  • Computer Science
    [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing
  • 1992
A very-fine-grain, VLSI processor is described, which maintains both a high degree of flexibility and fine grainness by reducing each processing cell to a small RAM and several multiplexers.
Two's Complement Pipeline Multipliers
  • R. Lyon
  • Computer Science
    IEEE Trans. Commun.
  • 1976
This concise paper addresses the design of multipliers capable of accepting data in 2's complement notation, or both data and coefficients in 1's complement shorthand, and considers multiplier recoding techniques, such as the Booth algorithm.
Fractal Image Compression
This paper begins by presenting a simple explanation of the main ideas in fractal image compression. It then presents a brief discussion of the current state of the art along with some results
Fractals everywhere
Focusing on how fractal geometry can be used to model real objects in the physical world, this up-to-date edition featurestwo 16-page full-color inserts, problems and tools emphasizing fractal