|
|
Ernest Valveny, Salvatore Tabbone, Oriol Ramos Terrades and Emilie Jean-Marie Odile. 2007. Performance Characterization of Shape Descriptors for Symbol Representation. Seventh IAPR International Workshop on Graphics Recognition.82–83.
|
|
|
|
Ernest Valveny, Salvatore Tabbone and Oriol Ramos Terrades. 2008. Performance Characterization of Shape Descriptors for Symbol Representation. In W. Liu, J.L., J.M. Ogier, ed. Graphics Recognition: Recent Advances and New Opportunities.278–287. (LNCS.)
|
|
|
|
Ernest Valveny and Philippe Dosch. 2004. Performance Evaluation of Symbol Recognition. In S. Marinai, A.D.(E.),, ed. Document Analysis Systems.354–365.
|
|
|
|
Mathieu Nicolas Delalandre, Ernest Valveny and Josep Llados. 2008. Performance Evaluation of Symbol Recognition and Spotting Systems. Proceedings of the 8th International Workshop on Document Analysis Systems,.497–505.
|
|
|
|
Mathieu Nicolas Delalandre, Ernest Valveny and Josep Llados. 2008. Performance Evaluation of Symbol Recognition and Spotting Systems: An Overview.
|
|
|
|
Jaume Rodriguez, S. Yacoub, Gemma Sanchez and Josep Llados. 2006. Performance Evaluation, Comparison and Combination of Commercial Handwriting Recognition Engines.
|
|
|
|
Josep Llados. 2006. Perspectives on the Analysis of Graphical Documents.
|
|
|
|
Klaus Broelemann, Anjan Dutta, Xiaoyi Jiang and Josep Llados. 2013. Plausibility-Graphs for Symbol Spotting in Graphical Documents. 10th IAPR International Workshop on Graphics Recognition.
Abstract: Graph representation of graphical documents often suffers from noise viz. spurious nodes and spurios edges of graph and their discontinuity etc. In general these errors occur during the low-level image processing viz. binarization, skeletonization, vectorization etc. Hierarchical graph representation is a nice and efficient way to solve this kind of problem by hierarchically merging node-node and node-edge depending on the distance.
But the creation of hierarchical graph representing the graphical information often uses hard thresholds on the distance to create the hierarchical nodes (next state) of the lower nodes (or states) of a graph. As a result the representation often loses useful information. This paper introduces plausibilities to the nodes of hierarchical graph as a function of distance and proposes a modified algorithm for matching subgraphs of the hierarchical
graphs. The plausibility-annotated nodes help to improve the performance of the matching algorithm on two hierarchical structures. To show the potential of this approach, we conduct an experiment with the SESYD dataset.
|
|
|
|
Josep Llados and Enric Marti. 1997. Playing with error-tolerant subgraph isomorphism in line drawings. VII National Symposium on Pattern Recognition and image Analysis.
|
|
|
|
Alicia Fornes, Josep Llados and Gemma Sanchez. 2005. Primitive Segmentation in Old Handwritten Music Scores.
|
|
