This paper presents an efficient quadtree based fractal image coding scheme in wavelet transform domain based on the wavelet based theory of fractal image compression introduced by Davis. In the scheme, zerotrees of...This paper presents an efficient quadtree based fractal image coding scheme in wavelet transform domain based on the wavelet based theory of fractal image compression introduced by Davis. In the scheme, zerotrees of wavelet coefficients are used to reduce the number of domain blocks, which leads to lower bit cost required to represent the location information of fractal coding, and overall entropy constrained optimization is performed for the decision trees as well as for the sets of scalar quantizers and self quantizers of wavelet subtrees. Experiment results show that at the low bit rates, the proposed scheme gives about 1 dB improvement in PSNR over the reported results.展开更多
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.展开更多
A chaos-based cryptosystem for fractal image coding is proposed. The Renyi chaotic map is employed to determine the order of processing the range blocks and to generate the keystream for masking the encoded sequence. ...A chaos-based cryptosystem for fractal image coding is proposed. The Renyi chaotic map is employed to determine the order of processing the range blocks and to generate the keystream for masking the encoded sequence. Compared with the standard approach of fraetal image coding followed by the Advanced Encryption Standard, our scheme offers a higher sensitivity to both plaintext and ciphertext at a comparable operating efficiency. The keystream generated by the Renyi chaotic map passes the randomness tests set by the United States National Institute of Standards and Technology, and so the proposed scheme is sensitive to the key.展开更多
Based on Jacquin's work. this paper presents an adaptive block-based fractal image coding scheme. Firstly. masking functions are used to classify range blocks and weight the mean Square error (MSE) of images. Seco...Based on Jacquin's work. this paper presents an adaptive block-based fractal image coding scheme. Firstly. masking functions are used to classify range blocks and weight the mean Square error (MSE) of images. Secondly, an adaptive block partition scheme is introduced by developing the quadtree partition method. Thirdly. a piecewise uniform quantization strategy is appled to quantize the luminance shifting. Finally. experiment results are shown and compared with what reported by Jacquin and Lu to verify the validity of the methods addressed by the authors.展开更多
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.
Nonwovens are fiber materials which are based on nonwoven technologies. For the complexity and randomness of nonwovens morphologic structures, it is difficult to express them effectively using classical method. Fracta...Nonwovens are fiber materials which are based on nonwoven technologies. For the complexity and randomness of nonwovens morphologic structures, it is difficult to express them effectively using classical method. Fractal geometry gives us a new idea and a powerful tool to study on irregularity of geometric objects. Therefore, we studied on the pore size, pore shape, pore size distribution and fiber orientation distribution of real nonwovens using fractal geometry combined with computer image analysis to evaluate nonwovens’ morphologic structures.展开更多
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.展开更多
Lapped transforms are introduced into fractal image coding to remove the block effects which exist in conventional block based fractal image compression both in spatial and frequency domains. The proposed method offe...Lapped transforms are introduced into fractal image coding to remove the block effects which exist in conventional block based fractal image compression both in spatial and frequency domains. The proposed method offers not only an efficient solution to such block effects but also better objective performances. Compared with the fractal image compression methods based on discrete cosine transform, about 1 dB SNR gains can be achieved.展开更多
Fractal image compression is a completely new method to compress images by searching and exploiting the self similarity of the whole image . Fractal Block Coding (FBC) is a practicable fractal coding schem...Fractal image compression is a completely new method to compress images by searching and exploiting the self similarity of the whole image . Fractal Block Coding (FBC) is a practicable fractal coding scheme with annoying slow encoding speed . In this paper, we classify the image blocks by Classified Vector Quantization (CVQ) technique and present an Adaptive Block Truncation Coding (ABTC) scheme to process the midrange blocks in the image. By this method , we reduce the encoding time to one forty fifth comparing to ordinary FBC method with little change in compression ratio and a little decreased coded image quality.展开更多
A new block-based fractal image coding algorithm called Fractal Block Coding in Residue Domain (FBCRD) is proposed. In basic Fractal Block Coding (FBC) algorithm, each block (called range block) is encoded by an affin...A new block-based fractal image coding algorithm called Fractal Block Coding in Residue Domain (FBCRD) is proposed. In basic Fractal Block Coding (FBC) algorithm, each block (called range block) is encoded by an affine mapping from a domain block within the same image to itself. The decoder uses the parameters of these mappings to synthesize the reconstructed image through an iterative procedure. FBCRD is a modification of basic FBC. In FBCRD, range blocks and domain blocks are all residue blocks subtracted from their block means and both the parameters of affine mappings and block means are coded. This modification leads to fewer iterations at the decoder. An optimized decoding strategy is also introduced which reduces total decoding time by more than half of that of basic FBC. This improvement is favorable for real time implementation of fractal image compression.展开更多
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.展开更多
Traditional fractal pattern design has some disadvantages such as inability to effectively reflect the characteristics of real scenery and texture. We propose a novel pattern design technique combining fractal geometr...Traditional fractal pattern design has some disadvantages such as inability to effectively reflect the characteristics of real scenery and texture. We propose a novel pattern design technique combining fractal geometry and image texture synthesis to solve these problems. We have improved Wei and Levoy (2000)’s texture synthesis algorithm by first using two-dimensional autocorrelation function to analyze the structure and distribution of textures, and then determining the size of L neighborhood. Several special fractal sets were adopted and HSL (Hue, Saturation, and Light) color space was chosen. The fractal structure was used to manipulate the texture synthesis in HSL color space where the pattern’s color can be adjusted conveniently. Experiments showed that patterns with different styles and different color characteristics can be more efficiently generated using the new technique.展开更多
In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The pro...In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The proposed method is called CHK (KDE of Collage error and Hu moment) and it is tested on the Vistex texture database with 640 natural images. Experimental results show that the Average Retrieval Rate (ARR) can reach into 78.18%, which demonstrates that the proposed method performs better than the one with parameters respectively as well as the commonly used histogram method both on retrieval rate and retrieval time.展开更多
Starting with a fractal-based image-compression algorithm based on wavelet transformation for hyperspectral images, the authors were able to obtain more spectral bands with the help of of hyperspectral remote sensing....Starting with a fractal-based image-compression algorithm based on wavelet transformation for hyperspectral images, the authors were able to obtain more spectral bands with the help of of hyperspectral remote sensing. Because large amounts of data and limited bandwidth complicate the storage and transmission of data measured by TB-level bits, it is important to compress image data acquired by hyperspectral sensors such as MODIS, PHI, and OMIS; otherwise, conventional lossless compression algorithms cannot reach adequate compression ratios. Other loss-compression methods can reach high compression ratios but lack good image fidelity, especially for hyperspectral image data. Among the third generation of image compression algorithms, fractal image compression based on wavelet transformation is superior to traditional compression methods,because it has high compression ratios and good image fidelity, and requires less computing time. To keep the spectral dimension invariable, the authors compared the results of two compression algorithms based on the storage-file structures of BSQ and of BIP, and improved the HV and Quadtree partitioning and domain-range matching algorithms in order to accelerate their encode/decode efficiency. The authors' Hyperspectral Image Process and Analysis System (HIPAS) software used a VC++6.0 integrated development environment (IDE), with which good experimental results were obtained. Possible modifications of the algorithm and limitations of the method are also discussed.展开更多
In Comparison with the traditional point-by-point line generation method,the method we present is based on segment code in Pan-Euclidean geometric space and is quite different in re- spect of running speed and theoret...In Comparison with the traditional point-by-point line generation method,the method we present is based on segment code in Pan-Euclidean geometric space and is quite different in re- spect of running speed and theoretical basis.This paper presents an approach of using segment code to draw straight lines and shows the characteristics of a digital line.It is a newly proposed al- gorithm applicable in CAD.展开更多
为了克服基于单一视差合成的光场图像编码方法在遮挡区域无法恢复纹理细节的问题,提出一种基于多特征融合和几何感知网络的光场图像编码方法,以进一步提升遮挡场景下光场图像的压缩性能.首先,对密集光场稀疏采样,使用通用视频编码器(ver...为了克服基于单一视差合成的光场图像编码方法在遮挡区域无法恢复纹理细节的问题,提出一种基于多特征融合和几何感知网络的光场图像编码方法,以进一步提升遮挡场景下光场图像的压缩性能.首先,对密集光场稀疏采样,使用通用视频编码器(versatile video coding,VVC)对稀疏光场进行压缩;然后,在解码端使用2个关键分支模块,即视差估计模块和空间角度联合卷积模块,以获取光场图像全局的几何信息,确保在密集纹理和遮挡区域能够更充分地恢复特征;最后,为了挖掘2个分支融合特征的结构信息,构建了双向视图的堆栈结构,并运用几何感知的细化网络以重建高质量的密集光场.实验结果表明,与已有国际上流行的光场图像编码方法相比,所提出的方法具有显著优势.展开更多
文摘This paper presents an efficient quadtree based fractal image coding scheme in wavelet transform domain based on the wavelet based theory of fractal image compression introduced by Davis. In the scheme, zerotrees of wavelet coefficients are used to reduce the number of domain blocks, which leads to lower bit cost required to represent the location information of fractal coding, and overall entropy constrained optimization is performed for the decision trees as well as for the sets of scalar quantizers and self quantizers of wavelet subtrees. Experiment results show that at the low bit rates, the proposed scheme gives about 1 dB improvement in PSNR over the reported results.
文摘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.
基金Project supported by the Research Grants Council of the Hong Kong Special Administrative Region,China(Grant No.CityU123009)
文摘A chaos-based cryptosystem for fractal image coding is proposed. The Renyi chaotic map is employed to determine the order of processing the range blocks and to generate the keystream for masking the encoded sequence. Compared with the standard approach of fraetal image coding followed by the Advanced Encryption Standard, our scheme offers a higher sensitivity to both plaintext and ciphertext at a comparable operating efficiency. The keystream generated by the Renyi chaotic map passes the randomness tests set by the United States National Institute of Standards and Technology, and so the proposed scheme is sensitive to the key.
文摘Based on Jacquin's work. this paper presents an adaptive block-based fractal image coding scheme. Firstly. masking functions are used to classify range blocks and weight the mean Square error (MSE) of images. Secondly, an adaptive block partition scheme is introduced by developing the quadtree partition method. Thirdly. a piecewise uniform quantization strategy is appled to quantize the luminance shifting. Finally. experiment results are shown and compared with what reported by Jacquin and Lu to verify the validity of the methods addressed by the authors.
文摘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.
文摘Nonwovens are fiber materials which are based on nonwoven technologies. For the complexity and randomness of nonwovens morphologic structures, it is difficult to express them effectively using classical method. Fractal geometry gives us a new idea and a powerful tool to study on irregularity of geometric objects. Therefore, we studied on the pore size, pore shape, pore size distribution and fiber orientation distribution of real nonwovens using fractal geometry combined with computer image analysis to evaluate nonwovens’ morphologic structures.
文摘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.
文摘Lapped transforms are introduced into fractal image coding to remove the block effects which exist in conventional block based fractal image compression both in spatial and frequency domains. The proposed method offers not only an efficient solution to such block effects but also better objective performances. Compared with the fractal image compression methods based on discrete cosine transform, about 1 dB SNR gains can be achieved.
文摘Fractal image compression is a completely new method to compress images by searching and exploiting the self similarity of the whole image . Fractal Block Coding (FBC) is a practicable fractal coding scheme with annoying slow encoding speed . In this paper, we classify the image blocks by Classified Vector Quantization (CVQ) technique and present an Adaptive Block Truncation Coding (ABTC) scheme to process the midrange blocks in the image. By this method , we reduce the encoding time to one forty fifth comparing to ordinary FBC method with little change in compression ratio and a little decreased coded image quality.
基金Defence Preresearch FoundationNational Science Foundation of Guangdong ProoinceNational "Chinbing" Project
文摘A new block-based fractal image coding algorithm called Fractal Block Coding in Residue Domain (FBCRD) is proposed. In basic Fractal Block Coding (FBC) algorithm, each block (called range block) is encoded by an affine mapping from a domain block within the same image to itself. The decoder uses the parameters of these mappings to synthesize the reconstructed image through an iterative procedure. FBCRD is a modification of basic FBC. In FBCRD, range blocks and domain blocks are all residue blocks subtracted from their block means and both the parameters of affine mappings and block means are coded. This modification leads to fewer iterations at the decoder. An optimized decoding strategy is also introduced which reduces total decoding time by more than half of that of basic FBC. This improvement is favorable for real time implementation of fractal image compression.
基金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.
基金Project supported by the Natural Science Foundation of Zhejiang Province (No. M603228), Zhejiang Science and Technology Plan Project, and Ningbo Science Foundation for Doctor, China
文摘Traditional fractal pattern design has some disadvantages such as inability to effectively reflect the characteristics of real scenery and texture. We propose a novel pattern design technique combining fractal geometry and image texture synthesis to solve these problems. We have improved Wei and Levoy (2000)’s texture synthesis algorithm by first using two-dimensional autocorrelation function to analyze the structure and distribution of textures, and then determining the size of L neighborhood. Several special fractal sets were adopted and HSL (Hue, Saturation, and Light) color space was chosen. The fractal structure was used to manipulate the texture synthesis in HSL color space where the pattern’s color can be adjusted conveniently. Experiments showed that patterns with different styles and different color characteristics can be more efficiently generated using the new technique.
基金Supported by the Fundamental Research Funds for the Central Universities (No. NS2012093)
文摘In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The proposed method is called CHK (KDE of Collage error and Hu moment) and it is tested on the Vistex texture database with 640 natural images. Experimental results show that the Average Retrieval Rate (ARR) can reach into 78.18%, which demonstrates that the proposed method performs better than the one with parameters respectively as well as the commonly used histogram method both on retrieval rate and retrieval time.
文摘Starting with a fractal-based image-compression algorithm based on wavelet transformation for hyperspectral images, the authors were able to obtain more spectral bands with the help of of hyperspectral remote sensing. Because large amounts of data and limited bandwidth complicate the storage and transmission of data measured by TB-level bits, it is important to compress image data acquired by hyperspectral sensors such as MODIS, PHI, and OMIS; otherwise, conventional lossless compression algorithms cannot reach adequate compression ratios. Other loss-compression methods can reach high compression ratios but lack good image fidelity, especially for hyperspectral image data. Among the third generation of image compression algorithms, fractal image compression based on wavelet transformation is superior to traditional compression methods,because it has high compression ratios and good image fidelity, and requires less computing time. To keep the spectral dimension invariable, the authors compared the results of two compression algorithms based on the storage-file structures of BSQ and of BIP, and improved the HV and Quadtree partitioning and domain-range matching algorithms in order to accelerate their encode/decode efficiency. The authors' Hyperspectral Image Process and Analysis System (HIPAS) software used a VC++6.0 integrated development environment (IDE), with which good experimental results were obtained. Possible modifications of the algorithm and limitations of the method are also discussed.
文摘In Comparison with the traditional point-by-point line generation method,the method we present is based on segment code in Pan-Euclidean geometric space and is quite different in re- spect of running speed and theoretical basis.This paper presents an approach of using segment code to draw straight lines and shows the characteristics of a digital line.It is a newly proposed al- gorithm applicable in CAD.
文摘为了克服基于单一视差合成的光场图像编码方法在遮挡区域无法恢复纹理细节的问题,提出一种基于多特征融合和几何感知网络的光场图像编码方法,以进一步提升遮挡场景下光场图像的压缩性能.首先,对密集光场稀疏采样,使用通用视频编码器(versatile video coding,VVC)对稀疏光场进行压缩;然后,在解码端使用2个关键分支模块,即视差估计模块和空间角度联合卷积模块,以获取光场图像全局的几何信息,确保在密集纹理和遮挡区域能够更充分地恢复特征;最后,为了挖掘2个分支融合特征的结构信息,构建了双向视图的堆栈结构,并运用几何感知的细化网络以重建高质量的密集光场.实验结果表明,与已有国际上流行的光场图像编码方法相比,所提出的方法具有显著优势.
