background & objectives: cancer is a serious problem for human being and is becoming a serious problem day-by-day .a prerequisite for any therapeutic modality is early diagnosis. automated cancer diagnosis by automatic image feature extraction procedures can be used as a feature extraction in the field of fractal dimension. the aim of this survey was to introduce a quantitative and objectiv...

In fractal image compression the encoding step is com-putationally expensive. We present a new technique for reducing the computational complexity. It is lossless, i.e., it does not sacriice any image quality for the sake of the speedup. It is based on a codebook coherence characteristic to fractal image compression and leads to a novel application of the fast Fourier transform-based convolutio...

The image partitioning scheme in fractal image compression is one of the important aspect for enhancement of performance. In this paper, an adaptive quardtree partitioning scheme is proposed where the entire image is sub-divided recursively into four sub-images. The partitioning points are selected adaptively in a image context-dependent way instead of middle points of the image sides as in qua...

In this paper is presented a new approach in fractal image coding based on trigonometric approximation. The least square approximation method is used for approximation of blocks in standard fractal image compression algorithm. In the paper is shown that it is possible to use also trigonometric approximation for describing of blocks in fractal image coding. This approximation was implemented and...

In this paper a hybrid technique of Genetic Algorithm and Simulated Annealing (HGASA) is applied for Fractal Image Compression (FIC). With the help of this hybrid evolutionary algorithm effort is made to reduce the search complexity of matching between range block and domain block. The concept of Simulated Annealing (SA) is incorporated into Genetic Algorithm (GA) in order to avoid pre-mature c...

Fractals are self-similar structures or patterns that repeat at increasingly fine magnifications. Research has revealed fractal patterns in many natural and physiological processes. This article investigates pupillary size over time to determine if their oscillations demonstrate a fractal pattern. We predict that pupil size over time will fluctuate in a fractal manner and this may be due to eit...

Fractal Image Compression is a well-known problem which is in the class of NP-Hard problems. Quantum Evolutionary Algorithm is a novel optimization algorithm which uses a probabilistic representation for solutions and is highly suitable for combinatorial problems like Knapsack problem. Genetic algorithms are widely used for fractal image compression problems, but QEA is not used for this kind o...

A new approach of relative fractal coding has been presented in this paper. In this technique given the fractal code of a reference image, one can generate a relative fractal code of any other image of same size. The convergence of the relative code is also guaranteed. This method found to be useful for satellite remote sensing image compression as the spectral bands are correlated. It produces...

In this paper, we propose a new method for computerized human face recognition using fractal transformations. The popular use of fractal image coding has been for image compression. It is only recently that their uses for object recognition are being explored. We will show that by utilizing the intrinsic properties of block-wise self-similar transformations in fractal image coding we can use it...

Fractal Image Compression is a well-known problem which is in the class of NP-Hard problems. Quantum Evolutionary Algorithm is a novel optimization algorithm which uses a probabilistic representation for solutions and is highly suitable for combinatorial problems like Knapsack problem. Genetic algorithms are widely used for fractal image compression problems, but QEA is not used for this kind o...