Conference Paper
An effieient algorithm for fractal image coding using kickout and zero contrast conditions
Dept. of Electron. & Inf. Eng., Hong Kong Polytech. Univ., China
DOI: 10.1109/ISCAS.2003.1206014 Conference: Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on, Volume: 2 Source: DBLP
 Citations (4)
 Cited In (0)

Article: Fractal image coding: a review
[Show abstract] [Hide abstract]
ABSTRACT: An approach to image coding based on a fractal theory of iterated contractive transformations defined piecewise is described. The main characteristics of this approach are that it relies on the assumption that image redundancy can be efficiently captured and exploited through piecewise selftransformability on a blockwise basis, and it approximates an original image by a fractal image, obtained from a finite number of iterations of an image transformation called a fractal code. This approach is referred to as fractal block coding. The general codingdecoding system is based on the construction, for an image to be encoded, of a fractal codea contractive image transformation for which the original image is an approximate fixed pointwhich, when applied iteratively on any initial image of the decoder, produces a sequence of images which converges to a fractal approximation of the original. The design of a system for the encoding of monochrome digital images at rates below 1 b/pixel is described. Ideas and extensions from the work of other researchers are presentedProceedings of the IEEE 11/1993; · 5.47 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: In fractal image block coding, most of the time is spent on finding a close match between a range block and a large pool of domain blocks. For a large image, this effect becomes aggravated as the domain pool increases exponentially. We propose using the local variances of domain blocks to reduce the search space. By sorting the contracted domain pool according to their local variances and defining an acceptance criterion for a close match, we can confine all the potential close matches to a relatively small sized window to limit the search space. The encoding time can hence be shortened with the decoded image quality as good as that using the full search method. The speedup can be over ten times depending on the complexity of encoded images.IEEE Transactions on Image Processing 02/1998; 7(6):88891. · 3.11 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: In this paper, a fast encoding algorithm is developed for fractal image compression. At each search entry in the domain pool, the mean square error (MSE) calculations of the given range block and the eight dihedral symmetries of the domain block are obtained simultaneously in the frequency domain, in which the redundant computations are all eliminated in the new encoding algorithm. It is shown in software simulation that the encoding time is about six times faster than that of the baseline method with almost the same PSNR for the retrieved image. The fast algorithm is performed to deal with the eight dihedral symmetries at each search entry. Therefore, it can be applied to various enhanced algorithms which are equipped with quadtree, classification, and other mechanismsIEEE Transactions on Image Processing 05/2000; · 3.11 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.