| Home | [181–190] << 191 192 193 194 195 196 197 198 199 200 >> [201–210] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Jaume Gibert; Ernest Valveny; Horst Bunke | ||||
| Title | Embedding of Graphs with Discrete Attributes Via Label Frequencies | Type | Journal Article | ||
| Year | 2013 | Publication | International Journal of Pattern Recognition and Artificial Intelligence | Abbreviated Journal | IJPRAI |
| Volume | 27 | Issue | 3 | Pages | 1360002-1360029 |
Keywords  |
Discrete attributed graphs; graph embedding; graph classification | ||||
| Abstract | Graph-based representations of patterns are very flexible and powerful, but they are not easily processed due to the lack of learning algorithms in the domain of graphs. Embedding a graph into a vector space solves this problem since graphs are turned into feature vectors and thus all the statistical learning machinery becomes available for graph input patterns. In this work we present a new way of embedding discrete attributed graphs into vector spaces using node and edge label frequencies. The methodology is experimentally tested on graph classification problems, using patterns of different nature, and it is shown to be competitive to state-of-the-art classification algorithms for graphs, while being computationally much more efficient. | ||||
| 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 | Approved | no | ||
| Call Number | Admin @ si @ GVB2013 | Serial | 2305 | ||
| Permanent link to this record | |||||
| Author | Francesco Ciompi; Oriol Pujol; Petia Radeva | ||||
| Title | ECOC-DRF: Discriminative random fields based on error correcting output codes | Type | Journal Article | ||
| Year | 2014 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 47 | Issue | 6 | Pages | 2193-2204 |
| Keywords |
Discriminative random fields; Error-correcting output codes; Multi-class classification; Graphical models | ||||
| Abstract | We present ECOC-DRF, a framework where potential functions for Discriminative Random Fields are formulated as an ensemble of classifiers. We introduce the label trick, a technique to express transitions in the pairwise potential as meta-classes. This allows to independently learn any possible transition between labels without assuming any pre-defined model. The Error Correcting Output Codes matrix is used as ensemble framework for the combination of margin classifiers. We apply ECOC-DRF to a large set of classification problems, covering synthetic, natural and medical images for binary and multi-class cases, outperforming state-of-the art in almost all the experiments. | ||||
| 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 | LAMP; HuPBA; MILAB; 605.203; 600.046; 601.043; 600.079 | Approved | no | ||
| Call Number | Admin @ si @ CPR2014b | Serial | 2470 | ||
| Permanent link to this record | |||||
| Author | Kaida Xiao; Chenyang Fu; Dimosthenis Karatzas; Sophie Wuerger | ||||
| Title | Visual Gamma Correction for LCD Displays | Type | Journal Article | ||
| Year | 2011 | Publication | Displays | Abbreviated Journal | DIS |
| Volume | 32 | Issue | 1 | Pages | 17-23 |
| Keywords |
Display calibration; Psychophysics ; Perceptual; Visual gamma correction; Luminance matching; Observer-based calibration | ||||
| Abstract | An improved method for visual gamma correction is developed for LCD displays to increase the accuracy of digital colour reproduction. Rather than utilising a photometric measurement device, we use observ- ers’ visual luminance judgements for gamma correction. Eight half tone patterns were designed to gen- erate relative luminances from 1/9 to 8/9 for each colour channel. A psychophysical experiment was conducted on an LCD display to find the digital signals corresponding to each relative luminance by visually matching the half-tone background to a uniform colour patch. Both inter- and intra-observer vari- ability for the eight luminance matches in each channel were assessed and the luminance matches proved to be consistent across observers (DE00 < 3.5) and repeatable (DE00 < 2.2). Based on the individual observer judgements, the display opto-electronic transfer function (OETF) was estimated by using either a 3rd order polynomial regression or linear interpolation for each colour channel. The performance of the proposed method is evaluated by predicting the CIE tristimulus values of a set of coloured patches (using the observer-based OETFs) and comparing them to the expected CIE tristimulus values (using the OETF obtained from spectro-radiometric luminance measurements). The resulting colour differences range from 2 to 4.6 DE00. We conclude that this observer-based method of visual gamma correction is useful to estimate the OETF for LCD displays. Its major advantage is that no particular functional relationship between digital inputs and luminance outputs has to be assumed. | ||||
| Address | |||||
| 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 | Approved | no | ||
| Call Number | Admin @ si @ XFK2011 | Serial | 1815 | ||
| Permanent link to this record | |||||
| Author | C. Alejandro Parraga; Jordi Roca; Dimosthenis Karatzas; Sophie Wuerger | ||||
| Title | Limitations of visual gamma corrections in LCD displays | Type | Journal Article | ||
| Year | 2014 | Publication | Displays | Abbreviated Journal | Dis |
| Volume | 35 | Issue | 5 | Pages | 227–239 |
| Keywords |
Display calibration; Psychophysics; Perceptual; Visual gamma correction; Luminance matching; Observer-based calibration | ||||
| Abstract | A method for estimating the non-linear gamma transfer function of liquid–crystal displays (LCDs) without the need of a photometric measurement device was described by Xiao et al. (2011) [1]. It relies on observer’s judgments of visual luminance by presenting eight half-tone patterns with luminances from 1/9 to 8/9 of the maximum value of each colour channel. These half-tone patterns were distributed over the screen both over the vertical and horizontal viewing axes. We conducted a series of photometric and psychophysical measurements (consisting in the simultaneous presentation of half-tone patterns in each trial) to evaluate whether the angular dependency of the light generated by three different LCD technologies would bias the results of these gamma transfer function estimations. Our results show that there are significant differences between the gamma transfer functions measured and produced by observers at different viewing angles. We suggest appropriate modifications to the Xiao et al. paradigm to counterbalance these artefacts which also have the advantage of shortening the amount of time spent in collecting the psychophysical measurements. | ||||
| 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 | CIC; DAG; 600.052; 600.077; 600.074 | Approved | no | ||
| Call Number | Admin @ si @ PRK2014 | Serial | 2511 | ||
| Permanent link to this record | |||||
| Author | Pau Riba; Anjan Dutta; Josep Llados; Alicia Fornes; Sounak Dey | ||||
| Title | Improving Information Retrieval in Multiwriter Scenario by Exploiting the Similarity Graph of Document Terms | Type | Conference Article | ||
| Year | 2017 | Publication | 14th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 475-480 | ||
| Keywords |
document terms; information retrieval; affinity graph; graph of document terms; multiwriter; graph diffusion | ||||
| Abstract | Information Retrieval (IR) is the activity of obtaining information resources relevant to a questioned information. It usually retrieves a set of objects ranked according to the relevancy to the needed fact. In document analysis, information retrieval receives a lot of attention in terms of symbol and word spotting. However, through decades the community mostly focused either on printed or on single writer scenario, where the
state-of-the-art results have achieved reasonable performance on the available datasets. Nevertheless, the existing algorithms do not perform accordingly on multiwriter scenario. A graph representing relations between a set of objects is a structure where each node delineates an individual element and the similarity between them is represented as a weight on the connecting edge. In this paper, we explore different analytics of graphs constructed from words or graphical symbols, such as diffusion, shortest path, etc. to improve the performance of information retrieval methods in multiwriter scenario |
||||
| 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 | ICDAR | ||
| Notes | DAG; 600.097; 601.302; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RDL2017a | Serial | 3053 | ||
| Permanent link to this record | |||||
| Author | Stepan Simsa; Milan Sulc; Michal Uricar; Yash Patel; Ahmed Hamdi; Matej Kocian; Matyas Skalicky; Jiri Matas; Antoine Doucet; Mickael Coustaty; Dimosthenis Karatzas | ||||
| Title | DocILE Benchmark for Document Information Localization and Extraction | Type | Conference Article | ||
| Year | 2023 | Publication | 17th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | 14188 | Issue | Pages | 147–166 | |
| Keywords |
Document AI; Information Extraction; Line Item Recognition; Business Documents; Intelligent Document Processing | ||||
| Abstract | This paper introduces the DocILE benchmark with the largest dataset of business documents for the tasks of Key Information Localization and Extraction and Line Item Recognition. It contains 6.7k annotated business documents, 100k synthetically generated documents, and nearly 1M unlabeled documents for unsupervised pre-training. The dataset has been built with knowledge of domain- and task-specific aspects, resulting in the following key features: (i) annotations in 55 classes, which surpasses the granularity of previously published key information extraction datasets by a large margin; (ii) Line Item Recognition represents a highly practical information extraction task, where key information has to be assigned to items in a table; (iii) documents come from numerous layouts and the test set includes zero- and few-shot cases as well as layouts commonly seen in the training set. The benchmark comes with several baselines, including RoBERTa, LayoutLMv3 and DETR-based Table Transformer; applied to both tasks of the DocILE benchmark, with results shared in this paper, offering a quick starting point for future work. The dataset, baselines and supplementary material are available at https://github.com/rossumai/docile. | ||||
| Address | San Jose; CA; USA; August 2023 | ||||
| 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 | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ SSU2023 | Serial | 3903 | ||
| Permanent link to this record | |||||
| Author | Mohamed Ali Souibgui; Ali Furkan Biten; Sounak Dey; Alicia Fornes; Yousri Kessentini; Lluis Gomez; Dimosthenis Karatzas; Josep Llados | ||||
| Title | One-shot Compositional Data Generation for Low Resource Handwritten Text Recognition | Type | Conference Article | ||
| Year | 2022 | Publication | Winter Conference on Applications of Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords |
Document Analysis | ||||
| Abstract | Low resource Handwritten Text Recognition (HTR) is a hard problem due to the scarce annotated data and the very limited linguistic information (dictionaries and language models). This appears, for example, in the case of historical ciphered manuscripts, which are usually written with invented alphabets to hide the content. Thus, in this paper we address this problem through a data generation technique based on Bayesian Program Learning (BPL). Contrary to traditional generation approaches, which require a huge amount of annotated images, our method is able to generate human-like handwriting using only one sample of each symbol from the desired alphabet. After generating symbols, we create synthetic lines to train state-of-the-art HTR architectures in a segmentation free fashion. Quantitative and qualitative analyses were carried out and confirm the effectiveness of the proposed method, achieving competitive results compared to the usage of real annotated data. | ||||
| Address | Virtual; January 2022 | ||||
| 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 | WACV | ||
| Notes | DAG; 602.230; 600.140 | Approved | no | ||
| Call Number | Admin @ si @ SBD2022 | Serial | 3615 | ||
| Permanent link to this record | |||||
| Author | Minesh Mathew; Viraj Bagal; Ruben Tito; Dimosthenis Karatzas; Ernest Valveny; C.V. Jawahar | ||||
| Title | InfographicVQA | Type | Conference Article | ||
| Year | 2022 | Publication | Winter Conference on Applications of Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | 1697-1706 | ||
| Keywords |
Document Analysis Datasets; Evaluation and Comparison of Vision Algorithms; Vision and Languages | ||||
| Abstract | Infographics communicate information using a combination of textual, graphical and visual elements. This work explores the automatic understanding of infographic images by using a Visual Question Answering technique. To this end, we present InfographicVQA, a new dataset comprising a diverse collection of infographics and question-answer annotations. The questions require methods that jointly reason over the document layout, textual content, graphical elements, and data visualizations. We curate the dataset with an emphasis on questions that require elementary reasoning and basic arithmetic skills. For VQA on the dataset, we evaluate two Transformer-based strong baselines. Both the baselines yield unsatisfactory results compared to near perfect human performance on the dataset. The results suggest that VQA on infographics--images that are designed to communicate information quickly and clearly to human brain--is ideal for benchmarking machine understanding of complex document images. The dataset is available for download at docvqa. org | ||||
| Address | Virtual; Waikoloa; Hawai; USA; January 2022 | ||||
| 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 | WACV | ||
| Notes | DAG; 600.155 | Approved | no | ||
| Call Number | MBT2022 | Serial | 3625 | ||
| Permanent link to this record | |||||
| Author | M. Visani; Oriol Ramos Terrades; Salvatore Tabbone | ||||
| Title | A Protocol to Characterize the Descriptive Power and the Complementarity of Shape Descriptors | Type | Journal Article | ||
| Year | 2011 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
| Volume | 14 | Issue | 1 | Pages | 87-100 |
| Keywords |
Document analysis; Shape descriptors; Symbol description; Performance characterization; Complementarity analysis | ||||
| Abstract | Most document analysis applications rely on the extraction of shape descriptors, which may be grouped into different categories, each category having its own advantages and drawbacks (O.R. Terrades et al. in Proceedings of ICDAR’07, pp. 227–231, 2007). In order to improve the richness of their description, many authors choose to combine multiple descriptors. Yet, most of the authors who propose a new descriptor content themselves with comparing its performance to the performance of a set of single state-of-the-art descriptors in a specific applicative context (e.g. symbol recognition, symbol spotting...). This results in a proliferation of the shape descriptors proposed in the literature. In this article, we propose an innovative protocol, the originality of which is to be as independent of the final application as possible and which relies on new quantitative and qualitative measures. We introduce two types of measures: while the measures of the first type are intended to characterize the descriptive power (in terms of uniqueness, distinctiveness and robustness towards noise) of a descriptor, the second type of measures characterizes the complementarity between multiple descriptors. Characterizing upstream the complementarity of shape descriptors is an alternative to the usual approach where the descriptors to be combined are selected by trial and error, considering the performance characteristics of the overall system. To illustrate the contribution of this protocol, we performed experimental studies using a set of descriptors and a set of symbols which are widely used by the community namely ART and SC descriptors and the GREC 2003 database. | ||||
| 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; IF 1.091 | Approved | no | ||
| Call Number | Admin @ si @VRT2011 | Serial | 1856 | ||
| Permanent link to this record | |||||
| Author | Francisco Cruz; Oriol Ramos Terrades | ||||
| Title | A probabilistic framework for handwritten text line segmentation | Type | Miscellaneous | ||
| Year | 2018 | Publication | Arxiv | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords |
Document Analysis; Text Line Segmentation; EM algorithm; Probabilistic Graphical Models; Parameter Learning | ||||
| Abstract | We successfully combine Expectation-Maximization algorithm and variational
approaches for parameter learning and computing inference on Markov random fields. This is a general method that can be applied to many computer vision tasks. In this paper, we apply it to handwritten text line segmentation. We conduct several experiments that demonstrate that our method deal with common issues of this task, such as complex document layout or non-latin scripts. The obtained results prove that our method achieve state-of-theart performance on different benchmark datasets without any particular fine tuning step. |
||||
| 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; 600.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ CrR2018 | Serial | 3253 | ||
| Permanent link to this record | |||||
| Author | Ruben Tito; Dimosthenis Karatzas; Ernest Valveny | ||||
| Title | Document Collection Visual Question Answering | Type | Conference Article | ||
| Year | 2021 | Publication | 16th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | 12822 | Issue | Pages | 778-792 | |
| Keywords |
Document collection; Visual Question Answering | ||||
| Abstract | Current tasks and methods in Document Understanding aims to process documents as single elements. However, documents are usually organized in collections (historical records, purchase invoices), that provide context useful for their interpretation. To address this problem, we introduce Document Collection Visual Question Answering (DocCVQA) a new dataset and related task, where questions are posed over a whole collection of document images and the goal is not only to provide the answer to the given question, but also to retrieve the set of documents that contain the information needed to infer the answer. Along with the dataset we propose a new evaluation metric and baselines which provide further insights to the new dataset and task. | ||||
| 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 | Medium | |||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ TKV2021 | Serial | 3622 | ||
| Permanent link to this record | |||||
| Author | Thanh Ha Do; Oriol Ramos Terrades; Salvatore Tabbone | ||||
| Title | DSD: document sparse-based denoising algorithm | Type | Journal Article | ||
| Year | 2019 | Publication | Pattern Analysis and Applications | Abbreviated Journal | PAA |
| Volume | 22 | Issue | 1 | Pages | 177–186 |
| Keywords |
Document denoising; Sparse representations; Sparse dictionary learning; Document degradation models | ||||
| Abstract | In this paper, we present a sparse-based denoising algorithm for scanned documents. This method can be applied to any kind of scanned documents with satisfactory results. Unlike other approaches, the proposed approach encodes noise documents through sparse representation and visual dictionary learning techniques without any prior noise model. Moreover, we propose a precision parameter estimator. Experiments on several datasets demonstrate the robustness of the proposed approach compared to the state-of-the-art methods on document denoising. | ||||
| 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; 600.097; 600.140; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ DRT2019 | Serial | 3254 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Agnes Borras; Josep Llados | ||||
| Title | Relational Indexing of Vectorial Primitives for Symbol Spotting in Line-Drawing Images | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 31 | Issue | 3 | Pages | 188–201 |
| Keywords |
Document image analysis and recognition, Graphics recognition, Symbol spotting ,Vectorial representations, Line-drawings | ||||
| Abstract | This paper presents a symbol spotting approach for indexing by content a database of line-drawing images. As line-drawings are digital-born documents designed by vectorial softwares, instead of using a pixel-based approach, we present a spotting method based on vector primitives. Graphical symbols are represented by a set of vectorial primitives which are described by an off-the-shelf shape descriptor. A relational indexing strategy aims to retrieve symbol locations into the target documents by using a combined numerical-relational description of 2D structures. The zones which are likely to contain the queried symbol are validated by a Hough-like voting scheme. In addition, a performance evaluation framework for symbol spotting in graphical documents is proposed. The presented methodology has been evaluated with a benchmarking set of architectural documents achieving good performance results. | ||||
| Address | |||||
| 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 | Approved | no | ||
| Call Number | DAG @ dag @ RBL2010 | Serial | 1177 | ||
| Permanent link to this record | |||||
| Author | Juan Ignacio Toledo; Jordi Cucurull; Jordi Puiggali; Alicia Fornes; Josep Llados | ||||
| Title | Document Analysis Techniques for Automatic Electoral Document Processing: A Survey | Type | Conference Article | ||
| Year | 2015 | Publication | E-Voting and Identity, Proceedings of 5th international conference, VoteID 2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 139-141 | ||
| Keywords |
Document image analysis; Computer vision; Paper ballots; Paper based elections; Optical scan; Tally | ||||
| Abstract | In this paper, we will discuss the most common challenges in electoral document processing and study the different solutions from the document analysis community that can be applied in each case. We will cover Optical Mark Recognition techniques to detect voter selections in the Australian Ballot, handwritten number recognition for preferential elections and handwriting recognition for write-in areas. We will also propose some particular adjustments that can be made to those general techniques in the specific context of electoral documents. | ||||
| Address | Bern; Switzerland; September 2015 | ||||
| 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 | VoteID | ||
| Notes | DAG; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ TCP2015 | Serial | 2641 | ||
| Permanent link to this record | |||||
| Author | Juan Ignacio Toledo; Manuel Carbonell; Alicia Fornes; Josep Llados | ||||
| Title | Information Extraction from Historical Handwritten Document Images with a Context-aware Neural Model | Type | Journal Article | ||
| Year | 2019 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 86 | Issue | Pages | 27-36 | |
| Keywords |
Document image analysis; Handwritten documents; Named entity recognition; Deep neural networks | ||||
| Abstract | Many historical manuscripts that hold trustworthy memories of the past societies contain information organized in a structured layout (e.g. census, birth or marriage records). The precious information stored in these documents cannot be effectively used nor accessed without costly annotation efforts. The transcription driven by the semantic categories of words is crucial for the subsequent access. In this paper we describe an approach to extract information from structured historical handwritten text images and build a knowledge representation for the extraction of meaning out of historical data. The method extracts information, such as named entities, without the need of an intermediate transcription step, thanks to the incorporation of context information through language models. Our system has two variants, the first one is based on bigrams, whereas the second one is based on recurrent neural networks. Concretely, our second architecture integrates a Convolutional Neural Network to model visual information from word images together with a Bidirecitonal Long Short Term Memory network to model the relation among the words. This integrated sequential approach is able to extract more information than just the semantic category (e.g. a semantic category can be associated to a person in a record). Our system is generic, it deals with out-of-vocabulary words by design, and it can be applied to structured handwritten texts from different domains. The method has been validated with the ICDAR IEHHR competition protocol, outperforming the existing approaches. | ||||
| 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; 600.097; 601.311; 603.057; 600.084; 600.140; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ TCF2019 | Serial | 3166 | ||
| Permanent link to this record | |||||