Fractal image compression: theory and application
Fractal image compression: theory and application
The data compression book (2nd ed.)
The data compression book (2nd ed.)
Region-based fractal image compression
IEEE Transactions on Image Processing
Region-based fractal image compression using heuristic search
IEEE Transactions on Image Processing
Hi-index | 0.00 |
The fractal image compression technique has a unique feature due to which physical position of blocks regions in the input image can be extracted directly from the compressed data. Fractal image compression 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 iteration procedure. A fractal coder partitions an image into blocks that are coded via self-references to other parts of the image itself. The most commonly used partitioning method is the quad tree partition. We are using the HV partitioning scheme to obtain the range blocks. We are also increasing number of domain pools by consider scaling factor. The encoding step in fractal image compression has high computational complexity. The image is segmented into rectangles. If no domain match with acceptable collage error is found for a given rectangular range block, the block is split into two rectangles either by a horizontal or a vertical cut.