- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes THD for HSISR, reconstructing an HR-HSI from an LR-HSI and an HR-MSI. THD models spatial and spectral structures through two peripheral cycles coupled by a shared waist core. It absorbs degradation operators into the corresponding factors and solves the coupled model using matrix-free PAM. The paper provides rank bounds and descent analysis, with experiments on simulated and real data demonstrating competitive reconstruction performance.
Critical strengths
1.THD has a clear modeling motivation. Separate spatial and spectral representations capture their different structures, while the shared waist core models interactions between them. 2.The experiments provide substantial evidence of effectiveness. They cover multiple datasets, model-based and neural baselines, and different noise levels.
Critical weaknesses
1.The topology comparisons do not clearly separate the effects of structural design, parameter count, and rank configuration. Comparisons under matched parameter budgets would better establish the contribution of THD. 2.The selection of cyclic ranks, spoke ranks, and tensorization configurations for new scenes remains unclear, particularly when no HR-HSI reference is available. 3.The identifiability of THD is not fully characterized. Under what conditions is the decomposition unique up to inherent scaling and gauge ambiguities? 4.The convergence guarantees for the implemented optimizer need clarification. What assumptions are required, and do they ensure objective-value convergence or convergence to a stationary point? In particular, how do finite-step CG updates satisfy the sufficient-decrease condition?
Questions for authors
1.What parameter counts, rank configurations, and optimization budgets are used in the TT, TR, TW, and THD comparisons? Are results available under comparable parameter budgets to isolate the contribution of topology? 2.How are cyclic ranks, spoke ranks, and tensorization configurations selected? Are they fixed across datasets and noise levels? Does selection use the reference high-resolution image, and what procedure is recommended when no reference is available? 3.How do the finite-step conjugate gradient updates ensure sufficient decrease? What happens when the condition is not met? Does the analysis establish only convergence of objective values, or also convergence of the balanced iterates to a stationary point? 4.How do runtime and peak memory scale with image size, band count, and rank? Do the shared core or intermediate contractions become the main bottleneck? The paper presents a well-motivated model with strong experimental results. However, the contribution of topology remains difficult to separate from model capacity and rank selection, and the connection between the implemented updates and the descent guarantees needs clarification. Controlled comparisons and clearer explanations of parameter selection and optimization guarantees could lead me to raise my rating.
5 comments
Response to Reviewer 8MCb (2/2): Inexact CG and Computational Complexity
We clarify what the optimization analysis guarantees, how it relates to truncated CG, and the measured accuracy–efficiency trade-off.
Q3. Finite-Step CG, Descent, and Convergence
Strongly convex subproblems. With all other THD blocks fixed, each proximal update is quadratic. Proposition 8 (Appendix B.1) shows that its normal operator is self-adjoint and positive definite for , so the block minimizer is unique despite the overall problem being nonconvex.
Sufficient-decrease requirement. Let denote the unregularized fusion fidelity objective. A block update satisfying a nonincrease of the proximal subproblem objective relative to its previous value yields (Eq. B.55):
This condition is sufficient for the descent result of Proposition 9; it is not by itself a stationary-point convergence guarantee.
Truncated CG. Each block CG solve is initialized at the previous block and terminates at relative residual or 10 steps (Appendix B.5). In exact arithmetic, CG minimizes the positive-definite quadratic over expanding Krylov subspaces containing the initial point; its proximal objective therefore cannot increase. Finite-precision CG does not automatically ensure the same condition. If a computed step violates descent, Proposition 9 cannot be invoked for that step. Rejecting the update or continuing CG is a possible safeguard, but we do not claim such rejection was instrumented in our reported implementation.
What converges? For exact sweeps, or inexact sweeps satisfying the required per-block descent, Proposition 9 makes nonincreasing. Since , its values converge and the squared pre-balancing block displacements are summable. Proposition 6 shows spoke balancing preserves the represented tensor and . These results do not establish convergence of the balanced factor sequence to a stationary point, nor identifiability; the latter is discussed in Response 1/2.
Q4. Runtime, Working Memory, and Bottlenecks
Memory scaling. Define , , and , where is the MSI band count. Appendix C.3 derives the asymptotic working-memory bound:
Matrix-free CG evaluates normal-operator actions through tensor contractions and their adjoints, avoiding storage of explicit environment matrices and Kronecker-product normal coefficients. At fixed ranks, the spatial-group intermediates scale as (linear in spatial pixel count), while spectral-group intermediates scale as .
Rank-related costs. The waist core stores scalars, and its CG updates cost (Appendix C.2). With six equal spoke dimensions , core sizes grow as 64, 729, and 4,096. Thus, both the waist core and group contractions can become significant bottlenecks as ranks increase; their relative costs depend on scene dimensions and rank allocation.
Measured runtime (Fig. 9).
| Input/budget | TW time (s) | THD time (s) |
|---|---|---|
| PC/42k | 5.75 | 11.78 |
| PC/84k | 8.57 | 10.81 |
| WDC/42k | 6.57 | 17.51 |
| WDC/84k | 10.22 | 16.41 |
THD reaches higher final reconstruction quality but takes longer in all four common-solver tests. In the separate native MATLAB benchmark (Appendix D.8), THD averages 66.74 s, versus 63.17 s for GTNN and 109.41 s for LFCTNN. The two timing protocols should not be directly pooled.
Peak-memory scope. The derived storage bound is theoretical, not a measurement of peak resident memory; we therefore make no numerical peak-memory superiority claim.
We thank the reviewer for prompting a more precise account of theoretical guarantees and resource requirements.
Remaining concerns after the response
Thank you for the detailed responses and additional experiments. The new comparisons under approximately matched parameter budgets largely address my concern about comparison fairness. The explanations regarding finite-step CG and the scope of the convergence results also clarify my questions on optimization.
I still have two issues. First, the additional comparisons primarily demonstrate reconstruction performance in the fusion task, while direct evidence of THD’s representation efficiency as a new decomposition remains limited. Second, Table 2 shows substantial sensitivity to the spoke dimension. For example, increasing it from 3 to 4 on WDC reduces PSNR by approximately 2.69 dB. The authors explain that the configuration selected during development was reused across datasets, but a reliable procedure for selecting configurations without reference ground truth remains unvalidated.
Response to Reviewer 8MCb (1/2): Topology, Rank Selection, and Identifiability
We thank the reviewer for highlighting the need to distinguish topology, model capacity, rank selection, and optimization guarantees. We address Q1–Q2 and the identifiability concern with additional experiments and theory.
Q1. Controlled Topology Comparison
The original Fig. 7 was not parameter-matched: TT/TR/TW/THD used 36,398/29,645/25,578/40,170 parameters. We added 16 fits on PC (200×200×80) and WDC (256×256×103) at approximately matched 42k/84k budgets. The supplementary WDC cube retains 103 bands, unlike the 90-band main benchmark.
All models use identical ×4, 15/15-dB observations, a common four-thread float64 CPU PAM-CG solver (30 sweeps, CG$\leq10$, ρ=ρC=0.3), and one seed. Ranks follow a fixed dimension/count rule without consulting reference HR-HSI; parameter deviations range from −4.66% to +3.47% (Appendix Table 6).
All active TW/THD spokes have dimension 3. The final results (PSNR in dB/SAM in degrees; Appendix Table 6) are:
THD attains the highest final PSNR and lowest SAM in all four settings, improving PSNR over TW by 1.28/1.23/2.25/0.11 dB. However, TW/THD runtimes are 5.75/11.78, 8.57/10.81, 6.57/17.51, 10.22/16.41 s, respectively. Fig. 9 shows that competitors may lead at earlier time cutoffs. Our claim is better endpoint accuracy at comparable model sizes, not equal-time superiority.
Q2. Ranks, Realizations, and Reference-Free Selection
Rank protocol. Main benchmark ranks and the (3,3) realization were chosen on a representative reference-based development setting, then reused across datasets, scales, and noise levels without scene-specific rank retuning. In contrast, the new 42k/84k allocation above does not use reference HR-HSI.
Peripheral cycles. We evaluated seven realizations, from (2,1) to (4,4), with paired initialization and ρ=ρC=0.7. Total parameter counts differ by at most 0.93% per input. The (3,3) realization achieves the highest final PSNR on PC (30.6144 dB) and WDC (28.0426 dB) (Fig. 10; Appendix D.12.2); longer cycles do not guarantee gains.
Spoke sensitivity (Fig. 11 and Appendix Fig. 17). Fixing (3,3) and cyclic ranks:
s=3 attains the best PSNR and SAM in both tested conditions. For reference-free scenes, observation singular spectra and noise-level discrepancy may suggest candidate ranks but do not directly determine THD's internal bonds. An automatic reference-free rule has not been validated.
W3. Identifiability and Gauge Ambiguity
THD factors are generally non-identifiable. Proposition 6 (Appendix A.8) establishes diagonal spoke-gauge invariance: invertible spoke scalings can be absorbed by the corresponding waist-core modes without changing the reconstructed tensor. Cyclic bonds also permit compensating latent-basis changes between adjacent factors.
Spoke balancing (Appendix B.6) stabilizes scales but does not imply uniqueness; the rank bounds (Theorem 1; Proposition 2) concern capacity, not identifiability. We claim neither unique factors nor unconditional uniqueness of the recovered HR-HSI.