Speeding up Fractal Image Compression
نویسنده
چکیده
Fractal coding of digital images ooers many promising qualities. However the coding process suuers from the long search time of the domain block pool. In this paper, we obtain mathematical results on the distance measure used in the search. Then we derive an incremental procedure to bound the domain block pixels. We arrange the domain blocks in a tree structure, and utilise the procedure to direct the search. We show that this method speeds up the coding process by upto 50 times, without noticeable loss of image quality. Our procedure works in conjunction with other methods, such as block classiication.
منابع مشابه
Optimization of Fractal Image Compression Based on Genetic Algorithms
The fractal image compression problem put forward three major requirements: speeding up the compression algorithm, improving image quality or increasing compression ratio. Major variants of the standard algorithm were proposed to speed up computation time. But most of them lead to a bad image quality, or a lower compression ratio. In this paper we present an implementation based on genetic algo...
متن کاملGenetic Algorithm based Fractal Image Compression
Fractal Image Compression is a lossy compression technique that has been developed in the early 1990s. Fractal image compression explores the self-similarity property of a natural image and utilizes the partitioned iterated function system (PIFS) to encode it. The fractal image compression problem had three major requirements: speeding up the compression algorithm, improving image quality and i...
متن کاملA VLSI Design for High Speed Fractal Image Coding
-Fractal image coding has become a popular research area for the past decade, it has been widely used for commercial purpose. The major problem of fractal image coding is the excessive long encoding time. In this paper, we propose an VLSI design for speeding up of fractal image encoding. Simulation results show that the design is quite efficient.
متن کاملOn speeding up fractal image compression
In this work an improved classification algorithm is introduced, with the help of which the usually time consuming searching part of fractal image encoding speeds up considerably without loss of the reconstruction fidelity. Two parameters are used to sort image blocks into disjoint classes: the direction of the approximate first derivative and a normalized root mean square error of the fitting ...
متن کاملSpeeding-Up Fractal Image Compression by Using Classification Range Blocks
In fractal compression technique, an image is partitioned into sub blocks called range blocks, each of which is encoded by matching it (after an appropriate affine transformation) with a block chosen from a large pool of domain blocks, which is constructed from the image itself. The problem is that the encoding is very time consuming because of the need to search in a very large domain pool. Ou...
متن کامل