The essence of Huber fractal image coding (HFIC) is to predict the fractal code of a noiseless image as accurately as possible from its corrupted observation with outliers by adopting Huber M-estimation technique. How...
详细信息
The essence of Huber fractal image coding (HFIC) is to predict the fractal code of a noiseless image as accurately as possible from its corrupted observation with outliers by adopting Huber M-estimation technique. However, the traditional HFIC is not quite satisfactory mainly due to the absence of contractivity restriction for the estimate of the fractal parameters (actually, it is a fundamental requirement in the theory of fractal image coding). In this paper, we introduce a primal-dual algorithm for robust fractal image coding (PD-RFIC), which formulates the problem of robust prediction of the fractal parameters with contractivity condition as a constrained optimization model and then adopts a primal-dual algorithm to solve it. Furthermore, in order to relieve using the corrupted domain block as the independent variable in the proposed method, instead of using the mean operation on a 2 x 2 subblock in the traditional HFIC, we apply a median operation on a larger subblock to obtain the contracted domain blocks for achieving the robustness against outliers. The effectiveness of the proposed method is experimentally illustrated on problems of image denoising with impulse noise (specifically, salt & pepper noise and random-valued noise). Remarkable improvements of the proposed method over conventional HFIC are demonstrated in terms of both numerical evaluations and visual quality. In addition, a median-based version of Fisher classification method is also developed to accelerate the encoding speed of the proposed method.
A new no search fractal image coding scheme is introduced which is able to improve the speed of fractalimage compression greatly. Every time-consuming part of fractalcoding is redesigned and accelerated with new tec...
详细信息
A new no search fractal image coding scheme is introduced which is able to improve the speed of fractalimage compression greatly. Every time-consuming part of fractalcoding is redesigned and accelerated with new techniques. Compared with the most recent scheme of Tong and Wong, this method speeds up the encoding process by 22 times and maintain the compression quality. Experiments on standard images show that the proposed scheme gets the fastest speed of fractal image coding up to the present and holds high reconstruction fidelity. For example, using PII 450 MHz PC, the proposed scheme spends 0.515 s to compress the Lena (512 x 512 x 8) with 36.04 dB PSNR decoding quality. Using Dell PIV 2.8 GHz PC, it spends only 0.078 s to finish the encoding process and gets 36.04 dB PSNR. (C) 2004 Elsevier B.V. All rights reserved.
In conventional fractal image coding (FIC) schemes, domain blocks are constrained to be twice as large as range blocks to ensure the convergence of their iterative decoding stage. However, this constraint has limited ...
详细信息
In conventional fractal image coding (FIC) schemes, domain blocks are constrained to be twice as large as range blocks to ensure the convergence of their iterative decoding stage. However, this constraint has limited the fractal encoder to exploit the self-similarity at the same resolution scale of natural images. To overcome the shortcoming, a novel scheme using same-sized range and domain blocks is proposed. Further, a recursive scheme feeding the coding results back to the input during the encoding procedure is used to improve the decoded image quality. Experimental results show our method gives significant improvement over Fisher's FIC. (C) 2002 Society of Photo-Optical Instrumentation Engineers.
With advances in computer network and multimedia technology, digital media are rapidly proliferating, and thus the issue of copyright protection for electronic publishing is receiving great attention. To achieve the g...
详细信息
With advances in computer network and multimedia technology, digital media are rapidly proliferating, and thus the issue of copyright protection for electronic publishing is receiving great attention. To achieve the goal of copyright protection, the digital watermarks are used to identify the owner of a certain image, so as to prevent illegal copying. Digital watermarking is the technique that embeds an invisible signal including owner identification and copy control information into multimedia data such as audio, video, and images. A new digital watermark approach based on fractal image coding is proposed in this paper. We present a way to use the fractal code as a means of embedding a watermark into image. The proposed approach has been shown to be resistant to general attacks, like StirMark. Moreover, someone who owns the decryption key can simply extract the digital watermark from the watermarked image without resorting to the original image.
This paper proposes an analysis method of scaling-factor-quantization error in fractal image coding using a state-space approach with the statistical analysis method. It is shown that the statistical analysis method i...
详细信息
This paper proposes an analysis method of scaling-factor-quantization error in fractal image coding using a state-space approach with the statistical analysis method. It is shown that the statistical analysis method is appropriate and leads to a simple result, whereas the deterministic analysis method is not appropriate and leads to a complex result for the analysis of fractal image coding. We derive the output error variance matrix for the measure of error and define the output error variance by scalar quantity as the mean of diagonal elements of the output error variance matrix. Examples are given to show that the scaling-factor-quantization error due to iterative computation with finite-wordlength scaling factors degrades the quality of decoded images. A quantitative comparison uf experimental scaling-factor-quantization error with analytical result is made for the output error variance. The result shows that our analysis method is valid for the fractal image coding.
In this paper, we propose a fast no-search fractal image coding algorithm based on a modified gray-level transform. To improve the possibility of successful matching for a range block and a domain block, we introduce ...
详细信息
In this paper, we propose a fast no-search fractal image coding algorithm based on a modified gray-level transform. To improve the possibility of successful matching for a range block and a domain block, we introduce a modified gray-level transform with more transform parameters than proposed by Tong and Pi to encode the blocks. Then, we suggest a no-search fractal image coding method using two gray-level transforms, one for the large blocks and the other for the small blocks based on the quadtree partition scheme, to speed up the encoding time and improve the quality of the reconstructed images. (C) 2008 Elsevier Ltd. All rights reserved.
A progressive structure which takes the quadtree depth into consideration is proposed for fractal image coding. Simulation results show that its image quality at different received data rates is better than that witho...
详细信息
A progressive structure which takes the quadtree depth into consideration is proposed for fractal image coding. Simulation results show that its image quality at different received data rates is better than that without considering the quadtree level. Then, a hybrid fractal image coding scheme based on traditional and no-search fractal image coding with the proposed progressive structure is suggested. The image quality and compression ratio can be controlled by a threshold, which makes it downward compatible to the no-search fractal image coding. Experimental results justify that the progressive performance of the proposed scheme is better than that of traditional fractal image coding. (C) 2013 Elsevier Inc. All rights reserved.
image compression is needed to communicate image effectively. Especially, mobile communication needs high compression. It also needs high error tolerance because highly compressed data are strongly influenced by trans...
详细信息
ISBN:
(纸本)0819439843
image compression is needed to communicate image effectively. Especially, mobile communication needs high compression. It also needs high error tolerance because highly compressed data are strongly influenced by transmission errors. We found that the relation between the range block and domain block can also be applied well to the extended range blocks and domain blocks in most cases in fractalcoding based on Iterated Function System. We use this feature of fractalcoding and propose a new robust coding scheme, which has good error tolerance. We perform the fractal compression experiments based on the proposed scheme to verify the effectiveness of this scheme. Computational experiments show that it has nearly the same performance as conventional scheme when errors don't occur and achieve large improvement of image quality without increasing the amount of the data when errors occur.
fractal image coding (FIC) has been studied for more than ten years and a lot of improvements on its fidelity performance have been proposed. In the paper, another improving scheme called recursive scheme is proposed....
详细信息
fractal image coding (FIC) has been studied for more than ten years and a lot of improvements on its fidelity performance have been proposed. In the paper, another improving scheme called recursive scheme is proposed. In the scheme, the coding results of previous range blocks are fed back to adjust the encoder parameters for the next range block. So the method can gradually reach the global optimization. Experimental results show that the method can improve the image quality about 0.5 dB higher than Fisher's quadtree scheme.
The authors propose using a non-symmetric window to search for the best matched domain block based on the local variances method. Experimental results show that the proposed scheme can achieve a speedup of 50% with on...
详细信息
The authors propose using a non-symmetric window to search for the best matched domain block based on the local variances method. Experimental results show that the proposed scheme can achieve a speedup of 50% with only slight degradation in PSNR and compression ratio.
暂无评论