Low-complexity fractal-based image compression using two-stage search strategy

Chou Chen Wang, Chin-Hsing Chen

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A fractal image compression scheme is presented which incorporates the vector quantizer (VQ) to reduce the computational complexity in the encoding phase. The high-detail blocks of an input image are approximated by a fast fractal coding, and the low-detail blocks are encoded by the VQ technique. In fractal image coding, most of the time is spent on finding a close match between a range block and a large pool of domain blocks. We propose a two-stage search algorithm to reduce the search space of the domain pool. First, a fast and simple binary pattern matching algorithm is proposed to extract a small pool of candidate domains, and then the gray-level-matching algorithm is used to find the best match from the candidates. In addition, a variable block-size segmentation method is used in our coding system to further improve the image quality. It is shown that the average encoding time is short, and the average speedup factor of 45 is achieved, as compared to the full search fractal coding. Simulation results also show that the proposed scheme can achieve better image quality and higher compression ratio than other fast fractal-based coding schemes.

Original languageEnglish
Pages (from-to)1006-1013
Number of pages8
JournalOptical Engineering
Volume38
Issue number6
DOIs
Publication statusPublished - 1999 Jan 1

Fingerprint

Image compression
Fractals
fractals
coding
Image quality
counters
Pattern matching
Image coding
Computational complexity
compression ratio
simulation

All Science Journal Classification (ASJC) codes

  • Atomic and Molecular Physics, and Optics
  • Engineering(all)

Cite this

@article{32762a9f04404b198da1abaec479a376,
title = "Low-complexity fractal-based image compression using two-stage search strategy",
abstract = "A fractal image compression scheme is presented which incorporates the vector quantizer (VQ) to reduce the computational complexity in the encoding phase. The high-detail blocks of an input image are approximated by a fast fractal coding, and the low-detail blocks are encoded by the VQ technique. In fractal image coding, most of the time is spent on finding a close match between a range block and a large pool of domain blocks. We propose a two-stage search algorithm to reduce the search space of the domain pool. First, a fast and simple binary pattern matching algorithm is proposed to extract a small pool of candidate domains, and then the gray-level-matching algorithm is used to find the best match from the candidates. In addition, a variable block-size segmentation method is used in our coding system to further improve the image quality. It is shown that the average encoding time is short, and the average speedup factor of 45 is achieved, as compared to the full search fractal coding. Simulation results also show that the proposed scheme can achieve better image quality and higher compression ratio than other fast fractal-based coding schemes.",
author = "Wang, {Chou Chen} and Chin-Hsing Chen",
year = "1999",
month = "1",
day = "1",
doi = "10.1117/1.602142",
language = "English",
volume = "38",
pages = "1006--1013",
journal = "Optical Engineering",
issn = "0091-3286",
publisher = "SPIE",
number = "6",

}

Low-complexity fractal-based image compression using two-stage search strategy. / Wang, Chou Chen; Chen, Chin-Hsing.

In: Optical Engineering, Vol. 38, No. 6, 01.01.1999, p. 1006-1013.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Low-complexity fractal-based image compression using two-stage search strategy

AU - Wang, Chou Chen

AU - Chen, Chin-Hsing

PY - 1999/1/1

Y1 - 1999/1/1

N2 - A fractal image compression scheme is presented which incorporates the vector quantizer (VQ) to reduce the computational complexity in the encoding phase. The high-detail blocks of an input image are approximated by a fast fractal coding, and the low-detail blocks are encoded by the VQ technique. In fractal image coding, most of the time is spent on finding a close match between a range block and a large pool of domain blocks. We propose a two-stage search algorithm to reduce the search space of the domain pool. First, a fast and simple binary pattern matching algorithm is proposed to extract a small pool of candidate domains, and then the gray-level-matching algorithm is used to find the best match from the candidates. In addition, a variable block-size segmentation method is used in our coding system to further improve the image quality. It is shown that the average encoding time is short, and the average speedup factor of 45 is achieved, as compared to the full search fractal coding. Simulation results also show that the proposed scheme can achieve better image quality and higher compression ratio than other fast fractal-based coding schemes.

AB - A fractal image compression scheme is presented which incorporates the vector quantizer (VQ) to reduce the computational complexity in the encoding phase. The high-detail blocks of an input image are approximated by a fast fractal coding, and the low-detail blocks are encoded by the VQ technique. In fractal image coding, most of the time is spent on finding a close match between a range block and a large pool of domain blocks. We propose a two-stage search algorithm to reduce the search space of the domain pool. First, a fast and simple binary pattern matching algorithm is proposed to extract a small pool of candidate domains, and then the gray-level-matching algorithm is used to find the best match from the candidates. In addition, a variable block-size segmentation method is used in our coding system to further improve the image quality. It is shown that the average encoding time is short, and the average speedup factor of 45 is achieved, as compared to the full search fractal coding. Simulation results also show that the proposed scheme can achieve better image quality and higher compression ratio than other fast fractal-based coding schemes.

UR - http://www.scopus.com/inward/record.url?scp=0032631520&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032631520&partnerID=8YFLogxK

U2 - 10.1117/1.602142

DO - 10.1117/1.602142

M3 - Article

VL - 38

SP - 1006

EP - 1013

JO - Optical Engineering

JF - Optical Engineering

SN - 0091-3286

IS - 6

ER -