메뉴 건너뛰기




Volumn , Issue , 2002, Pages 61-66

Minimum classification error training for online handwritten word recognition

Author keywords

[No Author keywords available]

Indexed keywords

HANDWRITTEN WORD RECOGNITION; MINIMUM CLASSIFICATION ERROR; MINIMUM CLASSIFICATION ERROR TRAINING; SYSTEM USE; WORD ERROR RATE REDUCTIONS; WORD RECOGNITION;

EID: 84893458678     PISSN: 15505235     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWFHR.2002.1030885     Document Type: Conference Paper
Times cited : (6)

References (12)
  • 2
    • 0034846558 scopus 로고    scopus 로고
    • Minimum classification error training of hidden markov model for handwriting recognition
    • A. Biem. Minimum Classification Error Training of Hidden Markov Model for Handwriting Recognition. Proceedings of ICASSP, 3, 2001.
    • (2001) Proceedings of ICASSP , vol.3
    • Biem, A.1
  • 4
    • 2142709298 scopus 로고    scopus 로고
    • World level discriminative training for handwritten word recognition
    • W-T. Chen and P. Gader. World Level Discriminative Training for Handwritten Word Recognition. Proceedings of IWFWR VII, pages 393-402, 2000.
    • (2000) Proceedings of IWFWR VII , pp. 393-402
    • Chen, W.-T.1    Gader, P.2
  • 6
    • 0034857996 scopus 로고    scopus 로고
    • High performance chinese ocr based on gabor features
    • Q. Huo, Y. Ge, and Z. Feng. High Performance Chinese OCR Based on Gabor Features. Proceedings of ICASSP, 3, 2001.
    • (2001) Proceedings of ICASSP , vol.3
    • Huo, Q.1    Ge, Y.2    Feng, Z.3
  • 9
    • 0020796537 scopus 로고
    • A decision theoretic formulation of a training problem in speech recognition and a comparison of training by unconditional versus conditional maximum likelihood
    • A. Nadas. A Decision Theoretic Formulation of a Training Problem in Speech Recognition and a Comparison of Training by Unconditional Versus Conditional Maximum Likelihood. IEEE Trans. on Acoustics, Speech, and Signal Processing, 31(4):814-817, 1983.
    • (1983) IEEE Trans. on Acoustics, Speech, and Signal Processing , vol.31 , Issue.4 , pp. 814-817
    • Nadas, A.1
  • 10
  • 11
    • 0000998113 scopus 로고    scopus 로고
    • K-means clustering for hidden markov models
    • Sep
    • M. P. Perrone and S. D. Connell. K-means Clustering for Hidden Markov Models. Proceedings of IWFHR VII, pages 229-238, Sep. 2000.
    • (2000) Proceedings of IWFHR VII , pp. 229-238
    • Perrone, M.P.1    Connell, S.D.2
  • 12
    • 0026370988 scopus 로고
    • A tree-treillis based fast search for finding the n-best sentence hypothese in continuous speech recognition
    • F. K. Soong and E-F. Huang. A Tree-treillis based Fast Search for Finding the N-best Sentence Hypothese in Continuous Speech Recognition. Proceedings of ICASSP, 1991.
    • (1991) Proceedings of ICASSP
    • Soong, F.K.1    Huang, E.-F.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.