Weighted Feature Fusion (WFF) Strategies

• Weighted Feature Fusion is a method to assign unequal contributions to combined features, addressing semantic mismatches in heterogeneous data.
• It employs techniques from fixed scalar scaling to learned normalized weights and channel-wise modality gating, adapting fusion across layers and modalities.
• Practical applications in segmentation, detection, and collaborative perception show that WFF yields modest, consistent improvements over naive equal-weight fusion.

Weighted Feature Fusion (WFF) denotes a family of fusion strategies in which multiple inputs are aggregated with unequal contributions rather than by uniform addition or unconstrained concatenation. In current usage, the term encompasses fixed scalar rescaling in skip connections, normalized learned weights in multi-scale feature pyramids, fast normalized fusion over encoder–bottleneck–decoder streams, channel-wise modality gating, and reliability-aware weighting in collaborative perception (Qi, 2020, Tang et al., 2024, Fan et al., 2023, Lin et al., 3 Aug 2025, Han et al., 13 Feb 2026). Taken together, these formulations indicate that WFF is less a single module than a design principle for controlling the relative influence of heterogeneous features across depth, scale, modality, space, or time.

1. Conceptual scope and design dimensions

The central motivation for WFF is asymmetry among fused sources. In encoder–decoder segmentation, shallow layers preserve texture, edges, and shape while deeper layers encode stronger semantics; direct fusion can therefore mix semantically mismatched or noisy responses (Qi, 2020). In multi-scale detection, different pyramid levels contribute unequally depending on target size and background complexity, so equal-weight fusion is a poor prior (Tang et al., 2024). In RGB-D glass segmentation, RGB is affected by transparency, reflections, and weak texture, while depth carries anomalous but informative cues that are themselves unreliable under some conditions; this makes modality-adaptive weighting preferable to naive RGB-D concatenation (Lin et al., 3 Aug 2025). In collaborative perception, remote features differ in freshness and alignment quality, so treating them equally can degrade the fused scene representation (Han et al., 13 Feb 2026).

Across these settings, WFF varies along four main axes. The first is adaptivity: weights may be fixed hyperparameters, as in scalar-weighted skip concatenation; trainable parameters, as in fast normalized fusion; or analytically computed from system variables such as Age of Information and uncertainty (Qi, 2020, Fan et al., 2023, Han et al., 13 Feb 2026). The second is granularity: weighting may be a single scalar per branch, one weight per feature level, a channel-wise modality gate, an element-wise affinity volume, or a region-of-interest weight (Qi, 2020, Zheng et al., 11 Nov 2025, Lin et al., 3 Aug 2025, Feng et al., 2024, Han et al., 13 Feb 2026). The third is normalization: some designs use raw coefficients, whereas others normalize by a sum or by softmax to stabilize scale and interpretability (Tang et al., 2024, Fan et al., 2023, Lin et al., 3 Aug 2025). The fourth is fusion operator: weighting can precede concatenation, weighted summation, multiplicative recalibration, or hybrid pipelines that combine several of these.

A common misconception is that WFF is synonymous with attention. The literature does not support that equivalence. Some WFF modules are attention-like and input-adaptive, but others are deliberately minimal, such as multiplying one feature map by a constant before concatenation (Qi, 2020). Another misconception is that WFF must be feature-space fusion in the narrow deep-learning sense. Broader usage includes pixel-space weighting, evidential branch weighting, and subspace-weighting formulations that are structurally related but not identical to neural latent-feature fusion (Deng et al., 11 Apr 2025, Gupta et al., 2024, Casazza et al., 2012).

2. Canonical mathematical forms

A minimal WFF formulation is fixed-scalar weighted concatenation. In the residual U-Net study that introduced a “weight mechanism,” ordinary fusion is written as

$X_F=\mathrm{concat}(X_1,\ldots,X_L),$

whereas the weighted variant for serially related features is

$X_F=\mathrm{concat}(a*X_1, X_L),$

with $a$ a manually chosen scalar such as $0.1$, $0.5$, or $1$ (Qi, 2020). The paper’s technical claim is not merely that weighting helps, but that placement matters: scaling the earlier member of a serial pair can narrow the semantic gap, whereas weighting a parallel branch can be absorbed into upstream convolutions and may mainly disturb optimization.

A second canonical form is the fast normalized weighted sum used in BiFPN-style fusion: $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$ Here $I_i$ are incoming feature maps, $w_i$ are learned node weights, and normalization prevents unstable scaling (Tang et al., 2024). This form appears in crack detection necks derived from PAN and BiFPN, where top-down, bottom-up, and same-level inputs are fused with learnable relative importance rather than equal coefficients.

A third form augments normalized weighting with explicit interaction terms. DSFNet uses three aligned inputs $I_1,I_2,I_3 \in \mathbb{R}^{C\times H\times W}$ and six trainable coefficients: $X_F=\mathrm{concat}(a*X_1, X_L),$0 This extends BiFPN-style fast normalized fusion by weighting not only the original inputs but also pairwise averages (Fan et al., 2023).

A fourth form is channel-wise competitive modality gating. In RGB-D glass segmentation, same-scale RGB and depth features $X_F=\mathrm{concat}(a*X_1, X_L),$1 are first summarized by global average pooling, passed through a small fully connected network, normalized across the two modalities by softmax, and fused as

$X_F=\mathrm{concat}(a*X_1, X_L),$2

The weights are global per channel rather than spatially varying (Lin et al., 3 Aug 2025).

A fifth form is reliability-and-freshness weighting in collaborative perception. After synchronization, spatial warping, temporal compensation, and uncertainty estimation, the normalized RoI weight for sender $X_F=\mathrm{concat}(a*X_1, X_L),$3 and receiver $X_F=\mathrm{concat}(a*X_1, X_L),$4 is

$X_F=\mathrm{concat}(a*X_1, X_L),$5

where $X_F=\mathrm{concat}(a*X_1, X_L),$6 is reliability derived from uncertainty and $X_F=\mathrm{concat}(a*X_1, X_L),$7 is delivery-time AoI (Han et al., 13 Feb 2026). This illustrates that WFF can be grounded in system-level variables rather than solely in learned latent attention.

3. Architectural patterns

In encoder–decoder networks, WFF often appears as a refinement of skip fusion. The simplest instance is weighted concatenation in residual U-Net and fused U-Net, where four scalar weights are inserted on skip-like concatenation paths and the baseline is recovered when all are set to $X_F=\mathrm{concat}(a*X_1, X_L),$8 (Qi, 2020). Adjacent designs use more implicit weighting. The Context Fusion Decoder Network for saliency detection combines encoder features, decoder features, and a global salient context feature; although it does not present explicit scalar branch weights, it uses global-average-pooling-based attention and $X_F=\mathrm{concat}(a*X_1, X_L),$9 channel mixing to bias skip fusion toward salient rather than merely spatially detailed content (Park et al., 2021). This suggests a broader family of context-guided WFF designs in which weighting is realized through attention and learned mixing rather than exposed coefficients.

In feature pyramids and necks, WFF serves as a selective alternative to equal-sum aggregation. BsS-YOLO replaces the default YOLOv8 FPN/PAN neck with an optimized PAN-based BiFPN, removes low-contribution nodes, adds same-level skip connections, and performs normalized weighted fusion at multi-input pyramid nodes from $a$0 to $a$1 (Tang et al., 2024). DSFNet applies fast normalized fusion near the decoding side to combine encoder, bottleneck, and decoder features and explicitly models pairwise interactions among these streams (Fan et al., 2023). In both cases, WFF is integral to a topology revision rather than an isolated plug-in.

Multimodal fusion introduces finer-grained weighting schemes. In RGB-D glass segmentation, WFF is a plug-and-play module that fuses shallow and deep RGB/depth features at multiple levels using channel-wise softmax competition between modalities (Lin et al., 3 Aug 2025). In 3D detection, LiCamFuse computes a sigmoid gate from LiDAR features, image features, and a Euclidean discrepancy descriptor, then fuses image and point features as a weighted sum; BiLiCamFuse deepens this idea with softmax-normalized local neighbor weights in both LiDAR-to-image and image-to-LiDAR directions (Jiang et al., 2022). In freespace detection, SNE-RoadSegV2 constructs an affinity volume $a$2 from cross-modal attention and contrast descriptors, then recalibrates original RGB and surface-normal features before fusion (Feng et al., 2024). These architectures show that multimodal WFF often combines correspondence modeling with weighting, rather than treating weighting as a purely semantic operation.

Hybrid and cross-domain variants extend the same principle. FIWHN for super-resolution uses adaptive residual multipliers, branch interaction coefficients derived from average and standard-deviation pooling, self-calibrating dual-branch fusion, and group-level shuffled aggregation across blocks (Li et al., 2022). Dynamic signed weighted network prediction uses concatenative heterogeneous feature fusion at node and edge level, but performs explicit attention-weighted temporal aggregation

$a$3

for historical structural features (Zhang et al., 13 Feb 2026). These examples indicate that once weighting is viewed as control over contribution rather than as a fixed module template, WFF spans both visual and non-visual architectures.

4. Empirical behavior across representative applications

Representative studies report consistent, though usually moderate, gains over naive fusion baselines. In Massachusetts building segmentation, the residual U-Net baseline reaches $a$4 mIoU, $a$5 pixel accuracy, and $a$6 mean accuracy; scalar-weighted skip fusion raises mIoU to $a$7 for $a$8 and $a$9 for $0.1$0, corresponding to about $0.1$1–$0.1$2 percentage points improvement, while the “wrong” placement $0.1$3 reduces mIoU to $0.1$4 (Qi, 2020). In the same study, fused U-Net improves from a best result of $0.1$5 mIoU at weight $0.1$6 to $0.1$7 at weight $0.1$8, a $0.1$9 gain (Qi, 2020).

In road crack detection, the baseline YOLOv8n achieves $0.5$0 mAP. Adding the BiFPN neck that uses normalized weighted fusion raises mAP to $0.5$1, with precision, recall, and F1 moving from $0.5$2, $0.5$3, and $0.5$4 to $0.5$5, $0.5$6, and $0.5$7, respectively. With additional SimAM and Shuffle Attention modules, the full BsS-YOLO reaches $0.5$8 mAP, or $0.5$9 points over baseline (Tang et al., 2024).

In medical segmentation, DSFNet’s fast normalized fusion outperforms unbounded and softmax-based fusion on Endoscene in four of five metrics, reaching Dice $1$0, IoU $1$1, MAE $1$2, Boundary_F $1$3, and S_measure $1$4 (Fan et al., 2023). The paper interprets this as evidence that lightweight normalized weighting is more effective than equal-weight or raw trainable-sum fusion for combining encoder, bottleneck, and decoder cues.

In RGB-D glass segmentation, WFF improves both region and boundary quality. For PSPNet on the MJU-Glass dataset, RGB-only performance is IoU $1$5, mIoU $1$6, and bIoU $1$7; concatenation reaches $1$8, $1$9, and $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$0; WFF reaches $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$1, $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$2, and $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$3. The paper’s headline claim is a $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$4 improvement in bIoU when WFF is integrated with PSPNet (Lin et al., 3 Aug 2025).

These results suggest that WFF most often yields improvement where naive fusion is likely to over-preserve irrelevant detail, underweight small-scale signals, or treat heterogeneous modalities as equally trustworthy. The gains are typically not orders of magnitude; rather, WFF acts as a selective bias that improves the utility of already informative features.

5. Trade-offs, limitations, and recurrent implementation issues

WFF is not uniformly adaptive, lightweight, or stable across all formulations. The simplest scalar-weighted skip fusion adds essentially no computation: in the residual U-Net study, GFLOPs remain $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$5 for both baseline and weighted models, and the overhead is reported as “+4” parameters for four scalar constants; by contrast, the tested gating mechanism adds $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$6M parameters and raises computation from $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$7 to $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$8 GFLOPs (Qi, 2020). However, this simplicity comes with reduced expressiveness: fixed scalars cannot model channel importance, spatial saliency, or input-dependent behavior.

More expressive weighted fusion can increase cost and sometimes stability risk. BsS-YOLO describes BiFPN’s weighted fusion as “fast-weighted normalization fusion,” yet also notes that BiFPN increases computational load and memory consumption and that the rapid weighted normalization technique may struggle to consistently allocate optimal weights for feature maps of varying complexity (Tang et al., 2024). In DSFNet, weights are trainable and normalized by a sum, but positivity constraints are not documented, even though such constraints are common in related BiFPN formulations (Fan et al., 2023). In the residual U-Net study, box plots over 10 runs show that the beneficial scalar placement $$O = \frac{\sum_i w_i I_i}{\sum_i w_i + \varepsilon}, \qquad \varepsilon = 0.0001.$$9 is somewhat more variable across runs than the baseline, and the paper explicitly lists increased dispersion as a shortcoming (Qi, 2020).

Granularity also creates limitations. The RGB-D glass WFF module computes weights globally for each channel from pooled descriptors; the authors note that reducing the primary fused map to $I_i$0 inevitably loses fine-grained spatial detail, even though the original feature maps are reweighted afterward (Lin et al., 3 Aug 2025). DWFF-Net for farmland habitat mapping similarly uses sample-wise level weights obtained from global average pooling and a two-layer MLP, so its weighting is level-wise and global rather than spatially adaptive within a feature map (Zheng et al., 11 Nov 2025). This indicates a common trade-off: global weighting is efficient and often robust, but it cannot express pixel-level trust variation.

A further misconception is that any weighted placement is meaningful. The scalar skip-fusion study argues that weighting is useful only when the scaled feature is serially related to the deeper feature it is fused with; in parallel connections, the scalar can be absorbed into preceding weights and mainly affects initialization or optimization dynamics (Qi, 2020). This placement sensitivity recurs in broader form across the literature: weighting is effective only when it is aligned with the actual source of mismatch or uncertainty.

6. Broader interpretations and adjacent formulations

The term WFF is often used narrowly for deep feature maps, but adjacent literatures broaden its meaning. An early face-recognition precursor multiplies PCA, DCT, histogram, and intensity feature sets by scalar weights before SVM classification; the best reported ORL result is $I_i$1 average recognition for weights $I_i$2, compared with $I_i$3 for PCA alone and $I_i$4 for equal weighting of all four feature groups (Sakthivel et al., 2010). This is feature-level weighted fusion in a direct, pre-deep-learning sense.

Other works extend weighting outside latent feature space. GBFF for few-shot image fusion computes a pixel-wise mask $I_i$5 and synthesizes a pseudo-supervised image

$I_i$6

while also reweighting losses by global positive- and boundary-region ratios (Deng et al., 11 Apr 2025). The authors explicitly position this as prior-guided pixel-weighted fusion rather than a classic learned feature-fusion block. Evidential MAGDM for OCT diagnosis similarly computes branch weights from ordered weighted belief divergence among “experts” and fuses branch outputs as

$I_i$7

which is better read as reliability-aware branch fusion than as a conventional neural WFF layer (Gupta et al., 2024). These cases show that weighted fusion can refer to a broader family of reliability-weighted aggregation procedures.

A still broader mathematical analogue appears in weighted fusion frames. In finite-dimensional Hilbert spaces, a fusion frame consists of subspaces $I_i$8 and positive weights $I_i$9 such that

$w_i$0

with fusion frame operator

$w_i$1

This is not a neural architecture, but it formalizes weighted aggregation of subspace information under stability and reconstructability constraints (Casazza et al., 2012). A plausible implication is that modern WFF modules can be viewed as empirical, data-driven descendants of a much older concern: how to combine heterogeneous components with unequal reliability while preserving global coherence.

The contemporary literature therefore supports a broad but technically consistent view of WFF. At its narrowest, it is a mechanism for assigning unequal contribution to fused tensors. At its widest, it is a general strategy for encoding trust, relevance, or complementarity in aggregation. What remains invariant across formulations is the rejection of equal-contribution fusion as a universal default.