2012
DOI: 10.1007/978-3-642-34166-3_58
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical Graph Representation for Symbol Spotting in Graphical Document Images

Abstract: Symbol spotting can be defined as locating given query symbol in a large collection of graphical documents. In this paper we present a hierarchical graph representation for symbols. This representation allows graph matching methods to deal with low-level vectorization errors and, thus, to perform a robust symbol spotting. To show the potential of this approach, we conduct an experiment with the SESYD dataset.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
2
1

Relationship

3
4

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 8 publications
0
11
0
Order By: Relevance
“…section 2), , which proposed the segmentation algorithm that is used in this work, as well as Broelemann (2014), which presented a collection of algorithms for sketch map understanding. Further works on sketch map understanding from the authors are Broelemann et al (2011) for street segmentation, Broelemann et al (2012 for symbol spotting in sketch maps and floor plans and Schwering et al (2014) for the alignment of sketch maps with metric maps.…”
Section: Related Workmentioning
confidence: 99%
“…section 2), , which proposed the segmentation algorithm that is used in this work, as well as Broelemann (2014), which presented a collection of algorithms for sketch map understanding. Further works on sketch map understanding from the authors are Broelemann et al (2011) for street segmentation, Broelemann et al (2012 for symbol spotting in sketch maps and floor plans and Schwering et al (2014) for the alignment of sketch maps with metric maps.…”
Section: Related Workmentioning
confidence: 99%
“…In architectural floor plan analysis, images are typically binary (bi-level) or grayscale and thus shape [49], as opposed to color for instance, is the most important visual cue for describing them. The main challenges present in this step are scale and rotation changes, [35,36,37,38] Scale and rotation invariant, robust to small variations Vectors and quadrilateral primitives V Hierarchical Plausibility Graph (HPG) [39,40] Robust to various distortions Critical points and lines V Shape, topology, and Region Adjacency Graph (RAG) [41,42] Rotation and scale invariant Image regions V Boundary and RAG [43] Rotation and scale invariant Image regions V Convexity and Near Convex Region Adjacency Graph (NCRAG) [44] Rotation and scale invariant Oriented line segments V Bag-of-GraphPaths (BoGP) [45] Rotation invariant Critical points V Jacobs' statistical grouping [46] Scale and rotation invariant Contour map V Bag-of-Relations (BoR) [47] Scale and rotation invariant and robust to irregularities Thick (solid) components, circles, corners and extremities V Cassinian ovals [48] Not invariant to scaling and rotation…”
Section: Symbol Spotting: Description Phasementioning
confidence: 99%
“…In general, hierarchical models have been successfully employed in many different domains within the computer vision and image processing field, such as, image segmentation [17,18], scene categorization [19], action recognition [49], shape classification [12], graphic recognition [50], 3D object recognition [13] etc. These approaches usually exploit some kind of pyramidal structure containing information at various resolutions.…”
Section: Hierarchical Graph Representationmentioning
confidence: 99%