{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:11:36Z","timestamp":1648905096789},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[1991,6]]},"abstract":"<jats:p> The problem of handwritten Chinese character recognition is solved by matching character stroke segments using an iteration scheme. Length and orientation similarity properties, and coordinate overlapping ratios are used to define a measure of similarity between any two stroke segments. The initial measures of similarity between the stroke segments of the input and template characters are used to set up a match network which includes all the match relationships between the input and template stroke segments. Based on the concept of at-most-one to one mapping an iteration scheme is employed to adjust the match relationships, using the contextual information implicitly contained in the match network, so that the match relationships can get into a stable state. From the final match relationships, matched stroke-segment pairs are determined by a mutually-best match strategy and the degree of similarity between the input and each template character is evaluated accordingly. Certain structure information of Chinese characters is also used in the evaluation process. The experimental results show that the proposed approach is effective. For recognition of Chinese characters written by a specific person, the recognition rate is about 96%. If the characters of the first three ranks are checked in counting the recognition rate, the rate rises to 99.6%. <\/jats:p>","DOI":"10.1142\/s0218001491000120","type":"journal-article","created":{"date-parts":[[2004,11,27]],"date-time":"2004-11-27T01:43:01Z","timestamp":1101519781000},"page":"175-197","source":"Crossref","is-referenced-by-count":9,"title":["RECOGNIZING HANDWRITTEN CHINESE CHARACTERS BY STROKE-SEGMENT MATCHING USING AN ITERATION SCHEME"],"prefix":"10.1142","volume":"05","author":[{"given":"SHENG-LIN","family":"CHOU","sequence":"first","affiliation":[{"name":"Institute of Computer Science and  Information Engineering, National Chiao Tung University, Hsinchu,  Taiwan 30050, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WEN-HSIANG","family":"TSAI","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, National Chiao Tung University, Hsinchu,  Taiwan 30050, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001491000120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:14:45Z","timestamp":1565144085000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001491000120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":0,"journal-issue":{"issue":"01n02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1991,6]]}},"alternative-id":["10.1142\/S0218001491000120"],"URL":"https:\/\/doi.org\/10.1142\/s0218001491000120","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}