This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Color Quantization of Video Sequences
September 1995 (vol. 1 no. 3)
pp. 274-286
present an efticient algorithm for dynamic adaptive color quantization of 24-bit image (video) sequences, important in multimedia applications. Besides producing hifidelity S-bit imagery, our algorithm runs with minimal computational cost and the generated colormaps are robust to small differences in consecutive images. Apart from the two standard color quantization tasks, colormap design and quantizer mapping, our aigorithm inciudes coiormap fiiiing-an operation unique to dynamic color quantization. This task solves the problem of screen flicker, a serious problem in dynamic quantization of image sequences, resulting from rapid changes in display of colormaps. Our solution is based on two ideas: including in the current colormap a small set of color representatives from the previous image; assigning representatives to the colormap entries in an order that reduces the difference between contents of equal entries in consecutive colormaps. Our algorithm runs in near real time on medium-range workstations.

[1] A. Gersho and R.M. Gray,“Vector quantization and signal compression,” Kluwer Academic Publishers, 1992.
[2] M. Orchard and C. Bouman,“Color quantization of images,” IEEE Trans. Signal Processing, vol. 39, no.12, pp. 2,677-2,690, 1991.
[3] P. Heckbert,“Color image quantization for frame buffer display” Computer Graphics (SIGGRAPH), vol. 16, no. 3, pp. 297-307, 1982.
[4] S.J. Wan,P. Prusinkiewicz,, and S.K.M. Wong,“Variance-based colour image quantization for frame buffer display,” COLOUR Research and Application, vol. 15, no. 1, pp. 52-58, 1990.
[5] M. Gervautz and W. Purgathofer,“A simple method for color quantization: Octree quantization,” A. Glassner, ed., Graphics Gems, pp. 287-293, Academic Press, New York, 1990.
[6] P. Brucker,“On the complexity of clustering problems,” Optimization and Operations Research, R. Henn, B. Korte, and W. Oettly, eds. Springer-Verlag, New York, pp. 45-54, 1977.
[7] M.R. Garey,D.S. Johnson,, and H.S. Witsenhausen,“The complexity of the generalized Lloyd-Max problem,” IEEE Trans. Information Theory, vol. 28, pp. 255-256, 1982.
[8] Y. Linde,A. Buzo,, and R.M. Gray,“An algorithm for vector quantizer design,” IEEE Trans. Comm., vol. 28, pp. 84-89, 1980.
[9] J.H. Friedman,J.L. Bentley,, and R.A. Finkel,“An algorithm for finding best matches in logarithmic expected time,” ACM Trans. Math. Software, vol. 3, no. 3, pp. 209-226, 1977.
[10] N. Goldberg,“Colour image quantization for high resolution graphics display,” Image and Vision Computing, vol. 9, no. 5, pp. 303-312, 1991.
[11] R. Duda and P. Hart,Pattern classification and scene analysis. Wiley, New York, 1973.
[12] G. Braudaway,“A procedure of optimum choice of a small number of colors from a large color palette for color imaging,” Proc. Electronic Imaging ‘87,San Francisco, 1987.
[13] S. Wan,S. Wong,, and P. Prusinkiewicz,“An algorithm for multidimensional data clustering,” ACM Trans. Math. Software, vol. 14, no. 2, pp. 153-162, 1988.
[14] X. Wu,“Color quantization by dynamic programming and principal analysis,” ACM Trans. Graphics, vol. 11, no. 4, pp. 348-372, 1992.
[15] J.L. Furlani,L. McMillan,, and L. Westover,“Adaptive color selection algorithm for motion sequences,” Proc. ACM Multimedia 94, pp. 341-347, 1994.
[16] E. Roytman and C. Gotsman,“Dynamic color quantization of video sequences,” Proc. Computer Graphics Int’l,Melbourne, 1994.
[17] J.M. Kasson and W. Plouffe,“An analysis of selected computer interchange color spaces,” ACM Trans. Graphics, vol. 11, no. 4, pp.373-405, 1992.

Citation:
Evgeny Roytman, Craig Gotsman, "Dynamic Color Quantization of Video Sequences," IEEE Transactions on Visualization and Computer Graphics, vol. 1, no. 3, pp. 274-286, Sept. 1995, doi:10.1109/TVCG.1995.2
Usage of this product signifies your acceptance of the Terms of Use.