60
Views
13
CrossRef citations to date
0
Altmetric
Original Articles

Colour quantisation using the adaptive distributing units algorithm

, &
Pages 80-91 | Received 16 Feb 2012, Accepted 30 Jul 2013, Published online: 09 Jan 2014

References

  • Brun L., Trémeau A., Digital Color Imaging Handbook, 2002, Ch. Color Quantization, pp. 589–638 (CRC Press, Boca Raton, FL).
  • Yang C.-K. and Tsai W.-H.. Color image compression using quantization, thresholding, and edge detection techniques all based on the moment-preserving principle. Pattern Recognit. Lett., 1998, 19, (2), 205–215.
  • Deng Y. and Manjunath B.. Unsupervised segmentation of color-texture regions in images and video. IEEE Trans. Pattern Anal. Machine Intell., 2001, 23, (8), 800–810.
  • Sherkat N., Allen T. and Wong S.. Use of colour for hand-filled form analysis and recognition. Pattern Anal. Appl., 2005, 8, (1), 163–180.
  • Sertel O., Kong J., Catalyurek U. V., Lozanski G., Saltz J. H. and Gurcan M. N.. Histopathological image analysis using model-based intermediate representations and color texture: follicular lymphoma grading. J. Signal Process. Syst., 2009, 55, (1–3), 169–183.
  • Kuo C.-T. and Cheng S.-C.. Fusion of color edge detection and color quantization for color image watermarking using principal axes analysis. Pattern Recognit., 2007, 40, (12), 3691–3704.
  • Wang S., Cai K., Lu J., Liu X. and Wu E.. Real-time coherent stylization for augmented reality. Visual Comput., 2010, 26, (6–8), 445–455.
  • Deng Y., Manjunath B., Kenney C., Moore M. and Shin H.. An efficient color representation for image retrieval. IEEE Trans. Image Process., 2001, 10, (1), 140–147.
  • Xiang Z.. Handbook of Approximation Algorithms and Metaheuristics, 2007, Ch. Color Quantization, pp. 86-1–86-17 (Chapman & Hall/CRC, London).
  • Gentile R. S., Allebach J. P. and Walowit E.. Quantization of color images based on uniform color spaces. J. Imag. Technol., 1990, 16, (1), 11–21.
  • Mojsilovic A. and Soljanin E.. Color quantization and processing by Fibonacci lattices. IEEE Trans. Image Process., 2001, 10, (11), 1712–1725.
  • Heckbert P.. Color image quantization for frame buffer display. ACM SIGGRAPH Comput. Graph., 1982, 16, (3), 297–307.
  • Gervautz M. and Purgathofer W.. New Trends in Computer Graphics, 1988, Ch. A Simple Method for Color Quantization: Octree Quantization, pp. 219–231 (Springer, Berlin/New York).
  • Wan S. J. and Wong S. K. M.. Prusinkiewicz, variance-based color image quantization for frame buffer display. Color Res. Appl., 1990, 15, 52–58.
  • Orchard M. and Bouman C.. Color quantization of images. IEEE Trans. Signal Process., 1991, 39, 2677–2690.
  • Wu X.. Graphics Gems Volume II, 1991, Ch. Efficient Statistical Computations for Optimal Color Quantization, pp. 126–133 (Academic Press, San Diego, CA).
  • Joy G. and Xiang Z.. Center-cut for color image quantization. Visual Comput., 1993, 10, 62–66.
  • Yang C.-Y. and Lin J.-C.. RWM-cut for color image quantization. Comput. Graph., 1996, 20, (4), 577–588.
  • Hsieh I.-S. and Fan K.-C.. An adaptive clustering algorithm for color quantization. Pattern Recognit. Lett., 2000, 21, 337–346.
  • Cheng S. and Yang C.. Fast and novel technique for color quantization using reduction of color space dimensionality. Pattern Recognit. Lett., 2001, 22, (8), 845–856.
  • Lo K.. Chan, Y. and Yu, M. Colour quantization by three-dimensional frequency diffusion. Pattern Recognit. Lett., 2003, 24, (14), 2325–2334.
  • Sirisathitkul Y., Auwatanamongkol S. and Uyyanonvara B.. Color image quantization using distances between adjacent colors along the color axis with highest color variance. Pattern Recognit. Lett., 2004, 25, (9), 1025–1043.
  • Kanjanawanishkul K. and Uyyanonvara B.. Novel fast color reduction algorithm for time-constrained applications. J. Visual Commun. Image Represent., 2005, 16, (3), 311–332.
  • Equitz W. H.. A new vector quantization clustering algorithm. IEEE Trans. Acoust., Speech Signal Process., 1989, 37, (10), 1568–1575.
  • Balasubramanian R. and Allebach J.. A new approach to palette selection for color images. J. Imag. Technol., 1991, 17, (6), 284–290.
  • Xiang Z. and Joy G.. Color image quantization by agglomerative clustering. IEEE Comput. Graph. Appl., 1994, 14, (3), 44–48.
  • Velho L., Gomez J. and Sobreiro M. V. R.. Color image quantization by pairwise clustering, Proc. 10th Brazilian Symp. on Computer Graphics and Image Processing, Campos do Jorddao, Brazil, October 1997, IEEE, pp. 203–210.
  • Brun L. and Mokhtari M.. Two high speed color quantization algorithms, Proc. 1st Int. Conf. on Color in Graphics and Image Processing, Saint-Etienne, France, October 2000, pp. 116–121.
  • Goldberg N.. Colour image quantization for high resolution graphics display. Image Vis. Comput., 1991, 9, (5), 303–312.
  • Xiang Z.. Color image quantization by minimizing the maximum intercluster distance. ACM Trans. Graph., 1997, 16, (3), 260–276.
  • Kasuga H., Yamamoto H. and Okamoto M.. Color quantization using the fast k-means algorithm. Syst. Comput. Jpn, 2000, 31, (8), 33–40.
  • Huang Y.-L. and Chang R.-F.. A fast finite-state algorithm for generating RGB palettes of color quantized images. J. Inf. Sci. Eng., 2004, 20, (4), 771–782.
  • Hu Y.-C. and Lee M.-G.. K-means based color palette design scheme with the use of stable flags. J. Electron. Imag., 2007, 16, (3), 033003.
  • Hu Y.-C. and Su B.-H.. Accelerated k-means clustering algorithm for colour image quantization. Imag. Sci. J., 2008, 56, (1), 29–40.
  • Celebi M. E.. Improving the performance of k-means for color quantization. Image Vis. Comput., 2011, 29, (4), 260–271.
  • Frackiewicz M. and Palus H.. Computational Vision and Medical Image Processing: Recent Trends, 2011, Ch. KM and KHM Clustering Techniques for Colour Image Quantisation, pp. 161–174 (Springer, Berlin).
  • Verevka O. and Buchanan J.. Local k-means algorithm for colour image quantization, Proc. Graphics/Vision Interface Conf., Quebec Canada, May 1995, pp. 128–135.
  • Scheunders P.. Comparison of clustering algorithms applied to color image quantization. Pattern Recognit. Lett., 1997, 18, (11–13), 1379–1384.
  • Cak S., Dizdar E. N. and Ersak A.. A fuzzy colour quantizer for renderers. Displays, 1998, 19, (2), 61–65.
  • Ozdemir D. and Akarun L.. Fuzzy algorithm for color quantization of images. Pattern Recognit., 2002, 35, (8), 1785–1791.
  • Kim D.-W., Lee K. and Lee D.. A novel initialization scheme for the fuzzy c-means algorithm for color clustering. Pattern Recognit. Lett., 2004, 25, (2), 227–237.
  • Schaefer G. and Zhou H.. Fuzzy clustering for colour reduction in images. Telecommun. Syst., 2009, 40, (1–2), 17–25.
  • Zhou H., Schaefer G., Sadka A. and Celebi M. E.. Anisotropic mean shift based fuzzy c-means segmentation of dermoscopy images. IEEE J. Sel. Top. Signal Process., 2009, 3, (1), 26–34.
  • Schaefer G. and Zhou H.. Foundations of Computational Intelligence Volume 2, 2009, Ch. An Overview of Fuzzy C-Means Based Image Clustering Algorithms, pp. 295–310 (Springer, Berlin/Heidelberg).
  • Wen Q. and Celebi M. E.. Hard vs. fuzzy c-means clustering for color quantization, EURASIP J. Adv. Signal Process., 2011, (1), 118–129.
  • Schaefer G.. Innovations in Intelligent Image Analysis, 2011, Ch. Intelligent Approaches to Colour Palette Design, pp. 275–289 (Springer, Berlin).
  • Bing Z., Junyi S. and Qinke P.. An adjustable algorithm for color quantization. Pattern Recognit. Lett., 2004, 25, (16), 1787–1797.
  • Dekker A.. Kohonen neural networks for optimal colour quantization. Netw.: Comput. Neural Syst., 1994, 5, (3), 351–367.
  • Papamarkos N., Atsalakis A. and Strouthopoulos C.. Adaptive color reduction. IEEE Trans. Syst., Man, Cybern. Part B, 2002, 32, (1), 44–56.
  • Chang C.-H., Xu P., Xiao R., and Srikanthan T.. New adaptive color quantization method based on self-organizing maps. IEEE Trans. Neural Netw., 2005, 16, (1), 237–249.
  • Rasti J., Monadjemi A. and Vafaei A.. Color reduction using a multi-stage kohonen self-organizing map with redundant features. Expert Syst. Appl., 2011, 38, (10), 13188–13197.
  • Chung K.-L., Huang Y.-H., Wang J.-P. and Cheng M.-S.. Speedup of color palette indexing in self-organization of kohonen feature map. Expert Syst. Appl., 2012, 39, (3), 2427–2432.
  • Xiao Y., Leung C.-S., Lam P.-M. and Ho T.-Y.. Self-organizing map-based color palette for high-dynamic range texture compression. Neural Comput. Appl., 2012, 21, (4), 639–647.
  • Uchiyama T. and Arbib M.. An algorithm for competitive learning in clustering problems. Pattern Recognit., 1994, 27, (10), 1415–1421.
  • Aloise D., Deshpande A., Hansen P. and Popat P.. NP-hardness of euclidean sum-of-squares clustering. Mach. Learn., 2009, 75, (2), 245–248.
  • Mahajan M., Nimbhorkar P. and Varadarajan K.. The planar k-means problem is NP-hard. Theor. Comput. Sci., 2012, 442, 13–21.
  • Tarsitano A.. A computational study of several relocation methods for k-means algorithms. Pattern Recognit. 2003, 36, (12), 2955–2966.
  • Lloyd S.. Least squares quantization in PCM. IEEE Trans. Inform. Theory, 1982, 28, (2), 129–136.
  • Celebi M. E., Kingravi H. and Vela P. A.. A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst. Appl., 2013, 40, 200–210.
  • Xu R. and Wunsch D.. Clustering, 2008 (Wiley-IEEE Press, New York).
  • Rumelhart D. and Zipser D.. Feature discovery by competitive learning. Cogn. Sci., 1985, 9, (1), 75–112.
  • Bratley P. and Fox B. L.. Algorithm 659: implementing Sobol’s quasirandom sequence generator. ACM Trans. Math. Softw., 1988, 14, (1), 88–100.
  • Press W. H., Teukolsky S. A., Vetterling W. T. and Flannery B. P.. Numerical Recipes, 2007, 3rd edition, (Cambridge University Press, New York).
  • Matsumoto M. and Nishimura T.. Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul., 1998, 8, (1), 3–30.
  • Heath M. T.. Scientific Computing: An Introductory Survey, 2002, 2nd edition (McGraw-Hill, New York).
  • Braudaway G. W.. Procedure for optimum choice of a small number of colors from a large color palette for color imaging, Proc. Electronic Imaging Conf., San Francisco, CA February 1987, SPIE, pp. 71–75.
  • Ward J.. Hierarchical grouping to optimize an objective function. J. Am. Stat. Assoc., 1963, 58, (301), 236–244.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.