Min-cut segmentation of cursive handwriting in tabular documents

被引:0
|
作者
Davis, Brian L. [1 ]
Barrett, William A. [1 ]
Swingle, Scott D. [1 ]
机构
[1] Brigham Young Univ, Dept Comp Sci, Provo, UT 84602 USA
来源
关键词
handwriting segmentation; tabular; cursive handwriting; line segmentation; word segmentation; graph cut; min cut; max flow; overlap; 3D;
D O I
10.1117/12.2076228
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Handwritten tabular documents, such as census, birth, death and marriage records, contain a wealth of information vital to genealogical and related research. Much work has been done in segmenting freeform handwriting, however, segmentation of cursive handwriting in tabular documents is still an unsolved problem. Tabular documents present unique segmentation challenges caused by handwriting overlapping cell-boundaries and other words, both horizontally and vertically, as "ascenders" and "descenders" overlap into adjacent cells. This paper presents a method for segmenting handwriting in tabular documents using a min-cut/max-flow algorithm on a graph formed from a distance map and connected components of handwriting. Specifically, we focus on line, word and first letter segmentation. Additionally, we include the angles of strokes of the handwriting as a third dimension to our graph to enable the resulting segments to share pixels of overlapping letters. Word segmentation accuracy is 89.5% evaluating lines of the data set used in the ICDAR2013 Handwriting Segmentation Contest. Accuracy is 92.6% for a specific application of segmenting first and last names from noisy census records. Accuracy for segmenting lines of names from from noisy census records is 80.7%. The 3D graph cutting shows promise in segmenting overlapping letters, although highly convoluted or overlapping handwriting remains an ongoing challenge.
引用
下载
收藏
页数:12
相关论文
共 50 条
  • [1] Min-Cut Segmentation of Retinal OCT Images
    Dodo, Bashir Isa
    Li, Yongmin
    Eltayef, Khalid
    Liu, Xiaohui
    BIOMEDICAL ENGINEERING SYSTEMS AND TECHNOLOGIES, BIOSTEC 2018, 2019, 1024 : 86 - 99
  • [2] Min-cut floorplacement
    Roy, Jarrod A.
    Adya, Saurabh N.
    Papa, David A.
    Markov, Igor L.
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2006, 25 (07) : 1313 - 1326
  • [3] MIN-CUT CLUSTERING
    JOHNSON, EL
    MEHROTRA, A
    NEMHAUSER, GL
    MATHEMATICAL PROGRAMMING, 1993, 62 (01) : 133 - 151
  • [4] Tracking and segmentation using min-cut with consecutive shape priors
    Wang J.
    Yagi Y.
    Paladyn, 2010, 1 (01): : 73 - 79
  • [5] MIN-CUT BASED SEGMENTATION OF AIRBORNE LIDAR POINT CLOUDS
    Ural, Serkan
    Shan, Jie
    XXII ISPRS CONGRESS, TECHNICAL COMMISSION III, 2012, 39-B3 : 167 - 172
  • [6] Small min-cut polyhedra
    Alevras, D
    MATHEMATICS OF OPERATIONS RESEARCH, 1999, 24 (01) : 35 - 49
  • [7] A simple min-cut algorithm
    Stoer, M
    Wagner, F
    JOURNAL OF THE ACM, 1997, 44 (04) : 585 - 591
  • [8] Dead-end elimination as a heuristic for min-cut image segmentation
    Radhakrishnan, Mala L.
    Su, Sara L.
    2006 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, ICIP 2006, PROCEEDINGS, 2006, : 2429 - +
  • [9] A Multigrid Algorithm for Maxflow and Min-Cut Problems with Applications to Multiphase Image Segmentation
    Xue-Cheng Tai
    Liang-Jian Deng
    Ke Yin
    Journal of Scientific Computing, 2021, 87
  • [10] A Multigrid Algorithm for Maxflow and Min-Cut Problems with Applications to Multiphase Image Segmentation
    Tai, Xue-Cheng
    Deng, Liang-Jian
    Yin, Ke
    JOURNAL OF SCIENTIFIC COMPUTING, 2021, 87 (03)