A graph-theoretic approach for studying the convergence of fractal encoding algorithm

Author

Mukherjee, Jayanta ; Kumar, Pramod ; Ghosh, S.K.

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India

Volume

9

Issue

3

fYear

2000

fDate

3/1/2000 12:00:00 AM

Firstpage

366

Lastpage

377

Abstract

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

Keywords

convergence of numerical methods; data compression; decoding; fractals; graph theory; image coding; iterative methods; transform coding; transforms; compressed image; contractive transform; convergence; decoded image; fractal compression; fractal encoding algorithm; graph theory; iterative decompression algorithm; linear time fast decoding algorithm; partial iterated function system; spatial contraction; Computer science; Convergence; Encoding; Fractals; Frequency; Image coding; Iterative algorithms; Iterative decoding; Spatial resolution;

fLanguage

English

Journal_Title

Image Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7149

Type

jour

DOI

10.1109/83.826775

Filename

826775