中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/29248
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78818/78818 (100%)
Visitors : 34720948      Online Users : 1471
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/29248


    Title: ONLINE RECOGNITION BY DEVIATION-EXPANSION MODEL AND DYNAMIC-PROGRAMMING MATCHING
    Authors: LIN,CK;FAN,KC;LEE,FTP
    Contributors: 資訊工程研究所
    Keywords: ONLINE
    Date: 1993
    Issue Date: 2010-06-29 20:17:28 (UTC+8)
    Publisher: 中央大學
    Abstract: An on-line recognition system is presented for large-alphabet handprinted Chinese characters by the model based recognition approach with stroke based features. A deviation-expansion (D-E) model representing the reference pattern is constructed. The model contains the hypothetical knowledge of handwriting variations including stroke-order deviations and stroke-number deviations. For pattern matching a matching graph is constructed by combining the knowledge of the reference pattern and the unknown pattern together. With the graph a similarity measure function is defined to indicate similarity degree, The evaluation of the function is obtained by utilizing dynamic programming matching. Experimental results are based upon the testing set of 54,000 handprinted sample characters written in square style by ten persons. The D-E models of reference patterns saved in a data base are generated by 5400 daily-used Chinese characters. The unknown character to be recognized can be stroke-order and stroke-number free, tolerant for incorrect strokes and daily-used connected strokes, size and shape flexible. The cumulative classification rate of choosing the ten most similar characters is 98%. The results suggest that the hypothetical model is feasible and reasonable.
    Relation: PATTERN RECOGNITION
    Appears in Collections:[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML680View/Open


    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 ©   - 隱私權政策聲明