Stroke segmentation as a basis for structural matching of Chinese characters

Chang, Fu; Chen, Y.-C.; Don, Hon-Son; Hsu, Wei-Wen; Kao, Chih-Hong

doi:10.1109/icdar.1993.395787

Cited by 7 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These thin line representations ͑i.e., the skeletons͒ usually coarsely approximate each region's medial axis. [1][2][3][4][5][6][7][8][9] A large amount of previous work has certainly been focused on creating skeletal representations that are both useful and able to be generated quickly. 10 Approaches here are widely varied and quite numerous, with each approach having its own strengths and weaknesses.…”

Section: Introductionmentioning

confidence: 99%

Well-shaped skeletons and fast computation of the (3,4) distance transform

Goldman¹,

Bourbakis

2002

J. Electron. Imaging

View full text Add to dashboard Cite

In this paper we describe a time efficient approach for computing the (3,4) distance transform and a method of producing intuitively well-shaped nonsensitive skeletons. The need and usefulness of abstracting both skeletal and distance transform information have been demonstrated in various earlier work. However, the approach presented here is intended to overcome several weaknesses while possibly permitting real-time computation on low-cost single or multiprocessor systems for applications such as video processing. Specifically, an incremental improvement to Kwok's thinning algorithm is presented which allows the distance transform to be computed during thinning using significantly fewer addition and comparison operations. Additionally, efficient techniques are given which then further process the resultant skeleton using the computed distance transform information as well as information gathered about the surrounding chain codes. These techniques efficiently remove various skeletal artifacts, leaving well-shaped graph representations annotated with distance transform values.

show abstract

Section: Introductionmentioning

confidence: 99%

Well-shaped skeletons and fast computation of the (3,4) distance transform

Goldman¹,

Bourbakis

2002

J. Electron. Imaging

View full text Add to dashboard Cite

show abstract

Feature analysis using line sweep thinning algorithm

Chang

Pavlidis

1999

IEEE Trans. Pattern Anal. Machine Intell.

View full text Add to dashboard Cite

Structural analysis based stroke segmentation for Chinese characters

Lam

Yam

2009

Proceedings of the 48h IEEE Conference on Decision and Control (CDC) Held Jointly With 2009 28th Chinese Control Conference

View full text Add to dashboard Cite

This paper proposes a method for stroke segmentation to decompose Chinese characters to become individual strokes. The method first obtains the medial axes of any given Chinese character for structural analysis. A fast skeletonization method using Delaunay triangulation is applied to convert the character into triangular mesh. Based on the fundamental rules and formations of Chinese characters, the mesh is rearranged to remove the spurious branches existing in the character structure. Connections between the stroke branches are decided by those with the minimum differences in various factors, including gradients of the medial axes and boundaries, as well as the widths of the branches. Strokes are then generated and completed using Bezier curves. The work included experiments to examine the algorithm.

show abstract

Stroke segmentation as a basis for structural matching of Chinese characters

Cited by 7 publications

References 10 publications

Well-shaped skeletons and fast computation of the (3,4) distance transform

Well-shaped skeletons and fast computation of the (3,4) distance transform

Feature analysis using line sweep thinning algorithm

Structural analysis based stroke segmentation for Chinese characters

Contact Info

Product

Resources

About