簡易檢索 / 詳目顯示

回結果列表
研究生： 汪均嬪
Jyun-Pin Wang
論文名稱： 加速基於自組織特徵映射之調色盤建立法
Speedup of Color Palette Indexing in Self-Organization of Kohonen Feature Map
指導教授： 鍾國亮
Kuo-Liang Chung
口試委員: 李漢銘
none
廖弘源
none
范國清
none
古鴻炎
none
學位類別： 碩士
Master
系所名稱： 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年： 2009
畢業學年度： 97
語文別： 英文
論文頁數： 24
中文關鍵詞： 彩色調色盤排序 、側向更新影響 、查找表 、自組織特徵映射 、學習過程 、加速
外文關鍵詞： Color palette indexing, lateral update interaction, learning process, lookup table, SOFM, speedup
相關次數： 點閱：222  下載：1 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  •  上一筆

    • 最近貝教授等人提出一基於自組織特徵映射 (SOFM) 調色盤影像之調色盤建立方法，具有良好的壓縮效果。以上述調色盤影像之調色盤建立方法為基礎架構，本篇論文提出兩種機制用以加速 SOFM 中學習過程，這兩種機制分別為：(1) 刪減搜尋法 和 (2) 查表更新機制。我們將利用刪減搜尋法加速尋找勝利神經元；而更新相關側向影響神經元的部分則利用查表法以加快其執行速度。我們使用四張典型的影像進行測試，實驗結果說明我們所提出的方法平均執行時間改善率達到 35%，此實驗數據亦非常接近本論文中所提及的理論分析數值。實際上，我們所提出的兩個機制亦可使用於其它 SOFM 的相關應用的學習過程上。

    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 the palette indexing method as a representative, this thesis 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. The proposed search strategy is used to speed up the process for finding the winning neuron in each iteration; the proposed LUT-based update strategy is used to speed up the lateral update interaction between the winning neuron and its neighboring neurons 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. The practical improvement ratio is very close to that in the theoretical analysis.

    1 Introduction 2 The palette indexing method by Pei et al. and two computational bottlenecks 2.1 SOFM–based learning model 2.2 Two computational bottlenecks 3 The proposed faster learning process 3.1 Pruning–based search strategy for finding winning neurons 3.2 LUT–Based Lateral Update Interaction 4 Experimental Results 5 Conclusions Appendices Appendix A

    [1] “Information Technology–Lossless and Near–Lossless Compression of Continuous–tone Still Images”, ISO/IEC Standard 14 495–1, (1999).
    [2] Weinberger, M. J., Seroussi, G., and Sapiro, G., “The LOCO–I lossless image compression algorithm: Principles and standardization into JPEG–LS”, IEEE Trans. on Image Processing, Vol. 9, No. 8, pp. 1309–1324 (2000).
    [3] “Information Technology–JPEG 2000 Image Coding System”, ISO/IEC Standard 15 444–1, (2000).
    [4] Skodras, A., Christopoulos, C., and Ebrahimi, T., “The JPEG 2000 still image compression standard”, IEEE Signal Processing, Vol. 18, No. 5, pp. 36–58 (2001).
    [5] Roleof, G., PNG: The Definitive Guide 2nd ed., CA: Greeg Roelof, San Jose, (2003) [online]. Available: http://www.libpng.org/pub/png/book/.
    [6] 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).
    [7] Pei, S. C. and Lo, Y. S., “Color image compression and limited display using self–organization Kohonen map”, IEEE Trans. on Circuits Systems Video Technology, Vol. 8, No. 2, pp. 191–205 (1998).
    [8] Pei, S. C., Chuang, Y. T., and Chuang, W. H., “Effective palette indexing for image compression using self–organization of Kohonen feature map”, IEEE Trans. on Image Processing, Vol. 15, No. 9, pp. 52–61 (2006).
    [9] Cho, J., Paiva, A. R. C., Kim, S., Sanchez, J. C., and Pr′ıncipe, J. C., “Self–organizing maps with dynamic learning for signal reconstruction”, Neural Networks, Vol. 20, No. 2, pp. 274–284 (2007).
    [10] Laha, A., Pal, N. R., and Chanda, B., “Design of vector quantizer for image compression using self–organizing feature map and surface fitting”, IEEE Trans. on Image Processing, Vol. 13, No. 10, pp. 1291–303 (2004).
    [11] Hu, Y. C., Chen, R. S., Hsu, Y. T., and Tzeng, G. H., “Grey self–organizing feature maps”, Neurocomputing, Vol. 48, No. 1–4, pp. 863–877 (2002).
    [12] Hsu, A. and Halgamuge, S. K., “Class structure visualization with semi–supervised growing self–organizing maps”, Neurocomputing, Vol. 71, No. 16–18, pp. 3124–3130 (2008).
    [13] Pandya, A. S. and Macy, R. B., Pattern Recognition with Neural Networks in C++, CRC Press, New York, pp. 230–258 (1995).
    [14] Ritteer, H., Martinez, T., and Schulten, K., Neural Computation and Self–Organizing Maps: An Introduction, Addison–Wesley, New York, pp. 63–80 (1992).
    [15] Ripley, B. D., Pattern Recognition and Neural Networks, Cambridge university Press, New York, pp. 322–326 (1996).
    [16] Hagenbuchner, Sperduti, M., A., and Tsoi, A. C., “Graph self–organizing maps for cyclic and unbounded graphs”, Neurocomputing, Vol. 72, No. 7–9, pp. 1419–1430
    (2009).
    [17] Memon, N. D., Venkateswaran, A., and Stanco, F., “On ordering color maps for lossless predictive coding”, IEEE Trans. on Image Processing, Vol. 5, No. 11, pp. 1522–1527 (1996).
    [18] Zeng, W., Li, J., and Lei, S., “An efficient color re–indexing scheme for palette–based compression”, Proceedings of the 2000 International Conference on Image Processing, Vol. 3, No. 3, pp. 476–479 (2000).
    [19] Pinho, A. J., and Neves, A. J. R., “A note on Zeng’s technique for color reindexing of palette–based images”, IEEE Signal Processing Letters, Vol. 11, No. 2, pp. 232–234
    (2004).

    QR CODE