File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Consistent relaxation matching for handwritten Chinese character recognition

TitleConsistent relaxation matching for handwritten Chinese character recognition
Authors
KeywordsComputers
Computer graphics
Issue Date1995
PublisherIEEE.
Citation
Iee Conference Publication, 1995 n. 410, p. 95-99 How to Cite?
AbstractDue to the complexity in structure and the various distortions (translation, rotation, shifting, and deformation) in different writing styles of Handwritten Chinese Characters(HCCs), it is more suitable to use a structural matching algorithm for computer recognition of HCC. Relaxation matching is a powerful technique which can tolerate considerable distortion. However, most relaxation techniques so far developed for Handwritten Chinese Character Recognition (HCCR) are based on a probabilistic relaxation scheme. In this paper, based on local constraint of relaxation labelling and optimization theory, we apply a new relaxation matching technique to handwritten character recognition. From the properties of the compatibility constraints, several rules are devised to guide the design of the compatibility function, which plays an important role in the relaxation process. By parallel use of local contextual information of geometric relaxationship among strokes of two characters, the ambiguity between them can be relaxed iteratively to achieve optimal consistent matching.
Persistent Identifierhttp://hdl.handle.net/10722/45567
ISSN

 

DC FieldValueLanguage
dc.contributor.authorJin, LWen_HK
dc.contributor.authorChan, KPen_HK
dc.contributor.authorXu, BingZen_HK
dc.date.accessioned2007-10-30T06:29:20Z-
dc.date.available2007-10-30T06:29:20Z-
dc.date.issued1995en_HK
dc.identifier.citationIee Conference Publication, 1995 n. 410, p. 95-99en_HK
dc.identifier.issn0537-9989en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45567-
dc.description.abstractDue to the complexity in structure and the various distortions (translation, rotation, shifting, and deformation) in different writing styles of Handwritten Chinese Characters(HCCs), it is more suitable to use a structural matching algorithm for computer recognition of HCC. Relaxation matching is a powerful technique which can tolerate considerable distortion. However, most relaxation techniques so far developed for Handwritten Chinese Character Recognition (HCCR) are based on a probabilistic relaxation scheme. In this paper, based on local constraint of relaxation labelling and optimization theory, we apply a new relaxation matching technique to handwritten character recognition. From the properties of the compatibility constraints, several rules are devised to guide the design of the compatibility function, which plays an important role in the relaxation process. By parallel use of local contextual information of geometric relaxationship among strokes of two characters, the ambiguity between them can be relaxed iteratively to achieve optimal consistent matching.en_HK
dc.format.extent353547 bytes-
dc.format.extent4345 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEE Conference Publicationen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectComputersen_HK
dc.subjectComputer graphicsen_HK
dc.titleConsistent relaxation matching for handwritten Chinese character recognitionen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1522-4880&volume=&spage=95&epage=99&date=1995&atitle=Consistent+relaxation+matching+for+handwritten+Chinese+character+recognitionen_HK
dc.identifier.emailChan, KP:kpchan@cs.hku.hken_HK
dc.identifier.authorityChan, KP=rp00092en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.scopuseid_2-s2.0-0029215257en_HK
dc.identifier.hkuros14161-
dc.identifier.issue410en_HK
dc.identifier.spage95en_HK
dc.identifier.epage99en_HK
dc.identifier.scopusauthoridJin, LW=7403329268en_HK
dc.identifier.scopusauthoridChan, KP=7406032820en_HK
dc.identifier.scopusauthoridXu, BingZ=7404588354en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats