Book ChapterDOI
Efficient statistical computations for optimal color quantization
Xiaolin Wu
- pp 126-133
Reads0
Chats0
TLDR
This chapter discusses efficient statistical computations for optimal color quantization based on variance minimization, a 3D clustering process that leads to significant image data compression, making extra frame buffer available for animation and reducing bandwidth requirements.Abstract:
Publisher Summary This chapter discusses efficient statistical computations for optimal color quantization. Color quantization is a must when using an inexpensive 8-bit color display to display high-quality color images. Even when 24-bit full color displays become commonplace in the future, quantization will still be important because it leads to significant image data compression, making extra frame buffer available for animation and reducing bandwidth requirements. Color quantization is a 3D clustering process. A color image in an RGB mode corresponds to a three-dimensional discrete density. In this chapter, quantization based on variance minimization is discussed. Efficient computations of color statistics are described. An optimal color quantization algorithm is presented. The algorithm was implemented on a SUN 3/80 workstation. It took only 10 s to quantize a 256 × 256 image. The impact of optimizing partitions is very positive. The new algorithm achieved, on average, one-third and one-ninth of mean-square errors for the median-cut and Wan et. al. algorithms, respectively.read more
Citations
More filters
Journal ArticleDOI
Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA
TL;DR: A new formulation for multiway spectral clustering corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual least-squares support vector machine (LS-SVM) formulations and exploits the structure of the eigenvectors and the corresponding projections when the clusters are well formed.
Journal ArticleDOI
Color quantization by dynamic programming and principal analysis
TL;DR: This paper shows that by ordering the N colors along their principal axis and partitioning the color space with respect to this ordering, the resulting constrained optimization problem can be solved in O(N) time by dynamic programming.
Journal ArticleDOI
Improving the performance of k-means for color quantization
TL;DR: Experiments demonstrate that an efficient implementation of k-means with an appropriate initialization strategy can in fact serve as a very effective color quantizer.
Journal ArticleDOI
Adaptive color reduction
TL;DR: The proposed adaptive color reduction (ACR) technique achieves color reduction using a tree clustering procedure using a self-organized neural network classifier (NNC) which is fed by image color values and additional local spatial features.
Journal ArticleDOI
Automatic segmentation of dermoscopy images using saliency combined with Otsu threshold.
TL;DR: A novel automatic segmentation algorithm using saliency combined with Otsu threshold is proposed in this paper, which includes enhancement and segmentation stages, which is robust and performs better than other state-of-the-art methods.