1 November 2002 Fractal image compression based on intrablock variance distribution and vector quantization
Author Affiliations +
Optical Engineering, 41(11), (2002). doi:10.1117/1.1510743
Abstract
In the encoding phase of fractal image compression, most of the time is taken in finding the closest match between each range block and a large pool of domain blocks. We use the intrablock variance distributions of domain blocks to reduce the search space. For finding a close match, we need search only the domain blocks whose maximal intrablock variance quadrants are at the same corner as the range block. Thus, we reduce the number of transforms applied on each domain block from eight to two. We also adopt the longest-distance-first vector quantization scheme to divide the large pool of domain blocks into clusters. Thus, the number of domain blocks to be searched is also reduced. The experimental results show that our algorithm can reduce encoding time with only slight loss of quality.
Shin-Si Chen, Chang-Biau Yang, Kuo-Si Huang, "Fractal image compression based on intrablock variance distribution and vector quantization," Optical Engineering 41(11), (1 November 2002). http://dx.doi.org/10.1117/1.1510743
JOURNAL ARTICLE
7 PAGES


SHARE
KEYWORDS
Fractal analysis

Image compression

Computer programming

Transform theory

Image quality

Distortion

Virtual point source

RELATED CONTENT


Back to Top