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 条
  • [31] Study on the K-shortest Paths Searching Algorithm of Urban Mass Transit Network Based on the Network Characteristics
    Zhou, Weiteng
    Han, Baoming
    Yin, Haodong
    ADVANCES IN TRANSPORTATION, PTS 1 AND 2, 2014, 505-506 : 689 - 697
  • [32] COMPARISON OF K-SHORTEST PATHS AND MAXIMUM FLOW ROUTING FOR NETWORK FACILITY RESTORATION
    DUNN, DA
    GROVER, WD
    MACGREGOR, MH
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1994, 12 (01) : 88 - 99
  • [33] Satellite Multi-vehicle Tracking under Inconsistent Detection Conditions by Bilevel K-shortest Paths Optimization
    Zhang, Junpeng
    Jia, Xiuping
    Hu, Jiankun
    Tan, Kun
    2018 INTERNATIONAL CONFERENCE ON DIGITAL IMAGE COMPUTING: TECHNIQUES AND APPLICATIONS (DICTA), 2018, : 801 - 808
  • [34] Restoration performance study of k-shortest disjoint paths in WDM optical networks
    Sungwoo Tak
    E. K. Park
    Telecommunication Systems, 2007, 34 : 13 - 26
  • [35] Constrained K-shortest paths algorithm within dynamic restricted searching area
    Yu, De-Xin
    Yang, Zhao-Sheng
    Gao, Peng
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2009, 39 (SUPPL. 2): : 172 - 176
  • [36] Shortest paths in an arrangement with k line orientations
    Eppstein, D
    Hart, DW
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 310 - 316
  • [37] A single source k-shortest paths algorithm to infer regulatory pathways in a gene network
    Shih, Yu-Keng
    Parthasarathy, Srinivasan
    BIOINFORMATICS, 2012, 28 (12) : I49 - I58
  • [38] A new solution to the K-shortest paths problem and its application in wavelength routed optical networks
    Li, Junjie
    Zhang, Hanyi
    PHOTONIC NETWORK COMMUNICATIONS, 2006, 12 (03) : 269 - 284
  • [39] K-shortest paths Q-routing: A new QoS routing algorithm in telecommunication networks
    Hoceini, S
    Mellouk, A
    Amirat, Y
    NETWORKING - ICN 2005, PT 2, 2005, 3421 : 164 - 172
  • [40] A new solution to the K-shortest paths problem and its application in wavelength routed optical networks
    Junjie Li
    Hanyi Zhang
    Photonic Network Communications, 2006, 12 : 269 - 284