DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Jin-Hyung | - |
dc.contributor.advisor | 김진형 | - |
dc.contributor.author | Lee, Seung-Ho | - |
dc.contributor.author | 이승호 | - |
dc.date.accessioned | 2011-12-13T05:23:27Z | - |
dc.date.available | 2011-12-13T05:23:27Z | - |
dc.date.issued | 1995 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=101781&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/33040 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전산학과, 1995.2, [ v, 101 p. ] | - |
dc.description.abstract | In this thesis, a new framework is proposed for the problem of on-line cursive script recognition. In the proposed framework, the process of word recognition is guided by the psychological model of the human reading process proposed by Taylor and Taylor. It is initially chosen from a lexicon a smaller list of candidate words which have global features equivalent to the unknown input pattern. The reduced lexicon is utilized as linguistic constrains to lattice search. Next, all letter components within the unknown pattern are detected using a letter spotting technique utilizing hidden Markov models (HMM), which has been successfully applied in speech recognition and language modeling problems. A letter hypothesis lattice is generated as a result of letter spotting. Then an island-driven search technique is applied to find the optimal path on the letter hypothesis lattice. In case that lattice search fails to find a complete path covering the entire input data, an error-tolerant word matching procedure is followed to rank all candidate words in the reduced lexicon. The proposed framework can be easily incorporated with other recognition methods such as neural network models. For instance, in order to increase the discrimination power of letter models we use neural network models in the place of HMMs. Thus, we can find on a letter hypothesis lattice the optimal path that maximizes a global criterion with respect to HMM-based latter segmentation and neural network model-based letter classification. This hybrid framework provides a nice recognition scheme of integrating the temporal structure of HMMs with the discrimination power of neural networks. It is shown by an experiment that the proposed framework is promising for recognizing English cursive words. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | On-line cursive script recognition using HMM-based letter spotting technique | - |
dc.title.alternative | 은닉 마르코프 모델 기반의 문자 검출 기법을 이용한 온라인 필기 단어 인식 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 101781/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 000865313 | - |
dc.contributor.localauthor | Kim, Jin-Hyung | - |
dc.contributor.localauthor | 김진형 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.