Results 261 to 270 of about 21,898 (295)
Some of the next articles are maybe not open access.
Fast fractal image compression
Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540), 2002In this paper, we propose a method of regional search for fractal image compression and decompression. In this method, the search for fractal codes is carried out in a region of the image instead of over the whole image. Because the area surrounding a partitioned block has a high probability of being similar to the block, the use of regional search to ...
openaire +1 more source
Fast fractal compression of greyscale images
IEEE Transactions on Image Processing, 2001A new algorithm for fractal compression of greyscale images is presented. It uses some previous results allowing the compression process to be reduced to a nearest neighbors problem, and is essentially based on a geometrical partition of the image block feature space.
openaire +3 more sources
VQ-enhanced fractal image compression
Proceedings of 3rd IEEE International Conference on Image Processing, 2002A novel hybrid scheme combining fractal image compression with mean-removed shape-gain vector quantization is presented. The scheme uses a small set of VQ codebook blocks as a block classifier for the domain blocks and as an alternative means of coding when able to provide a satisfying distortion.
R. Hamzaoui, M. Muller, D. Saupe
openaire +1 more source
A Fractal Image Compression Techniques
International Journal of Computer & Organization Trends, 2014Image compression is an essential technology in multimedia and digital communication fields. Fractal image compression is a potential image compression scheme due to its potential high compression ratio, fast decompression and multi resolution properties. Fractal image compression utilizes the existence of self symmetry of images.
P Subramanian, R Indumathi
openaire +1 more source
Is Fractal Image Compression Related to Cortical Image Compression?
Applied Vision, 1989Fractals are customarily introduced with simple line replacement rules, for example the well known Koch curve. At each state of iteration single lines are replaced by combinations of lines according to a rule. Remarkable complexity can be built up this way as shown by five stages of this line replacement bush fractal1.
openaire +1 more source
Fractal scanning for image compression
[1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers, 2002The authors describe an alternative scanning technique called fractal scanning for images different from the usual raster scan which increases the image correlation. The increased correlation can be better exploited to achieve higher image compression. The scanning procedure uses a basic 4*4 pattern recursively to scan an image.
K.S. Thyagarajan, S. Chatterjee
openaire +1 more source
Stochastic image compression using fractals
Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing, 2004Fractal objects like the Sierpinski triangle and Fern have very high visual complexity and low storage-information content. For generating computer graphic images and compression of such objects, iterated function systems (IFS) (Barnsley; Jacquin (1992)) are used.
A. Kapoor +3 more
openaire +1 more source
Wavelet-based fractal image compression
SPIE Proceedings, 2003In this paper, a wavelet-based fractal image coding algorithm is proposed. The conventional fractal image coding in spatial domain is extended to wavelet domain by taking advantage of the self-similarities among different wavelet subtrees through proper affine transformation.
Yang Zhang, Guangtao Zhai
openaire +1 more source
Merged quadtree fractal image compression
Optical Engineering, 1998The quadtree method is usually used in fractal block coding, but its efficiency is very low. We propose a new scheme, merged quadtree partitioning (MQP), for efficient image compression. It is an improved quadtree method, and can merge the quadtree nodes on the same level and on the different levels to share one transformation.
openaire +1 more source

