Optical Graph Edge Recognition

Rudolfs Opmanis

Abstract

Optical graph recognition is a process that from an input raster image extracts a graph topology. Graph recognition is interesting for not only because it allows reusing information from other diagrams, but also it is a tool that can measure the readability of a graph diagram visualisation or help with a testing of automatic graph visualisation engines. In this paper, we propose an optical graph edge recognition algorithm that can recognise edges with arbitrary edge routing style, handle drawings with many edge crossings and process edges that are rendered as polylines using a solid or dashed stroke. To evaluate the proposed algorithm we have developed comprehensive test suite with 2400 graphs of various sizes, edge densities, edge routing styles and edge rendering strokes.

Download


Paper Citation


in Harvard Style

Opmanis R. (2018). Optical Graph Edge Recognition.In Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP, ISBN 978-989-758-289-9, pages 184-191. DOI: 10.5220/0006550401840191


in Bibtex Style

@conference{ivapp18,
author={Rudolfs Opmanis},
title={Optical Graph Edge Recognition},
booktitle={Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP,},
year={2018},
pages={184-191},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006550401840191},
isbn={978-989-758-289-9},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP,
TI - Optical Graph Edge Recognition
SN - 978-989-758-289-9
AU - Opmanis R.
PY - 2018
SP - 184
EP - 191
DO - 10.5220/0006550401840191