Abstract
This paper presents a fast algorithm for fractal image compression. The algorithm uses quadtree partitioning to partition an image into image blocks of different sizes. Each of the image blocks is normalized to have zero mean and unity variance, and represented by a feature vector of dimension 16. The feature vectors, which can provide an accurate representation of the image blocks, are composed of the means and/or variances of each of the rows and columns. The k-d tree structure is used to partition the feature vectors of the domain blocks. This arrangement allows the search of the best matched domain block for a range block efficiently and accurately. An efficient encoding approach for low complexity range blocks is also proposed, which encodes the mean of a range block without searching the domain blocks. Moreover, during the range-domain matching process, a simple but very efficient search by using the property of zero contrast value is introduced, which can further improve the encoding time and compression ratio, especially in high compression ratio. This can lead to an improvement in encoding time and an increase in compression ratio, while maintaining comparable image quality. Experimental results show that the run-time required by our proposed algorithm is over 200 times faster than that of a full search.
Original language | English |
---|---|
Pages (from-to) | 146-153 |
Number of pages | 8 |
Journal | Proceedings of SPIE - The International Society for Optical Engineering |
Volume | 4875 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 2002 |
Event | Second International Conference on Image and Graphics - Hefei, China Duration: 16 Aug 2002 → 18 Aug 2002 |
Keywords
- Feature vector
- Fractal image compression
- k-d tree
- Quadtree
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering