English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67621/67621 (100%)
Visitors : 23122672      Online Users : 550
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29236

    Contributors: 資訊工程研究所
    Date: 1994
    Issue Date: 2010-06-29 20:17:09 (UTC+8)
    Publisher: 中央大學
    Abstract: The problems arising in the modeling and coding of digital Chinese character patterns for noiseless compression purposes are discussed. The modeling is intended to capture the maximum redundancies of the source under the consideration of relevant parameters, In this study, a redundancy-gathering algorithm is proposed in which a 2-D parsing tree is used, and the nodes to extend the tree are ranked according to the maximum redundancy gathered. Hence, the modeling represented by the tree can achieve great performance in the small number of nodes. The algorithm is then applied to evaluate the performance of arithmetic coding for digital Chinese character patterns. The results are compared to those of the traditional compression methods. In the same complexity, we find that our algorithm can improve the coding efficiency as high as 25.54%, 30.23%, 32.17%, 15.90%, and 27.58%, for five Chinese fonts, respectively.
    Appears in Collections:[資訊工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明