|Home||<< 1 >>|
|Author||Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados|
|Title||Plausibility-Graphs for Symbol Spotting in Graphical Documents||Type||Conference Article|
|Year||2013||Publication||10th IAPR International Workshop on Graphics Recognition||Abbreviated Journal|
|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||Bethlehem; PA; USA; August 2013|
|Publisher||Place of Publication||Editor|
|Language||Summary Language||Original Title|
|Series Editor||Series Title||Abbreviated Series Title|
|Series Volume||Series Issue||Edition|
|Notes||DAG; 600.045; 600.056; 600.061; 601.152||Approved||no|
|Call Number||Admin @ si @ BDJ2013||Serial||2360|
|Permanent link to this record