Non-linear partitioning path based approach for touching and kerned character segmentation
基于折线切分路径的粘连搭接字符切分算法的研究

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 ca...