|
|
Agnes Borras and Josep Llados. 2005. Object Image Retrieval by Shape Content in Complex Scenes Using Geometric Constraints. Pattern Recognition And Image Analysis. Springer Link, 325–332.
Abstract: This paper presents an image retrieval system based on 2D shape information. Query shape objects and database images are repre- sented by polygonal approximations of their contours. Afterwards they are encoded, using geometric features, in terms of predefined structures. Shapes are then located in database images by a voting procedure on the spatial domain. Then an alignment matching provides a probability value to rank de database image in the retrieval result. The method al- lows to detect a query object in database images even when they contain complex scenes. Also the shape matching tolerates partial occlusions and affine transformations as translation, rotation or scaling.
|
|
|
|
Lluis Gomez and Dimosthenis Karatzas. 2015. Object Proposals for Text Extraction in the Wild. 13th International Conference on Document Analysis and Recognition ICDAR2015.206–210.
Abstract: Object Proposals is a recent computer vision technique receiving increasing interest from the research community. Its main objective is to generate a relatively small set of bounding box proposals that are most likely to contain objects of interest. The use of Object Proposals techniques in the scene text understanding field is innovative. Motivated by the success of powerful while expensive techniques to recognize words in a holistic way, Object Proposals techniques emerge as an alternative to the traditional text detectors. In this paper we study to what extent the existing generic Object Proposals methods may be useful for scene text understanding. Also, we propose a new Object Proposals algorithm that is specifically designed for text and compare it with other generic methods in the state of the art. Experiments show that our proposal is superior in its ability of producing good quality word proposals in an efficient way. The source code of our method is made publicly available
|
|
|
|
Ali Furkan Biten, Ruben Tito, Lluis Gomez, Ernest Valveny and Dimosthenis Karatzas. 2022. OCR-IDL: OCR Annotations for Industry Document Library Dataset. ECCV Workshop on Text in Everything.
Abstract: Pretraining has proven successful in Document Intelligence tasks where deluge of documents are used to pretrain the models only later to be finetuned on downstream tasks. One of the problems of the pretraining approaches is the inconsistent usage of pretraining data with different OCR engines leading to incomparable results between models. In other words, it is not obvious whether the performance gain is coming from diverse usage of amount of data and distinct OCR engines or from the proposed models. To remedy the problem, we make public the OCR annotations for IDL documents using commercial OCR engine given their superior performance over open source OCR models. The contributed dataset (OCR-IDL) has an estimated monetary value over 20K US$. It is our hope that OCR-IDL can be a starting point for future works on Document Intelligence. All of our data and its collection process with the annotations can be found in this https URL.
|
|
|
|
Alicia Fornes, Josep Llados and Gemma Sanchez. 2007. Old Handwritten Musical Symbol Classification by a Dynamic Time Warping Based Method. Seventh IAPR International Workshop on Graphics Recognition.26–27.
|
|
|
|
Alicia Fornes, Josep Llados and Gemma Sanchez. 2008. Old Handwritten Musical Symbol Classification by a Dynamic TimeWrapping Based Method. In W. Liu, J.L., J.M. Ogier, ed. Graphics Recognition: Recent Advances and New Opportunities.52–60. (LNCS.)
|
|
|
|
David Fernandez, Josep Llados, Alicia Fornes and R.Manmatha. 2012. On Influence of Line Segmentation in Efficient Word Segmentation in Old Manuscripts. 13th International Conference on Frontiers in Handwriting Recognition.763–768.
Abstract: he objective of this work is to show the importance of a good line segmentation to obtain better results in the segmentation of words of historical documents. We have used the approach developed by Manmatha and Rothfeder [1] to segment words in old handwritten documents. In their work the lines of the documents are extracted using projections. In this work, we have developed an approach to segment lines more efficiently. The new line segmentation algorithm tackles with skewed, touching and noisy lines, so it is significantly improves word segmentation. Experiments using Spanish documents from the Marriages Database of the Barcelona Cathedral show that this approach reduces the error rate by more than 20%
Keywords: document image processing;handwritten character recognition;history;image segmentation;Spanish document;historical document;line segmentation;old handwritten document;old manuscript;word segmentation;Bifurcation;Dynamic programming;Handwriting recognition;Image segmentation;Measurement;Noise;Skeleton;Segmentation;document analysis;document and text processing;handwriting analysis;heuristics;path-finding
|
|
|
|
Oriol Ramos Terrades, Ernest Valveny and Salvatore Tabbone. 2007. On the Combination of Ridgelets Descriptors for Symbol Recognition. Seventh IAPR International Workshop on Graphics Recognition.18–20.
|
|
|
|
Oriol Ramos Terrades, Ernest Valveny and Salvatore Tabbone. 2008. On the Combination of Ridgelets Descriptors for Symbol Recognition. Graphics Recognition: Recent Advances and New Oportunities, W. Lius, J. Llados, J.M. Ogier, LNCS 5046:104–113.
|
|
|
|
Jaume Gibert, Ernest Valveny, Horst Bunke and Alicia Fornes. 2012. On the Correlation of Graph Edit Distance and L1 Distance in the Attribute Statistics Embedding Space. Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop. Springer-Berlag, Berlin, 135–143. (LNCS.)
Abstract: Graph embeddings in vector spaces aim at assigning a pattern vector to every graph so that the problems of graph classification and clustering can be solved by using data processing algorithms originally developed for statistical feature vectors. An important requirement graph features should fulfil is that they reproduce as much as possible the properties among objects in the graph domain. In particular, it is usually desired that distances between pairs of graphs in the graph domain closely resemble those between their corresponding vectorial representations. In this work, we analyse relations between the edit distance in the graph domain and the L1 distance of the attribute statistics based embedding, for which good classification performance has been reported on various datasets. We show that there is actually a high correlation between the two kinds of distances provided that the corresponding parameter values that account for balancing the weight between node and edge based features are properly selected.
|
|
|
|
David Fernandez, Pau Riba, Alicia Fornes and Josep Llados. 2014. On the Influence of Key Point Encoding for Handwritten Word Spotting. 14th International Conference on Frontiers in Handwriting Recognition.476–481.
Abstract: In this paper we evaluate the influence of the selection of key points and the associated features in the performance of word spotting processes. In general, features can be extracted from a number of characteristic points like corners, contours, skeletons, maxima, minima, crossings, etc. A number of descriptors exist in the literature using different interest point detectors. But the intrinsic variability of handwriting vary strongly on the performance if the interest points are not stable enough. In this paper, we analyze the performance of different descriptors for local interest points. As benchmarking dataset we have used the Barcelona Marriage Database that contains handwritten records of marriages over five centuries.
Keywords: Local descriptors; Interest points; Handwritten documents; Word spotting; Historical document analysis
|
|
