A parallel decoding algorithm for IFS codes without transient behavior

Iterated function systems (IFSs) have received great attention in encoding and decoding fractal images. Barnsley (1988) has shown that IFSs for image compression can achieve a very high compression ratio for a single image. However, the major drawback of such a technique is the large computation loa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on image processing Ročník 5; číslo 3; s. 411 - 415
Hlavní autoři: PEI, S.-C, TSENG, C.-C, LIN, C.-Y
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.03.1996
Institute of Electrical and Electronics Engineers
Témata:
Applied sciences
Bandwidth
Clouds
Data compression
Discrete cosine transforms
Exact sciences and technology
Extraterrestrial measurements
Fractals
Image coding
Image communication
Image processing
Information, signal and communications theory
Iterative decoding
Signal processing
Telecommunications and information theory
Performance evaluation
Computation time
Parallel algorithm
Fractal
Compression ratio
Image processing
Coding
Data compression
Decoding
ISSN:1057-7149
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Iterated function systems (IFSs) have received great attention in encoding and decoding fractal images. Barnsley (1988) has shown that IFSs for image compression can achieve a very high compression ratio for a single image. However, the major drawback of such a technique is the large computation load required to both encode and decode a fractal image. We provide a novel algorithm to decode IFS codes. The main features of this algorithm are that it is very suitable for parallel implementation and has no transient behavior. Also, from the decoding process of this method we can understand the encoding procedure explicitly. One example is illustrated to demonstrate the quality of its performance.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1057-7149
DOI:10.1109/83.491315