Abstract
In this paper, we present a graph-theoretic interpretation of convergence of fractal encoding based on partial iterated function system (PIFS). First we have considered a special circumstance, where no spatial contraction has been allowed in the encoding process. The concept leads to the development of a linear time fast decoding algorithm from the compressed image. This concept is extended for the general scheme of fractal compression allowing spatial contraction (on averaging) from larger domains to smaller ranges. A linear time fast decoding algorithm is also proposed in this situation, which produces a decoded image very close to the result obtained by an ordinary iterative decompression algorithm.
Original language | English |
---|---|
Pages (from-to) | 366-377 |
Number of pages | 12 |
Journal | IEEE Transactions on Image Processing |
Volume | 9 |
Issue number | 3 |
DOIs | |
State | Published - 2000 |
Externally published | Yes |
Bibliographical note
Funding Information:Dr. Mukherjee is a member of the IEEE Computer Society and has served as a member of the Technical Program Committee in various national and international conferences. He received the Young Scientist Award from the Indian National Science Academy in 1992.
Funding
Dr. Mukherjee is a member of the IEEE Computer Society and has served as a member of the Technical Program Committee in various national and international conferences. He received the Young Scientist Award from the Indian National Science Academy in 1992.
Funders | Funder number |
---|---|
Young | |
Indian National Science Academy |
Keywords
- Attractor
- Contractive transform
- Fixed point
- Fractal compression
- Partial iterated function system (PIFS)