CASR-PAN: Adaptive Sparse Routing Network

• The paper introduces CASR-PAN, which leverages content-adaptive sparse routing to efficiently fuse multi-scale features for improved infrared gas leak detection.
• It utilizes an Importance Estimator and dynamic routing weights through spatial gating and fusion blocks to selectively transmit salient information.
• Empirical findings show CASR-PAN outperforms dense fusion methods, delivering higher AP scores and reducing GFLOPs and parameters in challenging detection tasks.

The Content-Adaptive Sparse Routing Path Aggregation Network (CASR-PAN) is a neural feature aggregation architecture designed for cross-scale feature fusion in detection networks, particularly within the context of the PEG-DRNet framework for infrared gas leak detection. CASR-PAN implements sparse, content-adaptive routing of multi-scale features, selectively propagating information across spatial locations and resolution levels based on dynamic, data-driven cues. This architecture addresses redundancies and inefficiencies in traditional dense path aggregation necks by leveraging spatial gating and explicit modulation mechanisms, yielding improvements in both accuracy and computational efficiency in challenging object detection scenarios (Li et al., 29 Dec 2025).

1. Architectural Structure and Component Design

CASR-PAN is situated between the feature extraction backbone (Physics–Edge Hybrid) and the detection decoder (RT-DETR). Its role is to fuse multi-scale feature maps, specifically $\{P3, P4, P5\}$, using path-specific, content-adaptive control. The core components are:

• Importance Estimator (IE): Takes a feature map $X\in\mathbb{R}^{B\times C\times H\times W}$ and generates an importance tensor $I$ via fusion of three cues:
  • Global ($G$): Global-average pooling followed by $1\times 1$ convolutions and nonlinearity.
  • Local ($L$): Local context via $3\times 3$ convolution and further transformation.
  • Diversity ($D$): $1\times 1$ convolution, ReLU, sigmoid, and per-channel variance.
  • Softmax-normalized scalar weights $(w_g, w_l, w_d)$ combine these into $X\in\mathbb{R}^{B\times C\times H\times W}$0.
• Routing Weight Generation: A $X\in\mathbb{R}^{B\times C\times H\times W}$1 convolution transforms $X\in\mathbb{R}^{B\times C\times H\times W}$2 into four spatially-varying routing maps $X\in\mathbb{R}^{B\times C\times H\times W}$3, assigned to four functional paths.
• Adaptive Information Modulation for Fusion (AIMM-F): Blends local ($X\in\mathbb{R}^{B\times C\times H\times W}$4) and transported ($X\in\mathbb{R}^{B\times C\times H\times W}$5) features:

$X\in\mathbb{R}^{B\times C\times H\times W}$6

where $X\in\mathbb{R}^{B\times C\times H\times W}$7 denotes addition, $X\in\mathbb{R}^{B\times C\times H\times W}$8 is broadcasted multiplication, $X\in\mathbb{R}^{B\times C\times H\times W}$9 is a bias, and $I$0 is per-channel standard deviation.

• Adaptive Information Modulation for Self (AIMM-S): Enhances a feature map via self-routing:

$I$1

$I$2 provides an identity baseline.

• Explicit Routing Paths: Four defined flows:
  1. Deep ($I$3) to mid ($I$4) via AIMM-F and $I$5.
  2. Deep ($I$6) to shallow ($I$7) via AIMM-F and $I$8.
  3. Shallow ($I$9) to mid ($G$0) via AIMM-F and $G$1.
  4. Mid ($G$2) self-enhancement via AIMM-S and $G$3.

The resulting routed outputs are aggregated and refined by shallow convolutional blocks before emission to the decoder.

2. Routing Formulation and Sparsity Mechanisms

The content-adaptive routing in CASR-PAN is implemented as a spatially varying convex blend at each location $G$4:

$G$5

where $G$6 and $G$7 are local and transported feature vectors, respectively, and $G$8 is the routing weight. $G$9 is generated by applying a sigmoid nonlinearity to the output of a $1\times 1$0 convolution over the fused importance $1\times 1$1.

Sparsity arises implicitly: The sigmoid activation, together with the bias $1\times 1$2, encourages low routing weights for uninformative regions. No explicit $1\times 1$3 regularization or hard thresholding is used; paths are “sparse” in the practical sense that many $1\times 1$4 approach zero, effectively suppressing cross-scale propagation at these points.

A plausible implication is that this spatial sparsity focuses computation and transmission on salient structures, such as gas plume boundaries, rather than uniformly across the field of view.

3. Network Dataflow and Functional Workflow

The canonical forward pass through CASR-PAN can be summarized as follows:

1. Importance Estimation: For each input scale $1\times 1$5, compute global ($1\times 1$6), local ($1\times 1$7), and diversity ($1\times 1$8) cues, combine with learned weights to form $1\times 1$9.
2. Routing Map Generation: Typically, $L$0's importance $L$1 is used to generate all four routing weights through a $L$2 conv and sigmoid.
3. Routing and Fusion:
   • $L$3: AIMM-F with $L$4
   • $L$5: AIMM-F with $L$6
   • $L$7: AIMM-F with $L$8
   • $L$9 self: AIMM-S with $3\times 3$0
4. Aggregation and Output: Routed outputs targeting the same scale are summed, passed through a light RepC3 block, and forwarded along with unmodified $3\times 3$1 to the detection decoder.

This workflow fuses features in a way that is both content- and location-adaptive, differing from traditional fixed or shared-weight aggregation strategies. Pseudocode for the full forward pass is supplied verbatim in the original source (Li et al., 29 Dec 2025).

4. Computational Complexity and Efficiency Gains

CASR-PAN reduces the redundancy and parameter overhead typical of dense path aggregation networks such as BiFPN. Empirical analysis on the IIG dataset (input size $3\times 3$2) yields the following:

Variant	AP	AP$3\times 3$3	GFLOPs	Parameters
RT-DETR-R18	26.8	77.8	56.9	19.87 M
PEG-DRNet (CASR)	29.8	84.3	43.7	14.93 M

CASR-PAN adds approximately $3\times 3$4 GFLOPs and $3\times 3$5 M parameters, which is substantially less than BiFPN (which requires $3\times 3$6 GFLOPs and $3\times 3$7 M parameters). Thus, CASR-PAN saves about $3\times 3$8 GFLOPs and $3\times 3$9 M parameters while increasing AP$D$0 by roughly $D$1 points over a dense neck. This reflects both reduced computational cost and redundant fusion avoidance (Li et al., 29 Dec 2025).

5. Ablation Studies and Empirical Findings

CASR-PAN yields substantial improvements in detection metrics and cross-scale discriminability:

• The introduction of full CASR-PAN on a ResNet18 backbone increases AP from $D$2 to $D$3 and AP$D$4 from $D$5 to $D$6.
• In combination with the Physics–Edge Hybrid Backbone (PEG-DRNet), CASR-PAN achieves AP$D$7, AP$D$8, and small-object AP$D$9, all at $1\times 1$0 GFLOPs and $1\times 1$1 M parameters.
• Path ablations: Removing any of the defined routing flows results in a $1\times 1$2–$1\times 1$3 point reduction in AP.
• When tested against PANet, BiFPN, and NAS-FPN under identical backbones, CASR-PAN achieves $1\times 1$4–$1\times 1$5 point AP gains with $1\times 1$6–$1\times 1$7 fewer FLOPs.
• Small-object AP$1\times 1$8 improves by $1\times 1$9–$(w_g, w_l, w_d)$0 points, and AP$(w_g, w_l, w_d)$1 rises from about $(w_g, w_l, w_d)$2 (dense fusion) to $(w_g, w_l, w_d)$3 with CASR-PAN, indicative of improved fine localization (Li et al., 29 Dec 2025).

These findings highlight the benefit of content-selective, sparse multi-scale feature propagation in detection tasks with diffuse, weakly-bounded targets.

6. Context, Significance, and Related Methods

CASR-PAN is positioned within a landscape of cross-scale fusion methods, such as BiFPN and PANet. Unlike these dense architectures, CASR-PAN individually weighs and gates the propagation of multi-scale features, based on spatial content and edge cues. This suggests that content-adaptive sparse routing is advantageous in domains where informative features are spatially concentrated or weakly localized—such as in infrared gas-leak detection, where targets are often small and have indistinct boundaries.

The use of learned importance cues and route-specific gating advances over static or uniformly-applied fusion, allowing the system to prioritize salient features and minimize unnecessary computation. A plausible implication is that such adaptive strategies may generalize to other visual reasoning tasks requiring high sensitivity to fine local structures while maintaining efficiency.

7. Limitations and Prospective Extensions

The concept of “sparse routing” in CASR-PAN refers to implicit suppression of uninformative regions via sigmoid-based gating and additive bias. No explicit $(w_g, w_l, w_d)$4 regularization or hard sparsity constraints are applied in the published configuration, though such techniques could be explored for further efficiency. The architecture is tightly integrated with edge and physics-based modules in PEG-DRNet, and its performance improvements are demonstrated specifically for infrared gas-plume detection.

A plausible extension would be to investigate explicit regularization for increased sparsity, or to generalize the routing mechanism for broader multi-task feature fusion. The effectiveness of CASR-PAN is empirically established against established path aggregation mechanisms, suggesting its potential as a general-purpose, efficient cross-scale routing module in detection architectures (Li et al., 29 Dec 2025).