J4

• Original Articles • Previous Articles    

Faster compress coding arithmetic based on fractal

QI Li-Min;LIU Wen-Yao;L Da-Wei
  

  1. (Tianjin Univ. College of Precision Instrument and Opto-electronics Eng., Tianjin 300072, China)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-04-20 Published:2008-03-28
  • Contact: QI Li-Min E-mail:wwqqlm@126.com

Abstract: Fractal image compression is an efficient technique for encoding images. It can lead to a high compress ratio and decoding quality in theory. But, the speed of basic automatic fractal encoding is slow and the decoding quality is also unsatisfactory when the compress ratio is higher.This paper gives a way to get a fast speed of encoding. We reduce the original image to the 1/4 resolution, encode the 1/4 resolution image by the basic fractal algorithm, get the fractal code of the 1/4 resolution image, and decode the code to the original resolution. Then we calculate the difference between the decode image and the original image, and encode the difference image in a simple way. The code of the 1/4 resolution and the code of the difference image constitute the code of the original image.This method can speed up about 3-4 times with the same PSNR as for the basic automatic fractal algorithm.

Key words: image compression, fractals, iterated function system, resolution

CLC Number: 

  • TN919.8