Speedup of Color Palette Indexing in Self–Organization of Kohonen Feature Map
Based on the self–organization of Kohonen feature map (SOFM), recently, Pei et al. presented an efficient color palette indexing method to construct a color table for compression. Taking their palette indexing method as a representative, this paper presents two new strategies, the pruning–based search strategy and the lookup table (LUT)–based update strategy, to speed up the learning process in the SOFM. Based on four typical testing images, experimental results demonstrate that our proposed two strategies have 35% execution–time improvement ratio in average. In fact, our proposed two strategies could be used to speed up the other SOFM–based learning processes in different applications.
KeywordsColor palette indexing lateral update interaction learning process lookup table SOFM speedup winning neuron
Unable to display preview. Download preview PDF.
- 1.Kohonen, T.: Construction of similarity diagrams for phonemes by a self-organizing algorithm. Technical Report TKK-F-A463, Helsinki University of Technology, Espoo, Finland (1981)Google Scholar
- 2.Pei, S.C., Chuang, Y.T., Chuang, W.H.: Effective palette indexing for image compression using self-organization of Kohonen feature map. IEEE Transactions on Image Processing 15(9), 52–61 (2006)Google Scholar
- 3.Information Technology–Lossless and Near-Lossless Compression of Continuous-Tone Still Images, ISO/IEC Standard 14 495–1 (1999)Google Scholar
- 4.Information Technology–JPEG 2000 Image Coding System. ISO/IEC Standard 15 444–1 (2000)Google Scholar