Symbol Spotting using Full Visibility Graph Representation
Hervé Locteau, Sébastien Adam, Éric Trupin, Jacques Labiche, Pierre Héroux · 2007
Abstract. In this paper, a method for matching symbols in line-drawings is presented. Facing both segmentation and recognition of symbols is a difficult challenge. Starting from the results of a vectorization procedure, a visibility graph is built to enhance the main geometric constraints which were specified during the construction of the initial document. The cliques detection, which correspond to a perceptual grouping of primitives, is used in the system to detect regions of particular interest. Both opened and perceptually closed curves are identified from aggregation of cliques. Finally, the recognition stage uses an attributed edit distance technique to match approximated curves within the host attributed relation graph and the ones from a collection of symbols.