02-07-2012, 12:33 PM
A Extreme Image Encoder for Internet
[attachment=26419]
Abstract:
The significance of images has increased drastically in all the technological fields. So, there is great demand of image coder with reduced encoding and decoding time. Fractal image coder has recently become an active area of research in this regard. Here an image is coded as a set of contractive transformations in a complete metric space. As a result of a well known theorem in metric space theory, the set of contractive transformations is guaranteed to produce an approximation to the original image, when iteratively applied to any initial image.
. Principle of Fractal Coding
In the encoding phase of fractal image compression, the image of size N x N is first partitioned into non overlapping range blocks
{R R R... 2 1} of a predefined size BxB. Then, a search codebook is created from the image taking all the square blocks (domain blocks) {D D D... 2 1} of size 2Bx2B, with integer step L in horizontal or vertical directions. To enlarge the variation, each domain is expanded with the eight basic .
EZW algorithm
The EZW output stream will have to start with some information to synchronize the decoder. The minimum information required by the decoder is the number of wavelet transform levels used and the initial threshold, if we assume that always the same wavelet transform will be used. Additionally we can send the image dimensions and the image mean. Sending the image mean is useful if we remove it from the image before coding. After imperfect reconstruction the decoder can then replace the imperfect mean by the original mean. This can increase the PSNR significantly.
Proposed Algorithm:-
In order to reduce the encoding time of fractals image compression a new image coder is proposed in this paper. Here, speed of wavelet is used along with the advantages of fractals image compression. First of all Discrete wavelet transform is applied on the full images. By doing this we get four Quadrant frequency matrix named as approximate sub-band and detail sub-band. The iterated Function system algorithm is applied on the detail sub-band coefficients. Here affine transform is used to get IFS. Finally 8X8 images and set of IFS Parameters is achieved, which is encoded using entropy encoder and transmitted to the Decoder section.
Conclusion:
Because of the reduction in encoding time, the proposed algorithm could be used in the World Wide Web for fast encoding and decoding. Further the above proposed algorithm could be implemented, using code composure studio 6711 processor for the real time processing.
[attachment=26419]
Abstract:
The significance of images has increased drastically in all the technological fields. So, there is great demand of image coder with reduced encoding and decoding time. Fractal image coder has recently become an active area of research in this regard. Here an image is coded as a set of contractive transformations in a complete metric space. As a result of a well known theorem in metric space theory, the set of contractive transformations is guaranteed to produce an approximation to the original image, when iteratively applied to any initial image.
. Principle of Fractal Coding
In the encoding phase of fractal image compression, the image of size N x N is first partitioned into non overlapping range blocks
{R R R... 2 1} of a predefined size BxB. Then, a search codebook is created from the image taking all the square blocks (domain blocks) {D D D... 2 1} of size 2Bx2B, with integer step L in horizontal or vertical directions. To enlarge the variation, each domain is expanded with the eight basic .
EZW algorithm
The EZW output stream will have to start with some information to synchronize the decoder. The minimum information required by the decoder is the number of wavelet transform levels used and the initial threshold, if we assume that always the same wavelet transform will be used. Additionally we can send the image dimensions and the image mean. Sending the image mean is useful if we remove it from the image before coding. After imperfect reconstruction the decoder can then replace the imperfect mean by the original mean. This can increase the PSNR significantly.
Proposed Algorithm:-
In order to reduce the encoding time of fractals image compression a new image coder is proposed in this paper. Here, speed of wavelet is used along with the advantages of fractals image compression. First of all Discrete wavelet transform is applied on the full images. By doing this we get four Quadrant frequency matrix named as approximate sub-band and detail sub-band. The iterated Function system algorithm is applied on the detail sub-band coefficients. Here affine transform is used to get IFS. Finally 8X8 images and set of IFS Parameters is achieved, which is encoded using entropy encoder and transmitted to the Decoder section.
Conclusion:
Because of the reduction in encoding time, the proposed algorithm could be used in the World Wide Web for fast encoding and decoding. Further the above proposed algorithm could be implemented, using code composure studio 6711 processor for the real time processing.