|
|
Philippe Dosch, & Josep Llados. (2004). Vectorial Signatures for Symbol Discrimination.
|
|
|
|
Mathieu Nicolas Delalandre, Jean-Marc Ogier, & Josep Llados. (2007). A Fast System for the Retrieval of Ornamental Letter Image. In Seventh IAPR International Workshop on Graphics Recognition (51–54).
|
|
|
|
Mathieu Nicolas Delalandre, Jean-Marc Ogier, & Josep Llados. (2008). A Fast Cbir System of Old Ornamental Letter. In J.M. Ogier J. L. W. Liu (Ed.), Graphics Reognition: Recent Advances and New Opportunities (Vol. 5046, 135–144). LNCS.
|
|
|
|
Philippe Dosch, & Ernest Valveny. (2006). Report on the Second Symbol Recognition Contest. In Graphics Recognition: Ten Years Review and Future Perspectives, W. Liu, J. Llados (Eds.), LNCS 3926: 381–397.
|
|
|
|
Anjan Dutta, Umapada Pal, Alicia Fornes, & Josep Llados. (2010). An Efficient Staff Removal Technique from Printed Musical Documents. In 20th International Conference on Pattern Recognition (1965–1968).
Abstract: Staff removal is an important preprocessing step of the Optical Music Recognition (OMR). The process aims to remove the stafflines from a musical document and retain only the musical symbols, later these symbols are used effectively to identify the music information. This paper proposes a simple but robust method to remove stafflines from printed musical scores. In the proposed methodology we have considered a staffline segment as a horizontal linkage of vertical black runs with uniform height. We have used the neighbouring properties of a staffline segment to validate it as a true segment. We have considered the dataset along with the deformations described in for evaluation purpose. From experimentation we have got encouraging results.
|
|
|
|
Mathieu Nicolas Delalandre, Tony Pridmore, Ernest Valveny, Eric Trupin, & Herve Locteau. (2007). Building Synthetic Graphical Documents for Performance Evaluation. In Seventh IAPR International Workshop on Graphics Recognition (84–87).
|
|
|
|
Mathieu Nicolas Delalandre, Tony Pridmore, Ernest Valveny, Herve Locteau, & Eric Trupin. (2008). Building Synthetic Graphical Documents for Performance Evaluation. In J.M. Ogier J. L. W. Liu (Ed.), Graphics Recognition: Recent Advances and New Opportunities (Vol. 5046, 288–298). LNCS.
|
|
|
|
Mathieu Nicolas Delalandre, Jean-Yves Ramel, Ernest Valveny, & Muhammad Muzzamil Luqman. (2009). A Performance Characterization Algorithm for Symbol Localization. In 8th IAPR International Workshop on Graphics Recognition (pp. 3–11). Springer.
Abstract: In this paper we present an algorithm for performance characterization of symbol localization systems. This algorithm is aimed to be a more “reliable” and “open” solution to characterize the performance. To achieve that, it exploits only single points as the result of localization and offers the possibility to reconsider the localization results provided by a system. We use the information about context in groundtruth, and overall localization results, to detect the ambiguous localization results. A probability score is computed for each matching between a localization point and a groundtruth region, depending on the spatial distribution of the other regions in the groundtruth. Final characterization is given with detection rate/probability score plots, describing the sets of possible interpretations of the localization results, according to a given confidence rate. We present experimentation details along with the results for the symbol localization system of [1], exploiting a synthetic dataset of architectural floorplans and electrical diagrams (composed of 200 images and 3861 symbols).
|
|
|
|
Mathieu Nicolas Delalandre, Ernest Valveny, & Josep Llados. (2008). Performance Evaluation of Symbol Recognition and Spotting Systems: An Overview.
|
|
|
|
Mathieu Nicolas Delalandre, Ernest Valveny, & Josep Llados. (2008). Performance Evaluation of Symbol Recognition and Spotting Systems. In Proceedings of the 8th International Workshop on Document Analysis Systems, (497–505).
|
|
|
|
Mathieu Nicolas Delalandre, Ernest Valveny, Tony Pridmore, & Dimosthenis Karatzas. (2010). Generation of Synthetic Documents for Performance Evaluation of Symbol Recognition & Spotting Systems. IJDAR - International Journal on Document Analysis and Recognition, 13(3), 187–207.
Abstract: This paper deals with the topic of performance evaluation of symbol recognition & spotting systems. We propose here a new approach to the generation of synthetic graphics documents containing non-isolated symbols in a real context. This approach is based on the definition of a set of constraints that permit us to place the symbols on a pre-defined background according to the properties of a particular domain (architecture, electronics, engineering, etc.). In this way, we can obtain a large amount of images resembling real documents by simply defining the set of constraints and providing a few pre-defined backgrounds. As documents are synthetically generated, the groundtruth (the location and the label of every symbol) becomes automatically available. We have applied this approach to the generation of a large database of architectural drawings and electronic diagrams, which shows the flexibility of the system. Performance evaluation experiments of a symbol localization system show that our approach permits to generate documents with different features that are reflected in variation of localization results.
|
|
|
|
Miquel Ferrer, & Ernest Valveny. (2007). Combination of OCR Engines for Page Segmentation based on Performance Evaluation. In 9th International Conference on Document Analysis and Recognition (Vol. 2, 784–788).
|
|
|
|
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valveny, & Horst Bunke. (2009). A Recursive Embedding Approach to Median Graph Computation. In 7th IAPR – TC–15 Workshop on Graph–Based Representations in Pattern Recognition (Vol. 5534, 113–123). LNCS. Springer Berlin Heidelberg.
Abstract: The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.
|
|
|
|
Alicia Fornes, Josep Llados, & Gemma Sanchez. (2005). Primitive Segmentation in Old Handwritten Music Scores.
|
|
|
|
Alicia Fornes, Josep Llados, & Gemma Sanchez. (2005). Staff and graphical primitive segmentation in old handwritten music scores.
|
|
