File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: PRACTICAL BASIS SET FOR CHINESE CHARACTER REPRESENTATION.

TitlePRACTICAL BASIS SET FOR CHINESE CHARACTER REPRESENTATION.
Authors
Issue Date1985
AbstractChinese characters have the property that the strokes are distributed mainly in the horizontal, vertical, and slant directions. Hence, there are strong correlations in these directions that can be utilized for data compression. Among the decorrelation techniques, the Karhunen-Loeve transformation (KLT) is optimal. However, it is not practical due to the heavy computation involved in diagonalizing the N**2 multiplied by N**2 correlation matrix corresponding to the sample images digitized on an N multiplied by N grid. A modified KLT (MKLT) that can be efficiently computed is proposed. The method is to transform the character with respect to several basis sets, each set representing strokes of a given direction. It is shown that by suitable modeling, computation of the MKLT involves only diagonalization of N multiplied by N matrices instead of N**2 multiplied by N**2 matrices as generally required. The inherent computational problem of the KLT is thus bypassed by this suboptimal approach. Experimental results show that the MKLT is more effective than Fourier transformation for Chinese character representation.
Persistent Identifierhttp://hdl.handle.net/10722/157988

 

DC FieldValueLanguage
dc.contributor.authorLeung, CHen_US
dc.date.accessioned2012-08-08T08:57:35Z-
dc.date.available2012-08-08T08:57:35Z-
dc.date.issued1985en_US
dc.identifier.urihttp://hdl.handle.net/10722/157988-
dc.description.abstractChinese characters have the property that the strokes are distributed mainly in the horizontal, vertical, and slant directions. Hence, there are strong correlations in these directions that can be utilized for data compression. Among the decorrelation techniques, the Karhunen-Loeve transformation (KLT) is optimal. However, it is not practical due to the heavy computation involved in diagonalizing the N**2 multiplied by N**2 correlation matrix corresponding to the sample images digitized on an N multiplied by N grid. A modified KLT (MKLT) that can be efficiently computed is proposed. The method is to transform the character with respect to several basis sets, each set representing strokes of a given direction. It is shown that by suitable modeling, computation of the MKLT involves only diagonalization of N multiplied by N matrices instead of N**2 multiplied by N**2 matrices as generally required. The inherent computational problem of the KLT is thus bypassed by this suboptimal approach. Experimental results show that the MKLT is more effective than Fourier transformation for Chinese character representation.en_US
dc.languageengen_US
dc.titlePRACTICAL BASIS SET FOR CHINESE CHARACTER REPRESENTATION.en_US
dc.typeConference_Paperen_US
dc.identifier.emailLeung, CH:chleung@eee.hku.hken_US
dc.identifier.authorityLeung, CH=rp00146en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0022216626en_US
dc.identifier.scopusauthoridLeung, CH=7402612415en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats