Text Line Extraction based on Integrated K-shortest Paths Optimization

被引:0
|
作者
Wang, Liuan [1 ]
Sun, Jun [1 ]
Uchida, Seiichi [2 ]
机构
[1] Fujitsu R&D Ctr CO LTD, Beijing, Peoples R China
[2] Kyushu Univ, Fukuoka, Fukuoka, Japan
关键词
text line extraction; directed graph transformation; integrated k-shortest paths optimization; IMAGES;
D O I
10.1109/DAS.2018.68
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Text in images can be utilized in many image understanding applications due to the exact semantic information. In this paper, we propose a novel integrated k-shortest paths optimization based text line extraction method. Firstly, the candidate text components are extracted by the Maximal Stable Extremal Region (MSER) algorithm on gray, red, green and blue channels. Secondly, one integrated directed graph on red, green, and blue channels are constructed upon the candidate text components, which can effectively incorporate different channels into one framework. Then, the integrated directed graph is transformed guided by the extracted text lines in gray channel to reduced the computational complexity. Finally, we use the k-shortest paths optimization algorithm to extract the text lines by taking advantage of the particular structure of the integrated directed graph. Experimental results demonstrate the effectiveness of the proposed method in comparison with state-of-the-art methods.
引用
收藏
页码:85 / 90
页数:6
相关论文
共 50 条
  • [1] Globally Optimal Text Line Extraction based on K-Shortest Paths algorithm
    Wang, Liuan
    Fan, Wei
    Sun, Jun
    Uchida, Seiichi
    PROCEEDINGS OF 12TH IAPR WORKSHOP ON DOCUMENT ANALYSIS SYSTEMS, (DAS 2016), 2016, : 335 - 339
  • [2] Multiple Object Tracking Using K-Shortest Paths Optimization
    Berclaz, Jerome
    Fleuret, Francois
    Tueretken, Engin
    Fua, Pascal
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (09) : 1806 - 1819
  • [3] ROUTE ASSIGNMENT BASED ON K-SHORTEST PATHS PROBLEM
    Majer, Tomas
    QUANTITATIVE METHODS IN ECONOMICS [MULTIPLE CRITERIA DECISION MAKING XV], 2010, : 117 - 126
  • [4] A Note on k-Shortest Paths Problem
    Gravin, Nick
    Chen, Ning
    JOURNAL OF GRAPH THEORY, 2011, 67 (01) : 34 - 37
  • [5] Near-shortest and K-shortest simple paths
    Carlyle, WM
    Wood, RK
    NETWORKS, 2005, 46 (02) : 98 - 109
  • [6] Finding All Hops k-shortest Paths
    Cheng, G
    Ansari, N
    2003 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS, AND SIGNAL PROCESSING, VOLS 1 AND 2, CONFERENCE PROCEEDINGS, 2003, : 474 - 477
  • [7] Finding k-shortest paths with limited overlap
    Chondrogiannis, Theodoros
    Bouros, Panagiotis
    Gamper, Johann
    Leser, Ulf
    Blumenthal, David B.
    VLDB JOURNAL, 2020, 29 (05): : 1023 - 1047
  • [8] IMPLEMENTATION OF ALGORITHMS FOR K-SHORTEST LOOPLESS PATHS
    PERKO, A
    NETWORKS, 1986, 16 (02) : 149 - 160
  • [9] DNA implementation of k-shortest paths computation
    Ibrahim, Z
    Tsuboi, Y
    Muhammad, MS
    Ono, O
    Khalid, M
    2005 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-3, PROCEEDINGS, 2005, : 707 - 713
  • [10] Finding k-shortest paths with limited overlap
    Theodoros Chondrogiannis
    Panagiotis Bouros
    Johann Gamper
    Ulf Leser
    David B. Blumenthal
    The VLDB Journal, 2020, 29 : 1023 - 1047