Entropy Based Lossless Fractal Image Compression using Irregular Rectangular Partitions

نویسندگان

  • Jeet Kumar
  • Manish Kumar
چکیده

Entropy of an image can be taken as a parameter of variation among pixel values. Equal value for all pixels in an image results in zero entropy. This idea is incorporated at the time of partitioning the image. Partitions are done with zero entropy in order to make the compression lossless. Unlike traditional fractal image compression mechanism this method doesn’t require two separate partitions called range blocks and domain blocks on same image, rather it needs only single irregular rectangular partition. Each pixel compares its value with adjacent pixels and as long as their values are same, the pixels remain in same partition. The fractal approach is incorporated by reading the common pixel value in a partition and searches other partitions with same pixel value in order to store the block once. The proposed method increases encryption and decryption speed considerably over traditional methods. KeywordsEntropy, lossless compression, fractal, domain block, range block.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossless acceleration of fractal image encoding via the fast Fourier transform

In fractal image compression the encoding step is computationally expensive. We present a new technique for reducing the encoding complexity. It is lossless, i.e., it does not sacrifice any image reconstruction quality for the sake of speedup. It is based on a codebook coherence characteristic of fractal image compression and leads to a novel application of the Fast Fourier Transform based cros...

متن کامل

Optimal Hierarchical Partitions for Fractal Image Compression

In fractal image compression a partitioning of the image is required. In this paper we discuss the construction of rate-distortion optimal partitions. We begin with a fine scale partition which gives a fractal encoding with a high bit rate and a low distortion. The partition is hierarchical, thus, corresponds to a tree. We employ a pruning strategy based on the generalized BFOS algorithm. It ex...

متن کامل

Rate-Distortion Based Fractal Image Compression

In fractal image compression a contractive affine mapping whose fixed point is an approximation to the original image has to be determined. Usually, this mapping is found in a heuristic way. In this paper, we discuss rate-distortion based fractal image coding where the code corresponding to the mapping is optimal in the sense that it guarantees the lowest collage error (distortion between the o...

متن کامل

Wavelet-Based Fractal Transforms for Image Coding with No Search

The compression performance of fractal image coding is considered using the wavelet-based fractal coder with no search or classi cation of the domain blocks. A new partitioning scheme is introduced as a variant of earlier schemes which further improves the compression performance. The Wavelet-Based Fractal Transform (WBFT) links the theory of multiresolution analysis (MRA) with iterated functio...

متن کامل

Neural based domain and range pool partitioning using Fractal Coding for nearly lossless Medical Image Compression

This work results from a fractal image compression based on iterated transforms and machine learning modeling. In this work an improved quasi-losses fractal coding scheme is addressed to preserve the rich features of the medical image as the domain blocks and to generate the remaining part of the image from it based on fractal transformations. Machine learning based model is used for improving ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012