mlsanityData to 7 Oct 2026

Accurate, Low-latency, Efficient SAR Automatic Target Recognition on FPGA

arXiv 2301.01454 ↗First posted 4 Jan 2023cs.AR cs.CV eess.IVcited by 10

Not on the map. Why?

Abstract (arXiv)

Synthetic aperture radar (SAR) automatic target recognition (ATR) is the key technique for remote-sensing image recognition. The state-of-the-art convolutional neural networks (CNNs) for SAR ATR suffer from high computation cost and large memory footprint, making them unsuitable to be deployed on resource-limited platforms, such as small/micro satellites. In this paper, we propose a comprehensive GNN-based model-architecture co-design on FPGA to address the above issues. Model design: we design a novel graph neural network (GNN) for SAR ATR. The proposed GNN model incorporates GraphSAGE layer operators and attention mechanism, achieving comparable accuracy as the state-of-the-art work with near 1/100 computation cost. Then, we propose a pruning approach including weight pruning and input pruning. While weight pruning through lasso regression reduces most parameters without accuracy drop, input pruning eliminates most input pixels with negligible accuracy drop. Architecture design: to fully unleash the computation parallelism within the proposed model, we develop a novel unified hardware architecture that can execute various computation kernels (feature aggregation, feature transformation, graph pooling). The proposed hardware design adopts the Scatter-Gather paradigm to efficiently handle the irregular computation patterns of various computation kernels. We deploy the proposed design on an embedded FPGA (AMD Xilinx ZCU104) and evaluate the performance using MSTAR dataset. Compared with the state-of-the-art CNNs, the proposed GNN achieves comparable accuracy with 1/3258 computation cost and 1/83 model size. Compared with the state-of-the-art CPU/GPU, our FPGA accelerator achieves 14.8×/2.5× speedup (latency) and is 62×/39× more energy efficient.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 15 of its 47 references that are in the map. First posted on arXiv 4 Jan 2023.

Builds on

15 of 47 references.

References · 15

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
  5. 2017Squeeze-and-Excitation Networkscited by 4,763
  6. 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,384
  7. 2018How Powerful are Graph Neural Networks?cited by 4,355
  8. 2018CBAM: Convolutional Block Attention Modulecited by 2,463
  9. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  10. 2018Link Prediction Based on Graph Neural Networkscited by 829
  11. 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
  12. 2020HyGCN: A GCN Accelerator with Hybrid Architecturecited by 73
3 more
  1. 2019GraphACT: Accelerating GCN Training on CPU-FPGA Heterogeneous Platformscited by 29
  2. 2022Model-Architecture Co-Design for High Performance Temporal GNN Inference on FPGAcited by 12
  3. 2021HP-GNN: Generating High Throughput GNN Training Implementation on CPU-FPGA Heterogeneous Platformcited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 4; 2024: 3; 2025: 2; 2026: 1.

10 papers.