In this paper, image compression and decompression are realized on a personal computer based on fractal theory. The algorithm is effectiveas as the reconstructed image is similar to the original. In the algorithm, the...In this paper, image compression and decompression are realized on a personal computer based on fractal theory. The algorithm is effectiveas as the reconstructed image is similar to the original. In the algorithm, the formulas for contrast scaling and luminance shift are simplified,and the Hausdorff distance is replaced by the Euclidean distance. Thus, the calculation load is reduced. The formula for compression ratio is presented for an ideal situation, from which one can analyze how the different factors influence image compression ratio.展开更多
Geographic information system(GIS)technology is a combination of computer’s graphic and database to store and process spatial information.According to the users’ demands,GIS exports the exact geographic information ...Geographic information system(GIS)technology is a combination of computer’s graphic and database to store and process spatial information.According to the users’ demands,GIS exports the exact geographic information and related in- formation for users with map and description through associating geographic place and related attributes.Based on the existing pop- ular technology,this paper presents a distributed web GIS application based on component technology and fractal image compres- sion.It presents the basic framework of the proposed system at first,and then discusses the key technology of implementing this sys- tem;finally it designs a three-layer WEB GIS instance using VC++ATL based on Geo Beans.The example suggests the proposed design is correct,feasible and valid.展开更多
Fast algorithms for reducing encoding complexity of fractal image coding have recently been an important research topic. Search of the best matched domain block is the most computation intensive part of the fractal en...Fast algorithms for reducing encoding complexity of fractal image coding have recently been an important research topic. Search of the best matched domain block is the most computation intensive part of the fractal encoding process. In this paper, a fast fractal approximation coding scheme implemented on a personal computer based on matching in range block's neighbours is presented.Experimental results show that the proposed algorithm is very simple in implementation, fast in encoding time and high in compression ratio while PSNR is almost the same as compared with Barnsley's fractal block coding .展开更多
We present lower and upper bounds for the box dimension of the graphs of certain nonaffine fractal interpolation functions by generalizing the results that hold for the affine case.
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.展开更多
Some shortcomings of common fractal image coding methods are studied , then they are corrected with a new method. The new method is improved further in DCT domain. Coding results show the advantage of the new method.
Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated Function System (IFS) corresponding to a data set is the graph of the...Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated Function System (IFS) corresponding to a data set is the graph of the FIF. Coalescence Hidden-variable Fractal Interpolation Function (CHFIF) is both self-affine and non self-affine in nature depending on the free variables and constrained free variables for a generalized IFS. In this article, graph directed iterated function system for a finite number of generalized data sets is considered and it is shown that the projection of the attractors on is the graph of the CHFIFs interpolating the corresponding data sets.展开更多
Fractal geometry provides a new insight to the approximation and modelling of experimental data. We give the construction of complete cubic fractal splines from a suitable basis and their error bounds with the origina...Fractal geometry provides a new insight to the approximation and modelling of experimental data. We give the construction of complete cubic fractal splines from a suitable basis and their error bounds with the original function. These univariate properties are then used to investigate complete bicubic fractal splines over a rectangle Bicubic fractal splines are invariant in all scales and they generalize classical bicubic splines. Finally, for an original function , upper bounds of the error for the complete bicubic fractal splines and derivatives are deduced. The effect of equal and non-equal scaling vectors on complete bicubic fractal splines were illustrated with suitably chosen examples.展开更多
Research and application of fractal theory in landscape design has greatly enriched the concepts and techniques of garden creation,and pushed forward landscape design closer to the natural world.By elaborating interna...Research and application of fractal theory in landscape design has greatly enriched the concepts and techniques of garden creation,and pushed forward landscape design closer to the natural world.By elaborating internal connection between fractal theory and landscape design,this paper uses iterative function system of the fractal theory and matlab to draw fractal trees.Two designed experiments demonstrate that the fractal theory can be employed to realize the vivid drawing of natural landscapes with the support of limited data.Therefore,fractal theory is a practical tool used to draw vivid natural landscapes efficiently.展开更多
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.
In recent years,the three dimensional reconstruction of vascular structures in the field of medical research has been extensively developed.Several studies describe the various numerical methods to numerical modeling ...In recent years,the three dimensional reconstruction of vascular structures in the field of medical research has been extensively developed.Several studies describe the various numerical methods to numerical modeling of vascular structures in near-reality.However,the current approaches remain too expensive in terms of storage capacity.Therefore,it is necessary to find the right balance between the relevance of information and storage space.This article adopts two sets of human retinal blood vessel data in 3D to proceed with data reduction in the first part and then via 3D fractal reconstruction,recreate them in a second part.The results show that the reduction rate obtained is between 66%and 95%as a function of the tolerance rate.Depending on the number of iterations used,the 3D blood vessel model is successful at reconstruction with an average error of 0.19 to 5.73 percent between the original picture and the reconstructed image.展开更多
Employing the properties of the affine mappings, a very novel fractal model scheme based on the iterative function system is proposed. We obtain the vertical scaling factors by a set of the middle points in each affin...Employing the properties of the affine mappings, a very novel fractal model scheme based on the iterative function system is proposed. We obtain the vertical scaling factors by a set of the middle points in each affine transform, solving the difficulty in determining the vertical scaling factors, one of the most difficult challenges faced by the fractal interpolation. The proposed method is carried out by interpolating the known attractor and the real discrete sequences from seismic data. The results show that a great accuracy in reconstruction of the known attractor and seismic profile is found, leading to a significant improvement over other fractal interpolation schemes.展开更多
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.展开更多
Random iterated function systems (IFSs) is discussed, which is one of the methods for fractal drawing. A certain figure can be reconstructed by a random IFS. One approach is presented to determine a new random IFS, th...Random iterated function systems (IFSs) is discussed, which is one of the methods for fractal drawing. A certain figure can be reconstructed by a random IFS. One approach is presented to determine a new random IFS, that the figure reconstructed by the new random IFS is the image of the origin figure reconstructed by old IFS under a given affine transformation. Two particular examples are used to show this approach.展开更多
A novel paradigm for fractal coding selectively corrects the fractal code for selected domain blocks with an image-adaptive VQ codebook. The codebook is generated from the initial uncorrected fractal code and is, ther...A novel paradigm for fractal coding selectively corrects the fractal code for selected domain blocks with an image-adaptive VQ codebook. The codebook is generated from the initial uncorrected fractal code and is, therefore, available at the decoder. An efficient trade-off is generated between incremental performance and bit rate.展开更多
The definition of generalized product of fractal is first put forward for the research on the relations between original fractal and its product of fractal when the transformations of iteration function system （IFS）...The definition of generalized product of fractal is first put forward for the research on the relations between original fractal and its product of fractal when the transformations of iteration function system （IFS） are incomplete. Then the representations of generalized product of IFS are discussed based on the theory of the product of fractal. Furthermore, the dimensional relations between the product of fractal and its semi-product are obtained. The dimensional relations of self-similar set are discussed. Finally, the examples for rendering fractal graphs are given. These results posses potentials in image compression and pattern recognition.展开更多
Iterated function system （IFS） models have been used to represent discrete sequences where the attractor of the IFS is piece-wise self-affine in R2 or R3 （R is the set of real numbers）. In this paper, the piece-wi...Iterated function system （IFS） models have been used to represent discrete sequences where the attractor of the IFS is piece-wise self-affine in R2 or R3 （R is the set of real numbers）. In this paper, the piece-wise self-affine IFS model is extended from R3 to Rn （n is an integer greater than 3）, which is called the multi-dimensional piece-wise self-affine fractal interpolation model. This model uses a ＂mapping partial derivative＂, and a constrained inverse algorithm to identify the model parameters. The model values depend continuously on all the model parameters, and represent most data which are not multi-dimensional self-affine in R^n. Therefore, the result is very general. The class of functions obtained is much more diverse because their values depend continuously on all of the variables, with all the coefficients of the possible multi-dimensional affine maps determining the functions.展开更多
针对从基于压缩超快成像(Compressed Ultrafast Photography,CUP)的任意反射面速度干涉仪(Velocity Interferometer System for Any Reflector,VISAR)中获得的压缩图像中重构出冲击波二维条纹图像的问题,提出一种基于卡尔曼滤波的双约...针对从基于压缩超快成像(Compressed Ultrafast Photography,CUP)的任意反射面速度干涉仪(Velocity Interferometer System for Any Reflector,VISAR)中获得的压缩图像中重构出冲击波二维条纹图像的问题,提出一种基于卡尔曼滤波的双约束图像重构算法。该算法首先基于条纹图像具有的稀疏性和平滑性,将问题转化为基于小波与全变分双先验约束的优化问题,然后,考虑到实际成像的噪声问题,采用加权卡尔曼滤波对图像已有信息进行预测和调整,最后将卡尔曼滤波引入二步迭代阈值算法的迭代过程中,进而求解该双约束优化问题,实现压缩图像的精确重构。在大噪声仿真实验中,该算法重构图像的峰值信噪比和结构相似度分别提高了4.8 dB和14.81%,显著提高了图像重构质量。在实际实验中,该算法重构出了清晰的冲击波条纹图像,且将冲击波速度最大相对误差降低了9.57%和平均相对误差降低了2.2%,验证了该算法的可行性。展开更多
文摘In this paper, image compression and decompression are realized on a personal computer based on fractal theory. The algorithm is effectiveas as the reconstructed image is similar to the original. In the algorithm, the formulas for contrast scaling and luminance shift are simplified,and the Hausdorff distance is replaced by the Euclidean distance. Thus, the calculation load is reduced. The formula for compression ratio is presented for an ideal situation, from which one can analyze how the different factors influence image compression ratio.
文摘Geographic information system(GIS)technology is a combination of computer’s graphic and database to store and process spatial information.According to the users’ demands,GIS exports the exact geographic information and related in- formation for users with map and description through associating geographic place and related attributes.Based on the existing pop- ular technology,this paper presents a distributed web GIS application based on component technology and fractal image compres- sion.It presents the basic framework of the proposed system at first,and then discusses the key technology of implementing this sys- tem;finally it designs a three-layer WEB GIS instance using VC++ATL based on Geo Beans.The example suggests the proposed design is correct,feasible and valid.
文摘Fast algorithms for reducing encoding complexity of fractal image coding have recently been an important research topic. Search of the best matched domain block is the most computation intensive part of the fractal encoding process. In this paper, a fast fractal approximation coding scheme implemented on a personal computer based on matching in range block's neighbours is presented.Experimental results show that the proposed algorithm is very simple in implementation, fast in encoding time and high in compression ratio while PSNR is almost the same as compared with Barnsley's fractal block coding .
文摘We present lower and upper bounds for the box dimension of the graphs of certain nonaffine fractal interpolation functions by generalizing the results that hold for the affine case.
文摘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.
文摘Some shortcomings of common fractal image coding methods are studied , then they are corrected with a new method. The new method is improved further in DCT domain. Coding results show the advantage of the new method.
文摘Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated Function System (IFS) corresponding to a data set is the graph of the FIF. Coalescence Hidden-variable Fractal Interpolation Function (CHFIF) is both self-affine and non self-affine in nature depending on the free variables and constrained free variables for a generalized IFS. In this article, graph directed iterated function system for a finite number of generalized data sets is considered and it is shown that the projection of the attractors on is the graph of the CHFIFs interpolating the corresponding data sets.
文摘Fractal geometry provides a new insight to the approximation and modelling of experimental data. We give the construction of complete cubic fractal splines from a suitable basis and their error bounds with the original function. These univariate properties are then used to investigate complete bicubic fractal splines over a rectangle Bicubic fractal splines are invariant in all scales and they generalize classical bicubic splines. Finally, for an original function , upper bounds of the error for the complete bicubic fractal splines and derivatives are deduced. The effect of equal and non-equal scaling vectors on complete bicubic fractal splines were illustrated with suitably chosen examples.
基金Supported by National University Student Innovation Program of Beijing Forestry University~~
文摘Research and application of fractal theory in landscape design has greatly enriched the concepts and techniques of garden creation,and pushed forward landscape design closer to the natural world.By elaborating internal connection between fractal theory and landscape design,this paper uses iterative function system of the fractal theory and matlab to draw fractal trees.Two designed experiments demonstrate that the fractal theory can be employed to realize the vivid drawing of natural landscapes with the support of limited data.Therefore,fractal theory is a practical tool used to draw vivid natural landscapes efficiently.
文摘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.
文摘In recent years,the three dimensional reconstruction of vascular structures in the field of medical research has been extensively developed.Several studies describe the various numerical methods to numerical modeling of vascular structures in near-reality.However,the current approaches remain too expensive in terms of storage capacity.Therefore,it is necessary to find the right balance between the relevance of information and storage space.This article adopts two sets of human retinal blood vessel data in 3D to proceed with data reduction in the first part and then via 3D fractal reconstruction,recreate them in a second part.The results show that the reduction rate obtained is between 66%and 95%as a function of the tolerance rate.Depending on the number of iterations used,the 3D blood vessel model is successful at reconstruction with an average error of 0.19 to 5.73 percent between the original picture and the reconstructed image.
基金supported by the National Natural Science Foundation of China (Grant Nos.60972004 and 60402004)
文摘Employing the properties of the affine mappings, a very novel fractal model scheme based on the iterative function system is proposed. We obtain the vertical scaling factors by a set of the middle points in each affine transform, solving the difficulty in determining the vertical scaling factors, one of the most difficult challenges faced by the fractal interpolation. The proposed method is carried out by interpolating the known attractor and the real discrete sequences from seismic data. The results show that a great accuracy in reconstruction of the known attractor and seismic profile is found, leading to a significant improvement over other fractal interpolation schemes.
文摘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.
文摘Random iterated function systems (IFSs) is discussed, which is one of the methods for fractal drawing. A certain figure can be reconstructed by a random IFS. One approach is presented to determine a new random IFS, that the figure reconstructed by the new random IFS is the image of the origin figure reconstructed by old IFS under a given affine transformation. Two particular examples are used to show this approach.
文摘A novel paradigm for fractal coding selectively corrects the fractal code for selected domain blocks with an image-adaptive VQ codebook. The codebook is generated from the initial uncorrected fractal code and is, therefore, available at the decoder. An efficient trade-off is generated between incremental performance and bit rate.
基金supported by National Natural Science Foundation of China (50575026, 50275013), National High-Tech. R&D Program for CIMS (2001AA412011).
文摘The definition of generalized product of fractal is first put forward for the research on the relations between original fractal and its product of fractal when the transformations of iteration function system （IFS） are incomplete. Then the representations of generalized product of IFS are discussed based on the theory of the product of fractal. Furthermore, the dimensional relations between the product of fractal and its semi-product are obtained. The dimensional relations of self-similar set are discussed. Finally, the examples for rendering fractal graphs are given. These results posses potentials in image compression and pattern recognition.
文摘Iterated function system （IFS） models have been used to represent discrete sequences where the attractor of the IFS is piece-wise self-affine in R2 or R3 （R is the set of real numbers）. In this paper, the piece-wise self-affine IFS model is extended from R3 to Rn （n is an integer greater than 3）, which is called the multi-dimensional piece-wise self-affine fractal interpolation model. This model uses a ＂mapping partial derivative＂, and a constrained inverse algorithm to identify the model parameters. The model values depend continuously on all the model parameters, and represent most data which are not multi-dimensional self-affine in R^n. Therefore, the result is very general. The class of functions obtained is much more diverse because their values depend continuously on all of the variables, with all the coefficients of the possible multi-dimensional affine maps determining the functions.
文摘针对从基于压缩超快成像(Compressed Ultrafast Photography,CUP)的任意反射面速度干涉仪(Velocity Interferometer System for Any Reflector,VISAR)中获得的压缩图像中重构出冲击波二维条纹图像的问题,提出一种基于卡尔曼滤波的双约束图像重构算法。该算法首先基于条纹图像具有的稀疏性和平滑性,将问题转化为基于小波与全变分双先验约束的优化问题,然后,考虑到实际成像的噪声问题,采用加权卡尔曼滤波对图像已有信息进行预测和调整,最后将卡尔曼滤波引入二步迭代阈值算法的迭代过程中,进而求解该双约束优化问题,实现压缩图像的精确重构。在大噪声仿真实验中,该算法重构图像的峰值信噪比和结构相似度分别提高了4.8 dB和14.81%,显著提高了图像重构质量。在实际实验中,该算法重构出了清晰的冲击波条纹图像,且将冲击波速度最大相对误差降低了9.57%和平均相对误差降低了2.2%,验证了该算法的可行性。
