跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2605.00722 · v2

From Points to Targets: Online Foreground Affinity and Background Learning for Infrared Small Target Detection

首次提交 2026-05-01 23:08
版本更新 2026-11-06 18:24
雷达观测 2026-11-09 11:19
arXiv ↗PDF ↗

摘要

Infrared small-target detection must identify a few faint target pixels in extensive background clutter while keeping false alarms low. Under single-point supervision, each target has only one labeled foreground pixel with unknown spatial extent during training, whereas the detector must recover complete targets from the infrared image without any point guidance at inference. Existing methods typically reconstruct regional pseudo-labels from local cues or intermediate predictions, which can introduce boundary noise around blurry target edges. Instead of turning uncertain boundaries into dense pseudo-masks, we propose Online Foreground Affinity and Background Learning (OABL), a single-stage framework that learns target structure directly from sparse points. First, for online foreground affinity learning, each annotated target point serves as a feature anchor, and local spatial proximity and intensity similarity weight the feature alignment between the point and surrounding pixels, guiding target-related representations without hard boundary labels. Second, for online background learning, we exclude the ambiguous neighborhood around each target point and select high-response false alarms outside this region as active negatives. Averaging the background loss over this active set keeps sparse target-like clutter influential as easy background pixels are suppressed. Jointly optimizing these objectives in a single stage updates the detector directly without generating or refreshing persistent pseudo-masks. Across three public datasets and the combined SIRST3 benchmark, OABL improves detection probability by 1.06--7.82 percentage points over matched PAL training at a false-alarm area rate of $2 \times 10^{-5}$ and avoids PAL's multi-stage full-pool label updates.

作者备注:10 pages, 6 figures, 8 tables

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-06 18:24 · 最新观测版本

From Points to Targets: Online Foreground Affinity and Background Learning for Infrared Small Target Detection

Infrared small-target detection must identify a few faint target pixels in extensive background clutter while keeping false alarms low. Under single-point supervision, each target has only one labeled foreground pixel with unknown spatial extent during training, whereas the detector must recover complete targets from the infrared image without any point guidance at inference. Existing methods typically reconstruct regional pseudo-labels from local cues or intermediate predictions, which can introduce boundary noise around blurry target edges. Instead of turning uncertain boundaries into dense pseudo-masks, we propose Online Foreground Affinity and Background Learning (OABL), a single-stage framework that learns target structure directly from sparse points. First, for online foreground affinity learning, each annotated target point serves as a feature anchor, and local spatial proximity and intensity similarity weight the feature alignment between the point and surrounding pixels, guiding target-related representations without hard boundary labels. Second, for online background learning, we exclude the ambiguous neighborhood around each target point and select high-response false alarms outside this region as active negatives. Averaging the background loss over this active set keeps sparse target-like clutter influential as easy background pixels are suppressed. Jointly optimizing these objectives in a single stage updates the detector directly without generating or refreshing persistent pseudo-masks. Across three public datasets and the combined SIRST3 benchmark, OABL improves detection probability by 1.06--7.82 percentage points over matched PAL training at a false-alarm area rate of $2 \times 10^{-5}$ and avoids PAL's multi-stage full-pool label updates.

查看此版本解读 →查看此版本原文 ↗