| Home | [31–40] << 41 42 43 44 45 46 47 48 49 50 >> [51–60] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Antonio Hernandez; Nadezhda Zlateva; Alexander Marinov; Miguel Reyes; Petia Radeva; Dimo Dimov; Sergio Escalera | ||||
| Title | Graph Cuts Optimization for Multi-Limb Human Segmentation in Depth Maps | Type | Conference Article | ||
| Year | 2012 | Publication  |
25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 726-732 | ||
| Keywords | |||||
| Abstract | We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps. First, from a set of random depth features, Random Forest is used to infer a set of label probabilities for each data sample. This vector of probabilities is used as unary term in α-β swap Graph-cuts algorithm. Moreover, depth of spatio-temporal neighboring data points are used as boundary potentials. Results on a new multi-label human depth data set show high performance in terms of segmentation overlapping of the novel methodology compared to classical approaches. | ||||
| Address | Portland; Oregon; June 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | MILAB;HuPBA | Approved | no | ||
| Call Number | Admin @ si @ HZM2012b | Serial | 2046 | ||
| Permanent link to this record | |||||
| Author | Fahad Shahbaz Khan; Muhammad Anwer Rao; Joost Van de Weijer; Andrew Bagdanov; Maria Vanrell; Antonio Lopez | ||||
| Title | Color Attributes for Object Detection | Type | Conference Article | ||
| Year | 2012 | Publication |
25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 3306-3313 | ||
| Keywords | pedestrian detection | ||||
| Abstract | State-of-the-art object detectors typically use shape information as a low level feature representation to capture the local structure of an object. This paper shows that early fusion of shape and color, as is popular in image classification,
leads to a significant drop in performance for object detection. Moreover, such approaches also yields suboptimal results for object categories with varying importance of color and shape. In this paper we propose the use of color attributes as an explicit color representation for object detection. Color attributes are compact, computationally efficient, and when combined with traditional shape features provide state-ofthe- art results for object detection. Our method is tested on the PASCAL VOC 2007 and 2009 datasets and results clearly show that our method improves over state-of-the-art techniques despite its simplicity. We also introduce a new dataset consisting of cartoon character images in which color plays a pivotal role. On this dataset, our approach yields a significant gain of 14% in mean AP over conventional state-of-the-art methods. |
||||
| Address | Providence; Rhode Island; USA; | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | ADAS; CIC; | Approved | no | ||
| Call Number | Admin @ si @ KRW2012 | Serial | 1935 | ||
| Permanent link to this record | |||||
| Author | Naila Murray; Luca Marchesotti; Florent Perronnin | ||||
| Title | AVA: A Large-Scale Database for Aesthetic Visual Analysis | Type | Conference Article | ||
| Year | 2012 | Publication |
25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 2408-2415 | ||
| Keywords | |||||
| Abstract | With the ever-expanding volume of visual content available, the ability to organize and navigate such content by aesthetic preference is becoming increasingly important. While still in its nascent stage, research into computational models of aesthetic preference already shows great potential. However, to advance research, realistic, diverse and challenging databases are needed. To this end, we introduce a new large-scale database for conducting Aesthetic Visual Analysis: AVA. It contains over 250,000 images along with a rich variety of meta-data including a large number of aesthetic scores for each image, semantic labels for over 60 categories as well as labels related to photographic style. We show the advantages of AVA with respect to existing databases in terms of scale, diversity, and heterogeneity of annotations. We then describe several key insights into aesthetic preference afforded by AVA. Finally, we demonstrate, through three applications, how the large scale of AVA can be leveraged to improve performance on existing preference tasks | ||||
| Address | Providence, Rhode Islan | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ MMP2012a | Serial | 2025 | ||
| Permanent link to this record | |||||
| Author | Marc Serra; Olivier Penacchio; Robert Benavente; Maria Vanrell | ||||
| Title | Names and Shades of Color for Intrinsic Image Estimation | Type | Conference Article | ||
| Year | 2012 | Publication |
25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 278-285 | ||
| Keywords | |||||
| Abstract | In the last years, intrinsic image decomposition has gained attention. Most of the state-of-the-art methods are based on the assumption that reflectance changes come along with strong image edges. Recently, user intervention in the recovery problem has proved to be a remarkable source of improvement. In this paper, we propose a novel approach that aims to overcome the shortcomings of pure edge-based methods by introducing strong surface descriptors, such as the color-name descriptor which introduces high-level considerations resembling top-down intervention. We also use a second surface descriptor, termed color-shade, which allows us to include physical considerations derived from the image formation model capturing gradual color surface variations. Both color cues are combined by means of a Markov Random Field. The method is quantitatively tested on the MIT ground truth dataset using different error metrics, achieving state-of-the-art performance. | ||||
| Address | Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ SPB2012 | Serial | 2026 | ||
| Permanent link to this record | |||||
| Author | Murad Al Haj; Jordi Gonzalez; Larry S. Davis | ||||
| Title | On Partial Least Squares in Head Pose Estimation: How to simultaneously deal with misalignment | Type | Conference Article | ||
| Year | 2012 | Publication |
25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 2602-2609 | ||
| Keywords | |||||
| Abstract | Head pose estimation is a critical problem in many computer vision applications. These include human computer interaction, video surveillance, face and expression recognition. In most prior work on heads pose estimation, the positions of the faces on which the pose is to be estimated are specified manually. Therefore, the results are reported without studying the effect of misalignment. We propose a method based on partial least squares (PLS) regression to estimate pose and solve the alignment problem simultaneously. The contributions of this paper are two-fold: 1) we show that the kernel version of PLS (kPLS) achieves better than state-of-the-art results on the estimation problem and 2) we develop a technique to reduce misalignment based on the learned PLS factors. | ||||
| Address | Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | ISE | Approved | no | ||
| Call Number | Admin @ si @ HGD2012 | Serial | 2029 | ||
| Permanent link to this record | |||||
| Author | Jose Carlos Rubio; Joan Serrat; Antonio Lopez | ||||
| Title | Unsupervised co-segmentation through region matching | Type | Conference Article | ||
| Year | 2012 | Publication |
25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 749-756 | ||
| Keywords | |||||
| Abstract | Co-segmentation is defined as jointly partitioning multiple images depicting the same or similar object, into foreground and background. Our method consists of a multiple-scale multiple-image generative model, which jointly estimates the foreground and background appearance distributions from several images, in a non-supervised manner. In contrast to other co-segmentation methods, our approach does not require the images to have similar foregrounds and different backgrounds to function properly. Region matching is applied to exploit inter-image information by establishing correspondences between the common objects that appear in the scene. Moreover, computing many-to-many associations of regions allow further applications, like recognition of object parts across images. We report results on iCoseg, a challenging dataset that presents extreme variability in camera viewpoint, illumination and object deformations and poses. We also show that our method is robust against large intra-class variability in the MSRC database. | ||||
| Address | Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ RSL2012b; ADAS @ adas @ | Serial | 2033 | ||
| Permanent link to this record | |||||
| Author | Albert Gordo; Jose Antonio Rodriguez; Florent Perronnin; Ernest Valveny | ||||
| Title | Leveraging category-level labels for instance-level image retrieval | Type | Conference Article | ||
| Year | 2012 | Publication |
25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 3045-3052 | ||
| Keywords | |||||
| Abstract | In this article, we focus on the problem of large-scale instance-level image retrieval. For efficiency reasons, it is common to represent an image by a fixed-length descriptor which is subsequently encoded into a small number of bits. We note that most encoding techniques include an unsupervised dimensionality reduction step. Our goal in this work is to learn a better subspace in a supervised manner. We especially raise the following question: “can category-level labels be used to learn such a subspace?” To answer this question, we experiment with four learning techniques: the first one is based on a metric learning framework, the second one on attribute representations, the third one on Canonical Correlation Analysis (CCA) and the fourth one on Joint Subspace and Classifier Learning (JSCL). While the first three approaches have been applied in the past to the image retrieval problem, we believe we are the first to show the usefulness of JSCL in this context. In our experiments, we use ImageNet as a source of category-level labels and report retrieval results on two standard dataseis: INRIA Holidays and the University of Kentucky benchmark. Our experimental study shows that metric learning and attributes do not lead to any significant improvement in retrieval accuracy, as opposed to CCA and JSCL. As an example, we report on Holidays an increase in accuracy from 39.3% to 48.6% with 32-dimensional representations. Overall JSCL is shown to yield the best results. | ||||
| Address | Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GRP2012 | Serial | 2050 | ||
| Permanent link to this record | |||||
| Author | Alvaro Peris; Marc Bolaños; Petia Radeva; Francisco Casacuberta | ||||
| Title | Video Description Using Bidirectional Recurrent Neural Networks | Type | Conference Article | ||
| Year | 2016 | Publication |
25th International Conference on Artificial Neural Networks | Abbreviated Journal | |
| Volume | 2 | Issue | Pages | 3-11 | |
| Keywords | Video description; Neural Machine Translation; Birectional Recurrent Neural Networks; LSTM; Convolutional Neural Networks | ||||
| Abstract | Although traditionally used in the machine translation field, the encoder-decoder framework has been recently applied for the generation of video and image descriptions. The combination of Convolutional and Recurrent Neural Networks in these models has proven to outperform the previous state of the art, obtaining more accurate video descriptions. In this work we propose pushing further this model by introducing two contributions into the encoding stage. First, producing richer image representations by combining object and location information from Convolutional Neural Networks and second, introducing Bidirectional Recurrent Neural Networks for capturing both forward and backward temporal relationships in the input frames. | ||||
| Address | Barcelona; September 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 | ICANN | ||
| Notes | MILAB; | Approved | no | ||
| Call Number | Admin @ si @ PBR2016 | Serial | 2833 | ||
| Permanent link to this record | |||||
| Author | Marco Buzzelli; Joost Van de Weijer; Raimondo Schettini | ||||
| Title | Learning Illuminant Estimation from Object Recognition | Type | Conference Article | ||
| Year | 2018 | Publication |
25th International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 3234 - 3238 | ||
| Keywords | Illuminant estimation; computational color constancy; semi-supervised learning; deep learning; convolutional neural networks | ||||
| Abstract | In this paper we present a deep learning method to estimate the illuminant of an image. Our model is not trained with illuminant annotations, but with the objective of improving performance on an auxiliary task such as object recognition. To the best of our knowledge, this is the first example of a deep
learning architecture for illuminant estimation that is trained without ground truth illuminants. We evaluate our solution on standard datasets for color constancy, and compare it with state of the art methods. Our proposal is shown to outperform most deep learning methods in a cross-dataset evaluation setup, and to present competitive results in a comparison with parametric solutions. |
||||
| Address | Athens; Greece; October 2018 | ||||
| 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 | ICIP | ||
| Notes | LAMP; 600.109; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ BWS2018 | Serial | 3157 | ||
| Permanent link to this record | |||||
| Author | Patricia Suarez; Angel Sappa; Boris X. Vintimilla; Riad I. Hammoud | ||||
| Title | Near InfraRed Imagery Colorization | Type | Conference Article | ||
| Year | 2018 | Publication |
25th International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 2237 - 2241 | ||
| Keywords | Convolutional Neural Networks (CNN), Generative Adversarial Network (GAN), Infrared Imagery colorization | ||||
| Abstract | This paper proposes a stacked conditional Generative Adversarial Network-based method for Near InfraRed (NIR) imagery colorization. We propose a variant architecture of Generative Adversarial Network (GAN) that uses multiple
loss functions over a conditional probabilistic generative model. We show that this new architecture/loss-function yields better generalization and representation of the generated colored IR images. The proposed approach is evaluated on a large test dataset and compared to recent state of the art methods using standard metrics. |
||||
| Address | Athens; Greece; October 2018 | ||||
| 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 | ICIP | ||
| Notes | MSIAU; 600.086; 600.130; 600.122 | Approved | no | ||
| Call Number | Admin @ si @ SSV2018b | Serial | 3195 | ||
| Permanent link to this record | |||||
| Author | Mohamed Ali Souibgui; Alicia Fornes; Y.Kessentini; C.Tudor | ||||
| Title | A Few-shot Learning Approach for Historical Encoded Manuscript Recognition | Type | Conference Article | ||
| Year | 2021 | Publication |
25th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 5413-5420 | ||
| Keywords | |||||
| Abstract | Encoded (or ciphered) manuscripts are a special type of historical documents that contain encrypted text. The automatic recognition of this kind of documents is challenging because: 1) the cipher alphabet changes from one document to another, 2) there is a lack of annotated corpus for training and 3) touching symbols make the symbol segmentation difficult and complex. To overcome these difficulties, we propose a novel method for handwritten ciphers recognition based on few-shot object detection. Our method first detects all symbols of a given alphabet in a line image, and then a decoding step maps the symbol similarity scores to the final sequence of transcribed symbols. By training on synthetic data, we show that the proposed architecture is able to recognize handwritten ciphers with unseen alphabets. In addition, if few labeled pages with the same alphabet are used for fine tuning, our method surpasses existing unsupervised and supervised HTR methods for ciphers recognition. | ||||
| Address | Virtual; January 2021 | ||||
| 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 | ICPR | ||
| Notes | DAG; 600.121; 600.140 | Approved | no | ||
| Call Number | Admin @ si @ SFK2021 | Serial | 3449 | ||
| Permanent link to this record | |||||
| Author | Manuel Carbonell; Pau Riba; Mauricio Villegas; Alicia Fornes; Josep Llados | ||||
| Title | Named Entity Recognition and Relation Extraction with Graph Neural Networks in Semi Structured Documents | Type | Conference Article | ||
| Year | 2020 | Publication |
25th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | The use of administrative documents to communicate and leave record of business information requires of methods
able to automatically extract and understand the content from such documents in a robust and efficient way. In addition, the semi-structured nature of these reports is specially suited for the use of graph-based representations which are flexible enough to adapt to the deformations from the different document templates. Moreover, Graph Neural Networks provide the proper methodology to learn relations among the data elements in these documents. In this work we study the use of Graph Neural Network architectures to tackle the problem of entity recognition and relation extraction in semi-structured documents. Our approach achieves state of the art results in the three tasks involved in the process. Additionally, the experimentation with two datasets of different nature demonstrates the good generalization ability of our approach. |
||||
| Address | Virtual; January 2021 | ||||
| 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 | ICPR | ||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ CRV2020 | Serial | 3509 | ||
| Permanent link to this record | |||||
| Author | M. Li; Xialei Liu; Joost Van de Weijer; Bogdan Raducanu | ||||
| Title | Learning to Rank for Active Learning: A Listwise Approach | Type | Conference Article | ||
| Year | 2020 | Publication |
25th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 5587-5594 | ||
| Keywords | |||||
| Abstract | Active learning emerged as an alternative to alleviate the effort to label huge amount of data for data hungry applications (such as image/video indexing and retrieval, autonomous driving, etc.). The goal of active learning is to automatically select a number of unlabeled samples for annotation (according to a budget), based on an acquisition function, which indicates how valuable a sample is for training the model. The learning loss method is a task-agnostic approach which attaches a module to learn to predict the target loss of unlabeled data, and select data with the highest loss for labeling. In this work, we follow this strategy but we define the acquisition function as a learning to rank problem and rethink the structure of the loss prediction module, using a simple but effective listwise approach. Experimental results on four datasets demonstrate that our method outperforms recent state-of-the-art active learning approaches for both image classification and regression tasks. | ||||
| Address | Virtual; January 2021 | ||||
| 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 | ICPR | ||
| Notes | LAMP; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ LLW2020a | Serial | 3511 | ||
| Permanent link to this record | |||||
| Author | Idoia Ruiz; Joan Serrat | ||||
| Title | Rank-based ordinal classification | Type | Conference Article | ||
| Year | 2020 | Publication |
25th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 8069-8076 | ||
| Keywords | |||||
| Abstract | Differently from the regular classification task, in ordinal classification there is an order in the classes. As a consequence not all classification errors matter the same: a predicted class close to the groundtruth one is better than predicting a farther away class. To account for this, most previous works employ loss functions based on the absolute difference between the predicted and groundtruth class labels. We argue that there are many cases in ordinal classification where label values are arbitrary (for instance 1. . . C, being C the number of classes) and thus such loss functions may not be the best choice. We instead propose a network architecture that produces not a single class prediction but an ordered vector, or ranking, of all the possible classes from most to least likely. This is thanks to a loss function that compares groundtruth and predicted rankings of these class labels, not the labels themselves. Another advantage of this new formulation is that we can enforce consistency in the predictions, namely, predicted rankings come from some unimodal vector of scores with mode at the groundtruth class. We compare with the state of the art ordinal classification methods, showing
that ours attains equal or better performance, as measured by common ordinal classification metrics, on three benchmark datasets. Furthermore, it is also suitable for a new task on image aesthetics assessment, i.e. most voted score prediction. Finally, we also apply it to building damage assessment from satellite images, providing an analysis of its performance depending on the degree of imbalance of the dataset. |
||||
| Address | Virtual; January 2021 | ||||
| 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 | ICPR | ||
| Notes | ADAS; 600.118; 600.124 | Approved | no | ||
| Call Number | Admin @ si @ RuS2020 | Serial | 3549 | ||
| Permanent link to this record | |||||
| Author | Klara Janousckova; Jiri Matas; Lluis Gomez; Dimosthenis Karatzas | ||||
| Title | Text Recognition – Real World Data and Where to Find Them | Type | Conference Article | ||
| Year | 2020 | Publication |
25th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 4489-4496 | ||
| Keywords | |||||
| Abstract | We present a method for exploiting weakly annotated images to improve text extraction pipelines. The approach uses an arbitrary end-to-end text recognition system to obtain text region proposals and their, possibly erroneous, transcriptions. The method includes matching of imprecise transcriptions to weak annotations and an edit distance guided neighbourhood search. It produces nearly error-free, localised instances of scene text, which we treat as “pseudo ground truth” (PGT). The method is applied to two weakly-annotated datasets. Training with the extracted PGT consistently improves the accuracy of a state of the art recognition model, by 3.7% on average, across different benchmark datasets (image domains) and 24.5% on one of the weakly annotated datasets 1 1 Acknowledgements. The authors were supported by Czech Technical University student grant SGS20/171/0HK3/3TJ13, the MEYS VVV project CZ.02.1.01/0.010.0J16 019/0000765 Research Center for Informatics, the Spanish Research project TIN2017-89779-P and the CERCA Programme / Generalitat de Catalunya. | ||||
| Address | Virtual; January 2021 | ||||
| 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 | ICPR | ||
| Notes | DAG; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ JMG2020 | Serial | 3557 | ||
| Permanent link to this record | |||||