| Home | [111–120] << 121 122 123 124 125 126 127 128 129 130 >> [131–140] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Anjan Dutta; Josep Llados; Horst Bunke; Umapada Pal | ||||
| Title | Product graph-based higher order contextual similarities for inexact subgraph matching | Type | Journal Article | ||
| Year | 2018 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 76 | Issue | Pages | 596-611 | |
| Keywords | |||||
| Abstract | Many algorithms formulate graph matching as an optimization of an objective function of pairwise quantification of nodes and edges of two graphs to be matched. Pairwise measurements usually consider local attributes but disregard contextual information involved in graph structures. We address this issue by proposing contextual similarities between pairs of nodes. This is done by considering the tensor product graph (TPG) of two graphs to be matched, where each node is an ordered pair of nodes of the operand graphs. Contextual similarities between a pair of nodes are computed by accumulating weighted walks (normalized pairwise similarities) terminating at the corresponding paired node in TPG. Once the contextual similarities are obtained, we formulate subgraph matching as a node and edge selection problem in TPG. We use contextual similarities to construct an objective function and optimize it with a linear programming approach. Since random walk formulation through TPG takes into account higher order information, it is not a surprise that we obtain more reliable similarities and better discrimination among the nodes and edges. Experimental results shown on synthetic as well as real benchmarks illustrate that higher order contextual similarities increase discriminating power and allow one to find approximate solutions to the subgraph matching problem. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
Notes  |
DAG; 602.167; 600.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ DLB2018 | Serial | 3083 | ||
| Permanent link to this record | |||||
| Author | Veronica Romero; Alicia Fornes; Enrique Vidal; Joan Andreu Sanchez | ||||
| Title | Information Extraction in Handwritten Marriage Licenses Books Using the MGGI Methodology | Type | Conference Article | ||
| Year | 2017 | Publication | 8th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 10255 | Issue | Pages | 287-294 | |
| Keywords | Handwritten Text Recognition; Information extraction; Language modeling; MGGI; Categories-based language model | ||||
| Abstract | Historical records of daily activities provide intriguing insights into the life of our ancestors, useful for demographic and genealogical research. For example, marriage license books have been used for centuries by ecclesiastical and secular institutions to register marriages. These books follow a simple structure of the text in the records with a evolutionary vocabulary, mainly composed of proper names that change along the time. This distinct vocabulary makes automatic transcription and semantic information extraction difficult tasks. In previous works we studied the use of category-based language models and how a Grammatical Inference technique known as MGGI could improve the accuracy of these tasks. In this work we analyze the main causes of the semantic errors observed in previous results and apply a better implementation of the MGGI technique to solve these problems. Using the resulting language model, transcription and information extraction experiments have been carried out, and the results support our proposed approach. | ||||
| Address | Faro; Portugal; June 2017 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | L.A. Alexandre; J.Salvador Sanchez; Joao M. F. Rodriguez | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-3-319-58837-7 | Medium | ||
| Area | Expedition | Conference | IbPRIA | ||
| Notes |
DAG; 602.006; 600.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RFV2017 | Serial | 2952 | ||
| Permanent link to this record | |||||
| Author | Juan Ignacio Toledo; Alicia Fornes; Jordi Cucurull; Josep Llados | ||||
| Title | Election Tally Sheets Processing System | Type | Conference Article | ||
| Year | 2016 | Publication | 12th IAPR Workshop on Document Analysis Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 364-368 | ||
| Keywords | |||||
| Abstract | In paper based elections, manual tallies at polling station level produce myriads of documents. These documents share a common form-like structure and a reduced vocabulary worldwide. On the other hand, each tally sheet is filled by a different writer and on different countries, different scripts are used. We present a complete document analysis system for electoral tally sheet processing combining state of the art techniques with a new handwriting recognition subprocess based on unsupervised feature discovery with Variational Autoencoders and sequence classification with BLSTM neural networks. The whole system is designed to be script independent and allows a fast and reliable results consolidation process with reduced operational cost. | ||||
| Address | Santorini; Greece; April 2016 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | DAS | ||
| Notes |
DAG; 602.006; 600.061; 601.225; 600.077; 600.097 | Approved | no | ||
| Call Number | TFC2016 | Serial | 2752 | ||
| Permanent link to this record | |||||
| Author | Anders Hast; Alicia Fornes | ||||
| Title | A Segmentation-free Handwritten Word Spotting Approach by Relaxed Feature Matching | Type | Conference Article | ||
| Year | 2016 | Publication | 12th IAPR Workshop on Document Analysis Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 150-155 | ||
| Keywords | |||||
| Abstract | The automatic recognition of historical handwritten documents is still considered challenging task. For this reason, word spotting emerges as a good alternative for making the information contained in these documents available to the user. Word spotting is defined as the task of retrieving all instances of the query word in a document collection, becoming a useful tool for information retrieval. In this paper we propose a segmentation-free word spotting approach able to deal with large document collections. Our method is inspired on feature matching algorithms that have been applied to image matching and retrieval. Since handwritten words have different shape, there is no exact transformation to be obtained. However, the sufficient degree of relaxation is achieved by using a Fourier based descriptor and an alternative approach to RANSAC called PUMA. The proposed approach is evaluated on historical marriage records, achieving promising results. | ||||
| Address | Santorini; Greece; April 2016 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | DAS | ||
| Notes |
DAG; 602.006; 600.061; 600.077; 600.097 | Approved | no | ||
| Call Number | HaF2016 | Serial | 2753 | ||
| Permanent link to this record | |||||
| Author | Francisco Cruz; Oriol Ramos Terrades | ||||
| Title | EM-Based Layout Analysis Method for Structured Documents | Type | Conference Article | ||
| Year | 2014 | Publication | 22nd International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 315-320 | ||
| Keywords | |||||
| Abstract | In this paper we present a method to perform layout analysis in structured documents. We proposed an EM-based algorithm to fit a set of Gaussian mixtures to the different regions according to the logical distribution along the page. After the convergence, we estimate the final shape of the regions according
to the parameters computed for each component of the mixture. We evaluated our method in the task of record detection in a collection of historical structured documents and performed a comparison with other previous works in this task. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1051-4651 | ISBN | Medium | ||
| Area | Expedition | Conference | ICPR | ||
| Notes |
DAG; 602.006; 600.061; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ CrR2014 | Serial | 2530 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes; Xavier Otazu; Josep Llados | ||||
| Title | Show through cancellation and image enhancement by multiresolution contrast processing | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 200-204 | ||
| Keywords | |||||
| Abstract | Historical documents suffer from different types of degradation and noise such as background variation, uneven illumination or dark spots. In case of double-sided documents, another common problem is that the back side of the document usually interferes with the front side because of the transparency of the document or ink bleeding. This effect is called the show through phenomenon. Many methods are developed to solve these problems, and in the case of show-through, by scanning and matching both the front and back sides of the document. In contrast, our approach is designed to use only one side of the scanned document. We hypothesize that show-trough are low contrast components, while foreground components are high contrast ones. A Multiresolution Contrast (MC) decomposition is presented in order to estimate the contrast of features at different spatial scales. We cancel the show-through phenomenon by thresholding these low contrast components. This decomposition is also able to enhance the image removing shadowed areas by weighting spatial scales. Results show that the enhanced images improve the readability of the documents, allowing scholars both to recover unreadable words and to solve ambiguities. | ||||
| Address | Washington; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes |
DAG; 602.006; 600.045; 600.061; 600.052;CIC | Approved | no | ||
| Call Number | Admin @ si @ FOL2013 | Serial | 2241 | ||
| Permanent link to this record | |||||
| Author | Nuria Cirera; Alicia Fornes; Volkmar Frinken; Josep Llados | ||||
| Title | Hybrid grammar language model for handwritten historical documents recognition | Type | Conference Article | ||
| Year | 2013 | Publication | 6th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 7887 | Issue | Pages | 117-124 | |
| Keywords | |||||
| Abstract | In this paper we present a hybrid language model for the recognition of handwritten historical documents with a structured syntactical layout. Using a hidden Markov model-based recognition framework, a word-based grammar with a closed dictionary is enhanced by a character sequence recognition method. This allows to recognize out-of-dictionary words in controlled parts of the recognition, while keeping a closed vocabulary restriction for other parts. While the current status is work in progress, we can report an improvement in terms of character error rate. | ||||
| Address | Madeira; Portugal; June 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-38627-5 | Medium | |
| Area | Expedition | Conference | IbPRIA | ||
| Notes |
DAG; 602.006; 600.045; 600.061 | Approved | no | ||
| Call Number | Admin @ si @ CFF2013 | Serial | 2292 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; J. Chazalon; Jean-Marc Ogier | ||||
| Title | Combining Focus Measure Operators to Predict OCR Accuracy in Mobile-Captured Document Images | Type | Conference Article | ||
| Year | 2014 | Publication | 11th IAPR International Workshop on Document Analysis and Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 181 - 185 | ||
| Keywords | |||||
| Abstract | Mobile document image acquisition is a new trend raising serious issues in business document processing workflows. Such digitization procedure is unreliable, and integrates many distortions which must be detected as soon as possible, on the mobile, to avoid paying data transmission fees, and losing information due to the inability to re-capture later a document with temporary availability. In this context, out-of-focus blur is major issue: users have no direct control over it, and it seriously degrades OCR recognition. In this paper, we concentrate on the estimation of focus quality, to ensure a sufficient legibility of a document image for OCR processing. We propose two contributions to improve OCR accuracy prediction for mobile-captured document images. First, we present 24 focus measures, never tested on document images, which are fast to compute and require no training. Second, we show that a combination of those measures enables state-of-the art performance regarding the correlation with OCR accuracy. The resulting approach is fast, robust, and easy to implement in a mobile device. Experiments are performed on a public dataset, and precise details about image processing are given. | ||||
| Address | Tours; France; April 2014 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-4799-3243-6 | Medium | ||
| Area | Expedition | Conference | DAS | ||
| Notes |
DAG; 601.223; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ RCO2014a | Serial | 2545 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; J. Chazalon; Jean-Marc Ogier | ||||
| Title | Normalisation et validation d'images de documents capturées en mobilité | Type | Conference Article | ||
| Year | 2014 | Publication | Colloque International Francophone sur l'Écrit et le Document | Abbreviated Journal | |
| Volume | Issue | Pages | 109-124 | ||
| Keywords | mobile document image acquisition; perspective correction; illumination correction; quality assessment; focus measure; OCR accuracy prediction | ||||
| Abstract | Mobile document image acquisition integrates many distortions which must be corrected or detected on the device, before the document becomes unavailable or paying data transmission fees. In this paper, we propose a system to correct perspective and illumination issues, and estimate the sharpness of the image for OCR recognition. The correction step relies on fast and accurate border detection followed by illumination normalization. Its evaluation on a private dataset shows a clear improvement on OCR accuracy. The quality assessment
step relies on a combination of focus measures. Its evaluation on a public dataset shows that this simple method compares well to state of the art, learning-based methods which cannot be embedded on a mobile, and outperforms metric-based methods. |
||||
| Address | Nancy; France; March 2014 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | CIFED | ||
| Notes |
DAG; 601.223; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ RCO2014b | Serial | 2546 | ||
| Permanent link to this record | |||||
| Author | Lluis Gomez; Dimosthenis Karatzas | ||||
| Title | A fine-grained approach to scene text script identification | Type | Conference Article | ||
| Year | 2016 | Publication | 12th IAPR Workshop on Document Analysis Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 192-197 | ||
| Keywords | |||||
| Abstract | This paper focuses on the problem of script identification in unconstrained scenarios. Script identification is an important prerequisite to recognition, and an indispensable condition for automatic text understanding systems designed for multi-language environments. Although widely studied for document images and handwritten documents, it remains an almost unexplored territory for scene text images. We detail a novel method for script identification in natural images that combines convolutional features and the Naive-Bayes Nearest Neighbor classifier. The proposed framework efficiently exploits the discriminative power of small stroke-parts, in a fine-grained classification framework. In addition, we propose a new public benchmark dataset for the evaluation of joint text detection and script identification in natural scenes. Experiments done in this new dataset demonstrate that the proposed method yields state of the art results, while it generalizes well to different datasets and variable number of scripts. The evidence provided shows that multi-lingual scene text recognition in the wild is a viable proposition. Source code of the proposed method is made available online. | ||||
| Address | Santorini; Grecia; April 2016 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | DAS | ||
| Notes |
DAG; 601.197; 600.084 | Approved | no | ||
| Call Number | Admin @ si @ GoK2016b | Serial | 2863 | ||
| Permanent link to this record | |||||
| Author | Francisco Alvaro; Francisco Cruz; Joan Andreu Sanchez; Oriol Ramos Terrades; Jose Miguel Benedi | ||||
| Title | Structure Detection and Segmentation of Documents Using 2D Stochastic Context-Free Grammars | Type | Journal Article | ||
| Year | 2015 | Publication | Neurocomputing | Abbreviated Journal | NEUCOM |
| Volume | 150 | Issue | A | Pages | 147-154 |
| Keywords | document image analysis; stochastic context-free grammars; text classi cation features | ||||
| Abstract | In this paper we de ne a bidimensional extension of Stochastic Context-Free Grammars for structure detection and segmentation of images of documents.
Two sets of text classi cation features are used to perform an initial classi cation of each zone of the page. Then, the document segmentation is obtained as the most likely hypothesis according to a stochastic grammar. We used a dataset of historical marriage license books to validate this approach. We also tested several inference algorithms for Probabilistic Graphical Models and the results showed that the proposed grammatical model outperformed the other methods. Furthermore, grammars also provide the document structure along with its segmentation. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
DAG; 601.158; 600.077; 600.061 | Approved | no | ||
| Call Number | Admin @ si @ ACS2015 | Serial | 2531 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; T.Benkhelfallah; V. Poulain d'Andecy | ||||
| Title | Field Extraction from Administrative Documents by Incremental Structural Templates | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1100 - 1104 | ||
| Keywords | |||||
| Abstract | In this paper we present an incremental framework aimed at extracting field information from administrative document images in the context of a Digital Mail-room scenario. Given a single training sample in which the user has marked which fields have to be extracted from a particular document class, a document model representing structural relationships among words is built. This model is incrementally refined as the system processes more and more documents from the same class. A reformulation of the tf-idf statistic scheme allows to adjust the importance weights of the structural relationships among words. We report in the experimental section our results obtained with a large dataset of real invoices. | ||||
| Address | Washington; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes |
DAG; 600.56; 600.045; 605.203; 602.101 | Approved | no | ||
| Call Number | Admin @ si @ RBP2013 | Serial | 2346 | ||
| Permanent link to this record | |||||
| Author | Arnau Baro; Pau Riba; Alicia Fornes | ||||
| Title | Musigraph: Optical Music Recognition Through Object Detection and Graph Neural Network | Type | Conference Article | ||
| Year | 2022 | Publication | Frontiers in Handwriting Recognition. International Conference on Frontiers in Handwriting Recognition (ICFHR2022) | Abbreviated Journal | |
| Volume | 13639 | Issue | Pages | 171-184 | |
| Keywords | Object detection; Optical music recognition; Graph neural network | ||||
| Abstract | During the last decades, the performance of optical music recognition has been increasingly improving. However, and despite the 2-dimensional nature of music notation (e.g. notes have rhythm and pitch), most works treat musical scores as a sequence of symbols in one dimension, which make their recognition still a challenge. Thus, in this work we explore the use of graph neural networks for musical score recognition. First, because graphs are suited for n-dimensional representations, and second, because the combination of graphs with deep learning has shown a great performance in similar applications. Our methodology consists of: First, we will detect each isolated/atomic symbols (those that can not be decomposed in more graphical primitives) and the primitives that form a musical symbol. Then, we will build the graph taking as root node the notehead and as leaves those primitives or symbols that modify the note’s rhythm (stem, beam, flag) or pitch (flat, sharp, natural). Finally, the graph is translated into a human-readable character sequence for a final transcription and evaluation. Our method has been tested on more than five thousand measures, showing promising results. | ||||
| Address | December 04 – 07, 2022; Hyderabad, India | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ICFHR | ||
| Notes |
DAG; 600.162; 600.140; 602.230 | Approved | no | ||
| Call Number | Admin @ si @ BRF2022b | Serial | 3740 | ||
| Permanent link to this record | |||||
| Author | Andrea Gemelli; Sanket Biswas; Enrico Civitelli; Josep Llados; Simone Marinai | ||||
| Title | Doc2Graph: A Task Agnostic Document Understanding Framework Based on Graph Neural Networks | Type | Conference Article | ||
| Year | 2022 | Publication | 17th European Conference on Computer Vision Workshops | Abbreviated Journal | |
| Volume | 13804 | Issue | Pages | 329–344 | |
| Keywords | |||||
| Abstract | Geometric Deep Learning has recently attracted significant interest in a wide range of machine learning fields, including document analysis. The application of Graph Neural Networks (GNNs) has become crucial in various document-related tasks since they can unravel important structural patterns, fundamental in key information extraction processes. Previous works in the literature propose task-driven models and do not take into account the full power of graphs. We propose Doc2Graph, a task-agnostic document understanding framework based on a GNN model, to solve different tasks given different types of documents. We evaluated our approach on two challenging datasets for key information extraction in form understanding, invoice layout analysis and table detection. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-3-031-25068-2 | Medium | ||
| Area | Expedition | Conference | ECCV-TiE | ||
| Notes |
DAG; 600.162; 600.140; 110.312 | Approved | no | ||
| Call Number | Admin @ si @ GBC2022 | Serial | 3795 | ||
| Permanent link to this record | |||||
| Author | Pau Riba; Lutz Goldmann; Oriol Ramos Terrades; Diede Rusticus; Alicia Fornes; Josep Llados | ||||
| Title | Table detection in business document images by message passing networks | Type | Journal Article | ||
| Year | 2022 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 127 | Issue | Pages | 108641 | |
| Keywords | |||||
| Abstract | Tabular structures in business documents offer a complementary dimension to the raw textual data. For instance, there is information about the relationships among pieces of information. Nowadays, digital mailroom applications have become a key service for workflow automation. Therefore, the detection and interpretation of tables is crucial. With the recent advances in information extraction, table detection and recognition has gained interest in document image analysis, in particular, with the absence of rule lines and unknown information about rows and columns. However, business documents usually contain sensitive contents limiting the amount of public benchmarking datasets. In this paper, we propose a graph-based approach for detecting tables in document images which do not require the raw content of the document. Hence, the sensitive content can be previously removed and, instead of using the raw image or textual content, we propose a purely structural approach to keep sensitive data anonymous. Our framework uses graph neural networks (GNNs) to describe the local repetitive structures that constitute a table. In particular, our main application domain are business documents. We have carefully validated our approach in two invoice datasets and a modern document benchmark. Our experiments demonstrate that tables can be detected by purely structural approaches. | ||||
| Address | July 2022 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
DAG; 600.162; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RGR2022 | Serial | 3729 | ||
| Permanent link to this record | |||||