mlsanityData to 7 Oct 2026

Confidence-feedback-weighted graph matching network: online-offline laser-induced damage site matching under complex interference

arXiv 2606.29255 ↗First posted 28 Jun 2026cs.CV cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Online inspection images of final optics in high-power laser facilities contain pseudo-damage sites that closely resemble true damage sites. Determining the authenticity of online-detected sites is therefore difficult and requires accurate matching to offline ground-truth sites. However, this matching remains highly challenging due to limited match-discriminative features, local geometric distortions, and numerous distractor sites. Existing matching models mainly suppress distractors implicitly through loss-function supervision. We propose a confidence-feedback-weighted graph matching network that requires only damage-site centroid coordinates as input. It estimates node matchability confidence from each round of matching scores and feeds it back as a reliability weight to guide subsequent edge-feature aggregation, thereby suppressing distractor propagation and enhancing cross-graph discriminability. Within this framework, a geometric consistency constraint calibrates spurious high-confidence matchability estimates, while a hard-example mining loss improves discrimination between structurally similar sites. Experiments on our Complex-Scene dataset show that the proposed method achieves a matching F1-score of 96.36% with robust and efficient performance.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 48 references that are in the map. First posted on arXiv 28 Jun 2026.

Builds on

11 of 48 references.

References · 11

  1. 2017Attention Is All You Needcited by 59,932
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  4. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  5. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
  6. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,437
  7. 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 974
  8. 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
  9. 2017Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphscited by 307
  10. 2019Graph Matching Networks for Learning the Similarity of Graph Structured Objectscited by 202
  11. 2016Best-Buddies Similarity - Robust Template Matching using Mutual Nearest Neighborscited by 12

Built on by

Not cited yet.