Log In Sign Up

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

by   Zhaohua Zheng, et al.

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.


page 2

page 3

page 9

page 10

page 11

page 12

page 13

page 16


FloorPlanCAD: A Large-Scale CAD Drawing Dataset for Panoptic Symbol Spotting

Access to large and diverse computer-aided design (CAD) drawings is crit...

CAD Adjacency Computation Using Validated Numerics

We present an algorithm for computation of cell adjacencies for well-bas...

Circular Accessible Depth: A Robust Traversability Representation for UGV Navigation

In this paper, we present the Circular Accessible Depth (CAD), a robust ...

An Unique and Novel Graph Matrix for Efficient Extraction of Structural Information of Networks

In this article, we propose a new type of square matrix associated with ...

Computing list homomorphisms in geometric intersection graphs

A homomorphism from a graph G to a graph H is an edge-preserving mapping...

Cascaded Semantic and Positional Self-Attention Network for Document Classification

Transformers have shown great success in learning representations for la...