toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
  Records Links
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 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 (up)  
  Notes OR; IAM; DAG; CIC; MV Approved no  
  Call Number BCNPCL @ bcnpcl @ LGV2008 Serial 1030  
Permanent link to this record
 

 
Author Robert Benavente; Ernest Valveny; Jaume Garcia; Agata Lapedriza; Miquel Ferrer; Gemma Sanchez edit  openurl
  Title Una experiencia de adaptacion al EEES de las asignaturas de programacion en Ingenieria Informatica Type Miscellaneous
  Year 2008 Publication V Congreso Iberoamericano de Docencia Universitaria, pp. 213–216 Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address Valencia  
  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 (up)  
  Notes OR;DAG;CIC;MV Approved no  
  Call Number BCNPCL @ bcnpcl @ BVG2008 Serial 1031  
Permanent link to this record
 

 
Author Alfons Juan-Ciscar; Gemma Sanchez edit  openurl
  Title PRIS 2008. Pattern Recognition in Information Systems. Proceedings of the 8th international Workshop on Pattern Recognition in Information systems – PRIS 2008, in conjunction with ICEIS 2008 Type Book Whole
  Year 2008 Publication Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address Barcelona (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 (up)  
  Notes DAG Approved no  
  Call Number DAG @ dag @ JuS2008 Serial 1054  
Permanent link to this record
 

 
Author Josep Llados; Marçal Rusiñol edit  doi
isbn  openurl
  Title Graphics Recognition Techniques Type Book Chapter
  Year 2014 Publication Handbook of Document Image Processing and Recognition Abbreviated Journal  
  Volume D Issue Pages 489-521  
  Keywords Dimension recognition; Graphics recognition; Graphic-rich documents; Polygonal approximation; Raster-to-vector conversion; Texture-based primitive extraction; Text-graphics separation  
  Abstract This chapter describes the most relevant approaches for the analysis of graphical documents. The graphics recognition pipeline can be splitted into three tasks. The low level or lexical task extracts the basic units composing the document. The syntactic level is focused on the structure, i.e., how graphical entities are constructed, and involves the location and classification of the symbols present in the document. The third level is a functional or semantic level, i.e., it models what the graphical symbols do and what they mean in the context where they appear. This chapter covers the lexical level, while the next two chapters are devoted to the syntactic and semantic level, respectively. The main problems reviewed in this chapter are raster-to-vector conversion (vectorization algorithms) and the separation of text and graphics components. The research and industrial communities have provided standard methods achieving reasonable performance levels. Hence, graphics recognition techniques can be considered to be in a mature state from a scientific point of view. Additionally this chapter provides insights on some related problems, namely, the extraction and recognition of dimensions in engineering drawings, and the recognition of hatched and tiled patterns. Both problems are usually associated, even integrated, in the vectorization process.  
  Address  
  Corporate Author Thesis  
  Publisher Springer London Place of Publication Editor D. Doermann; K. Tombre  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN 978-0-85729-858-4 Medium  
  Area Expedition Conference (up)  
  Notes DAG; 600.077 Approved no  
  Call Number Admin @ si @ LlR2014 Serial 2380  
Permanent link to this record
 

 
Author Jose Antonio Rodriguez; Gemma Sanchez; Josep Llados edit  openurl
  Title Categorization of Digital Ink Elements using Spectral Features Type Book Chapter
  Year 2008 Publication Graphics Recognition: Recent Advances and New Opportunities Abbreviated Journal  
  Volume 5046 Issue Pages 188–198  
  Keywords  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher Springer–Verlag Place of Publication Editor W. Liu, J. Llados, J.M. Ogier  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title LNCS  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference (up)  
  Notes DAG Approved no  
  Call Number DAG @ dag @ RSL2008 Serial 1099  
Permanent link to this record
 

 
Author Miquel Ferrer; Ernest Valveny; F. Serratosa edit  doi
openurl 
  Title Median graph: A new exact algorithm using a distance based on the maximum common subgraph Type Journal Article
  Year 2009 Publication Pattern Recognition Letters Abbreviated Journal PRL  
  Volume 30 Issue 5 Pages 579–588  
  Keywords  
  Abstract Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems.  
  Address  
  Corporate Author Thesis  
  Publisher Elsevier Science Inc. Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0167-8655 ISBN Medium  
  Area Expedition Conference (up)  
  Notes DAG Approved no  
  Call Number DAG @ dag @ FVS2009a Serial 1114  
Permanent link to this record
 

 
Author Josep Llados; Dimosthenis Karatzas; Joan Mas; Gemma Sanchez edit  openurl
  Title A Generic Architecture for the Conversion of Document Collections into Semantically Annotated Digital Archives Type Journal
  Year 2008 Publication Journal of Universal Computer Science Abbreviated Journal  
  Volume 14 Issue 18 Pages 2912–2935  
  Keywords Median Graph, Graph Embedding, Graph Matching, Structural Pattern Recognition  
  Abstract  
  Address  
  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 (up)  
  Notes DAG Approved no  
  Call Number DAG @ dag @ LKM2008 Serial 1142  
Permanent link to this record
 

 
Author Marçal Rusiñol; Josep Llados; Gemma Sanchez edit  doi
openurl 
  Title Symbol Spotting in Vectorized Technical Drawings Through a Lookup Table of Region Strings Type Journal Article
  Year 2010 Publication Pattern Analysis and Applications Abbreviated Journal PAA  
  Volume 13 Issue 3 Pages 321-331  
  Keywords  
  Abstract In this paper, we address the problem of symbol spotting in technical document images applied to scanned and vectorized line drawings. Like any information spotting architecture, our approach has two components. First, symbols are decomposed in primitives which are compactly represented and second a primitive indexing structure aims to efficiently retrieve similar primitives. Primitives are encoded in terms of attributed strings representing closed regions. Similar strings are clustered in a lookup table so that the set median strings act as indexing keys. A voting scheme formulates hypothesis in certain locations of the line drawing image where there is a high presence of regions similar to the queried ones, and therefore, a high probability to find the queried graphical symbol. The proposed approach is illustrated in a framework consisting in spotting furniture symbols in architectural drawings. It has been proved to work even in the presence of noise and distortion introduced by the scanning and raster-to-vector processes.  
  Address  
  Corporate Author Thesis  
  Publisher Springer-Verlag Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 1433-7541 ISBN Medium  
  Area Expedition Conference (up)  
  Notes DAG Approved no  
  Call Number DAG @ dag @ RLS2010 Serial 1165  
Permanent link to this record
 

 
Author Marçal Rusiñol; Josep Llados edit  url
openurl 
  Title A Performance Evaluation Protocol for Symbol Spotting Systems in Terms of Recognition and Location Indices Type Journal Article
  Year 2009 Publication International Journal on Document Analysis and Recognition Abbreviated Journal IJDAR  
  Volume 12 Issue 2 Pages 83-96  
  Keywords Performance evaluation; Symbol Spotting; Graphics Recognition  
  Abstract Symbol spotting systems are intended to retrieve regions of interest from a document image database where the queried symbol is likely to be found. They shall have the ability to recognize and locate graphical symbols in a single step. In this paper, we present a set of measures to evaluate the performance of a symbol spotting system in terms of recognition abilities, location accuracy and scalability. We show that the proposed measures allow to determine the weaknesses and strengths of different methods. In particular we have tested a symbol spotting method based on a set of four different off-the-shelf shape descriptors.  
  Address  
  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 1433-2833 ISBN Medium  
  Area Expedition Conference (up)  
  Notes DAG Approved no  
  Call Number DAG @ dag @ RuL2009a Serial 1166  
Permanent link to this record
 

 
Author Miquel Ferrer; Ernest Valveny; F. Serratosa edit  doi
openurl 
  Title Median Graphs: A Genetic Approach based on New Theoretical Properties Type Journal Article
  Year 2009 Publication Pattern Recognition Abbreviated Journal PR  
  Volume 42 Issue 9 Pages 2003–2012  
  Keywords Median graph; Genetic search; Maximum common subgraph; Graph matching; Structural pattern recognition  
  Abstract Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs.  
  Address  
  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 (up)  
  Notes DAG Approved no  
  Call Number DAG @ dag @ FVS2009b Serial 1167  
Permanent link to this record
Select All    Deselect All
 |   | 
Details

Save Citations:
Export Records: