| |
Records |
Links |
|
Author |
Oriol Ramos Terrades; Ernest Valveny |
|
| |
Title  |
Indexing Technical Symbols Using Ridgelets Transform |
Type |
Miscellaneous |
| |
Year |
2003 |
Publication |
Proceedings of the Fifth International Workshop on Graphics Recognition (GREC´03), 202–211 |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
Abstract |
|
|
| |
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 |
DAG @ dag @ RaV2003c |
Serial |
405 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Oriol Ramos Terrades; Ernest Valveny |
|
| |
Title |
Indexing Technical Symbols Using Ridgelets Transform |
Type |
Miscellaneous |
| |
Year |
2004 |
Publication |
Graphics Recognition: Recent Advances and Perspectives, J. Llados, Y.B. Kwon (Eds.), Lecture Notes in Computer Science, 3088:177–187, ISBN: 3–540–22478–5 |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
Abstract |
|
|
| |
Address |
Springer-Verlag |
|
| |
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 |
DAG @ dag @ VaD2004c |
Serial |
503 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Mirko Arnold; Anarta Ghosh; Gerard Lacey; Stephen Patchett; Hugh Mulcahy |
|
| |
Title |
Indistinct frame detection in colonoscopy videos |
Type |
Conference Article |
| |
Year |
2009 |
Publication |
Machine Vision and Image Processing Conference |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
47-52 |
|
| |
Keywords |
|
|
| |
Abstract |
|
|
| |
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 |
800 |
Expedition |
|
Conference |
|
|
| |
Notes |
MV |
Approved |
no |
|
| |
Call Number |
fernando @ fernando @ |
Serial |
2424 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Maria Vanrell; Ramon Baldrich; Anna Salvatella; Robert Benavente; Francesc Tous |
|
| |
Title |
Induction operators for a computational colour-texture representation |
Type |
Journal |
| |
Year |
2004 |
Publication |
Computer Vision and Image Understanding, 94(1–3):92–114, ISSN: 1077–3142 (IF: 0.651) |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
Abstract |
|
|
| |
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 |
Approved |
no |
|
| |
Call Number |
CAT @ cat @ VBS2004 |
Serial |
453 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Anjan Dutta |
|
| |
Title |
Inexact Subgraph Matching Applied to Symbol Spotting in Graphical Documents |
Type |
Book Whole |
| |
Year |
2014 |
Publication |
PhD Thesis, Universitat Autonoma de Barcelona-CVC |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
Abstract |
There is a resurgence in the use of structural approaches in the usual object recognition and retrieval problem. Graph theory, in particular, graph matching plays a relevant role in that. Specifically, the detection of an object (or a part of that) in an image in terms of structural features can be formulated as a subgraph matching. Subgraph matching is a challenging task. Specially due to the presence of outliers most of the graph matching algorithms do not perform well in subgraph matching scenario. Also exact subgraph isomorphism has proven to be an NP-complete problem. So naturally, in graph matching community, there are lot of efforts addressing the problem of subgraph matching within suboptimal bound. Most of them work with approximate algorithms that try to get an inexact solution in estimated way. In addition, usual recognition must cope with distortion. Inexact graph matching consists in finding the best isomorphism under a similarity measure. Theoretically this thesis proposes algorithms for solving subgraph matching in an approximate and inexact way.
We consider the symbol spotting problem on graphical documents or line drawings from application point of view. This is a well known problem in the graphics recognition community. It can be further applied for indexing and classification of documents based on their contents. The structural nature of this kind of documents easily motivates one for giving a graph based representation. So the symbol spotting problem on graphical documents can be considered as a subgraph matching problem. The main challenges in this application domain is the noise and distortions that might come during the usage, digitalization and raster to vector conversion of those documents. Apart from that computer vision nowadays is not any more confined within a limited number of images. So dealing a huge number of images with graph based method is a further challenge.
In this thesis, on one hand, we have worked on efficient and robust graph representation to cope with the noise and distortions coming from documents. On the other hand, we have worked on different graph based methods and framework to solve the subgraph matching problem in a better approximated way, which can also deal with considerable number of images. Firstly, we propose a symbol spotting method by hashing serialized subgraphs. Graph serialization allows to create factorized substructures such as graph paths, which can be organized in hash tables depending on the structural similarities of the serialized subgraphs. The involvement of hashing techniques helps to reduce the search space substantially and speeds up the spotting procedure. Secondly, we introduce contextual similarities based on the walk based propagation on tensor product graph. These contextual similarities involve higher order information and more reliable than pairwise similarities. We use these higher order similarities to formulate subgraph matching as a node and edge selection problem in the tensor product graph. Thirdly, we propose near convex grouping to form near convex region adjacency graph which eliminates the limitations of traditional region adjacency graph representation for graphic recognition. Fourthly, we propose a hierarchical graph representation by simplifying/correcting the structural errors to create a hierarchical graph of the base graph. Later these hierarchical graph structures are matched with some graph matching methods. Apart from that, in this thesis we have provided an overall experimental comparison of all the methods and some of the state-of-the-art methods. Furthermore, some dataset models have also been proposed. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
Ph.D. thesis |
|
| |
Publisher |
Ediciones Graficas Rey |
Place of Publication |
|
Editor |
Josep Llados;Umapada Pal |
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
978-84-940902-4-0 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG; 600.077 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ Dut2014 |
Serial |
2465 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Bogdan Raducanu; D. Gatica-Perez |
|
| |
Title |
Inferring competitive role patterns in reality TV show through nonverbal analysis |
Type |
Journal Article |
| |
Year |
2012 |
Publication |
Multimedia Tools and Applications |
Abbreviated Journal |
MTAP |
|
| |
Volume |
56 |
Issue |
1 |
Pages |
207-226 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper introduces a new facet of social media, namely that depicting social interaction. More concretely, we address this problem from the perspective of nonverbal behavior-based analysis of competitive meetings. For our study, we made use of “The Apprentice” reality TV show, which features a competition for a real, highly paid corporate job. Our analysis is centered around two tasks regarding a person's role in a meeting: predicting the person with the highest status, and predicting the fired candidates. We address this problem by adopting both supervised and unsupervised strategies. The current study was carried out using nonverbal audio cues. Our approach is based only on the nonverbal interaction dynamics during the meeting without relying on the spoken words. The analysis is based on two types of data: individual and relational measures. Results obtained from the analysis of a full season of the show are promising (up to 85.7% of accuracy in the first case and up to 92.8% in the second case). Our approach has been conveniently compared with the Influence Model, demonstrating its superiority. |
|
| |
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 |
1380-7501 |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
OR;MV |
Approved |
no |
|
| |
Call Number |
BCNPCL @ bcnpcl @ RaG2012 |
Serial |
1360 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Fadi Dornaika; Bogdan Raducanu |
|
| |
Title |
Inferring Facial Expressions from Videos: Tool and Application |
Type |
Journal |
| |
Year |
2007 |
Publication |
Signal Processing: Image Communication, vol. 22(9):769–784 |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
Abstract |
|
|
| |
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 |
OR;MV |
Approved |
no |
|
| |
Call Number |
BCNPCL @ bcnpcl @ DoR2007b |
Serial |
918 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Aura Hernandez-Sabate; Debora Gil; David Roche; Monica M. S. Matsumoto; Sergio S. Furuie |
|
| |
Title |
Inferring the Performance of Medical Imaging Algorithms |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
14th International Conference on Computer Analysis of Images and Patterns |
Abbreviated Journal |
|
|
| |
Volume |
6854 |
Issue |
|
Pages |
520-528 |
|
| |
Keywords |
Validation, Statistical Inference, Medical Imaging Algorithms. |
|
| |
Abstract |
Evaluation of the performance and limitations of medical imaging algorithms is essential to estimate their impact in social, economic or clinical aspects. However, validation of medical imaging techniques is a challenging task due to the variety of imaging and clinical problems involved, as well as, the difficulties for systematically extracting a reliable solely ground truth. Although specific validation protocols are reported in any medical imaging paper, there are still two major concerns: definition of standardized methodologies transversal to all problems and generalization of conclusions to the whole clinical data set.
We claim that both issues would be fully solved if we had a statistical model relating ground truth and the output of computational imaging techniques. Such a statistical model could conclude to what extent the algorithm behaves like the ground truth from the analysis of a sampling of the validation data set. We present a statistical inference framework reporting the agreement and describing the relationship of two quantities. We show its transversality by applying it to validation of two different tasks: contour segmentation and landmark correspondence. |
|
| |
Address |
Sevilla |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer-Verlag Berlin Heidelberg |
Place of Publication |
Berlin |
Editor |
Pedro Real; Daniel Diaz-Pernil; Helena Molina-Abril; Ainhoa Berciano; Walter Kropatsch |
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
L |
Abbreviated Series Title |
LNCS |
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
CAIP |
|
| |
Notes |
IAM; ADAS |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ HGR2011 |
Serial |
1676 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Carles Onielfa; Carles Casacuberta; Sergio Escalera |
|
| |
Title |
Influence in Social Networks Through Visual Analysis of Image Memes |
Type |
Conference Article |
| |
Year |
2022 |
Publication |
Artificial Intelligence Research and Development |
Abbreviated Journal |
|
|
| |
Volume |
356 |
Issue |
|
Pages |
71-80 |
|
| |
Keywords |
|
|
| |
Abstract |
Memes evolve and mutate through their diffusion in social media. They have the potential to propagate ideas and, by extension, products. Many studies have focused on memes, but none so far, to our knowledge, on the users that post them, their relationships, and the reach of their influence. In this article, we define a meme influence graph together with suitable metrics to visualize and quantify influence between users who post memes, and we also describe a process to implement our definitions using a new approach to meme detection based on text-to-image area ratio and contrast. After applying our method to a set of users of the social media platform Instagram, we conclude that our metrics add information to already existing user characteristics. |
|
| |
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 |
HuPBA; no menciona |
Approved |
no |
|
| |
Call Number |
Admin @ si @ OCE2022 |
Serial |
3799 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Debora Gil; Ruth Aris; Agnes Borras; Esmitt Ramirez; Rafael Sebastian; Mariano Vazquez |
|
| |
Title |
Influence of fiber connectivity in simulations of cardiac biomechanics |
Type |
Journal Article |
| |
Year |
2019 |
Publication |
International Journal of Computer Assisted Radiology and Surgery |
Abbreviated Journal |
IJCAR |
|
| |
Volume |
14 |
Issue |
1 |
Pages |
63–72 |
|
| |
Keywords |
Cardiac electromechanical simulations; Diffusion tensor imaging; Fiber connectivity |
|
| |
Abstract |
PURPOSE:
Personalized computational simulations of the heart could open up new improved approaches to diagnosis and surgery assistance systems. While it is fully recognized that myocardial fiber orientation is central for the construction of realistic computational models of cardiac electromechanics, the role of its overall architecture and connectivity remains unclear. Morphological studies show that the distribution of cardiac muscular fibers at the basal ring connects epicardium and endocardium. However, computational models simplify their distribution and disregard the basal loop. This work explores the influence in computational simulations of fiber distribution at different short-axis cuts.
METHODS:
We have used a highly parallelized computational solver to test different fiber models of ventricular muscular connectivity. We have considered two rule-based mathematical models and an own-designed method preserving basal connectivity as observed in experimental data. Simulated cardiac functional scores (rotation, torsion and longitudinal shortening) were compared to experimental healthy ranges using generalized models (rotation) and Mahalanobis distances (shortening, torsion).
RESULTS:
The probability of rotation was significantly lower for ruled-based models [95% CI (0.13, 0.20)] in comparison with experimental data [95% CI (0.23, 0.31)]. The Mahalanobis distance for experimental data was in the edge of the region enclosing 99% of the healthy population.
CONCLUSIONS:
Cardiac electromechanical simulations of the heart with fibers extracted from experimental data produce functional scores closer to healthy ranges than rule-based models disregarding architecture connectivity. |
|
| |
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 |
IAM; 600.096; 601.323; 600.139; 600.145 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ GAB2019a |
Serial |
3133 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
C. Santa-Marta; Jaume Garcia; A. Bajo; J.J. Vaquero; M. Ledesma-Carbayo; Debora Gil |
|
| |
Title |
Influence of the Temporal Resolution on the Quantification of Displacement Fields in Cardiac Magnetic Resonance Tagged Images |
Type |
Conference Article |
| |
Year |
2008 |
Publication |
XXVI Congreso Anual de la Sociedad Española de Ingenieria Biomedica |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
352–353 |
|
| |
Keywords |
|
|
| |
Abstract |
It is difficult to acquire tagged cardiac MR images with a high temporal and spatial resolution using clinical MR scanners. However, if such images are used for quantifying scores based on motion, it is essential a resolution as high as possibl e. This paper explores the influence of the temporal resolution of a tagged series on the quantification of myocardial dynamic parameters. To such purpose we have designed a SPAMM (Spatial Modulation of Magnetization) sequence allowing acquisition of sequences at simple and double temporal resolution. Sequences are processed to compute myocardial motion by an automatic technique based on the tracking of the harmonic phase of tagged images (the Harmonic Phase Flow, HPF). The results have been compared to manual tracking of myocardial tags. The error in displacement fields for double resolution sequences reduces 17%. |
|
| |
Address |
Valladolid |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
Roberto hornero, Saniel Abasolo |
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
CASEIB |
|
| |
Notes |
IAM; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ SGB2008 |
Serial |
1033 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Jaume Garcia; Debora Gil; A.Bajo; M.J.Ledesma-Carbayo; C.SantaMarta |
|
| |
Title |
Influence of the temporal resolution on the quantification of displacement fields in cardiac magnetic resonance tagged images |
Type |
Conference Article |
| |
Year |
2008 |
Publication |
Proc. Computers in Cardiology |
Abbreviated Journal |
|
|
| |
Volume |
35 |
Issue |
|
Pages |
785-788 |
|
| |
Keywords |
|
|
| |
Abstract |
It is difficult to acquire tagged cardiac MR images with a high temporal and spatial resolution using clinical MR scanners. However, if such images are used for quantifying scores based on motion, it is essential a resolution as high as possible. This paper explores the influence of the temporal resolution of a tagged series on the quantification of myocardial dynamic parameters. To such purpose we have designed a SPAMM (Spatial Modulation of Magnetization) sequence allowing acquisition of sequences at simple and double temporal resolution. Sequences are processed to compute myocardial motion by an automatic technique based on the tracking of the harmonic phase of tagged images (the Harmonic Phase Flow, HPF). The results have been compared to manual tracking of myocardial tags. The error in displacement fields for double resolution sequences reduces 17%. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
Alan Murray |
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
IAM |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ GGB2008 |
Serial |
1508 |
|
| 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 |
Juan Ignacio Toledo |
|
| |
Title |
Information Extraction from Heterogeneous Handwritten Documents |
Type |
Book Whole |
| |
Year |
2019 |
Publication |
PhD Thesis, Universitat Autonoma de Barcelona-CVC |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
Abstract |
In this thesis we explore information Extraction from totally or partially handwritten documents. Basically we are dealing with two different application scenarios. The first scenario are modern highly structured documents like forms. In this kind of documents, the semantic information is encoded in different fields with a pre-defined location in the document, therefore, information extraction becomes roughly equivalent to transcription. The second application scenario are loosely structured totally handwritten documents, besides transcribing them, we need to assign a semantic label, from a set of known values to the handwritten words.
In both scenarios, transcription is an important part of the information extraction. For that reason in this thesis we present two methods based on Neural Networks, to transcribe handwritten text.In order to tackle the challenge of loosely structured documents, we have produced a benchmark, consisting of a dataset, a defined set of tasks and a metric, that was presented to the community as an international competition. Also, we propose different models based on Convolutional and Recurrent neural networks that are able to transcribe and assign different semantic labels to each handwritten words, that is, able to perform Information Extraction. |
|
| |
Address |
July 2019 |
|
| |
Corporate Author |
|
Thesis |
Ph.D. thesis |
|
| |
Publisher |
Ediciones Graficas Rey |
Place of Publication |
|
Editor |
Alicia Fornes;Josep Llados |
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
978-84-948531-7-3 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG; 600.140; 600.121 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ Tol2019 |
Serial |
3389 |
|
| 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 |
