Instance Segmentation Based Graph Extraction for Handwritten Circuit Diagram Images

• URL: http://arxiv.org/abs/2301.03155v1
• Date: Mon, 9 Jan 2023 03:00:20 GMT
• Title: Instance Segmentation Based Graph Extraction for Handwritten Circuit Diagram Images
• Authors: Johannes Bayer, Amit Kumar Roy, Andreas Dengel
• Abstract summary: This paper describes an approach for extracting both the electrical components (including their terminals and describing texts) by the means of instance segmentation and keypoint extraction. The resulting graph extraction process consists of a simple two-step process of model inference and trivial geometric keypoint matching.
• Score: 4.365209337828563
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Handwritten circuit diagrams from educational scenarios or historic sources usually exist on analogue media. For deriving their functional principles or flaws automatically, they need to be digitized, extracting their electrical graph. Recently, the base technologies for automated pipelines facilitating this process shifted from computer vision to machine learning. This paper describes an approach for extracting both the electrical components (including their terminals and describing texts) as well their interconnections (including junctions and wire hops) by the means of instance segmentation and keypoint extraction. Consequently, the resulting graph extraction process consists of a simple two-step process of model inference and trivial geometric keypoint matching. The dataset itself, its preparation, model training and post-processing are described and publicly available.

Related papers

• Modular Graph Extraction for Handwritten Circuit Diagram Images [5.780326596446099]
  Hand-drawn circuit diagrams are still used today in the educational domain, where they serve as an easily accessible mean for trainees and students to learn drawing this type of diagrams. In order to harness the capabilities of digital circuit representations, automated means for extracting the electrical graph from graphics are required. This paper describes a modular end-to-end solution on a larger, public dataset, in which approaches for the individual sub-tasks are evaluated to form a new baseline.
  arXiv  Detail & Related papers  (2024-02-16T21:39:28Z)
• LineFormer: Rethinking Line Chart Data Extraction as Instance Segmentation [0.07521357985302306]
  LineFormer is a robust approach to line data extraction using instance segmentation. We achieve state-of-the-art performance on several benchmark synthetic and real chart datasets.
  arXiv  Detail & Related papers  (2023-05-03T00:38:24Z)
• You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction [79.15394378571132]
  We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph. The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge. We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
  arXiv  Detail & Related papers  (2023-02-27T22:56:06Z)
• Curriculum Graph Machine Learning: A Survey [51.89783017927647]
  curriculum graph machine learning (Graph CL) integrates the strength of graph machine learning and curriculum learning. This paper comprehensively overview approaches on Graph CL and present a detailed survey of recent advances in this direction.
  arXiv  Detail & Related papers  (2023-02-06T16:59:25Z)
• What does Transformer learn about source code? [26.674180481543264]
  transformer-based representation models have achieved state-of-the-art (SOTA) performance in many tasks. We propose the aggregated attention score, a method to investigate the structural information learned by the transformer. We also put forward the aggregated attention graph, a new way to extract program graphs from the pre-trained models automatically.
  arXiv  Detail & Related papers  (2022-07-18T09:33:04Z)
• Semantic keypoint-based pose estimation from single RGB frames [64.80395521735463]
  We present an approach to estimating the continuous 6-DoF pose of an object from a single RGB image. The approach combines semantic keypoints predicted by a convolutional network (convnet) with a deformable shape model. We show that our approach can accurately recover the 6-DoF object pose for both instance- and class-based scenarios.
  arXiv  Detail & Related papers  (2022-04-12T15:03:51Z)
• Learning to Generate Scene Graph from Natural Language Supervision [52.18175340725455]
  We propose one of the first methods that learn from image-sentence pairs to extract a graphical representation of localized objects and their relationships within an image, known as scene graph. We leverage an off-the-shelf object detector to identify and localize object instances, match labels of detected regions to concepts parsed from captions, and thus create "pseudo" labels for learning scene graph.
  arXiv  Detail & Related papers  (2021-09-06T03:38:52Z)
• A Neural Edge-Editing Approach for Document-Level Relation Graph Extraction [9.449257113935461]
  We treat relations in a document as a relation graph among entities. The relation graph is iteratively constructed by editing edges of an initial graph. The way to edit edges is to classify them in a close-first manner.
  arXiv  Detail & Related papers  (2021-06-18T03:46:49Z)
• Integrating 2D and 3D Digital Plant Information Towards Automatic Generation of Digital Twins [35.37983668316551]
  Ongoing standardization in Industry 4.0 supports tool vendor neutral representations of piping and instrumentation diagrams as well as 3D pipe routing. It is necessary to develop algorithms for identifying corresponding elements such as tanks and pumps from piping and instrumentation diagrams and 3D CAD models. This article focuses on automatic generation of the graphs as a prerequisite to graph matching.
  arXiv  Detail & Related papers  (2021-04-05T11:07:05Z)
• Structural Information Preserving for Graph-to-Text Generation [59.00642847499138]
  The task of graph-to-text generation aims at producing sentences that preserve the meaning of input graphs. We propose to tackle this problem by leveraging richer training signals that can guide our model for preserving input information. Experiments on two benchmarks for graph-to-text generation show the effectiveness of our approach over a state-of-the-art baseline.
  arXiv  Detail & Related papers  (2021-02-12T20:09:01Z)
• Distributed Training of Graph Convolutional Networks using Subgraph Approximation [72.89940126490715]
  We propose a training strategy that mitigates the lost information across multiple partitions of a graph through a subgraph approximation scheme. The subgraph approximation approach helps the distributed training system converge at single-machine accuracy.
  arXiv  Detail & Related papers  (2020-12-09T09:23:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.