Abstract
High-dynamic range (HDR) images are commonly used in computer graphics for accurate rendering. However, it is inefficient to store these images because of their large data size. Although vector quantization approach can be used to compress them, a large number of representative colors are still needed to preserve acceptable image quality. This paper presents an efficient color quantization approach to compress HDR images. In the proposed approach, a 1D/2D neighborhood structure is defined for the self-organizing map (SOM) approach and the SOM approach is then used to train a color palette. Afterward, a virtual color palette that has more codevectors is simulated by interpolating the trained color palette. The interpolation process is hardware supported in the current graphics hardware. Hence, there is no need to store the virtual color palette as the representative colors are constructed on the fly. Experimental results show that our approach can obtain good image quality with a moderate color palette.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
For instance, in Fig. 5, in the SOM color palette, given an input, we first find out its closest representative color \(\user2{c}_{1,2}.\) The representative color \(\user2{c}_{1,2}\) creates 9 potential representative colors in the virtual color palette.
References
Ward GJ (1994) The RADIANCE lighting simulation and rendering system. In: SIGGRAPH ’1994: Proceedings of the 21st annual conference on computer graphics and interactive techniques, pp 459–472
Lam PM, Ho TY, Leung CS, Wong TT (2010) All-frequency lighting with multiscale spherical radial basis functions. IEEE TVCG 16:43–56
Debevec PE, Malik J (1997) Recovering high dynamic range radiance maps from photographs. SIGGRAPH 97
Kang SB, Uyttendaele M, Winder S, Szeliski R (2003) High dynamic range video. In: Proceedings of ACM SIGGRAPH, pp 319–325
Wallace GK (1991) The JPEG still picture compression standard. Commun ACM 34(4):30–44
Adams MD, Ward R (2001) Wavelet transforms in the JPEG-2000 standard. In: Proceedings of IEEE Pacific Rim conference on communications, computers and signal processing, vol 1, pp 160–163
Usevitch BE (2001) A tutorial on modern lossy wavelet image compression: foundations of (JPEG) 2000. IEEE Signal Processing Magazine, pp 22–35
Verevka O (1995) Color image quantization in windows systems with local k-means algorithm. In: Proceedings of the western computer graphics symposium ’95, pp 74–79
Kruger A (1994) Median-cut color quantization. Dr. Dobb’s J 46–54
Clark D (1996) “Color quantization using octrees”. Dr. Dobb’s J 54–57
Braquelaire JP, Brun L (1997) Comparison and optimization of methods of color image quantization. IEEE Trans Image Process 6:1048–1051
Orchard MT, Bouman CA (1991) Color quantization of images. IEEE Trans Signal Process 39:2677–2690
Papamarkos N (1999) Color reduction using local features and a kohonen self-organized feature map neural network. Int J Imaging Syst Technol 10(5):404–409
Papamarkos N, Atsalakis AE, Strouthopoulos CP (2002) Adaptive color reduction. IEEE Syst Man Cybern B 32:44–56
Rui X, Chang CH, Srikanthan T (2002) On the initialization and training methods for kohonen self-organizing feature maps in color image quantization. Electronic design, test and applications, IEEE international workshop on 0:321
Linde Y, Buzo A, Gray R (1980) An algorithm for vector quantizer design. IEEE Trans Commun 28(1):84–95
Heckbert P (1982) Color image quantization for frame buffer display. SIGGRAPH Comput Graph 16(3):297–307
Gervautz M, Purgathofer W (1988) A simple method for color quantization: octree quantization. New trends in computer graphics, pp 219–231
Wan SJ, Prusinkiewicz P, Wong SKM (1990) Variance-based color image quantization for frame buffer display. Color Res Appl 15(1):52–58
Orchard MT, Bouman CA (1991) Color quantization of images. IEEE Trans Signal Process 39(12):2677–2690
Wu X (1991) Efficient statistical computations for optimal color quantization. Graph Gems 2:126–133
Joy G, Xiang Z (1993) Center-cut for color-image quantization. Vis Comput 10(1):62–66
Yang CY, Lin JC (1996) RWM-cut for color image quantization. Comput Graph 20(4):577–588, Hardware Supported Texturing
Celebi ME (2009) Fast color quantization using weighted sort-means clustering. J Opt Soc Am A 26(11):2434–2443
Xiang Z (1997) Color image quantization by minimizing the maximum intercluster distance. ACM Trans Graph 16(3):260–276
Ozdemir D, Akarun L (2002) A fuzzy algorithm for color quantization of images. Pattern Recognit 35(8):1785–1791
Schaefer G, Zhou H (2009) Fuzzy clustering for colour reduction in images. Telecommun Syst 40:17–25. doi:10.1007/s11235-008-9143-8
Dekker AH (1994) Kohonen neural networks for optimal colour quantization. Netw Comput Neural Syst 5(3):351–367
Kohonen T (2001) Self-organizing maps. Springer, Berlin
Chang CH, Xu PF, Xiao R, Srikanthan T (2005) New adaptive color quantization method based on self-organizing maps. IEEE transactions on neural networks, pp 237–249
Wang CH, Lee CN, Hsieh CH (2007) Sample-size adaptive self-organization map for color images quantization. Pattern Recognit Lett 28(13):1616–1629
Leung CS, Chan LW (1997) Transmission of vector quantized data over a noisy channel. IEEE Trans Neural Netw 8(1):582–589
Ho TY, Leung CS (2008) Efficient HDR texture compression. In ShaderX6, Charles River Media, pp 525–533
Acknowledgments
The work was supported by a research grant from City University of Hong Kong (Project No.: 7002701).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xiao, Y., Leung, CS., Lam, PM. et al. Self-organizing map-based color palette for high-dynamic range texture compression. Neural Comput & Applic 21, 639–647 (2012). https://doi.org/10.1007/s00521-011-0654-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-011-0654-y