para_split.py 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485
  1. from sklearn.cluster import DBSCAN
  2. import numpy as np
  3. from loguru import logger
  4. from magic_pdf.libs.boxbase import _is_in_or_part_overlap_with_area_ratio as is_in_layout
  5. from magic_pdf.libs.ocr_content_type import ContentType
  6. LINE_STOP_FLAG = ['.', '!', '?', '。', '!', '?',":", ":", ")", ")", ";"]
  7. INLINE_EQUATION = ContentType.InlineEquation
  8. INTERLINE_EQUATION = ContentType.InterlineEquation
  9. TEXT = "text"
  10. def __get_span_text(span):
  11. c = span.get('content', '')
  12. if len(c)==0:
  13. c = span.get('image_path', '')
  14. return c
  15. def __detect_list_lines(lines, new_layout_bboxes, lang='en'):
  16. """
  17. 探测是否包含了列表,并且把列表的行分开.
  18. 这样的段落特点是,顶格字母大写/数字,紧跟着几行缩进的。缩进的行首字母含小写的。
  19. """
  20. def find_repeating_patterns(lst):
  21. indices = []
  22. ones_indices = []
  23. i = 0
  24. while i < len(lst) - 1: # 确保余下元素至少有2个
  25. if lst[i] == 1 and lst[i+1] in [2, 3]: # 额外检查以防止连续出现的1
  26. start = i
  27. ones_in_this_interval = [i]
  28. i += 1
  29. while i < len(lst) and lst[i] in [2, 3]:
  30. i += 1
  31. # 验证下一个序列是否符合条件
  32. if i < len(lst) - 1 and lst[i] == 1 and lst[i+1] in [2, 3] and lst[i-1] in [2, 3]:
  33. while i < len(lst) and lst[i] in [1, 2, 3]:
  34. if lst[i] == 1:
  35. ones_in_this_interval.append(i)
  36. i += 1
  37. indices.append((start, i - 1))
  38. ones_indices.append(ones_in_this_interval)
  39. else:
  40. i += 1
  41. else:
  42. i += 1
  43. return indices, ones_indices
  44. """===================="""
  45. def split_indices(slen, index_array):
  46. result = []
  47. last_end = 0
  48. for start, end in sorted(index_array):
  49. if start > last_end:
  50. # 前一个区间结束到下一个区间开始之间的部分标记为"text"
  51. result.append(('text', last_end, start - 1))
  52. # 区间内标记为"list"
  53. result.append(('list', start, end))
  54. last_end = end + 1
  55. if last_end < slen:
  56. # 如果最后一个区间结束后还有剩余的字符串,将其标记为"text"
  57. result.append(('text', last_end, slen - 1))
  58. return result
  59. """===================="""
  60. if lang!='en':
  61. return lines, None
  62. else:
  63. total_lines = len(lines)
  64. line_fea_encode = []
  65. """
  66. 对每一行进行特征编码,编码规则如下:
  67. 1. 如果行顶格,且大写字母开头或者数字开头,编码为1
  68. 2. 如果顶格,其他非大写开头编码为4
  69. 3. 如果非顶格,首字符大写,编码为2
  70. 4. 如果非顶格,首字符非大写编码为3
  71. """
  72. for l in lines:
  73. first_char = __get_span_text(l['spans'][0])[0]
  74. layout_left = __find_layout_bbox_by_line(l['bbox'], new_layout_bboxes)[0]
  75. if l['bbox'][0] == layout_left:
  76. if first_char.isupper() or first_char.isdigit():
  77. line_fea_encode.append(1)
  78. else:
  79. line_fea_encode.append(4)
  80. else:
  81. if first_char.isupper():
  82. line_fea_encode.append(2)
  83. else:
  84. line_fea_encode.append(3)
  85. # 然后根据编码进行分段, 选出来 1,2,3连续出现至少2次的行,认为是列表。
  86. list_indice, list_start_idx = find_repeating_patterns(line_fea_encode)
  87. if len(list_indice)>0:
  88. logger.info(f"发现了列表,列表行数:{list_indice}, {list_start_idx}")
  89. # TODO check一下这个特列表里缩进的行左侧是不是对齐的。
  90. segments = []
  91. for start, end in list_indice:
  92. for i in range(start, end+1):
  93. if i>0:
  94. if line_fea_encode[i] == 4:
  95. logger.info(f"列表行的第{i}行不是顶格的")
  96. break
  97. else:
  98. logger.info(f"列表行的第{start}到第{end}行是列表")
  99. return split_indices(total_lines, list_indice), list_start_idx
  100. def __valign_lines(blocks, layout_bboxes):
  101. """
  102. 在一个layoutbox内对齐行的左侧和右侧。
  103. 扫描行的左侧和右侧,如果x0, x1差距不超过一个阈值,就强行对齐到所处layout的左右两侧(和layout有一段距离)。
  104. 3是个经验值,TODO,计算得来,可以设置为1.5个正文字符。
  105. """
  106. min_distance = 3
  107. min_sample = 2
  108. new_layout_bboxes = []
  109. for layout_box in layout_bboxes:
  110. blocks_in_layoutbox = [b for b in blocks if is_in_layout(b['bbox'], layout_box['layout_bbox'])]
  111. if len(blocks_in_layoutbox)==0:
  112. continue
  113. x0_lst = np.array([[line['bbox'][0], 0] for block in blocks_in_layoutbox for line in block['lines']])
  114. x1_lst = np.array([[line['bbox'][2], 0] for block in blocks_in_layoutbox for line in block['lines']])
  115. x0_clusters = DBSCAN(eps=min_distance, min_samples=min_sample).fit(x0_lst)
  116. x1_clusters = DBSCAN(eps=min_distance, min_samples=min_sample).fit(x1_lst)
  117. x0_uniq_label = np.unique(x0_clusters.labels_)
  118. x1_uniq_label = np.unique(x1_clusters.labels_)
  119. x0_2_new_val = {} # 存储旧值对应的新值映射
  120. x1_2_new_val = {}
  121. for label in x0_uniq_label:
  122. if label==-1:
  123. continue
  124. x0_index_of_label = np.where(x0_clusters.labels_==label)
  125. x0_raw_val = x0_lst[x0_index_of_label][:,0]
  126. x0_new_val = np.min(x0_lst[x0_index_of_label][:,0])
  127. x0_2_new_val.update({idx: x0_new_val for idx in x0_raw_val})
  128. for label in x1_uniq_label:
  129. if label==-1:
  130. continue
  131. x1_index_of_label = np.where(x1_clusters.labels_==label)
  132. x1_raw_val = x1_lst[x1_index_of_label][:,0]
  133. x1_new_val = np.max(x1_lst[x1_index_of_label][:,0])
  134. x1_2_new_val.update({idx: x1_new_val for idx in x1_raw_val})
  135. for block in blocks_in_layoutbox:
  136. for line in block['lines']:
  137. x0, x1 = line['bbox'][0], line['bbox'][2]
  138. if x0 in x0_2_new_val:
  139. line['bbox'][0] = int(x0_2_new_val[x0])
  140. if x1 in x1_2_new_val:
  141. line['bbox'][2] = int(x1_2_new_val[x1])
  142. # 其余对不齐的保持不动
  143. # 由于修改了block里的line长度,现在需要重新计算block的bbox
  144. for block in blocks_in_layoutbox:
  145. block['bbox'] = [min([line['bbox'][0] for line in block['lines']]),
  146. min([line['bbox'][1] for line in block['lines']]),
  147. max([line['bbox'][2] for line in block['lines']]),
  148. max([line['bbox'][3] for line in block['lines']])]
  149. """新计算layout的bbox,因为block的bbox变了。"""
  150. layout_x0 = min([block['bbox'][0] for block in blocks_in_layoutbox])
  151. layout_y0 = min([block['bbox'][1] for block in blocks_in_layoutbox])
  152. layout_x1 = max([block['bbox'][2] for block in blocks_in_layoutbox])
  153. layout_y1 = max([block['bbox'][3] for block in blocks_in_layoutbox])
  154. new_layout_bboxes.append([layout_x0, layout_y0, layout_x1, layout_y1])
  155. return new_layout_bboxes
  156. def __common_pre_proc(blocks, layout_bboxes):
  157. """
  158. 不分语言的,对文本进行预处理
  159. """
  160. #__add_line_period(blocks, layout_bboxes)
  161. aligned_layout_bboxes = __valign_lines(blocks, layout_bboxes)
  162. return aligned_layout_bboxes
  163. def __pre_proc_zh_blocks(blocks, layout_bboxes):
  164. """
  165. 对中文文本进行分段预处理
  166. """
  167. pass
  168. def __pre_proc_en_blocks(blocks, layout_bboxes):
  169. """
  170. 对英文文本进行分段预处理
  171. """
  172. pass
  173. def __group_line_by_layout(blocks, layout_bboxes, lang="en"):
  174. """
  175. 每个layout内的行进行聚合
  176. """
  177. # 因为只是一个block一行目前, 一个block就是一个段落
  178. lines_group = []
  179. for lyout in layout_bboxes:
  180. lines = [line for block in blocks if is_in_layout(block['bbox'], lyout['layout_bbox']) for line in block['lines']]
  181. lines_group.append(lines)
  182. return lines_group
  183. def __split_para_in_layoutbox(lines_group, new_layout_bbox, lang="en", char_avg_len=10):
  184. """
  185. lines_group 进行行分段——layout内部进行分段。lines_group内每个元素是一个Layoutbox内的所有行。
  186. 1. 先计算每个group的左右边界。
  187. 2. 然后根据行末尾特征进行分段。
  188. 末尾特征:以句号等结束符结尾。并且距离右侧边界有一定距离。
  189. 且下一行开头不留空白。
  190. """
  191. list_info = [] # 这个layout最后是不是列表,记录每一个layout里是不是列表开头,列表结尾
  192. layout_paras = []
  193. right_tail_distance = 1.5 * char_avg_len
  194. for lines in lines_group:
  195. paras = []
  196. total_lines = len(lines)
  197. if total_lines==0:
  198. continue # 0行无需处理
  199. if total_lines==1: # 1行无法分段。
  200. layout_paras.append([lines])
  201. list_info.append([False, False])
  202. continue
  203. """在进入到真正的分段之前,要对文字块从统计维度进行对齐方式的探测,
  204. 对齐方式分为以下:
  205. 1. 左对齐的文本块(特点是左侧顶格,或者左侧不顶格但是右侧顶格的行数大于非顶格的行数,顶格的首字母有大写也有小写)
  206. 1) 右侧对齐的行,单独成一段
  207. 2) 中间对齐的行,按照字体/行高聚合成一段
  208. 2. 左对齐的列表块(其特点是左侧顶格的行数小于等于非顶格的行数,非定格首字母会有小写,顶格90%是大写。并且左侧顶格行数大于1,大于1是为了这种模式连续出现才能称之为列表)
  209. 这样的文本块,顶格的为一个段落开头,紧随其后非顶格的行属于这个段落。
  210. """
  211. text_segments, list_start_line = __detect_list_lines(lines, new_layout_bbox, lang)
  212. """根据list_range,把lines分成几个部分
  213. """
  214. layout_right = __find_layout_bbox_by_line(lines[0]['bbox'], new_layout_bbox)[2]
  215. layout_left = __find_layout_bbox_by_line(lines[0]['bbox'], new_layout_bbox)[0]
  216. para = [] # 元素是line
  217. layout_list_info = [False, False] # 这个layout最后是不是列表,记录每一个layout里是不是列表开头,列表结尾
  218. for content_type, start, end in text_segments:
  219. if content_type == 'list':
  220. for i, line in enumerate(lines[start:end+1]):
  221. line_x0 = line['bbox'][0]
  222. if line_x0 == layout_left: # 列表开头
  223. if len(para)>0:
  224. paras.append(para)
  225. para = []
  226. para.append(line)
  227. else:
  228. para.append(line)
  229. if len(para)>0:
  230. paras.append(para)
  231. para = []
  232. if start==0:
  233. layout_list_info[0] = True
  234. if end==total_lines-1:
  235. layout_list_info[1] = True
  236. else:
  237. for i, line in enumerate(lines[start:end+1]):
  238. # 如果i有下一行,那么就要根据下一行位置综合判断是否要分段。如果i之后没有行,那么只需要判断一下行结尾特征。
  239. cur_line_type = line['spans'][-1]['type']
  240. next_line = lines[i+1] if i<total_lines-1 else None
  241. if cur_line_type in [TEXT, INLINE_EQUATION]:
  242. if line['bbox'][2] < layout_right - right_tail_distance:
  243. para.append(line)
  244. paras.append(para)
  245. para = []
  246. elif line['bbox'][2] >= layout_right - right_tail_distance and next_line and next_line['bbox'][0] == layout_left: # 现在这行到了行尾沾满,下一行存在且顶格。
  247. para.append(line)
  248. else:
  249. para.append(line)
  250. paras.append(para)
  251. para = []
  252. else: # 其他,图片、表格、行间公式,各自占一段
  253. if len(para)>0: # 先把之前的段落加入到结果中
  254. paras.append(para)
  255. para = []
  256. paras.append([line]) # 再把当前行加入到结果中。当前行为行间公式、图、表等。
  257. para = []
  258. if len(para)>0:
  259. paras.append(para)
  260. para = []
  261. list_info.append(layout_list_info)
  262. layout_paras.append(paras)
  263. paras = []
  264. return layout_paras, list_info
  265. def __connect_list_inter_layout(layout_paras, new_layout_bbox, layout_list_info, page_num, lang="en"):
  266. """
  267. 如果上个layout的最后一个段落是列表,下一个layout的第一个段落也是列表,那么将他们连接起来。
  268. 根据layout_list_info判断是不是列表。,下个layout的第一个段如果不是列表,那么看他们是否有几行都有相同的缩进。
  269. """
  270. for i in range(1, len(layout_paras)):
  271. pre_layout_list_info = layout_list_info[i-1]
  272. next_layout_list_info = layout_list_info[i]
  273. pre_last_para = layout_paras[i-1][-1]
  274. next_paras = layout_paras[i]
  275. next_first_para = next_paras[0]
  276. if pre_layout_list_info[1] and not next_layout_list_info[0]: # 前一个是列表结尾,后一个是非列表开头,此时检测是否有相同的缩进
  277. logger.info(f"连接page {page_num} 内的list")
  278. # 向layout_paras[i] 寻找开头具有相同缩进的连续的行
  279. may_list_lines = []
  280. for j in range(len(next_paras)):
  281. line = next_paras[j]
  282. if len(line)==1: # 只可能是一行,多行情况再需要分析了
  283. if line[0]['bbox'][0] > __find_layout_bbox_by_line(line[0]['bbox'], new_layout_bbox)[0]:
  284. may_list_lines.append(line[0])
  285. else:
  286. break
  287. else:
  288. break
  289. # 如果这些行的缩进是相等的,那么连到上一个layout的最后一个段落上。
  290. if len(may_list_lines)>0 and len(set([x['bbox'][0] for x in may_list_lines]))==1:
  291. pre_last_para.extend(may_list_lines)
  292. layout_paras[i] = layout_paras[i][len(may_list_lines):]
  293. return layout_paras
  294. def __find_layout_bbox_by_line(line_bbox, layout_bboxes):
  295. """
  296. 根据line找到所在的layout
  297. """
  298. for layout in layout_bboxes:
  299. if is_in_layout(line_bbox, layout):
  300. return layout
  301. return None
  302. def __connect_para_inter_layoutbox(layout_paras, new_layout_bbox, lang="en"):
  303. """
  304. layout之间进行分段。
  305. 主要是计算前一个layOut的最后一行和后一个layout的第一行是否可以连接。
  306. 连接的条件需要同时满足:
  307. 1. 上一个layout的最后一行沾满整个行。并且没有结尾符号。
  308. 2. 下一行开头不留空白。
  309. """
  310. connected_layout_paras = []
  311. connected_layout_paras.append(layout_paras[0])
  312. for i in range(1, len(layout_paras)):
  313. pre_last_line = layout_paras[i-1][-1][-1]
  314. next_first_line = layout_paras[i][0][0]
  315. pre_last_line_text = ''.join([__get_span_text(span) for span in pre_last_line['spans']])
  316. pre_last_line_type = pre_last_line['spans'][-1]['type']
  317. next_first_line_text = ''.join([__get_span_text(span) for span in next_first_line['spans']])
  318. next_first_line_type = next_first_line['spans'][0]['type']
  319. if pre_last_line_type not in [TEXT, INLINE_EQUATION] or next_first_line_type not in [TEXT, INLINE_EQUATION]:
  320. connected_layout_paras.append(layout_paras[i])
  321. continue
  322. pre_x2_max = __find_layout_bbox_by_line(pre_last_line['bbox'], new_layout_bbox)[2]
  323. next_x0_min = __find_layout_bbox_by_line(next_first_line['bbox'], new_layout_bbox)[0]
  324. pre_last_line_text = pre_last_line_text.strip()
  325. next_first_line_text = next_first_line_text.strip()
  326. if pre_last_line['bbox'][2] == pre_x2_max and pre_last_line_text[-1] not in LINE_STOP_FLAG and next_first_line['bbox'][0]==next_x0_min: # 前面一行沾满了整个行,并且没有结尾符号.下一行没有空白开头。
  327. """连接段落条件成立,将前一个layout的段落和后一个layout的段落连接。"""
  328. connected_layout_paras[-1][-1].extend(layout_paras[i][0])
  329. layout_paras[i].pop(0) # 删除后一个layout的第一个段落, 因为他已经被合并到前一个layout的最后一个段落了。
  330. if len(layout_paras[i])==0:
  331. layout_paras.pop(i)
  332. else:
  333. connected_layout_paras.append(layout_paras[i])
  334. else:
  335. """连接段落条件不成立,将前一个layout的段落加入到结果中。"""
  336. connected_layout_paras.append(layout_paras[i])
  337. return connected_layout_paras
  338. def __connect_para_inter_page(pre_page_paras, next_page_paras, pre_page_layout_bbox, next_page_layout_bbox, lang):
  339. """
  340. 连接起来相邻两个页面的段落——前一个页面最后一个段落和后一个页面的第一个段落。
  341. 是否可以连接的条件:
  342. 1. 前一个页面的最后一个段落最后一行沾满整个行。并且没有结尾符号。
  343. 2. 后一个页面的第一个段落第一行没有空白开头。
  344. """
  345. # 有的页面可能压根没有文字
  346. if len(pre_page_paras)==0 or len(next_page_paras)==0:
  347. return False
  348. pre_last_para = pre_page_paras[-1][-1]
  349. next_first_para = next_page_paras[0][0]
  350. pre_last_line = pre_last_para[-1]
  351. next_first_line = next_first_para[0]
  352. pre_last_line_text = ''.join([__get_span_text(span) for span in pre_last_line['spans']])
  353. pre_last_line_type = pre_last_line['spans'][-1]['type']
  354. next_first_line_text = ''.join([__get_span_text(span) for span in next_first_line['spans']])
  355. next_first_line_type = next_first_line['spans'][0]['type']
  356. if pre_last_line_type not in [TEXT, INLINE_EQUATION] or next_first_line_type not in [TEXT, INLINE_EQUATION]: # TODO,真的要做好,要考虑跨table, image, 行间的情况
  357. # 不是文本,不连接
  358. return False
  359. pre_x2_max = __find_layout_bbox_by_line(pre_last_line['bbox'], pre_page_layout_bbox)[2]
  360. next_x0_min = __find_layout_bbox_by_line(next_first_line['bbox'], next_page_layout_bbox)[0]
  361. pre_last_line_text = pre_last_line_text.strip()
  362. next_first_line_text = next_first_line_text.strip()
  363. if pre_last_line['bbox'][2] == pre_x2_max and pre_last_line_text[-1] not in LINE_STOP_FLAG and next_first_line['bbox'][0]==next_x0_min: # 前面一行沾满了整个行,并且没有结尾符号.下一行没有空白开头。
  364. """连接段落条件成立,将前一个layout的段落和后一个layout的段落连接。"""
  365. pre_last_para.extend(next_first_para)
  366. next_page_paras[0].pop(0) # 删除后一个页面的第一个段落, 因为他已经被合并到前一个页面的最后一个段落了。
  367. return True
  368. else:
  369. return False
  370. def __do_split(blocks, layout_bboxes, new_layout_bbox, page_num, lang="en"):
  371. """
  372. 根据line和layout情况进行分段
  373. 先实现一个根据行末尾特征分段的简单方法。
  374. """
  375. """
  376. 算法思路:
  377. 1. 扫描layout里每一行,找出来行尾距离layout有边界有一定距离的行。
  378. 2. 从上述行中找到末尾是句号等可作为断行标志的行。
  379. 3. 参照上述行尾特征进行分段。
  380. 4. 图、表,目前独占一行,不考虑分段。
  381. """
  382. lines_group = __group_line_by_layout(blocks, layout_bboxes, lang) # block内分段
  383. layout_paras, layout_list_info = __split_para_in_layoutbox(lines_group, new_layout_bbox, lang) # layout内分段
  384. layout_paras2 = __connect_list_inter_layout(layout_paras, new_layout_bbox, layout_list_info, page_num, lang) # layout之间连接列表段落
  385. connected_layout_paras = __connect_para_inter_layoutbox(layout_paras2, new_layout_bbox, lang) # layout间链接段落
  386. return connected_layout_paras
  387. def para_split(pdf_info_dict, lang="en"):
  388. """
  389. 根据line和layout情况进行分段
  390. """
  391. new_layout_of_pages = [] # 数组的数组,每个元素是一个页面的layoutS
  392. for page_num, page in pdf_info_dict.items():
  393. blocks = page['preproc_blocks']
  394. layout_bboxes = page['layout_bboxes']
  395. new_layout_bbox = __common_pre_proc(blocks, layout_bboxes)
  396. new_layout_of_pages.append(new_layout_bbox)
  397. splited_blocks = __do_split(blocks, layout_bboxes, new_layout_bbox, page_num, lang)
  398. page['para_blocks'] = splited_blocks
  399. """连接页面与页面之间的可能合并的段落"""
  400. pdf_infos = list(pdf_info_dict.values())
  401. for i, page in enumerate(pdf_info_dict.values()):
  402. if i==0:
  403. continue
  404. pre_page_paras = pdf_infos[i-1]['para_blocks']
  405. next_page_paras = pdf_infos[i]['para_blocks']
  406. pre_page_layout_bbox = new_layout_of_pages[i-1]
  407. next_page_layout_bbox = new_layout_of_pages[i]
  408. is_conn= __connect_para_inter_page(pre_page_paras, next_page_paras, pre_page_layout_bbox, next_page_layout_bbox, lang)
  409. if is_conn:
  410. logger.info(f"连接了第{i-1}页和第{i}页的段落")