Steinherz Tal, Doermann David, Rivlin Ehud, Intrator Nathan
Department of Computer Science, Tel-Aviv University, Tel-Aviv, Israel.
IEEE Trans Pattern Anal Mach Intell. 2009 Feb;31(2):193-209. doi: 10.1109/TPAMI.2008.68.
Resolution of different types of loops in handwritten script presents a difficult task and is an important step in many classic word recognition systems, writer modeling, and signature verification. When processing a handwritten script, a great deal of ambiguity occurs when strokes overlap, merge, or intersect. This paper presents a novel loop modeling and contour-based handwriting analysis that improves loop investigation. We show excellent results on various loop resolution scenarios, including axial loop understanding and collapsed loop recovery. We demonstrate our approach for loop investigation on several realistic data sets of static binary images and compare with the ground truth of the genuine online signal.
解决手写体中不同类型的环是一项艰巨的任务，并且是许多经典文字识别系统、书写者建模和签名验证中的重要步骤。在处理手写体时，当笔画重叠、合并或相交时会出现大量的模糊性。本文提出了一种新颖的环建模和基于轮廓的笔迹分析方法，该方法改进了环的研究。我们在各种环分辨率场景中展示了出色的结果，包括轴向环理解和折叠环恢复。我们在几个静态二值图像的实际数据集上展示了我们的环研究方法，并与真实在线信号的地面真值进行了比较。
