toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
  Records Links
Author Jon Almazan; Alicia Fornes; Ernest Valveny edit  url
doi  isbn
openurl 
  Title A Non-Rigid Feature Extraction Method for Shape Recognition Type Conference Article
  Year 2011 Publication 11th International Conference on Document Analysis and Recognition Abbreviated Journal  
  Volume Issue Pages 987-991  
  Keywords  
  Abstract This paper presents a methodology for shape recognition that focuses on dealing with the difficult problem of large deformations. The proposed methodology consists in a novel feature extraction technique, which uses a non-rigid representation adaptable to the shape. This technique employs a deformable grid based on the computation of geometrical centroids that follows a region partitioning algorithm. Then, a feature vector is extracted by computing pixel density measures around these geometrical centroids. The result is a shape descriptor that adapts its representation to the given shape and encodes the pixel density distribution. The validity of the method when dealing with large deformations has been experimentally shown over datasets composed of handwritten shapes. It has been applied to signature verification and shape recognition tasks demonstrating high accuracy and low computational cost.  
  Address (up) Beijing; China; September 2011  
  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 978-0-7695-4520-2 Medium  
  Area Expedition Conference ICDAR  
  Notes DAG Approved no  
  Call Number Admin @ si @ AFV2011 Serial 1763  
Permanent link to this record
 

 
Author Lluis Gomez edit   pdf
openurl 
  Title Perceptual Organization for Text Extraction in Natural Scenes Type Report
  Year 2012 Publication CVC Technical Report Abbreviated Journal  
  Volume 173 Issue Pages  
  Keywords  
  Abstract  
  Address (up) Bellaterra  
  Corporate Author Thesis Master's 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 Admin @ si @ Gom2012 Serial 2309  
Permanent link to this record
 

 
Author Miquel Ferrer; Ernest Valveny; F. Serratosa edit  openurl
  Title A New Optimal Algorithm for the Generalized Median Graph Computation Based on the Maximum Common Subgraph Type Report
  Year 2007 Publication CVC Technical Report #109 Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address (up) Bellaterra (Sapin)  
  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 @ FVS2007c Serial 839  
Permanent link to this record
 

 
Author Mathieu Nicolas Delalandre; Ernest Valveny; Josep Llados edit  openurl
  Title Performance Evaluation of Symbol Recognition and Spotting Systems: An Overview Type Report
  Year 2008 Publication CVC Technical Report #117 Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address (up) Bellaterra (Spain)  
  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 @ DVL2008a Serial 946  
Permanent link to this record
 

 
Author Agata Lapedriza; Jaume Garcia; Ernest Valveny; Robert Benavente; Miquel Ferrer; Gemma Sanchez edit  openurl
  Title Una experiencia de aprenentatge basada en projectes en el ambit de la informatica Type Miscellaneous
  Year 2008 Publication V Jornades d’Innovacio Docent (UAB) Abbreviated Journal  
  Volume Issue Pages 63  
  Keywords  
  Abstract  
  Address (up) Bellaterra (Spain)  
  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; IAM; DAG; CIC; MV Approved no  
  Call Number BCNPCL @ bcnpcl @ LGV2008 Serial 1030  
Permanent link to this record
 

 
Author Josep Llados; Gemma Sanchez; K. Tombre edit  openurl
  Title An Error-Correction Graph Grammar to Recognize Texture Symbols. Type Miscellaneous
  Year 2002 Publication Graphics Recognition: Algorithms and Apllications, LNCS 2390: 128–138, Springer Verlag. Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address (up) Berlin  
  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 @ LST2002 Serial 281  
Permanent link to this record
 

 
Author Fernando Vilariño; Dimosthenis Karatzas edit  openurl
  Title A Living Lab approach for Citizen Science in Libraries Type Conference Article
  Year 2016 Publication 1st International ECSA Conference Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address (up) Berlin; Germany; May 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 ECSA  
  Notes MV; DAG; 600.084; 600.097;SIAI Approved no  
  Call Number Admin @ si @ViK2016 Serial 2804  
Permanent link to this record
 

 
Author Juan Ignacio Toledo; Jordi Cucurull; Jordi Puiggali; Alicia Fornes; Josep Llados edit  url
doi  openurl
  Title Document Analysis Techniques for Automatic Electoral Document Processing: A Survey Type Conference Article
  Year 2015 Publication E-Voting and Identity, Proceedings of 5th international conference, VoteID 2015 Abbreviated Journal  
  Volume Issue Pages 139-141  
  Keywords Document image analysis; Computer vision; Paper ballots; Paper based elections; Optical scan; Tally  
  Abstract In this paper, we will discuss the most common challenges in electoral document processing and study the different solutions from the document analysis community that can be applied in each case. We will cover Optical Mark Recognition techniques to detect voter selections in the Australian Ballot, handwritten number recognition for preferential elections and handwriting recognition for write-in areas. We will also propose some particular adjustments that can be made to those general techniques in the specific context of electoral documents.  
  Address (up) Bern; Switzerland; September 2015  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title LNCS  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference VoteID  
  Notes DAG; 600.061; 602.006; 600.077 Approved no  
  Call Number Admin @ si @ TCP2015 Serial 2641  
Permanent link to this record
 

 
Author Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados edit   pdf
openurl 
  Title Plausibility-Graphs for Symbol Spotting in Graphical Documents Type Conference Article
  Year 2013 Publication 10th IAPR International Workshop on Graphics Recognition Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  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.
 
  Address (up) Bethlehem; PA; USA; August 2013  
  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 GREC  
  Notes DAG; 600.045; 600.056; 600.061; 601.152 Approved no  
  Call Number Admin @ si @ BDJ2013 Serial 2360  
Permanent link to this record
 

 
Author Anjan Dutta; Josep Llados; Horst Bunke; Umapada Pal edit   pdf
openurl 
  Title A Product graph based method for dual subgraph matching applied to symbol spotting Type Conference Article
  Year 2013 Publication 10th IAPR International Workshop on Graphics Recognition Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract Product graph has been shown to be an efficient way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. This paper focuses on the two major limitations of the previous version of product graph: (1) Spurious nodes and edges in the graph representation and (2) Inefficient node and edge attributes. To deal with noisy information of vectorized graphical documents, we consider a dual graph representation on the original graph representing the graphical information and the product graph is computed between the dual graphs of the query graphs and the input graph.
The dual graph with redundant edges is helpful for efficient and tolerating encoding of the structural information of the graphical documents. The adjacency matrix of the product graph locates similar path information of two graphs and exponentiating the adjacency matrix finds similar paths of greater lengths. Nodes joining similar paths between two graphs are found by combining different exponentials of adjacency matrices. An experimental investigation reveals that the recall obtained by this approach is quite encouraging.
 
  Address (up) Bethlehem; PA; USA; August 2013  
  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 GREC  
  Notes DAG Approved no  
  Call Number Admin @ si @ DLB2013b Serial 2359  
Permanent link to this record
Select All    Deselect All
 |   | 
Details

Save Citations:
Export Records: