logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A parallel decoding algorithm for IFS codes without transient behavior

delete1996-03-01
delete9
PRE
AI
S
Soo‐Chang Pei
C
Chien-Cheng Tseng
C
Ching‐Yung Lin
DOI：10.1109/83.491315delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Iterated function systems (IFS's) have received great attention in encoding and decoding fractal images, Barnsley has shown that IFS's 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, In this paper, 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.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Image Processing cover
IEEE Transactions on Image Processing
IF:
13.7
Papers:
1.0W
Citations:
8.4W

Organization

No organization information available