Accumulation of complete genome sequences of living organisms creates new possibilities to discuss the phylogenetic relationships at the genomic level. In the present Letter, a fractal model is proposed to simulate a kind of visual representation of complete genome. The estimated parameters in the fractal model is used to define the genetic distance between two organisms. Because we take into a...

Approximation of natural objects (curves, surfaces, or images) with fractal models is an important center of interest for research. The general inverse problem paradigm concerns many application fields and a large variety of studies have been proposed to address it.The most known of them is the fractal image compression method introduced by Jacquin. Generally speaking, these techniques lack of ...

In order to improve the efficiency and speed of match seeking in fractal compression, this paper presents an Average-Variance function which can make the optimal choice more efficiently. Based on it, we also present a fast optimal choice fractal image compression algorithm and an optimal method of constructing data tree which greatly improve the performances of the algorithm. Analysis and exper...

Recursive Fractal Genome Function in the geometric mind frame of Tensor Network Theory (TNT) leads through FractoGene to a mathematical unification of physiological and pathological development of neural structure and function as governed by the genome. The cerebellum serves as the best platform for unification of neuroscience and genomics. The matrix of massively parallel neural nets of fracta...

The principle of fractal image coding is that the image converges to a stable image by iterating the contractive transformations on an arbitrary initial image. This algorithm Partition the image into a number of range blocks and domain blocks. For every range block, the best matching domain block is searched for among all domain blocks by performing a set of transformations on each block. For c...

n Orientatio l S a subband at the l th decomposition level and at one of three orientations D-R distortion-rate T 0 initial threshold c(i,j) the wavelet coefficient at location (i,j) x a function which chooses the largest integer less than x l D the domain tree whose coarsest coefficients are in the decomposition level l 1 − l R the range tree whose coarsest coefficients are in the decomposit...

This paper presents a new fractal image coding (FIC) scheme to exploit the self-similarly at the same resolution scale in natural images. The new scheme can assure the convergence of FIC transforms without some limiting conditions like Zhao’s, and we also give the convergence proof of our new scheme in this paper. Our scheme also uses a recursive scheme feeding the coding results back to update...

Password authentication is a mechanism used to authenticate user identity over insecure communication channel. In this paper, a new method to improve the security of password authentication is proposed. It is based on the compression capability of the fractal image coding to provide an authorized user a secure access to registration and login process. In the proposed scheme, a hashed password s...

Fractal image coding suffers from its long encoding time. Block classification is often used to speed up coding processing, which uses some mechanism of classification when coding an image and only does match job for domain and range blocks with some similar features. D. Saupe’s classification algorithm of nearest neighbor search in feature space seems to have the best rate-distortion property ...