paper-with-me

홈 › Papers

Tablext: A Combined Neural Network And Heuristic Based Table Extractor

2021-04-22 · Zach Colter, Morteza Fayazi, Zineb Benameur-El, Serafina Kamp, Shuyan Yu, Ronald Dreslinski

A significant portion of the data available today is found within tables. Therefore, it is necessary to use automated table extraction to obtain thorough results when data-mining. Today's popular state-of-the-art methods for table extraction struggle to adequately extract tables with machine-readable text and structural data. To make matters worse, many tables do not have machine-readable data, such as tables saved as images, making most extraction methods completely ineffective. In order to address these issues, a novel, general format table extractor tool, Tablext, is proposed. This tool uses a combination of computer vision techniques and machine learning methods to efficiently and effectively identify and extract data from tables. Tablext begins by using a custom Convolutional Neural Network (CNN) to identify and separate all potential tables. The identification process is optimized by combining the custom CNN with the YOLO object detection network. Then, the high-level structure of each table is identified with computer vision methods. This high-level, structural meta-data is used by another CNN to identify exact cell locations. As a final step, Optical Characters Recognition (OCR) is performed on every individual cell to extract their content without needing machine-readable text. This multi-stage algorithm allows for the neural networks to focus on completing complex tasks, while letting image processing methods efficiently complete the simpler ones. This leads to the proposed approach to be general-purpose enough to handle a large batch of tables regardless of their internal encodings or their layout complexity. Additionally, it becomes accurate enough to outperform competing state-of-the-art table extractors on the ICDAR 2013 table dataset.

📄 PDF Abstract BibTeX arXiv:2104.11287

Code (0)

등록된 구현이 없습니다.

Tasks

object-detectionObject DetectionOptical Character Recognition (OCR)Table Extraction

Methods 이 논문이 사용한 방법론

YOLO 설명 없음

Similar Papers 제목 키워드 기반

Web Content Extraction - a Meta-Analysis of its Past and Thoughts on its Future

2015-08-18 · Weninger Tim, Palacios Rodrigo, Crescenzi Valter, Gottron Thomas 외

In this paper, we present a meta-analysis of several Web content extraction algorithms, and make recommendations for the future of content extraction on the Web. First, we find that nearly all Web content extractors do n…

Feature Engineering

Online Sequential Extreme Learning Machines: Features Combined From Hundreds of Midlayers

2020-06-12 · Chandra Swarathesh Addanki

In this paper, we develop an algorithm called hierarchal online sequential learning algorithm (H-OS-ELM) for single feed feedforward network with features combined from hundreds of midlayers, the algorithm can learn chun…

UNIREX: A Unified Learning Framework for Language Model Rationale Extraction

2021-12-16 · BigScience (ACL) 2022 5 · Aaron Chan, Maziar Sanjabi, Lambert Mathias, Liang Tan 외

An extractive rationale explains a language model's (LM's) prediction on a given task instance by highlighting the text inputs that most influenced the prediction. Ideally, rationale extraction should be faithful (reflec…

Language ModelingLanguage Modellingtext-classificationText Classification

Improve the performance of transfer learning without fine-tuning using dissimilarity-based multi-view learning for breast cancer histology images

2018-03-29 · Hongliu Cao, Simon Bernard, Laurent Heutte, Robert Sabourin

Breast cancer is one of the most common types of cancer and leading cancer-related death causes for women. In the context of ICIAR 2018 Grand Challenge on Breast Cancer Histology Images, we compare one handcrafted featur…

Deep LearningMULTI-VIEW LEARNINGTransfer Learning

Symbiosis of Search and Heuristics for Random 3-SAT

2014-02-18 · Sid Mijnders, Boris de Wilde, Marijn Heule

When combined properly, search techniques can reveal the full potential of sophisticated branching heuristics. We demonstrate this observation on the well-known class of random 3-SAT formulae. First, a new branching heur…