City University of Hong Kong

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - School of Creative Media >
SCM - Master of Philosophy  >

Please use this identifier to cite or link to this item:

Title: Markov random field-based hierarchical handwritten Chinese character modeling
Other Titles: Ji yu Maerkefu sui ji chang de Zhong wen shou xie Han zi ceng ci jian mo
Authors: Tian, Desai (田德赛)
Department: School of Creative Media
Degree: Master of Philosophy
Issue Date: 2010
Publisher: City University of Hong Kong
Subjects: Chinese characters -- Data processing.
Optical pattern recognition.
Markov processes.
Notes: CityU Call Number: PL1074.5 .T53 2010
xi, 56 leaves : ill. 30 cm.
Thesis (M.Phil.)--City University of Hong Kong, 2010.
Includes bibliographical references (leaves 51-56)
Type: thesis
Abstract: This dissertation proposes a statistical-structural character modeling method based on the Markov Random Fields(MRFs) in the Handwritten Chinese Character Recognition(HCCR) problem. In the MRF framework, we view the character recognition as a labeling problem, as how well a given observation matches a character model. The MRF framework can represent both statistical and structural information of the Chinese character by the neighborhood systems and clique potentials. The neighborhood system denotes the most important stroke relationships. The clique potential is composed by prior clique potential based on our prior knowledge and likelihood clique potential represents both statistical and structural information, which is derived from Gaussian Mixture Models(GMMs). We add the radical information into our prior knowledge, thus form a hierarchical character structure in which radicals constitute characters, and strokes constitute radicals. With the help of radical structure, we can easily grasp the most important stroke relationships. We implemented a real-world application of character recognition. In the proposed HCCR system, we extract candidate strokes from character image by minimizing the single-site likelihood clique potentials, and find the best structural match between candidate strokes and stroke models by the relaxation labeling algorithm. The experiments done on the Korea Advanced Institute of Science and Technology (KAIST) character database demonstrate the practicability of proposed approaches.
Online Catalog Link:
Appears in Collections:SCM - Master of Philosophy

Files in This Item:

File Description SizeFormat
abstract.html135 BHTMLView/Open
fulltext.html135 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer