File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1049/cp:19950627
- Scopus: eid_2-s2.0-0029215257
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Consistent relaxation matching for handwritten Chinese character recognition
Title | Consistent relaxation matching for handwritten Chinese character recognition |
---|---|
Authors | |
Keywords | Computers Computer graphics |
Issue Date | 1995 |
Publisher | IEEE. |
Citation | Proceedings of the 5th International Conference on Image Processing and its Applications, Edinburgh, UK, 4-6 July 1995, p. 95-99 How to Cite? |
Abstract | Due 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 Identifier | http://hdl.handle.net/10722/45567 |
ISSN | 2019 SCImago Journal Rankings: 0.101 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jin, LW | en_HK |
dc.contributor.author | Chan, KP | en_HK |
dc.contributor.author | Xu, BingZ | en_HK |
dc.date.accessioned | 2007-10-30T06:29:20Z | - |
dc.date.available | 2007-10-30T06:29:20Z | - |
dc.date.issued | 1995 | en_HK |
dc.identifier.citation | Proceedings of the 5th International Conference on Image Processing and its Applications, Edinburgh, UK, 4-6 July 1995, p. 95-99 | en_HK |
dc.identifier.issn | 0537-9989 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/45567 | - |
dc.description.abstract | Due 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.extent | 353547 bytes | - |
dc.format.extent | 4345 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | Proceedings of the 5th International Conference on Image Processing and its Applications | en_HK |
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.subject | Computers | en_HK |
dc.subject | Computer graphics | en_HK |
dc.title | Consistent relaxation matching for handwritten Chinese character recognition | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Chan, KP:kpchan@cs.hku.hk | en_HK |
dc.identifier.authority | Chan, KP=rp00092 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1049/cp:19950627 | - |
dc.identifier.scopus | eid_2-s2.0-0029215257 | en_HK |
dc.identifier.hkuros | 14161 | - |
dc.identifier.issue | 410 | en_HK |
dc.identifier.spage | 95 | en_HK |
dc.identifier.epage | 99 | en_HK |
dc.identifier.scopusauthorid | Jin, LW=7403329268 | en_HK |
dc.identifier.scopusauthorid | Chan, KP=7406032820 | en_HK |
dc.identifier.scopusauthorid | Xu, BingZ=7404588354 | en_HK |
dc.identifier.issnl | 0537-9989 | - |