- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The manuscript introduces Generalized Fourier Expansion Splatting (GFES), a signal representation method that treats the signal carried by each primitive as a function over an intrinsic domain and represents it using a truncated generalized Fourier expansion. This approach separates the primitive signal from its spatial localization. Using this formulation, the authors propose "LegendreImage", which uses a two-dimensional Legendre polynomial expansion with a compact raised cosine window and, based on this, they next develop "LegendreImage+" which includes adaptive primitive allocation. Numerical experiments on the DIV2K, Kodak, and DIV8K datasets show competitive reconstruction performance at moderate and high parameter budgets.
Critical strengths
The numerical experiments include several datasets and an extensive set of parameter budgets and ablations. The numerical results show that the method is very competitive against state-of-the-art, achieving higher PSNR than GaussianImage++ at moderate and high parameter budgets on DIV2K and Kodak.
Critical weaknesses
The conceptual novelty of the proposed method is rather limited. The idea of representing the signal carried by each primitive as a function has been exploited already, most notably by 3D Gaussian Splatting [1] and 2D Gaussian-Hermite Splatting [2]. Here, the novelty appears to be the selection of basis functions. However, the main LegendreImage implementation only uses first-order Legendre polynomials, so its local function space is simply span{1, u, v}, i.e., a standard affine model. The adaptive allocation strategy is conceptually closely related to GaussianImage++ [3], which already progressively inserts new primitives at pixel level with large reconstruction distortion. Thus, the underlying idea of allocating primitives according to reconstruction error is not new. Finally, Appendix A only provides a one-dimensional scalar result, whereas the proposed method is two-dimensional. This result is a standard local polynomial approximation property associated with the polynomial space PK, but does not imply any specific advantage of the Legendre basis.
Minor issue • Page 5, Lines 224: In Eq. (6), mn ̸= 0 excludes the first-order terms (1, 0) and (0, 1). I believe it should be (m, n) ̸= (0, 0).
[1] Kerbl, Bernhard, Georgios Kopanas, Thomas Leimkühler, and George Drettakis. ``3d gaussian splatting for real-time radiance field rendering.'' ACM Trans. Graph. 42, no. 4 (2023): 139-1.
[2] Yu, Ruihan, Tianyu Huang, Jingwang Ling, and Feng Xu. "2dgh: 2d gaussian-hermite splatting for high-quality rendering and better geometry features." IEEE Transactions on Visualization and Computer Graphics (2025).
[3] Li, Tiantian, Xinjie Zhang, Xingtong Ge, Tongda Xu, Dailan He, Jun Zhang, and Yan Wang. ``GaussianImage++: Boosted Image Representation and Compression with 2D Gaussian Splatting.'' In Proceedings of the AAAI Conference on Artificial Intelligence, vol. 40, no. 8, pp. 6442-6449. 2026.
Questions for authors
The presentation does not make a convincing case of the potential advantages of using Legendre polynomials. Since P0(x) = 1 and P1(x) = x, the first-order Legendre basis used in the main model (K = 1) is exactly the standard affine basis {1, u, v}. Moreover, increasing the order from K = 1 to K = 2 reduces PSNR under the same parameter budget (Table 2). Thus, what practical advantage does the Legendre formulation provide over a standard local affine model?
4 comments
Q1: On the Choice of First-Order Legendre Expansion
For scalar local signals, the Legendre expansion with spans the same function space as a standard local affine model. The Legendre formulation provides a local polynomial hierarchy that includes this affine form and can be extended to higher orders, making truncation order a design variable for adjusting per-primitive expressiveness and parameter cost. Our use of in the main experiments is an empirical choice within this representation family under the given parameter budget.
Regarding the “practical advantage,” if a task requires keeping the primitive count fixed, increasing the truncation order can enhance per-primitive expressiveness. Original Appendix C / Table 4 demonstrates this benefit with fixed-allocation LegendreImage, using 100,000 primitives, independent RGB coefficients, and no adaptive allocation:
| Legendre Truncation Order | Params / Primitive | Primitives | Trainable-parameter budget | PSNR (dB) | Data Source |
|---|---|---|---|---|---|
| 5 | 100,000 | 29.24 | Table 4 | ||
| 11 | 100,000 | 32.53 | Table 4 | ||
| 20 | 100,000 | 35.46 | Table 4 | ||
| 32 | 100,000 | 38.29 | Table 4 | ||
| 47 | 100,000 | 41.07 | Table 4 | ||
| 65 | 100,000 | 43.45 | Table 4 | ||
| 86 | 100,000 | 45.67 | Table 4 |
In the main experiments, we compare reconstruction quality under the same trainable-parameter budget to evaluate parameter efficiency. Sec. 5.2 / Table 2 of the original manuscript uses LegendreImage+ with adaptive allocation. Nonzero-order expansion coefficients are shared across RGB channels, while the constant terms remain channel-specific. We restate the original Table 2 results below, all under a 4M trainable-parameter budget:
| Legendre Truncation Order | Params / Primitive | Primitives | Trainable-parameter budget | PSNR (dB) | Data Source |
|---|---|---|---|---|---|
| 5 | 4,000,000 | 47.06 | Table 2 | ||
| 7 | 4,000,000 | 51.83 | Table 2 | ||
| 10 | 4,000,000 | 51.21 | Table 2 |
Increasing the truncation order increases the parameter count per primitive while reducing the number of primitives available under the same budget. In Table 2, the first-order configuration achieves the highest reconstruction quality among the evaluated orders, reflecting the budget trade-off between per-primitive expressiveness and the number of primitives. Therefore, our choice of is motivated by parameter efficiency and does not represent an upper limit on the per-primitive expressiveness of LegendreImage.
GFES also places local affine models within a unified approximation perspective. For sufficiently smooth scalar signals, Appendix A gives an first-order projection error on the normalized local domain, explaining the effectiveness of local affine approximation at small spatial scales. Conversely, the affine form alone is insufficient to provide GFES’s unified interpretation and construction principles across different signal domains, measures, basis functions, and expansion orders. We have added a discussion of this relationship in Sec. 6.3 of the revised manuscript.
W: Novelty of GFES
As summarized in the final paragraph of Sec. 1, our contributions span three levels:
- Conceptual level: We introduce GFES in Sec. 1, revealing the shared mathematical structure of different primitive representations.
- Methodological level: In Sec. 3, we instantiate GFES as two image representation methods, namely LegendreImage with fixed allocation and LegendreImage+ with adaptive allocation.
- Experimental level: Main experiments and ablations demonstrate the reconstruction performance, parameter efficiency, and design trade-offs of both methods in Tables 2, 4, 6, and 7.
Specific configurations, allocation strategies, and optimization choices implement and enhance these representations and are not claimed as separate core innovations.
Regarding the reviewer's statement that "the novelty appears to be the selection of basis functions," GFES reveals the intrinsic mathematical connections among existing primitive representations and uses this understanding to guide the construction of new representations. To address the primitive design question posed at the end of the first paragraph of Sec. 1, we inductively identify the common form of signal expansion combined with spatial localization in existing methods such as 3DGS [1] and 2DGH [2], and describe it using classical generalized Fourier expansion. Appendix F / Table 9 of the revised manuscript gives the concrete correspondences:
| Method | Signal Coordinates | Signal Representation | Localization |
|---|---|---|---|
| GI [4] / GI++ [3] / LIG [5] | Local space | Constant RGB | Gaussian function |
| 3DGS [1] | Viewing direction | Spherical harmonics | Gaussian function |
| 2DGH† [2] | Local space | Hermite polynomials | Gaussian function |
| WIPES (2D) [6] | Modulation phase | Constant and cosine | Gaussian function |
| LegendreImage / LegendreImage+ (Ours) | Local square | Legendre polynomials | Compact raised-cosine window |
GI denotes GaussianImage. † The Hermite expansion in 2DGH describes the shape field before its nonlinear activation.
3DGS uses spherical harmonics on the directional domain, while the cosine modulation in WIPES can be written as a finite Fourier representation on the phase domain. Both use Gaussian functions for spatial localization. The signal and localization domains can differ, yet these representations share the same structure.
This shared structure also provides a mathematical starting point for constructing new representations. Classical expansions such as Chebyshev, Jacobi, Zernike, and Fourier–Bessel provide signal representations associated with their respective domains and measures. Combining them with spatial localization expands the range of potential GFES instances beyond Table 9.
From this understanding, we deductively construct two image representation methods: LegendreImage with fixed allocation and LegendreImage+ with adaptive allocation. Both use a Legendre expansion to represent color variation within a bounded local domain and a compact window for spatial localization, as detailed in Sec. 3. The choice of specific basis functions is a result of this construction.
Original Table 4 shows reconstruction gains from higher-order expansion at a fixed primitive count, demonstrating per-primitive expressiveness. In revised Table 2, fixed-allocation LegendreImage improves from 42.38 dB at zeroth order to 48.29 dB at first order under the same 4M trainable-parameter budget, demonstrating the parameter efficiency of local expansion under this budget.
W: Brief Clarifications Regarding Other Comments
Adaptive primitive allocation. Residual-driven allocation has been investigated in prior work, such as GaussianImage++ [3]. We adopt it as a technical enhancement and do not claim it as a main contribution. Fig. 4 and Table 7 show that, under trainable-parameter budgets of 4M, 5.6M, and 7.2M on DIV2K, LegendreImage still achieves 48.29, 53.65, and 56.89 dB, respectively, after removing densification and relocation, exceeding the 48.06, 50.79, and 52.40 dB achieved by GaussianImage++, which already uses adaptive allocation. These results show that the reconstruction advantages at these budgets do not arise entirely from adaptive allocation.
Regarding Appendix A. The bound is a standard local polynomial approximation result for smooth scalar functions. It explains how local scale and truncation order jointly affect approximation accuracy, informing local expansion design within GFES without establishing an advantage specific to the Legendre basis. The current analysis is one-dimensional. Under appropriate smoothness and domain regularity assumptions, it can be extended via the Bramble–Hilbert lemma [7] to two-dimensional polynomial spaces of total degree at most .
Regarding Eq. (6). We thank the reviewer for pointing out this typographical error. The summation condition should be , excluding the zeroth-order term while retaining all nonzero-order terms. We have corrected this in the revised manuscript.
References
[1] Bernhard Kerbl, Georgios Kopanas, Thomas Leimkühler, and George Drettakis. 3D Gaussian Splatting for Real-Time Radiance Field Rendering. ACM Transactions on Graphics, 42(4), Article 139, 2023.
[2] Ruihan Yu, Tianyu Huang, Jingwang Ling, and Feng Xu. 2DGH: 2D Gaussian-Hermite Splatting for High-Quality Rendering and Better Geometry Features. IEEE Transactions on Visualization and Computer Graphics, 2025.
[3] Tiantian Li, Xinjie Zhang, Xingtong Ge, Tongda Xu, Dailan He, Jun Zhang, and Yan Wang. GaussianImage++: Boosted Image Representation and Compression with 2D Gaussian Splatting. Proceedings of the AAAI Conference on Artificial Intelligence, 40(8):6442–6449, 2026.
[4] Xinjie Zhang, Xingtong Ge, Tongda Xu, Dailan He, Yan Wang, Hongwei Qin, Guo Lu, Jing Geng, and Jun Zhang. GaussianImage: 1000 FPS Image Representation and Compression by 2D Gaussian Splatting. European Conference on Computer Vision, pp. 327–345, 2024.
[5] Lingting Zhu, Guying Lin, Jinnan Chen, Xinjie Zhang, Zhenchao Jin, Zhao Wang, and Lequan Yu. Large Images Are Gaussians: High-Quality Large Image Representation with Levels of 2D Gaussian Splatting. Proceedings of the AAAI Conference on Artificial Intelligence, 39(10):10977–10985, 2025.
[6] Wenhao Zhang, Hao Zhu, Delong Wu, Di Kang, Linchao Bao, Xun Cao, and Zhan Ma. WIPES: Wavelet-based Visual Primitives. Proceedings of the IEEE/CVF International Conference on Computer Vision, pp. 27338–27347, 2025.
[7] James H. Bramble and Stephen R. Hilbert. Estimation of Linear Functionals on Sobolev Spaces with Application to Fourier Transforms and Spline Interpolation. SIAM Journal on Numerical Analysis, 7(1):112–124, 1970.
Acknowledgments
We sincerely thank the reviewer for the detailed assessment of our work. We particularly appreciate that your assessment considered the breadth of the experiments and the reconstruction results while also examining the relationship between the mathematical formulation, the research contribution, and the practical benefits. Your questions about the first-order affine form and its practical advantages helped us focus more clearly on what this work seeks to reveal and how that understanding leads to concrete representations.
Your comments prompted us to present the connections across methods revealed by GFES more explicitly, explain how this unified understanding relates to the construction of LegendreImage, and distinguish the gains in expressiveness at a fixed primitive count from the gains in efficiency under a fixed parameter budget. We are very grateful for this attention to the relationship between research claims and experimental evidence. It helped us describe the contribution more precisely and make clearer which conclusions are supported by each set of experiments.
We also greatly appreciate your careful examination of the theoretical analysis and mathematical notation. These specific observations complement the broader conceptual questions and helped us improve the coherence of the manuscript from the research motivation through the mathematical formulation to the interpretation of the experiments. We sincerely thank you for the time and effort devoted to this assessment. Below, we respond to each comment and describe the corresponding revisions.