An Optimal Character Segmentation Algorithm Based on Connected Component Recognition[J]. Journal of Image and Graphics, 2006, 11(1): 8. DOI: 10.11834/jig.20060102.
An Optimal Character Segmentation Algorithm Based on Connected Component Recognition
Segmentation of merged characters is one of difficulties that have attracted a great deal of attention in optical character recognition(OCR).Nowadays
unsuitable segmentation is the primary cause of recognition errors.Based on the analysis of the shortcomings of some traditional algorithms for printed character segmentation
we notice that it is necessary to propose a fine method to meet with the requirement of real time processing and the characteristics of DSP module including relative low power and small memory comparing with PC.In this paper a new algorithm of segmentation and recognition based on connected component is proposed which can be used for electronic reading-pen.The proposed method reduces computation time by recognizing the connected component as a whole.It segments connected component by middle expansion method and peak-paddle function.As a result
recognition error arose by segmentation error can be reduced.Experiment results have proved that the algorithm is effective
easy to implement and it is reasonable and applicable for to ERpen.