- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper presents a novel method for learned texture representation, building on the HKTex model. It replaces the costly spectral computations with local charts and more expressive Gabor-based kernels, resulting in faster initialisation and less memory usage.
Critical strengths
- The method is well motivated: the learned kernels are local, and spectral methods become expensive on high-resolution meshes.
- Transfer across remeshings without retraining is useful in practice. For example, a mesh stored at several levels of detail could share a single texture. The authors could emphasise this application more.
- The method performs well on high-frequency and periodic textures.
- The barrier mechanism is a nice idea and could have useful applications.
Critical weaknesses
- The main-paper tables and figures mostly use small sets: the 32-object structural-failure set, six representative scenes, a 30-object subset for rate–distortion, synthetic toy textures, and 20 objects for ablations. Results on the full 313-object UV-fitting and 162-object multi-view benchmarks only appear as tables in the appendix (Tables 8 and 11). I encourage the authors to move these into the main paper.
- Relatedly, could the authors explain the large discrepancy between Table 8 and Table 1 of the HKTex paper? At comparable storage (~97 kB), HKTex reports 44.8 dB for HKTex and 42.5 dB for Intrinsic Neural Fields, while Table 8 reports 31.07 and 29.41 dB. The ranking also changes: the low-resolution GT texture is the strongest baseline in HKTex (48.4 dB) but the weakest here (26.10 dB).
- It is unclear in which cases the QSlim proxy was used in table 3. A fairer comparison would also include HKTex-Simplify, since it is closer to the QSlim proxy setting. What does "O(1) per proxy face" mean exactly in table 14? The paper should provide estimates of the per-vertex cost, without the quadric approximation and as a function of mesh resolution.
- Without the proxy, memory seems to scale roughly as O(N·V): higher vertex density means more faces inside each kernel’s support. Could the authors clarify how the charts are stored? Are A_if and b_if (or S_if) kept for every kernel-face pair, as Algorithm 1 suggests? A memory measurement as a function of |V| at fixed N, with and without the proxy, would make this clear.
Questions for authors
- When reporting the time per step, could the authors also report the rebuild time of the unfolding as a function of |V|? For example, 5k kernels on the same mesh at several resolutions.
- I would appreciate a more thorough analysis of the rebuild interval. Table 5 reports that rebuilding every step is 0.26 dB worse than every 10 steps, which is counter-intuitive. Could the authors explain this and provide a sweep over rebuild intervals?
- Could the authors analyse failure cases of the unfolding compared to the Vector Heat log map, beyond the median angular error of 1.9°? For example, the error distribution near cone vertices or on high-curvature regions.
Clarifications
- In the ablation against exact geodesics (Table 5), which quantities are replaced? MMP provides distances but not directions, so how are the chart coordinates (u, v) obtained in that variant? A comparison using a log map would be more informative.
- The authors claim that HKTex responses are local, however there are 2 techniques used in HKTex to assess them locally: one is the multiplication with a Gaussian using BH distance, and the other one is a computational efficiency trick that evaluates only on specific KNNs.
- Although HKTex uses a fixed diffusion time, kernel scale is controlled by a learned threshold. HKTex also fits an image on a two-triangle rectangle with only K=3 modes and still recovers fine detail (albeit with a kernel amplification exponent). This suggests the number of modes mainly affects the overall shape of the kernels rather than placing a hard limit on the finest representable detail. The “mode ceiling” argument (l. 50) should be discussed in light of this.
- Abstract (l. 13–14): reporting “fifty eigendecompositions” and a “[50, V, 256]” basis in the abstract seems unusual, since these are tunable hyperparameters of HKTex rather than intrinsic properties.
- l. 16–17 and l. 60: could the authors justify why the Minakshisundaram–Pleijel expansion is “the natural evaluator”?
- l. 53: “non-manifold soups”. Do the authors mean triangle soups?
- l. 66: the sentence “promotes the chart from an evaluation device to the representation itself” is hard to parse. Could the authors rephrase it and clarify what they mean by “evaluation device”?
- l. 190: the statement that the spectral construction is “super-linear in |V|” seems inconsistent with the spot measurements reported right after (122 s at 2.9k vs. 237 s at 47k vertices, i.e., sub-linear), although Table 6 does show super-linear growth. Clarifying which costs dominate in each regime would resolve this.
- The text in figures should be selectable, i.e., exported as vector graphics. Figures 2, 3, and 4, as well as Tables 1 and 2, are hard to read because the font is too small. The two stripes and two wood examples seem redundant; keeping only one of the two textures would free up space to enlarge the remaining results. Figure 4 also contains a lot of unused white-space.