dc.contributor.author |
Cloete, E
|
|
dc.contributor.author |
Venter, LM
|
|
dc.contributor.editor |
Petkov, D.
|
|
dc.contributor.editor |
Venter, L.
|
|
dc.date.accessioned |
2018-08-17T12:06:57Z |
|
dc.date.available |
2018-08-17T12:06:57Z |
|
dc.date.issued |
1998 |
|
dc.identifier.citation |
Cloete, E. & Venter, L.M. (1998) Reducing fractal encoding complexities. Proceedings of the annual research and development symposium, SAICSIT (South African Institute for Computer Scientists and Information Technologists), Van Riebeeck Hotel, Gordons Bay, Cape Town, 23-24 November 1998, |
en |
dc.identifier.isbn |
1-86840-303-3 |
|
dc.identifier.uri |
http://hdl.handle.net/10500/24694 |
|
dc.description.abstract |
In this paper we address the time complexity problem associated with fractal image coding. In particular, we
describe a new hybrid technique called Fractal Vector Quantization coding (FVQ), which takes advantage of the best qualities in fractal coding and vector quantization (VQ) .
In our proposed approach, VQ is used to construct a set of real world building blocks which can be used to approximate an arbitrary image. Fractal coding is then employed to fractalize the building blocks by finding an affine transformation for each block which best represents that block. The real world building blocks with their fractal codes are compiled in a fractal dictionary. To encode an image, FVQ approximates the image with a set of fractal code vectors from the dictionary, which is stored.
The decoder uses a standard fractal decoding algorithm since the fractal dictionary is no t required by the decoder. |
en |
dc.language.iso |
en |
en |
dc.subject |
Fractal compression |
en |
dc.subject |
Image coding |
en |
dc.subject |
Vector quantization |
en |
dc.title |
Reducing fractal encoding complexities |
en |