ridm@nrct.go.th   ระบบคลังข้อมูลงานวิจัยไทย   รายการโปรดที่คุณเลือกไว้

Binary validation as segmentation for cursive handwriting recognition

หน่วยงาน Central Queensland University, Australia

รายละเอียด

ชื่อเรื่อง : Binary validation as segmentation for cursive handwriting recognition
นักวิจัย : Lee, Hong. , Centre for Intelligent and Networked Systems (CINS) , Verma, Brijesh , Centre for Intelligent and Networked Systems (CINS)
คำค้น : Cursive Handwriting Recognition, Segmentation Algorithms, Neural Networks
หน่วยงาน : Central Queensland University, Australia
ผู้ร่วมงาน : -
ปีพิมพ์ : 2554
อ้างอิง : http://hdl.cqu.edu.au/10018/917806 , acquire3-20120131-21264 , cqu:8249
ที่มา : -
ความเชี่ยวชาญ : -
ความสัมพันธ์ : -
ขอบเขตของเนื้อหา : -
บทคัดย่อ/คำอธิบาย :

A novel Binary Validation as Segmentation (BVS) is presented in this paper. BVS is a bottom-up approach for character segmentation in off-line cursive handwriting recognition. The character segmentation is a process to extract individual character image from a handwritten word image. The extensive literature reveals that offline handwriting recognition still suffers from the absence of reliable character segmentation algorithms. The character segmentation stage is very crucial part in offline handwriting recognition because the recognition performance is directly affected by the segmentation performance. Therefore, improving the segmentation accuracy is very high prior task in this field. BVS takes over-segmentation components to generate primitives. The over-segmentation guarantees that none of primitives contains image pixels belonging to different characters. Based on the primitives, neighboring primitives are combined to create evaluation hypotheses. The most competent hypothesis is sought by global competency function using neural network classifier. BVS repeats cycles of combination and evaluation iteratively. Each cycle combines one a pair of two neighboring primitives permanently. That’s why the proposed approach includes the term, binary. BVS also introduces Continuous Foreground Transition (CFT) model to prevent under-segmentation errors. The proposed approach has been evaluated on CEDAR benchmark database. The results showed a significant improvement in segmentation errors. The analysis of results showed that the inclusion of CFT into the validation function has played a major role in improving over-segmentation and bad-segmentation errors.

บรรณานุกรม :
Lee, Hong. , Centre for Intelligent and Networked Systems (CINS) , Verma, Brijesh , Centre for Intelligent and Networked Systems (CINS) . (2554). Binary validation as segmentation for cursive handwriting recognition.
    กรุงเทพมหานคร : Central Queensland University, Australia.
Lee, Hong. , Centre for Intelligent and Networked Systems (CINS) , Verma, Brijesh , Centre for Intelligent and Networked Systems (CINS) . 2554. "Binary validation as segmentation for cursive handwriting recognition".
    กรุงเทพมหานคร : Central Queensland University, Australia.
Lee, Hong. , Centre for Intelligent and Networked Systems (CINS) , Verma, Brijesh , Centre for Intelligent and Networked Systems (CINS) . "Binary validation as segmentation for cursive handwriting recognition."
    กรุงเทพมหานคร : Central Queensland University, Australia, 2554. Print.
Lee, Hong. , Centre for Intelligent and Networked Systems (CINS) , Verma, Brijesh , Centre for Intelligent and Networked Systems (CINS) . Binary validation as segmentation for cursive handwriting recognition. กรุงเทพมหานคร : Central Queensland University, Australia; 2554.