- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes CALSRN for hyperspectral image single-image super-resolution. It combines parameter-free spectral compression, clustering-guided attention, and progressive reconstruction to exploit non-local spectral similarities while reducing computational complexity. Experiments on three datasets demonstrate competitive reconstruction performance and model efficiency.
Critical strengths
- The paper addresses spectral redundancy and non-local similarities in HSIs through clustering-guided feature interactions.
- The proposed CAB combines intra-group and inter-group attention to capture complementary pixel-level and category-level information.
- CALSRN achieves competitive performance across three datasets and multiple scaling factors, with relatively few parameters and low reported FLOPs. Extensive ablation studies further support its effectiveness.
Critical weaknesses
- CALSRN shares similarities with SCPSN in spectral compression, non-local modeling, and progressive reconstruction. Clustering-based attention has also been explored previously. The authors should better distinguish their contributions from existing approaches.
- Hard K-means clustering is performed on only three compressed spectral channels, with labels propagated across scales. However, if cluster labels are not re-estimated, this may result in incorrect cross-scale feature correlations. Besides, the authors acknowledge that hard clustering may be unreliable for mixed pixels and unknown sensor degradation; however, mixed pixels are inherent in HSI SR tasks, and the authors do not effectively analyze whether K-means is truly applicable or how much it affects the proposed method.
Questions for authors
- What are the key methodological differences between CALSRN and SCPSN or existing clustering-based attention methods?
- How robust is CAB to inaccurate clustering assignments, particularly under large scaling factors?
- Unclear attention grouping mechanism. Fixed-size grouping may separate tokens from the same cluster, while adjacent-group expansion may introduce unrelated tokens. Further clarification of cross-cluster interactions and boundary handling is needed.
- The author uses averaging across adjacent bands rather than PCA, SVD, or learnable low-rank decomposition. Does this approach offer any advantages?
- Some figure captions in the appendix are inconsistent with the displayed content, such as Figures 7 and 8.
Dear Reviewer,
We have posted a point-by-point response to your comments (Q1–Q5) in the thread above. Could you kindly let us know whether our revisions and responses resolve your concerns? If any question remains, we would be glad to discuss further and provide additional analysis or clarification.
Thank you for your time.