---
title: Noise-Suppression FPN (NS-FPN)
url: https://www.emergentmind.com/topics/noise-suppression-feature-pyramid-network-ns-fpn
type: topic
---

# Noise-Suppression FPN (NS-FPN)

A Noise-Suppression Feature Pyramid Network (NS-FPN) is an architectural variant of the standard Feature Pyramid Network (FPN) framework, explicitly engineered to suppress both high-frequency and spatially distributed noise during multi-scale feature fusion. NS-FPN has been introduced to enhance the robustness and discriminativeness of convolutional neural network-based detectors and segmenters, particularly in the context of infrared small target detection and segmentation (IRSTDS) amid substantial background clutter and sensor noise. Unlike previous FPN variants that primarily emphasize feature representation enhancement, NS-FPN prioritizes noise removal via frequency-domain purification and structured, content-adaptive multi-scale fusion, yielding significant reductions in false alarms and improved detection accuracy [2508.06878].

## 1. Architectural Overview

NS-FPN retains the canonical top-down pathway and lateral connection paradigm of the standard FPN, but introduces two functionally novel modules: Low-Frequency Guided Feature Purification (LFP) and Spiral-Aware Feature Sampling (SFS). Each 1×1 lateral convolution in the FPN is replaced with an LFP block, while conventional upsampling plus summation operations are replaced by SFS (except at the highest pyramid level, where LFP is used in isolation).

The processing chain is as follows:

- The backbone network (e.g., ResNet) extracts multi-level features ($C_1$ through $C_4$), each of which is channel-reduced via a 1×1 convolution to produce $\{X_1, X_2, X_3, X_4\}$.
- Each $X_i$ undergoes LFP, outputting $X_i'$.
- The top-down pathway fuses pyramid levels by recursively applying SFS: $Y_4=X_4'$, $Y_3=\mathrm{SFS}(X_3', Y_4)$, $Y_2=\mathrm{SFS}(X_2', Y_3)$, $Y_1=\mathrm{SFS}(X_1', Y_2)$.
- The fused pyramidal outputs $\{Y_1, Y_2, Y_3, Y_4\}$ are passed to subsequent detection or mask heads.

Parameter and computational complexities increase marginally compared to standard FPN: total parameters grow from 3.91M to 4.17M, and FLOPs from 6.80G to 7.96G on a 512×512 input [2508.06878].

## 2. Low-Frequency Guided Feature Purification (LFP)

The LFP module is designed to suppress high-frequency noise embedded in feature maps while retaining signal components conducive to robust target detection.

- **Frequency Decomposition:** Each feature map $f(x,y)$ is transformed to the frequency domain via Discrete Fourier Transform (DFT), yielding $F(u,v)$. A learnable low-frequency binary mask $M_\mathrm{low}(u,v)$ separates low ($F_\mathrm{low}$) and high-frequency ($F_\mathrm{high}$) components.
- **Low-Frequency Attention:** $F_\mathrm{low}$ is inverse-transformed to the spatial domain, upon which an attention map $A_s$ is computed using channel-concatenated average and max pooling followed by a two-layer 1×1 convolution and sigmoid activation.
- **Guided High-Frequency Suppression:** The high-frequency component is modulated elementwise by $A_s$, followed by a gated Gaussian filter with learnable standard deviation $\sigma$ to further attenuate weak activations:
  $$
  \tilde{F}_h(i,j)=
    \begin{cases}
      G_\sigma(\hat F_h(i, j)), & \text{if } |\hat F_h|<\tau \\
      \hat F_h(i,j),            & \text{otherwise}
    \end{cases}
  $$
- **Feature Reconstruction:** The purified feature is reconstructed as $X' = \mathcal{F}^{-1}(F_\mathrm{low} + \tilde F_\mathrm{high})$; equivalently, DWT/IDWT may be used.
  
Total additional overhead is ≈0.01M params and ≈0.01G FLOPs per stage. Backpropagation flows through both the low-pass filter and the Gaussian kernel with respect to the primary detection objective [2508.06878].

## 3. Spiral-Aware Feature Sampling (SFS)

The SFS module generalizes top-down pyramid fusion by replacing static upsampling/addition with a learnable, content- and geometry-aware attention mechanism anchored in spiral sampling.

- **Sampling Offsets:** For each head $h$ and sampling point $k$, define spiral offsets in polar coordinates $(\ell_k, \theta_{h,k})$, map to Cartesian $(\Delta x_{h,k}, \Delta y_{h,k})$, and add a global learnable bias $\epsilon^{(h,k)}$.
- **Deformable Feature Extraction:** At each spatial location, higher-level features are sampled at spiral-offset neighborhoods via bilinear interpolation.
- **Cross-Attention Fusion:** Query ($X'_i$) and key/value ($Y_{i+1}'$) inputs undergo layer normalization. Standard multi-head attention is computed:
  $$
  F_s = \mathrm{Attn}(\mathrm{LN}(X'_i),\, \mathrm{LN}(Y'_{i+1}))
  $$
  $$
  Y_i = X'_i + F_s
  $$
  with scalar form at each location:
  $$
  F_s(p) = \sum_{h=1}^H \sum_{k=1}^P w_{h,k}(p) \cdot Y_{i+1}(p + \Delta p^{(h,k)})
  $$
- **Parameter and Compute Costs:** SFS introduces ∼0.25M additional parameters, ∼1.15G more FLOPs [2508.06878].

## 4. Integration in IRSTDS Frameworks

NS-FPN is implemented as a modular, plug-in neck compatible with IRSTDS models such as MSHNet and YOLOv8n-p2. For a standard 512×512 input, backbone outputs are processed via LFP and SFS at each scale, yielding pyramidal features input to detection and segmentation heads. The design is readily adaptable to variable backbone architectures and target tasks without modification to core detection or segmentation modules.

## 5. Experimental Validation and Ablation Studies

Comprehensive evaluation on public IRSTDS datasets corroborates the efficacy of NS-FPN in both detection and segmentation:

- On IRSTD-1K, NS-FPN achieves IoU 69.3%, detection probability $P_d$ 95.2%, and false alarm rate $F_a$ 8.6, compared to baseline FPN's 67.0%, 91.2%, and 13.1, respectively. LFP and SFS modules contribute additively and synergistically, as demonstrated by ablation.
- On NUAA-SIRST, NS-FPN achieves IoU 78.8% with $F_a$ as low as 1.6.
- On detection with YOLOv8n-p2, mAP$_{50}$ is improved from 85.0% to 86.3%.
- Module-wise complexity increments over FPN are marginal (total 4.17M params, 7.96G FLOPs).

These results indicate substantial reductions in false alarms and improvements in both segmentation and detection metrics, with the bulk of gains attributable to LFP's noise purification and SFS's adaptive feature fusion [2508.06878].

## 6. Theoretical Distinction from Related Architectures

While other noise-aware FPN variants—such as the Octave convolution-based semantic attention FPN (OcSaFPN) [2012.09859] and contrastive loss-regularized NT-FPN [2507.19059]—also incorporate frequency decomposition and/or attention for robust feature fusion, NS-FPN is unique in its direct modularization of frequency-space purification (LFP) and learnable geometric fusion (SFS), and in its explicit ablation of false alarm suppressive effect. Unlike NT-FPN, which leverages contrastive objectives on embedding spaces, NS-FPN performs concrete frequency- and geometry-based modulation with negligible parameter increase and tightly integrated blocks.

A plausible implication is that NS-FPN's emphasis on pre-fusion frequency filtration rather than post-fusion attention or information regularization enables superior noise resilience without substantial model reparametrization or added supervisory loss components.

## 7. Pseudocode and Reproducibility

The forward computational graph for NS-FPN, as defined in the original work, is summarized as:

```python
function NS_FPN({C1,C2,C3,C4}):
  for i in {1,2,3,4}:
    Xi = Conv1x1(Ci,64)
    X′i = LFP(Xi)
  Y4 = X′4
  for i in {3,2,1}:
    Y_i = SFS(X′i, Y_{i+1})
  return {Y1,Y2,Y3,Y4}
```

Core module operations (DFT filtering, attention map computation, gated Gaussian filtering, and deformable spiral sampling) are mathematically specified in the primary reference [2508.06878]. These explicit formulations and the lightweight nature of the modifications facilitate direct reproduction and further experimentation within the context of IRSTDS or any multi-scale feature learning application.

Source: https://www.emergentmind.com/topics/noise-suppression-feature-pyramid-network-ns-fpn