Non-linear partitioning path based approach for touching and kerned character segmentation
Yangxing Liu · Jisuanji yingyong yanjiu · 2011
Segmentation of touching and kerned characters has been the most difficult problem in character segmentation.This paper presented a novel approach based on exploiting non-linear partitioning paths to segment touching and kerned characters.Firstly,employed character projection to isolate touching and kerned characters with other characters.Then in order to find the correct non-linear segmentation path of touching and kerned characters,used a heuristic method seeking minimal-penalty curved cut to determine candidate paths from all possible segmentation paths to remove redundant paths and reduce the computational cost.Some characters might be segmented into several regions in above process.So evoked a merging procedure to combine some neighboring regions that belong to a single character.Experimental results demonstrate that our algorithm is robust in segmenting touching and kerned characters with respect to different orientation and language.