Statistical Colour Quantization for Minimum Distortion

作者: Xiaolin Wu

DOI: 10.1007/978-3-642-77586-4_12

关键词: AlgorithmPopulationGlobal optimizationRGB color modelPixelQuantization (signal processing)Computer visionMathematicsImage qualityCluster analysisArtificial intelligenceColor quantization

摘要: Colour quantization for frame buffer displays, a basic computer graphics technique efficient use of colours, is statistically large scale clustering process and it poses difficult discrete optimization problem. Many heuristic color algorithms were proposed [7, 12, 22, 24] but they all suffer from various degrees non-adaptability to the colour statistics input images. In this article we will introduce an adaptive image algorithm that outperforms existing in subjective quality least square approximation sense. The new eliminates many current suboptimal treatments such as prequantization discarding few lower bits RGB values, restricted cuts orthogonal axes, partition criteria based on population or marginal distributions rather than variance minimization. A constrained global scheme incorporated into divide-and-conquer minimize distortion. time space complexities are O(N log K) O(N), where N number pixels K colours quantized image.

参考文章(24)
Xiaolin Wu, Ian H. Witten, A FAST K-MEANS TYPE CLUSTERING ALGORITHM University of Calgary. ,(1985) , 10.11575/PRISM/31135
M. Gervautz, W. Purgathofer, A simple method for color quantization: octree quantization Graphics gems. pp. 287- 293 ,(1990) , 10.1007/978-3-642-83492-9_20
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
James N. Morgan, John A. Sonquist, Problems in the Analysis of Survey Data, and a Proposal Journal of the American Statistical Association. ,vol. 58, pp. 415- 434 ,(1963) , 10.1080/01621459.1963.10500855
David L. MacAdam, Uniform color scales Journal of the Optical Society of America. ,vol. 64, pp. 1691- 1702 ,(1974) , 10.1364/JOSA.64.001691
R. J. Stevens, A. F. Lehar, F. H. Preston, Manipulation and Presentation of Multidimensional Image Data Using the Peano Scan IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. PAMI-5, pp. 520- 526 ,(1983) , 10.1109/TPAMI.1983.4767431
Jerome H. Friedman, Jon Louis Bentley, Raphael Ari Finkel, An Algorithm for Finding Best Matches in Logarithmic Expected Time ACM Transactions on Mathematical Software. ,vol. 3, pp. 209- 226 ,(1977) , 10.1145/355744.355745
Xiaolin Wu, Optimal quantization by matrix searching Journal of Algorithms. ,vol. 12, pp. 663- 673 ,(1991) , 10.1016/0196-6774(91)90039-2
S. J. Wan, S. K. M. Wong, P. Prusinkiewicz, An algorithm for multidimensional data clustering ACM Transactions on Mathematical Software. ,vol. 14, pp. 153- 162 ,(1988) , 10.1145/45054.45056
Henry Fuchs, Zvi M. Kedem, Bruce F. Naylor, On visible surface generation by a priori tree structures Proceedings of the 7th annual conference on Computer graphics and interactive techniques - SIGGRAPH '80. ,vol. 14, pp. 124- 133 ,(1980) , 10.1145/800250.807481