Skip to main content
Log in

Adjacency matrix generation from the image of graphs: a morphological approach

  • Published:
Machine Vision and Applications Aims and scope Submit manuscript

Abstract.

This paper presents a system for automatic generation of the adjacency matrix from the image of graphs. The graph, we assume, is printed or hand printed and available as a part of a document either separately or along with text and picture. A morphology-based approach is used here to separate components of the graphs: vertices, edges and labels. A novel technique is proposed to traverse the nonplanar edges joining the vertices. The proposed method may be used for logical compression of the information contained in the graph image in the form of an adjacency matrix. It may also be used to replace the cumbersome, error-prone and time-consuming manual method of generation of the adjacency matrix for graphs with large number of vertices and complex interconnections.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Das, A., Chanda, B. Adjacency matrix generation from the image of graphs: a morphological approach. Machine Vision and Applications 10, 9–16 (1997). https://doi.org/10.1007/s001380050054

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001380050054

Navigation