This article applied the self-similarity of fractal theory to the soybean leaf with the aid of powerful iterative computation ability of computer,analyzed the generation principle of IFS code in the iterated function ...This article applied the self-similarity of fractal theory to the soybean leaf with the aid of powerful iterative computation ability of computer,analyzed the generation principle of IFS code in the iterated function system,calculated the IFS code of the simulation soybean leaf.It basically realized the visualization simulation of soybean leaf and laid a foundation for the visualization simulation of the whole soybean plant.展开更多
This paper gives the definition of fractal affine transformation and presents a specific method for its realization and its corresponding mathematical equations which are essential in fractal image construction.
Traditionally, fractal image compression suffers from lengthy encoding time in measure ofhours. In this paper, combined with characteristlcs of human visual system, a flexible classification technique is proposed. Thi...Traditionally, fractal image compression suffers from lengthy encoding time in measure ofhours. In this paper, combined with characteristlcs of human visual system, a flexible classification technique is proposed. This yields a corresponding adaptive algorithm which can cut down the encoding timeinto second's magnitude. Experiment results suggest that the algorithm can balance the overall encodingperformance efficiently, that is, with a higher speed and a better PSNR gain.展开更多
In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system（IFS）. For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets ...In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system（IFS）. For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets are connected, if and only if all the N graphs are connected; in this case, the invariant sets are all locally connected and path connected. Our result extends the results on the connectedness of the self-similar sets.展开更多
A recent trend in computer graphics and image processing is to use Iterated Function System (IFS) to generate and describe both man-made graphics and natural images. Jacquin was the first to propose a fully automatic ...A recent trend in computer graphics and image processing is to use Iterated Function System (IFS) to generate and describe both man-made graphics and natural images. Jacquin was the first to propose a fully automatic gray scale image compression algorithm which is referred to as a typical static fractal transform based algorithm in this paper. By using this algorithm, an image can be condensely described as a fractal transform operator which is the combination of a set of fractal mappings. When the fractal transform operator is iteratedly applied to any initial image, a unique attractor (reconstructed image) can be achieved. In this paper) a dynamic fractal transform is presented which is a modification of the static transform. Instead of being fixed, the dynamic transform operator varies in each decoder iteration, thus differs from static transform operators. The new transform has advantages in improving coding efficiency and shows better convergence for the decoder.展开更多
基金Supported by Heilongjiang Natural Science Foundation of China(#C200607)Program for Innovative Research Team of Northeast Agricultural University,"IRTNEAU"
文摘This article applied the self-similarity of fractal theory to the soybean leaf with the aid of powerful iterative computation ability of computer,analyzed the generation principle of IFS code in the iterated function system,calculated the IFS code of the simulation soybean leaf.It basically realized the visualization simulation of soybean leaf and laid a foundation for the visualization simulation of the whole soybean plant.
文摘This paper gives the definition of fractal affine transformation and presents a specific method for its realization and its corresponding mathematical equations which are essential in fractal image construction.
文摘Traditionally, fractal image compression suffers from lengthy encoding time in measure ofhours. In this paper, combined with characteristlcs of human visual system, a flexible classification technique is proposed. This yields a corresponding adaptive algorithm which can cut down the encoding timeinto second's magnitude. Experiment results suggest that the algorithm can balance the overall encodingperformance efficiently, that is, with a higher speed and a better PSNR gain.
基金Supported by the Teaching Research Project of Hubei Province(2013469)the 12th Five-Year Project of Education Plan of Hubei Province(2014B379)
文摘In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system（IFS）. For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets are connected, if and only if all the N graphs are connected; in this case, the invariant sets are all locally connected and path connected. Our result extends the results on the connectedness of the self-similar sets.
文摘A recent trend in computer graphics and image processing is to use Iterated Function System (IFS) to generate and describe both man-made graphics and natural images. Jacquin was the first to propose a fully automatic gray scale image compression algorithm which is referred to as a typical static fractal transform based algorithm in this paper. By using this algorithm, an image can be condensely described as a fractal transform operator which is the combination of a set of fractal mappings. When the fractal transform operator is iteratedly applied to any initial image, a unique attractor (reconstructed image) can be achieved. In this paper) a dynamic fractal transform is presented which is a modification of the static transform. Instead of being fixed, the dynamic transform operator varies in each decoder iteration, thus differs from static transform operators. The new transform has advantages in improving coding efficiency and shows better convergence for the decoder.
