Simple and fast fractal image compression for VLSI circuits

Martinez-Ramirez, A.; Díaz-Sánchez, A.; Linares-Aranda, M.; Vega-Pineda, Javier

doi:10.1109/ispa.2003.1296878

Cited by 4 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The size of each domain block should be larger than that of the range block. For each range block, the best matching domain block must be found by affine transformations wi as equation (1). Where si controls the contrast and oi controls the brightness.…”

Section: Fractal Image Compressionmentioning

confidence: 99%

See 1 more Smart Citation

Acceleration of Fractal Image Compression using Characteristic Vector Classification

Rowshanbin

Samavi

Shirani

2006

2006 Canadian Conference on Electrical and Computer Engineering

View full text Add to dashboard Cite

Even though fractal image compression would result in high compression ratio and good quality of the reconstructed image, it rarely used due to its time consuming coding procedure. The most sluggish stage of the compression in this method is for finding the best matched domain block for every range block of the image. In this paper we propose a method which by using a special characteristic vector classifies the domain blocks of the image. Therefore, the search process is accelerated and the quality of the reconstructed image is preserved.

show abstract

Section: Fractal Image Compressionmentioning

confidence: 99%

“…Fractal compression of images is among efficient methods of compression. Fractal method based on block forming was first suggested by Jaquin [1] in 1990 and thereafter became an attractive field of research. This method has high compression ratio and keeps the quality of the image.…”

Section: Introductionmentioning

confidence: 99%