An encoding algorithm for ifs coding of homogeneous fractal images using univariate polynomial manipulation

Toshimizu Abikq, Masayuki Kawamata

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


This paper proposes a fast encoding algorithm for iterated function system (IFS) coding of gray-level homogeneous fractal images. In order to realize IFS coding of high order fractal images, it is necessary to solve a set of simultaneous equations with many unknowns. Solving the simultaneous equations using a multi-dimensional, numerical root-finding method is however very time consuming. As preprocessing of numerical computation, the proposed algorithm employs univariate polynomial manipulation, which requires less computation time than multivariate polynomial manipulation. Moreover, the symmetry'of the simultaneous equations with respect to the displacement coefficients enables us to derive an equation with a single unknown from the simultaneous equations using univariate polynomial manipulation. An experimental result is presented to illustrate that the encoding time of the proposed algorithm is about 5 seconds on a personal computer with a 400 MHz Pentium II processor.

Original languageEnglish
Pages (from-to)1435-1442
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number8
Publication statusPublished - 1999 Aug
EventProceedings of the 1998 13th Digital Signal Processing Symposium - Niigata, Japan
Duration: 1998 Nov 121998 Nov 13


  • Fractal
  • Intelligent signal processing
  • Inverse problem
  • Iterated function system
  • Polynomial manipulation

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'An encoding algorithm for ifs coding of homogeneous fractal images using univariate polynomial manipulation'. Together they form a unique fingerprint.

Cite this