GAT-CADNet: Graph Attention Network for Panoptic Symbol Spotting in CAD Drawings

• URL: http://arxiv.org/abs/2201.00625v1
• Date: Mon, 3 Jan 2022 13:08:28 GMT
• Title: GAT-CADNet: Graph Attention Network for Panoptic Symbol Spotting in CAD Drawings
• Authors: Zhaohua Zheng, Jianfang Li
• Abstract summary: Spotting graphical symbols from the computer-aided design (CAD) drawings is essential to many industrial applications. By treating each CAD drawing as a graph, we propose a novel graph attention network GAT-CADNet. The proposed GAT-CADNet is intuitive yet effective and manages to solve the panoptic symbol spotting problem in one consolidated network.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Spotting graphical symbols from the computer-aided design (CAD) drawings is essential to many industrial applications. Different from raster images, CAD drawings are vector graphics consisting of geometric primitives such as segments, arcs, and circles. By treating each CAD drawing as a graph, we propose a novel graph attention network GAT-CADNet to solve the panoptic symbol spotting problem: vertex features derived from the GAT branch are mapped to semantic labels, while their attention scores are cascaded and mapped to instance prediction. Our key contributions are three-fold: 1) the instance symbol spotting task is formulated as a subgraph detection problem and solved by predicting the adjacency matrix; 2) a relative spatial encoding (RSE) module explicitly encodes the relative positional and geometric relation among vertices to enhance the vertex attention; 3) a cascaded edge encoding (CEE) module extracts vertex attentions from multiple stages of GAT and treats them as edge encoding to predict the adjacency matrix. The proposed GAT-CADNet is intuitive yet effective and manages to solve the panoptic symbol spotting problem in one consolidated network. Extensive experiments and ablation studies on the public benchmark show that our graph-based approach surpasses existing state-of-the-art methods by a large margin.

Related papers

• Pixel-Wise Symbol Spotting via Progressive Points Location for Parsing CAD Images [1.5736099356327244]
  We propose to label and spot symbols from CAD images that are converted from CAD drawings. The advantage of spotting symbols from CAD images lies in the low requirement of labelers and the low-cost annotation. Based on the keypoints detection, we propose a symbol grouping method to redraw the rectangle symbols in CAD images.
  arXiv  Detail & Related papers  (2024-04-17T01:35:52Z)
• Symbol as Points: Panoptic Symbol Spotting via Point-based Representation [18.61469313164712]
  This work studies the problem of panoptic symbol spotting in computer-aided design (CAD) drawings. We take a different approach, which treats graphic primitives as a set of 2D points that are locally connected. Specifically, we utilize a point transformer to extract the primitive features and append a mask2former-like spotting head to predict the final output.
  arXiv  Detail & Related papers  (2024-01-19T08:44:52Z)
• Graph Transformer GANs with Graph Masked Modeling for Architectural Layout Generation [153.92387500677023]
  We present a novel graph Transformer generative adversarial network (GTGAN) to learn effective graph node relations. The proposed graph Transformer encoder combines graph convolutions and self-attentions in a Transformer to model both local and global interactions. We also propose a novel self-guided pre-training method for graph representation learning.
  arXiv  Detail & Related papers  (2024-01-15T14:36:38Z)
• BOURNE: Bootstrapped Self-supervised Learning Framework for Unified Graph Anomaly Detection [50.26074811655596]
  We propose a novel unified graph anomaly detection framework based on bootstrapped self-supervised learning (named BOURNE) By swapping the context embeddings between nodes and edges, we enable the mutual detection of node and edge anomalies. BOURNE can eliminate the need for negative sampling, thereby enhancing its efficiency in handling large graphs.
  arXiv  Detail & Related papers  (2023-07-28T00:44:57Z)
• Graph Spectral Embedding using the Geodesic Betweeness Centrality [76.27138343125985]
  We introduce the Graph Sylvester Embedding (GSE), an unsupervised graph representation of local similarity, connectivity, and global structure. GSE uses the solution of the Sylvester equation to capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2022-05-07T04:11:23Z)
• SSR-GNNs: Stroke-based Sketch Representation with Graph Neural Networks [34.759306840182205]
  This paper investigates a graph representation for sketches, where the information of strokes, i.e., parts of a sketch, are encoded on vertices and information of inter-stroke on edges. The resultant graph representation facilitates the training of a Graph Neural Networks for classification tasks. The proposed representation enables generation of novel sketches that are structurally similar to while separable from the existing dataset.
  arXiv  Detail & Related papers  (2022-04-27T19:18:01Z)
• Two-Stream Graph Convolutional Network for Intra-oral Scanner Image Segmentation [133.02190910009384]
  We propose a two-stream graph convolutional network (i.e., TSGCN) to handle inter-view confusion between different raw attributes. Our TSGCN significantly outperforms state-of-the-art methods in 3D tooth (surface) segmentation.
  arXiv  Detail & Related papers  (2022-04-19T10:41:09Z)
• MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs [55.66953093401889]
  Masked graph autoencoder (MGAE) framework to perform effective learning on graph structure data. Taking insights from self-supervised learning, we randomly mask a large proportion of edges and try to reconstruct these missing edges during training.
  arXiv  Detail & Related papers  (2022-01-07T16:48:07Z)
• FloorPlanCAD: A Large-Scale CAD Drawing Dataset for Panoptic Symbol Spotting [38.987494792258694]
  We present FloorPlanCAD, a large-scale real-world CAD drawing dataset containing over 10,000 floor plans. We propose a novel method by combining Graph Convolutional Networks (GCNs) with Convolutional Neural Networks (CNNs) The proposed CNN-GCN method achieved state-of-the-art (SOTA) performance on the task of semantic symbol spotting.
  arXiv  Detail & Related papers  (2021-05-15T06:01:11Z)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)
• Adaptive Graph Convolutional Network with Attention Graph Clustering for Co-saliency Detection [35.23956785670788]
  We present a novel adaptive graph convolutional network with attention graph clustering (GCAGC) We develop an attention graph clustering algorithm to discriminate the common objects from all the salient foreground objects in an unsupervised fashion. We evaluate our proposed GCAGC method on three cosaliency detection benchmark datasets.
  arXiv  Detail & Related papers  (2020-03-13T09:35:59Z)

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.