Fractal image compression provides immense advantages as compared to conventional image compressions. Though the fractal image encoding time is comparatively quite high as compared to the conventional ones but the decoding time is far less and almost instantaneous. Besides, fractal images are resolution-independent, implying that these images will render the same intensity and quality even when...

The paper contains a brief description of fractal image compression methods with sample compression results. We also present comparative results between two fractal schemes, discrete cosine transform, and a wavelet method. We show that, with the PSNR as a measure of image quality, some fractal schemes perform best over the range of compressions of most interest.

Many of the structures and parameters that are detected, measured and reported in cardiovascular magnetic resonance (CMR) have at least some properties that are fractal, meaning complex and self-similar at different scales. To date however, there has been little use of fractal geometry in CMR; by comparison, many more applications of fractal analysis have been published in MR imaging of the bra...

We present results of a scheme to encode video sequences of digital image data based on a quadtree still-image fractal method. The scheme encodes each frame using image pieces, or vectors, from its predecessor; hence it can be thought of as a VQ scheme in which the code book is derived from the previous image. We present results showing: near real-time (5 { 12 frames/sec) software-only decoding...

In recent years Fractal image compression techniques have gained more interest because of their capability to achieve high compression ratios while maintaining very good quality of the reconstructed image. Since Fractal image compression is computationally very expensive, some researchers tried to parallelize the encoding algorithm. Spiral Architecture is a relatively new and powerful approach ...

The main problem with fractal image compression is that it takes a lot of computational time for searching blocks (domain block and range block) and then compares these blocks. There are many optimization techniques which are used to improve efficiency of fractal image compression. Some of these are particle swarm optimization, ant colony optimization and biogeography based optimization. In thi...

We derive a bounding circle for a fractal image specified by an iterated function system. The radius of the bounding circle is smaller than those from previously published material. The bounding circle is important in fractal design and plotting software as it enables a fractal image to be scaled correctly to fit the screen of a digital computer.

The main purpose of image compression is to use as many bits as possible to represent the source image by eliminating the image redundancy with acceptable restoration. Fractal image compression coding has achieved good results in the field of image compression due to its high compression ratio, fast decoding speed as well as independency between decoding image and resolution. However, there is ...

In this paper, a series of studies to reinforced concrete cracks have been done by image graying, calibrating, image denoising, image enhancement and image segmentation, and the binary image of cracks is finally obtained. Using the Box Method, the fractal dimension of cracks is determined. The relationships between the fractal dimension of surface cracks in the cracking beam under three-point l...