- Limited methodological novelty and an overly complicated architecture.
The proposed framework primarily combines existing techniques, including K-nearest neighbor feature aggregation, learnable gating, cross-attention, Mamba-based feature modeling, and multi-scale convolutional fusion. While their integration produces empirical improvements, the paper does not clearly establish which component introduces a fundamentally new mechanism beyond existing multimodal fusion approaches. Furthermore, the framework introduces four major modules, each containing several additional operations. The resulting architecture is considerably complicated, but the paper lacks a convincing explanation of why this particular combination is necessary. The improvements may largely originate from increased model capacity and repeated feature interactions rather than from a genuinely novel fusion principle.
- The frequency-aware decomposition in the Mamba Split Block lacks mathematical justification.
In Section 3.1, Eq. (1) defines the frequency decomposition. However, this formulation merely scales the original features using a learnable coefficient. Assuming a scalar coefficient, both branches preserve the same relative frequency distribution, rather than explicitly separating low-frequency and high-frequency components. Although subsequent convolution and pooling operations may extract different spatial patterns, this does not establish that the proposed initial decomposition is genuinely frequency-aware. The authors provide neither theoretical analysis nor frequency-domain visualizations to support this claim. Consequently, one of the central methodological motivations of the paper remains insufficiently justified.
- The GALF module contains ambiguous technical definitions that raise concerns about its correctness.
Section 3.2 describes identifying non-empty voxels by summing camera and LiDAR features along the channel dimension and checking whether the resulting values are nonzero. However, a nonzero channel sum is not a reliable indicator of voxel validity, since valid feature activations may cancel each other. Moreover, the description does not clearly explain how modality-specific non-empty voxel sets are independently recovered from a combined intensity map. The proposed neighborhood retrieval is also described as K-nearest neighbor matching, but the actual implementation involves farthest point sampling and ball queries. These operations do not necessarily guarantee exact K-nearest neighbor associations for every query voxel. Important details, including the neighborhood radius, sampling strategy, and handling of insufficient neighbors, are omitted. Additionally, Eq. (5) does not clearly specify how the K neighboring features are aggregated to ensure dimensional compatibility with the original voxel features. These ambiguities substantially weaken the technical clarity and reproducibility of GALF.
- The central claims of distance guidance and robustness are not directly validated.
The paper repeatedly emphasizes that GALF alleviates calibration errors and that DGIF improves feature fusion across different observation distances. However, the experiments do not directly evaluate these claims. For calibration robustness, no controlled perturbation experiments are presented under varying extrinsic calibration errors. Similarly, the effectiveness of distance-guided fusion is not evaluated using distance-stratified occupancy metrics, such as performance at near, medium, and far ranges. Moreover, DGIF combines cross-modal alignment, dual-source geometric priors, and distance-aware attention, but the ablation study does not isolate the effects of the distance encoding and the individual geometric priors. Without these evaluations, it remains unclear whether the improvements actually result from the proposed distance-guided and gated-adaptive mechanisms or simply from additional network capacity.
- Insufficient efficiency analysis and limited performance advantages on the second benchmark.
The architecture introduces multiple computationally demanding operations, including bidirectional neighborhood retrieval, global BEV attention, dual-source geometric processing, and repeated cross-modal attention. However, the paper provides no quantitative analysis of parameter count, FLOPs, inference latency, or GPU memory consumption. This is particularly concerning because global self-attention over flattened BEV tokens can introduce substantial computational and memory overhead. Furthermore, on nuScenes-Occupancy, the proposed approach improves mIoU from 25.3 (MS-Occ) to 25.9, representing a relatively modest gain of 0.6 percentage points. Without computational comparisons or matched experimental settings, it is difficult to determine whether the added architectural complexity is justified.
- Important implementation details are missing, limiting reproducibility.
Several critical hyperparameters and design choices are insufficiently specified, including the number of sampled points in GALF, neighborhood search parameters, the architecture of the gating networks, the mathematical implementation of distance-aware attention, and the construction and normalization of geometric priors.