Based on explanation of wavelet fractal compression method, the significance of introducing wavelet decomposition into conventional fractal compression method is deeply investigated from the point of theoretical and p...Based on explanation of wavelet fractal compression method, the significance of introducing wavelet decomposition into conventional fractal compression method is deeply investigated from the point of theoretical and practical view. The result of study can be regarded as valuable guidelines for taking advantages of wavelet transform to develop more effective image compression algorithm.展开更多
A new fractal image compression scheme based on collage distance is explained, which can provide of the scheme two different compression codes containing their own unique collage distance sets and different types of s...A new fractal image compression scheme based on collage distance is explained, which can provide of the scheme two different compression codes containing their own unique collage distance sets and different types of similar transforms. The analysis and applications of the scheme indicate that it can be adopted as a suitable alternative for balancing between the distortion measure and compression ratio occurring in ordinary fractal compression method.展开更多
In this paper, the 3-D Wavelet-Fractal coder was used to compress the hyperspectral remote sensing image, which is a combination of 3-D improved set partitioning in hierarchical trees （SPIHT） coding and 3-D fractal ...In this paper, the 3-D Wavelet-Fractal coder was used to compress the hyperspectral remote sensing image, which is a combination of 3-D improved set partitioning in hierarchical trees （SPIHT） coding and 3-D fractal coding. Hyperspectral image date cube was first translated by 3-D wavelet and the 3-D fractal compression ceding was applied to lowest frequency subband. The remaining coefficients of higher frequency sub-bands were encoding by 3-D improved SPIHT. We used the block set instead of the hierarchical trees to enhance SPIHT＇s flexibility. The classical eight kinds of affme transformations in 2-D fractal image compression were generalized to nineteen for the 3-D fractal image compression. The new compression method had been tested on MATLAB. The experiment results indicate that we can gain high compression ratios and the information loss is acceptable.展开更多
Though progress has been made in fractal compression techniques, the longencoding times still remain the main drawback of this technique, which results from the need ofperforming a large number of range-domain matches...Though progress has been made in fractal compression techniques, the longencoding times still remain the main drawback of this technique, which results from the need ofperforming a large number of range-domain matches. The total encoding time is the sum of the timerequired to perform each match. In order to make this method more efficient in practical use, thefuzzy theory based on feature extraction of the projection and normalized codebook method has beenprovided to optimize the encoding time, based on the c-means clustering approach. The results of theimplementation of Rate Mean Square (RMS), Peak signal noise ratio (PSNR) and the encoding time ofthis proposed method have been compared to other methods like the Feature Extraction andSelf-orgarnization methods to show its efficiency.展开更多
This paper utilizes a spatial texture correlation and the intelligent classification algorithm （ICA） search strategy to speed up the encoding process and improve the bit rate for fractal image compression. Texture f...This paper utilizes a spatial texture correlation and the intelligent classification algorithm （ICA） search strategy to speed up the encoding process and improve the bit rate for fractal image compression. Texture features is one of the most important properties for the representation of an image. Entropy and maximum entry from co-occurrence matrices are used for representing texture features in an image. For a range block, concerned domain blocks of neighbouring range blocks with similar texture features can be searched. In addition, domain blocks with similar texture features are searched in the ICA search process. Experiments show that in comparison with some typical methods, the proposed algorithm significantly speeds up the encoding process and achieves a higher compression ratio, with a slight diminution in the quality of the reconstructed image; in comparison with a spatial correlation scheme, the proposed scheme spends much less encoding time while the compression ratio and the quality of the reconstructed image are almost the same.展开更多
A new method using plane fitting to decide whether a domain block is similar enough to a given range block is proposed in this paper. First, three coefficients are computed for describing each range and domain block. ...A new method using plane fitting to decide whether a domain block is similar enough to a given range block is proposed in this paper. First, three coefficients are computed for describing each range and domain block. Then, the best-matched one for every range block is obtained by analysing the relation between their coefficients. Experimental results show that the proposed method can shorten encoding time markedly, while the retrieved image quality is still acceptable. In the decoding step, a kind of simple line fitting on block boundaries is used to reduce blocking effects. At the same time, the proposed method can also achieve a high compression ratio.展开更多
The method of fractal image compression is introduced which is applied to compress the line structured light image. Based on the self similarity of the structured light image, we attain satisfactory compression ratio ...The method of fractal image compression is introduced which is applied to compress the line structured light image. Based on the self similarity of the structured light image, we attain satisfactory compression ratio and higher peak signal to noise ratio (PSNR). The experimental results indicate that this method can achieve high performance.展开更多
This paper presents a universal scheme （also called blind scheme） based on fractal compression and affinity propagation （AP） clustering to distinguish stego-images from cover grayscale images, which is a very chal...This paper presents a universal scheme （also called blind scheme） based on fractal compression and affinity propagation （AP） clustering to distinguish stego-images from cover grayscale images, which is a very challenging problem in steganalysis. Since fractal codes represent the ＂self-similarity＂ features of natural images, we adopt the statistical moment of fractal codes as the image features. We first build an image set to store the statistical features without hidden messages, of natural images with and and then apply the AP clustering technique to group this set. The experimental result shows that the proposed scheme performs better than Fridrich＇s traditional method.展开更多
There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency rendering algorithms. The i...There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency rendering algorithms. The invariant measures arising from IFSP (Iterate Function System with Probability) using the probabilistic algorithm are also known as chaos games. The role of these probabilities to generate the image of the attractor has been investigated using a multi-fractal analysis. The conventional choice of probability associated with each set /S/ to generate the attractor in least time possible is introduced, then a new method based on the self similarity and multi-fractal analysis is presented. The efficiency of the new method has been proved over the conventional method.展开更多
By analyzing the fine aggregate gradation scales from standards,fine aggregate in the asphalt mixture is regarded as a whole research object and fractal dimensions X of the samples were obtained by linear regression ...By analyzing the fine aggregate gradation scales from standards,fine aggregate in the asphalt mixture is regarded as a whole research object and fractal dimensions X of the samples were obtained by linear regression and（AC-13）is 2.43-2.56,Sup-13 is 2.28-2.54,SMA-13 is 2.66-2.88 and SAC-13 is 2.54-2.73.In the dense gradation mixture,there are little different between fractal dimensions of coarse and fine aggregates but it makes sense for skeleton asphalt mixture.For a given coarse aggregate gradation and the same percentage of coarse aggregates,the compressive strengths and splitting strengths of the asphalt mixture are studied when the fractal dimensions are selected as 2.60,2.65 and 2.70,respectively.When asphalt-stone ratio is less than optimal asphalt-stone ratio,the higher compressive strength is,the bigger X can be gotten.When asphalt-stone ratio is larger than optimal asphalt-stone ratio,little difference of compressive strength can be observed under these three conditions.The largest splitting strength can be got when X is 2.65,and larger splitting strength can be observed with the ascending of the asphalt-stone ratio.展开更多
A new fractal image compression algorithm based on high frequency energy (HFE) partitioning andmatched domain block searching is presented to code synthetic aperture radar (SAR) imagery. In the hybridcoding algorithm,...A new fractal image compression algorithm based on high frequency energy (HFE) partitioning andmatched domain block searching is presented to code synthetic aperture radar (SAR) imagery. In the hybridcoding algorithm, the original SAR image is decomposed to low frequency components and high frequencycomponents by wavelet transform (WT). Then the coder uses HFE of block to partition and searchthe matched domain block for each range block to code the low frequency components. For the high frequencycomponents, a modified embedded zero-tree wavelet coding algorithm is applied. Experiment resultsshow that the proposed coder obtains about 0. 3dB gain when compared to the traditional fractal coderbased on the quadtree partition. Moreover, the subjective visual quality of the reconstructed SAR imageof the proposed coder outperforms that of the traditional fractal coders in the same compression ratio(CR).展开更多
基金This project is supported by the National Natural Science Foundation of China (No. 69774030) Foundation for University Key Teacher by the Ministry of Education.
文摘Based on explanation of wavelet fractal compression method, the significance of introducing wavelet decomposition into conventional fractal compression method is deeply investigated from the point of theoretical and practical view. The result of study can be regarded as valuable guidelines for taking advantages of wavelet transform to develop more effective image compression algorithm.
基金This project is supported by the National Natural Science Foundation of China (No. 69774030) Foundation for University Key Teacher by the Ministry of Education.
文摘A new fractal image compression scheme based on collage distance is explained, which can provide of the scheme two different compression codes containing their own unique collage distance sets and different types of similar transforms. The analysis and applications of the scheme indicate that it can be adopted as a suitable alternative for balancing between the distortion measure and compression ratio occurring in ordinary fractal compression method.
基金National Natural Science Foundation of China (No.60975084)
文摘In this paper, the 3-D Wavelet-Fractal coder was used to compress the hyperspectral remote sensing image, which is a combination of 3-D improved set partitioning in hierarchical trees （SPIHT） coding and 3-D fractal coding. Hyperspectral image date cube was first translated by 3-D wavelet and the 3-D fractal compression ceding was applied to lowest frequency subband. The remaining coefficients of higher frequency sub-bands were encoding by 3-D improved SPIHT. We used the block set instead of the hierarchical trees to enhance SPIHT＇s flexibility. The classical eight kinds of affme transformations in 2-D fractal image compression were generalized to nineteen for the 3-D fractal image compression. The new compression method had been tested on MATLAB. The experiment results indicate that we can gain high compression ratios and the information loss is acceptable.
文摘Though progress has been made in fractal compression techniques, the longencoding times still remain the main drawback of this technique, which results from the need ofperforming a large number of range-domain matches. The total encoding time is the sum of the timerequired to perform each match. In order to make this method more efficient in practical use, thefuzzy theory based on feature extraction of the projection and normalized codebook method has beenprovided to optimize the encoding time, based on the c-means clustering approach. The results of theimplementation of Rate Mean Square (RMS), Peak signal noise ratio (PSNR) and the encoding time ofthis proposed method have been compared to other methods like the Feature Extraction andSelf-orgarnization methods to show its efficiency.
基金supported by the National Natural Science Foundation of China (Grant Nos. 60573172 and 60973152)the Superior University Doctor Subject Special Scientific Research Foundation of China (Grant No. 20070141014)the Natural Science Foundation of Liaoning Province of China (Grant No. 20082165)
文摘This paper utilizes a spatial texture correlation and the intelligent classification algorithm （ICA） search strategy to speed up the encoding process and improve the bit rate for fractal image compression. Texture features is one of the most important properties for the representation of an image. Entropy and maximum entry from co-occurrence matrices are used for representing texture features in an image. For a range block, concerned domain blocks of neighbouring range blocks with similar texture features can be searched. In addition, domain blocks with similar texture features are searched in the ICA search process. Experiments show that in comparison with some typical methods, the proposed algorithm significantly speeds up the encoding process and achieves a higher compression ratio, with a slight diminution in the quality of the reconstructed image; in comparison with a spatial correlation scheme, the proposed scheme spends much less encoding time while the compression ratio and the quality of the reconstructed image are almost the same.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61173183, 60973152, and 60573172)the Special Scientific Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20070141014)the Natural Science Foundation of Liaoning Province, China (Grant No. 20082165)
文摘A new method using plane fitting to decide whether a domain block is similar enough to a given range block is proposed in this paper. First, three coefficients are computed for describing each range and domain block. Then, the best-matched one for every range block is obtained by analysing the relation between their coefficients. Experimental results show that the proposed method can shorten encoding time markedly, while the retrieved image quality is still acceptable. In the decoding step, a kind of simple line fitting on block boundaries is used to reduce blocking effects. At the same time, the proposed method can also achieve a high compression ratio.
文摘The method of fractal image compression is introduced which is applied to compress the line structured light image. Based on the self similarity of the structured light image, we attain satisfactory compression ratio and higher peak signal to noise ratio (PSNR). The experimental results indicate that this method can achieve high performance.
基金supported by the National Natural Science Foundation of China under Grant No. 61070208the Postdoctor Foundation from North Electronic Systems Engineering Corporation
文摘This paper presents a universal scheme （also called blind scheme） based on fractal compression and affinity propagation （AP） clustering to distinguish stego-images from cover grayscale images, which is a very challenging problem in steganalysis. Since fractal codes represent the ＂self-similarity＂ features of natural images, we adopt the statistical moment of fractal codes as the image features. We first build an image set to store the statistical features without hidden messages, of natural images with and and then apply the AP clustering technique to group this set. The experimental result shows that the proposed scheme performs better than Fridrich＇s traditional method.
文摘There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency rendering algorithms. The invariant measures arising from IFSP (Iterate Function System with Probability) using the probabilistic algorithm are also known as chaos games. The role of these probabilities to generate the image of the attractor has been investigated using a multi-fractal analysis. The conventional choice of probability associated with each set /S/ to generate the attractor in least time possible is introduced, then a new method based on the self similarity and multi-fractal analysis is presented. The efficiency of the new method has been proved over the conventional method.
基金Funded by National Key Technology R&D Program in the 11th Five Year Plan of China(No.2006BAJ05B07-04)
文摘By analyzing the fine aggregate gradation scales from standards,fine aggregate in the asphalt mixture is regarded as a whole research object and fractal dimensions X of the samples were obtained by linear regression and（AC-13）is 2.43-2.56,Sup-13 is 2.28-2.54,SMA-13 is 2.66-2.88 and SAC-13 is 2.54-2.73.In the dense gradation mixture,there are little different between fractal dimensions of coarse and fine aggregates but it makes sense for skeleton asphalt mixture.For a given coarse aggregate gradation and the same percentage of coarse aggregates,the compressive strengths and splitting strengths of the asphalt mixture are studied when the fractal dimensions are selected as 2.60,2.65 and 2.70,respectively.When asphalt-stone ratio is less than optimal asphalt-stone ratio,the higher compressive strength is,the bigger X can be gotten.When asphalt-stone ratio is larger than optimal asphalt-stone ratio,little difference of compressive strength can be observed under these three conditions.The largest splitting strength can be got when X is 2.65,and larger splitting strength can be observed with the ascending of the asphalt-stone ratio.
基金Supported by the National Natural Science Foundation of China (No. 90304003)the President Fund of GUCAS (No. O85101HM03).
文摘A new fractal image compression algorithm based on high frequency energy (HFE) partitioning andmatched domain block searching is presented to code synthetic aperture radar (SAR) imagery. In the hybridcoding algorithm, the original SAR image is decomposed to low frequency components and high frequencycomponents by wavelet transform (WT). Then the coder uses HFE of block to partition and searchthe matched domain block for each range block to code the low frequency components. For the high frequencycomponents, a modified embedded zero-tree wavelet coding algorithm is applied. Experiment resultsshow that the proposed coder obtains about 0. 3dB gain when compared to the traditional fractal coderbased on the quadtree partition. Moreover, the subjective visual quality of the reconstructed SAR imageof the proposed coder outperforms that of the traditional fractal coders in the same compression ratio(CR).
