Citation

Low, Jing-Hong and Wong, Chee-Onn and Yang, Hwangkyu and Han, Eunjung and Keechul, Jung and Kirak, Kim (2008) Using Skeletonization and Shortest Skeleton Path Approach for Chinese Character Representation. In: Digital Image Computing: Techniques and Applications (DICTA), 2008. IEEE, 472 -479. ISBN 978-0-7695-3456-5

Text 04700059.pdf - Published Version Restricted to Repository staff only Download (436kB)

Abstract

This paper adopts skeletonization approach to represent Chinese character and uses the resulting written strokes for optimized matching. We use shortest path method that represented by end node pair and junction node pair in the character for matching. This strategy is improved from the original shortest skeleton path matching by introducing the junction node as an extra feature in order to be able to represent singularity, non-singularity and looping characteristics for Chinese characters. Our result shows an effective representation and matching of the character by skeletonization and shortest path method considering end nodes and junction nodes as matching strategy.

Item Type:	Book Section
Subjects:	Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions:	Faculty of Computing and Informatics (FCI)
Depositing User:	Ms Suzilawati Abu Samah
Date Deposited:	14 Nov 2013 05:05
Last Modified:	14 Nov 2013 05:05
URII:	http://shdl.mmu.edu.my/id/eprint/4407

Downloads

Edit (login required)