Subpixel Measurements Using a Moment-Based Edge Operator
IEEE Transactions on Pattern Analysis and Machine Intelligence
Color quantization by dynamic programming and principal analysis
ACM Transactions on Graphics (TOG)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Color image quantization for frame buffer display
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
The use of block truncation coding in DPCM image coding
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Single bit-map block truncation coding of color images
IEEE Journal on Selected Areas in Communications
A fast pixel mapping algorithm using principal component analysis
Pattern Recognition Letters
Improving the performance of k-means for color quantization
Image and Vision Computing
Color quantization using modified artificial fish swarm algorithm
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Hi-index | 0.10 |
A new approach to color image compression with high compression ratios and good quality of reconstructed images using quantization, thresholding, and edge detection all based on the moment-preserving principle is proposed. An input image with 24 bits per pixel is quantized into 8 bits per pixel using a new color quantization method based on the moment-preserving principle. The quantized image is then divided into n x n non-overlapping square blocks. Two representative colors for each block are computed by moment-preserving thresholding. A bit-map is then generated, consisting of 0s and 1s indicating whether the block pixels are assigned to the first color or the second according to the Euclidean distance measure. A moment-based edge detector is performed further on the bit-map of each non-uniform block. The two parameters l and @q of a line edge with the equation of x cos @q + y sin @q = l are obtained. The image is finally coded with a codebook of a 256-color palette; a 1-bit indicator for each block which specifies whether the block is uniform or not; an 8-bit color index for a uniform block, or two 8-bit color indices, a 3-bit index for @q, and a 2-bit or 3-bit index for l for a non-uniform block. An average compression ratio of 22.49 or 33.32 can be obtained for 4 x 4 or 5 x 5 image blocks, respectively. Experimental results show the feasibility and efficiency of the proposed approach for color image compression.