- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CGPRNet for the traditional Few-Shot Semantic Segmentation task. The network mainly consists of three modules: the Dual-Branch Feature Encoder uses a frozen pretrained CNN backbone to extract generic features, while learning task-specific features through a trainable adapter and then fusing them using a gating mechanism; the Cross-Attention Graph Prototype Generator initializes foreground and background prototypes based on support masks and iteratively updates the prototypes through query attention and message passing between graph nodes; the Multi-Scale Prototype Matching module applies 3×3, 5×5, and 7×7 convolutions to query features and adaptively fuses matching results from different receptive fields. The authors conduct 1-shot and 5-shot experiments on PASCAL-5i, COCO-20i, and FSS-1000, and report some competitive results.
Critical strengths
The author’s methodological framework introduces some novel ideas, and the experimental results show a certain level of competitiveness.
Critical weaknesses
-
There are several issues in the experimental results and configurations that require further clarification. For example, the mIoU, Dice, and FB results under the ResNet-50 configuration on FSS-1000 are inconsistent across Tables 3, 4, and 5. Additionally, the standard evaluation protocol for FSS-1000 divides the 1,000 categories into 520 training classes, 240 validation classes, and 240 testing classes, with evaluation performed on the test set. However, the authors report their results based on four folds. It is unclear how F0/F1/F2/F3 are constructed and whether the evaluation follows the standard protocol.
-
The authors' claim of State-of-the-art Performance does not seem sufficiently convincing. First, among the reported experimental results, the proposed method fails to achieve the best performance in several settings on PASCAL-5i. On COCO-20i, the mIoU under the R101 (5-shot) setting is nearly 5 points lower than HSNet. However, the authors still highlight their own results in bold, and there are also several incorrect bold/underlined markings in the tables. Second, most of the baseline methods listed in the tables were published between 2020 and 2022, with only a few more recent methods included. However, several stronger few-shot segmentation methods proposed in recent years, such as HDMNet (CVPR 2023), AMFormer (NeurIPS 2023), and HMNet (NeurIPS 2024), are not included in the comparisons. Among them, AMFormer uses ResNet-101 as the backbone and achieves 70.7% and 73.6% mIoU on PASCAL-5i under the 1-shot and 5-shot settings, respectively, while the corresponding results of CGPRNet are 64.1% and 69.6%.
-
The authors name their module the Cross-Attention Graph Prototype Generator and emphasize that it can learn cross-scale support-query relationships through iterative graph reasoning. However, in Table 4, removing Graph Refinement only leads to average mIoU drops of 0.4 and 0.7 in the 1-shot and 5-shot settings, respectively. In contrast, removing the Dual-Branch Encoder or Multi-Scale Matching leads to performance drops of 6.9 and 6.6 in the 5-shot setting. This suggests that the most significant improvements in the experiments seem to come from the dual-branch feature encoding and multi-scale matching, rather than the Graph Prototype Refinement emphasized in the paper's title. This does not mean that the graph module has no value, but the authors need to more accurately clarify the contributions of each module.
Questions for authors
- Could the authors explain why the mIoU, Dice, and FB-IoU results of the full model with ResNet-50 on FSS-1000 are inconsistent across Tables 3, 4, and 5?
- Could the authors clarify how the four folds (F0/F1/F2/F3) on FSS-1000 are constructed and whether the evaluation follows the standard FSS-1000 protocol?
- Why are several recent and stronger few-shot segmentation methods, such as HDMNet, AMFormer, and HMNet, not included in the comparisons?
- The ablation study in Table 4 shows that removing Graph Refinement leads to relatively small performance drops compared with the other two modules. Could the authors further explain how the graph refinement module contributes to cross-scale support-query relationships and why its performance contribution is relatively limited?
3 comments
W3. Missing recent baselines and overstated state-of-the-art claims
We appreciate the reviewer for identifying relevant recent methods, including HDMNet (CVPR 2023), AMFormer (NeurIPS 2023), and HMNet (NeurIPS 2024).
We agree that these methods should be discussed to provide a more complete assessment of recent progress. We also acknowledge that the statement claiming superior performance across all backbones and settings is too broad.
For example, AMFormer achieves stronger results than CGPRNet on PASCAL-5ⁱ with ResNet-101.
Table. PASCAL-5ⁱ comparison with AMFormer (ResNet-101, mean mIoU %).
| Method | 1-shot | 5-shot |
|---|---|---|
| AMFormer | 70.70 | 73.60 |
| CGPRNet | 64.10 | 69.60 |
Likewise, on COCO-20ⁱ with ResNet-101, HSNet achieves 49.5% 5-shot mean mIoU, compared with 44.6% for CGPRNet. We therefore do not claim that CGPRNet universally outperforms existing approaches.
Nevertheless, CGPRNet remains competitive in several evaluated configurations. For instance, on PASCAL-5ⁱ using ResNet-50, our method achieves 68.6% and 70.8% mean mIoU in the 1-shot and 5-shot settings, respectively, compared with 67.3% and 69.2% for RiFeNet.
The primary contribution of CGPRNet is its integration of three complementary mechanisms:
- Dual-branch feature adaptation. Preserves generic pretrained representations while incorporating task-specific information.
- Cross-attention graph prototype generation. Refines semantic prototypes using query-conditioned feedback and inter-prototype interactions.
- Multi-scale prototype matching. Combines information from different receptive fields through spatially adaptive weighting.
These mechanisms address complementary challenges in few-shot segmentation, rather than guaranteeing the best performance under every backbone and benchmark.
We will expand the related-work discussion to include HDMNet, AMFormer, and HMNet, incorporate additional quantitative comparisons where compatible results are available, correct the highlighted best-result markings, and revise the performance claims to accurately reflect the evidence.
W4. Contribution of graph prototype refinement
We thank the reviewer for questioning the relative contribution of graph refinement. We agree that the Dual-Branch Encoder and Multi-Scale Matching module produce larger improvements in the reported ablations, particularly in the 5-shot setting.
However, the graph component serves a distinct role: it enables query-conditioned prototype updates and interaction between foreground and background representations.
Table. Component-level ablation on FSS-1000 (ResNet-50, 50 epochs; mIoU %).
| Configuration | 1-shot | 5-shot | Δ 1-shot | Δ 5-shot |
|---|---|---|---|---|
| Full CGPRNet | 83.60 | 84.00 | — | — |
| w/o Dual-Branch | 82.50 | 77.10 | −1.10 | −6.90 |
| w/o Graph Refinement | 83.20 | 83.30 | −0.40 | −0.70 |
| w/o Multi-Scale Matching | 83.00 | 77.40 | −0.60 | −6.60 |
These results show that graph refinement provides a consistent, although comparatively modest, contribution to the complete architecture.
To further examine the underlying design, we report the existing targeted prototype-graph ablations.
Table. Prototype-graph design ablation on FSS-1000 (ResNet-50, mIoU %).
| Configuration | 1-shot | 5-shot | Δ 1-shot | Δ 5-shot |
|---|---|---|---|---|
| Full CGPRNet | 83.60 | 84.00 | — | — |
| Softmax over K | 83.00 | 83.50 | −0.60 | −0.50 |
| w/o Background Node | 82.80 | 83.20 | −0.80 | −0.80 |
| w/o Inter-Prototype Interaction | 82.90 | 83.30 | −0.70 | −0.70 |
Removing the background node reduces mIoU by 0.8 percentage points in both settings, suggesting that explicit background modeling is beneficial. Similarly, removing inter-prototype interaction decreases performance by 0.7 points in both settings, supporting the usefulness of information exchange among prototype nodes.
The attention-normalization ablation also shows that spatially normalized query feedback is preferable to prototype-axis normalization under the evaluated settings.
Importantly, we clarify that CGPRNet does not explicitly construct scale-specific graph nodes or cross-scale graph edges. Graph-based refinement operates on semantic prototypes, while multi-scale feature matching is performed subsequently by the matching module. These components are complementary but architecturally distinct.
We acknowledge that the overall graph contribution is smaller than those of the other major components. Accordingly, we will revise the manuscript to emphasize its role as a complementary refinement mechanism rather than attributing the majority of the performance improvement to graph reasoning.
We also recognize that the current ablations do not fully separate the effects of graph connectivity from additional learnable refinement capacity. We will clarify this limitation rather than making unsupported claims about the superiority of graph message passing.
W1. Inconsistencies in FSS-1000 results across Tables 3, 4, and 5
We thank the reviewer for identifying these discrepancies. After carefully examining our training logs, we confirmed that the ResNet-50 results reported in Tables 3 and 5 were inadvertently taken from an intermediate 5-epoch checkpoint, whereas the full-model results in Table 4 correspond to the completed 50-epoch training schedule.
Importantly, all configurations in Table 4 were trained for 50 epochs under the same training settings. Therefore, the ablation comparisons are internally consistent. The discrepancy arose from incorrect checkpoint selection during preparation of the main results tables, rather than from different training budgets within the ablation study.
Table. FSS-1000 ResNet-50 results from the reported checkpoints (%).
These results explain the systematic differences across all three metrics. We will correct Tables 3 and 5 using the verified final-checkpoint evaluation results, explicitly specify the training duration and checkpoint-selection protocol, and ensure consistency throughout the manuscript.
We acknowledge this reporting oversight and appreciate the reviewer for bringing it to our attention.
W2. FSS-1000 evaluation protocol and four-fold reporting
We thank the reviewer for highlighting the need for a clearer description of the FSS-1000 evaluation protocol.
The standard FSS-1000 benchmark contains 1,000 categories, partitioned into 520 training, 240 validation, and 240 testing categories. Our experiments use episodic K-shot evaluation, where each episode consists of K annotated support image-mask pairs and a query image from the target category.
The F0–F3 columns in our manuscript present fold-wise evaluation results, and the reported mean is calculated across these four folds. However, we acknowledge that the manuscript does not sufficiently specify the category assignments underlying these folds or their precise relationship to the official FSS-1000 test partition.
To address this concern, we will explicitly document the fold construction, category membership, training/validation/test partitions, episode-sampling procedure, and checkpoint-selection settings. We will also clearly distinguish any additional fold-based evaluation from the official FSS-1000 test-set protocol.
Furthermore, we will ensure that direct comparisons with existing methods are restricted to compatible evaluation settings, avoiding potentially misleading conclusions arising from different dataset partitions.
We appreciate this observation, as these clarifications are important for reproducibility and fair benchmarking.