A graph-theoretic approach for studying the convergence of fractal encoding algorithm
Related Experiment Video
Updated: Jul 7, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
J Mukherjee1, P Kumar, S K Ghosh
1Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India. jay@cse.iitkgp.ernet.in
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.
Related Concept Videos
Convergence of Fourier Series
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
Region of Convergence
Region of Convergence of Laplace Tarnsform
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This substitution...
Geometric Sequences
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Convergence of Sequences
