To predict the peak signal-to-noise ratio (PSNR) quality of decoded images in fractal image coding more efficiently and accurately, an improved method is proposed. After some derivations and analyses, we find that the...
详细信息
To predict the peak signal-to-noise ratio (PSNR) quality of decoded images in fractal image coding more efficiently and accurately, an improved method is proposed. After some derivations and analyses, we find that the linear correlation coefficients between coded range blocks and their respective best-matched domain blocks can determine the dynamic range of their collage errors, which can also provide the minimum and the maximum of the accumulated collage error (ACE) of uncoded range blocks. Moreover, the dynamic range of the actual percentage of accumulated collage error (APACE), APACEmin to APACEmax, can be determined as well. When APACEmin reaches a large value, such as 90%, APACEmin to APACEmax will be limited in a small range and APACE can be computed approximately. Furthermore, with ACE and the approximate APACE, the ACE of all range blocks and the average collage error (ACER) can be obtained. Finally, with the logarithmic relationship between ACER and the PSNR quality of decoded images, the PSNR quality of decoded images can be predicted directly. Experiments show that compared with the previous similar method, the proposed method can predict the PSNR quality of decoded images more accurately and needs less computation time simultaneously. (C) 2017 SPIE and IS&T
An effective method was proposed to improve the performance of fractal decoded image quality prediction. Firstly, we found that the dynamic range of the linear correlation coefficients (LCCs) between range blocks and ...
详细信息
An effective method was proposed to improve the performance of fractal decoded image quality prediction. Firstly, we found that the dynamic range of the linear correlation coefficients (LCCs) between range blocks and their respective best-matched domain blocks was significantly extended by a small number of outliers which contribute little to accumulated collage error and reduced the prediction accuracy. Secondly, to remove the outliers of LCCs, we introduced the effective minimum and maximum of LCCs that can provide the effective bottom and top limits of the actual percentage of accumulated collage error (APACE), EBL-APACE and ETL-APACE, respectively. Finally, by estimating APACE with the average of EBL-APACE and ETL-APACE, the decoded image quality can be directly predicted with the accumulated collage error divided by the estimated APACE. Three state-of-the-art and conventional fractal encoding methods were adopted to verify the effectiveness of the proposed method. Experimental results show that the proposed method can reduce the computational complexity by 2%-7% while maintaining comparable or higher prediction accuracy regarding the previous method.
Recently, there has been significant interest in robust fractal image coding for the purpose of robustness against outliers. However, the known robust fractalcoding methods (HFIC and LAD-FIC, etc.) are not optimal, s...
详细信息
Recently, there has been significant interest in robust fractal image coding for the purpose of robustness against outliers. However, the known robust fractalcoding methods (HFIC and LAD-FIC, etc.) are not optimal, since, besides the high computational cost, they use the corrupted domain block as the independent variable in the robust regression model, which may adversely affect the robust estimator to calculate the fractal parameters (depending on the noise level). This paper presents a Huber fitting plane-based fractal image coding (HFPFIC) method. This method builds Huber fitting planes (HFPs) for the domain and range blocks, respectively, ensuring the use of an uncorrupted independent variable in the robust model. On this basis, a new matching error function is introduced to robustly evaluate the best scaling factor. Meanwhile, a median absolute deviation (MAD) about the median decomposition criterion is proposed to achieve fast adaptive quadtree partitioning for the image corrupted by salt & pepper noise. In order to reduce computational cost, the no-search method is applied to speedup the encoding process. Experimental results show that the proposed HFPFIC can yield superior performance over conventional robust fractal image coding methods in encoding speed and the quality of the restored image. Furthermore, the no-search method can significantly reduce encoding time and achieve less than 2.0 s for the HFPFIC with acceptable image quality degradation. In addition, we show that, combined with the MAD decomposition scheme, the HFP technique used as a robust method can further reduce the encoding time while maintaining image quality.
In this paper, we present a classification algorithm in fractal image coding. Based on the contraction characteristics of transformations in fractal image coding, the algorithm uses the notion of feature difference to...
详细信息
In this paper, we present a classification algorithm in fractal image coding. Based on the contraction characteristics of transformations in fractal image coding, the algorithm uses the notion of feature difference to speed up the domain-range matching routine of the coding. The algorithm can effectively exclude pseudo matches during the process of domain-range matching and result in significant improvement of the rate-distortion performance. It can also be easily realized in cooperation with many other speedup schemes.
Some influential fractal methods are first discussed in this paper. Then a dual-classification technique is used to optimize the Same-Sized Block Mapping scheme. leading to considerable speed-up with no loss in fideli...
详细信息
Some influential fractal methods are first discussed in this paper. Then a dual-classification technique is used to optimize the Same-Sized Block Mapping scheme. leading to considerable speed-up with no loss in fidelity. The process of our FX(HX) scheme is also proposed in detail. Finally, the good performance can be seen in experimental results.
Perceptual image hashing finds increasing attention in several multimedia security applications. However, reaching the trade-off balance between the two most important properties of image hashing- robustness and discr...
详细信息
Perceptual image hashing finds increasing attention in several multimedia security applications. However, reaching the trade-off balance between the two most important properties of image hashing- robustness and discrimination, still remains the most restive challenge in hashing schemes. In this study, a robust image hashing technique is proposed by incorporating ring partition and fractal image coding. The scheme starts by normalizing the image to help in extracting its local features. Then the concept of ring partition is introduced in order to make our hash rotation invariant by dividing the image into 5 different rings to form a secondary image that possesses the invariant property. Further, imagecoding is introduced by extracting the structural fractal features to exploit dimensionality reduction and compression, hence, generating a robust hash. To ensure the system's security, encryption is performed on the generated fractal elements before the final hash construction. We conduct series of experiments to evaluate the performance of our scheme. The achieved result shows that our scheme is robust against several content-preserving attacks such as image rotation, JPEG compression, gamma correction, gaussian low pass filtering, image scaling, cropping, brightness adjustment and contrast adjustment. In addition, the receiver operating characteristics is used to show the discriminative capability and robustness of our scheme as compared to other state-of-art schemes in the literature.
fractal-based imagecoding is one of the efficient methods for grayscale image since the reconstructed images are resolution independent and also has low reconstruction time. This paper discusses the efficiency of hie...
详细信息
fractal-based imagecoding is one of the efficient methods for grayscale image since the reconstructed images are resolution independent and also has low reconstruction time. This paper discusses the efficiency of hierarchical classification strategy for fractal image coding that uses adaptive quadtree partitioning. The scheme forms two level hierarchical domain groups and ranges are matched with similar hierarchical domain class. The fractal image coding technique with hierarchical classification strategy is then modified also to improve the compression ratio by using an efficient loss-less coding scheme OLZW on fractal compressed image. A variant of OLZW, i.e., MOLZW is also applied for the same. These modified variants show their significant improvements in compression ratio without degradation of image quality.
An efficient fractalimage-coding method that exploits the correlation between range blocks is proposed. Four domain blocks mapped by the previous neighboring range blocks are considered as the good candidate blocks o...
详细信息
An efficient fractalimage-coding method that exploits the correlation between range blocks is proposed. Four domain blocks mapped by the previous neighboring range blocks are considered as the good candidate blocks of the input range block. Experimental results show that when the proposed method is implemented with a fast fractalcoding algorithm, it can further reduce the encoding time and bit rate with insignificant loss of image quality.
This paper presents an efficient quadtree based fractal image coding scheme in wavelet transform domain based on the wavelet based theory of fractalimage 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 fractalimage 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 fractalcoding, 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.
Considering the characteristics of human visual system, this paper presents a plain block selecting standard in DCT domain based on visual acuity. This standard excels the frequently used block variance and SNR measur...
详细信息
Considering the characteristics of human visual system, this paper presents a plain block selecting standard in DCT domain based on visual acuity. This standard excels the frequently used block variance and SNR measurements. Based on the standard, the computational complexity of the fractalimage compression is reduced by selecting out the uniform parts in the DCT domain and encoding output the direct current directly without any fractal matching. For encoding time further reducing, the frequency response of human visual system is introduced in the DCT domain to classify the picture blocks and similar blocks and the visual effects of the decoded images are guaranteed in the matching computation of redundancy filtering. Experiment shows that provided with the same compression ratio, the encoding time is greatly reduced with improved PSNR and much better visual effect.
暂无评论