CVC Home

Publicacions CVC

Home |  Show All |  Simple Search |  Advanced Search  | Add Record  | Import
Quick Search:
1–1 of 1 record found matching your query (RSS):
toggle visibility Search & Display Options
Select All    Deselect All << 1 >>
List View
 | 
Citations
 | 
Details
   print
  Record Links
Author (up) Anjan Dutta; Josep Llados; Horst Bunke; Umapada Pal edit   pdf
doi  openurl
  Title Near Convex Region Adjacency Graph and Approximate Neighborhood String Matching for Symbol Spotting in Graphical Documents Type Conference Article
  Year 2013 Publication 12th International Conference on Document Analysis and Recognition Abbreviated Journal  
  Volume Issue Pages 1078-1082  
  Keywords  
  Abstract This paper deals with a subgraph matching problem in Region Adjacency Graph (RAG) applied to symbol spotting in graphical documents. RAG is a very important, efficient and natural way of representing graphical information with a graph but this is limited to cases where the information is well defined with perfectly delineated regions. What if the information we are interested in is not confined within well defined regions? This paper addresses this particular problem and solves it by defining near convex grouping of oriented line segments which results in near convex regions. Pure convexity imposes hard constraints and can not handle all the cases efficiently. Hence to solve this problem we have defined a new type of convexity of regions, which allows convex regions to have concavity to some extend. We call this kind of regions Near Convex Regions (NCRs). These NCRs are then used to create the Near Convex Region Adjacency Graph (NCRAG) and with this representation we have formulated the problem of symbol spotting in graphical documents as a subgraph matching problem. For subgraph matching we have used the Approximate Edit Distance Algorithm (AEDA) on the neighborhood string, which starts working after finding a key node in the input or target graph and iteratively identifies similar nodes of the query graph in the neighborhood of the key node. The experiments are performed on artificial, real and distorted datasets.  
  Address Washington; 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 1520-5363 ISBN Medium  
  Area Expedition Conference ICDAR  
  Notes DAG; 600.045; 600.056; 600.061; 601.152 Approved no  
  Call Number Admin @ si @ DLB2013a Serial 2358  
Permanent link to this record
Select All    Deselect All << 1 >>
List View
 | 
Citations
 | 
Details
   print
toggle visibility
Save Citations:
Export Records:
Home SQL Search  |  Library Search  |  Show Record  |  Extract Citations Help