Fast fractal image encoding based on adaptive search

Chong Sze TONG*, Minghong Pi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

126 Citations (Scopus)

Abstract

This paper presents a new adaptive search approach to reduce the computational complexity of fractal encoding. A simple but very efficient adaptive necessary condition is introduced to exclude a large number of unqualified domain blocks so as to speed-up fractal image compression. Furthermore, we analyzed an unconventional affine parameter that has better properties than the conventional luminance offset. Specifically, we formulated an optimal bit allocation scheme for the simultaneous quantizations of the usual scaling and the aforementioned unconventional affine parameter. Experiments on standard images showed that our adaptive search method yields superior performance over conventional fractal encoding.

Original languageEnglish
Pages (from-to)1269-1277
Number of pages9
JournalIEEE Transactions on Image Processing
Volume10
Issue number9
DOIs
Publication statusPublished - Sep 2001

Scopus Subject Areas

  • Software
  • Computer Graphics and Computer-Aided Design

User-Defined Keywords

  • Adaptive search methods
  • Fractal encoding
  • Image compression
  • Optimal bit allocation

Fingerprint

Dive into the research topics of 'Fast fractal image encoding based on adaptive search'. Together they form a unique fingerprint.

Cite this