toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
  Records Links
Author Josep Llados; Enric Marti edit  openurl
  Title Graph-edit algorithms for hand-drawn graphical document recognition and their automatic introduction Type Journal Article
  Year 1999 Publication Machine Graphics & Vision journal, special issue on Graph transformation Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  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  
  Notes DAG;IAM Approved no  
  Call Number (down) IAM @ iam @ LIM1999c Serial 1569  
Permanent link to this record
 

 
Author Josep Llados; Enric Marti; Jaime Lopez-Krahe edit   pdf
doi  openurl
  Title A Hough-based method for hatched pattern detection in maps and diagrams Type Conference Article
  Year 1999 Publication Proceeding of the Fifth Int. Conf. Document Analysis and Recognition ICDAR ’99 Abbreviated Journal  
  Volume Issue Pages 479-482  
  Keywords  
  Abstract A hatched area is characterized by a set of parallel straight lines placed at regular intervals. In this paper, a Hough-based schema is introduced to recognize hatched areas in technical documents from attributed graph structures representing the document once it has been vectorized. Defining a Hough-based transform from a graph instead of the raster image allows to drastically reduce the processing time and, second, to obtain more reliable results because straight lines have already been detected in the vectorization step. A second advantage of the proposed method is that no assumptions must be made a priori about the slope and frequency of hatching patterns, but they are computed in run time for each hatched area.  
  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  
  Notes DAG;IAM; Approved no  
  Call Number (down) IAM @ iam @ LIM1999b Serial 1580  
Permanent link to this record
 

 
Author Josep Llados; Enric Marti edit  openurl
  Title A graph-edit algorithm for hand-drawn graphical document recognition and their automatic introduction into CAD systems Type Journal Article
  Year 1999 Publication Machine Graphics & Vision Abbreviated Journal  
  Volume 8 Issue Pages 195-211  
  Keywords  
  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  
  Notes DAG;IAM; Approved no  
  Call Number (down) IAM @ iam @ LIM1999 Serial 1568  
Permanent link to this record
 

 
Author Josep Llados; Horst Bunke; Enric Marti edit   pdf
openurl 
  Title Structural Recognition of hand drawn floor plans Type Conference Article
  Year 1996 Publication VI National Symposium on Pattern Recognition and Image Analysis Abbreviated Journal  
  Volume Issue Pages  
  Keywords Rotational Symmetry; Reflectional Symmetry; String Matching.  
  Abstract A system to recognize hand drawn architectural drawings in a CAD environment has been deve- loped. In this paper we focus on its high level interpretation module. To interpret a floor plan, the system must identify several building elements, whose description is stored in a library of pat- terns, as well as their spatial relationships. We propose a structural approach based on subgraph isomorphism techniques to obtain a high-level interpretation of the document. The vectorized input document and the patterns to be recognized are represented by attributed graphs. Discrete relaxation techniques (AC4 algorithm) have been applied to develop the matching algorithm. The process has been divided in three steps: node labeling, local consistency and global consistency verification. The hand drawn creation causes disturbed line drawings with several accuracy errors, which must be taken into account. Here we have identified them and the AC4 algorithm has been adapted to manage them.  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Cordoba 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;IAM; Approved no  
  Call Number (down) IAM @ iam @ LIM1995 Serial 1565  
Permanent link to this record
 

 
Author Josep Llados;Horst Bunke; Enric Marti edit  url
isbn  openurl
  Title Using Cyclic String Matching to Find Rotational and Reflectional Symmetries in Shapes Type Conference Article
  Year 1997 Publication Intelligent Robots: Sensing, Modeling and Planning Abbreviated Journal  
  Volume Issue Pages 164-179  
  Keywords  
  Abstract Dagstuhl Workshop  
  Address  
  Corporate Author Thesis  
  Publisher World Scientific Press Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN 9810231857 Medium  
  Area Expedition Conference  
  Notes DAG;IAM; Approved no  
  Call Number (down) IAM @ iam @ LBM1997b Serial 1563  
Permanent link to this record
 

 
Author Josep Llados; Horst Bunke; Enric Marti edit   pdf
url  doi
openurl 
  Title Finding rotational symmetries by cyclic string matching Type Journal Article
  Year 1997 Publication Pattern recognition letters Abbreviated Journal PRL  
  Volume 18 Issue 14 Pages 1435-1442  
  Keywords Rotational symmetry; Reflectional symmetry; String matching  
  Abstract Symmetry is an important shape feature. In this paper, a simple and fast method to detect perfect and distorted rotational symmetries of 2D objects is described. The boundary of a shape is polygonally approximated and represented as a string. Rotational symmetries are found by cyclic string matching between two identical copies of the shape string. The set of minimum cost edit sequences that transform the shape string to a cyclically shifted version of itself define the rotational symmetry and its order. Finally, a modification of the algorithm is proposed to detect reflectional symmetries. Some experimental results are presented to show the reliability of the proposed algorithm  
  Address  
  Corporate Author Thesis  
  Publisher Elsevier 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;IAM; Approved no  
  Call Number (down) IAM @ iam @ LBM1997a Serial 1562  
Permanent link to this record
 

 
Author Josep Llados; Horst Bunke; Enric Marti edit  openurl
  Title Using cyclic string matching to find rotational and reflectional symmetric shapes Type Conference Article
  Year 1996 Publication Dagstuhl Seminar on Modelling and Planning for Sensor–based Intelligent Robot Systems Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher World Scientific Place of Publication Saarbrucken (Germany). Editor R.C. Bolles, H.B.H.N.  
  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;IAM Approved no  
  Call Number (down) IAM @ iam @ LBM1996 Serial 1564  
Permanent link to this record
 

 
Author Dimosthenis Karatzas;Ch. Lioutas edit  openurl
  Title Software Package Development for Electron Diffraction Image Analysis Type Conference Article
  Year 1998 Publication Proceedings of the XIV Solid State Physics National Conference Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address Ioannina, Greece  
  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 (down) IAM @ iam @ KaL1998 Serial 2045  
Permanent link to this record
 

 
Author Debora Gil; Jordi Gonzalez; Gemma Sanchez (eds) edit  isbn
openurl 
  Title Computer Vision: Advances in Research and Development Type Book Whole
  Year 2007 Publication Proceedings of the 2nd CVC International Workshop Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher UAB Place of Publication Bellaterra (Spain) Editor Debora Gil; Jordi Gonzalez; Gemma Sanchez  
  Language Summary Language Original Title  
  Series Editor Series Title 2 Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN 978-84-935251-4-9 Medium  
  Area Expedition Conference  
  Notes IAM; ISE; DAG Approved no  
  Call Number (down) IAM @ iam @ GGS2007 Serial 1493  
Permanent link to this record
 

 
Author Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; I. Bardaji; Horst Bunke edit  openurl
  Title A Generic Framework for Median Graph Computation based on a Recursive Embedding Approach Type Journal Article
  Year 2011 Publication Computer Vision and Image Understanding Abbreviated Journal CVIU  
  Volume 115 Issue 7 Pages 919-928  
  Keywords Median Graph, Graph Embedding, Graph Matching, Structural Pattern Recognition  
  Abstract The median graph has been shown to be a good choice to obtain a represen- tative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain approximations of the median graph. The problem with such an approach is how to go from a point in the vector space back to a graph in the graph space. The main contribution of this paper is the generalization of this previ- ous method, proposing a generic recursive procedure that permits to recover the graph corresponding to a point in the vector space, introducing only the amount of approximation inherent to the use of graph matching algorithms. In order to evaluate the proposed method, we compare it with the set me- dian and with the other state-of-the-art embedding-based methods for the median graph computation. The experiments are carried out using four dif- ferent databases (one semi-artificial and three containing real-world data). Results show that with the proposed approach we can obtain better medi- ans, in terms of the sum of distances to the training graphs, than with the previous existing methods.  
  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  
  Notes DAG Approved no  
  Call Number (down) IAM @ iam @ FKV2011 Serial 1831  
Permanent link to this record
Select All    Deselect All
 |   | 
Details

Save Citations:
Export Records: