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 条
  • [41] Optimizing Multi-criteria k-Shortest Paths in Graph by a Natural Routing genotype-based Genetic Algorithm
    Wang, Yang
    Liu, Qing
    Ren, Haipeng
    Ma, Xuan
    Liu, Long
    Wang, Wenqing
    Zhang, Jing
    PROCEEDINGS OF THE 2018 13TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA 2018), 2018, : 341 - 345
  • [42] Performance optimization of intelligent optical networks by multiple alternate routes based on the K-shortest path algorithm
    Cu, Xinyou
    Zheng, Xiaoping
    Zhang, Hanyi
    Li, Yanhe
    Guo, Yili
    NETWORK ARCHITECTURES, MANAGEMENT, AND APPLICATIONS IV, 2006, 6354
  • [43] Efficient algorithm for finding k shortest paths based on re optimization technique
    Chen, Bi Yu
    Chen, Xiao-Wei
    Chen, Hui-Ping
    Lam, William H. K.
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2020, 133
  • [44] Intelligent Optimization Approach for the k Shortest Paths Problem Based on Genetic Algorithm
    Wang, Feng
    Man, Yuan
    Man, Lichun
    2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 219 - 224
  • [45] Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths
    Dinitz, Yefim
    Dolev, Shlomi
    Kumar, Manish
    CYBER SECURITY CRYPTOGRAPHY AND MACHINE LEARNING, 2021, 12716 : 266 - 274
  • [46] Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly
    Ibrahim, Zuwairie
    Tsuboi, Yusei
    Ono, Osamu
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2006, 2 (01): : 265 - 271
  • [47] Virtual network construction with K-shortest path algorithm and optimization problems for robust physical networks
    Urayama, Yasuhiro
    Tachibana, Takuji
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2017, 30 (01)
  • [48] Finding the k Shortest Paths for Co-Evolutionary Path Optimization
    Hu, Xiao-Bing
    Zhou, Jun
    Li, Hang
    Zhang, Ming-Kong
    Liao, Jian-Qin
    2018 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI), 2018, : 1906 - 1912
  • [49] Security access control method of heterogeneous database based on K-shortest path algorithm
    Zhou W.
    Yao M.
    International Journal of Reasoning-based Intelligent Systems, 2024, 16 (02) : 170 - 177
  • [50] A Modified K-Shortest Paths Algorithm for Solving the Earliest Arrival Problem on the Time-Dependent Model of Transportation Systems
    Yang, Yang
    Wang, Shuai
    Hu, Xiaolin
    Li, Jianmin
    Xu, Bingji
    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTIST, IMECS 2012, VOL II, 2012, : 1562 - 1567