- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper aims to design a fixed dimensional representation for 3D point cloud sampled from a distribution and make the representation invariant to permutation and the number of points. The main approach is to create a Fourier representation by sampling random vectors and use Fourier positional encoding to encoded the projection of 3D points to these vectors. These features are decoded through a conditional flow matching in 3D space, which allows sampling of arbitrary number of points. The paper demonstrated that such features can be used in 3D point cloud generation, and showed strong performance comparable to some of the state-of-the-arts.
Critical strengths
The method is rather simple and easy to implemented. The paper is clearly written and generally easy to follow. The performance is decent and the ablation showed that under the current setup, the proposed fourier encoding is helpful.
Critical weaknesses
- The model is not cardinality independence. While the dimensionality is independent of the number of the points, the latent depends the number of points entering into the encoder.
- Validation results are mixed, and it does not demonstrate any unique advantage of the Fourier encoding.
- It's not very clear to me what is the advantage of this proposed method comparing to training an VAE or AE that compressed the point cloud into a latent representation. While the authors have showed some baseline using similar technique, such as ShapeGF, such baseline is also trained with out-dated neural network architectures. It would be interesting to see what is the advantage of such Fourier feature encoding.
Questions for authors
See previous sections.
We thank the reviewer for recognizing the simplicity and effectiveness of our approach, and for the insightful comments on the Fourier representation. We address these concerns below.
Cardinality independence of the representation.
Our formulation distinguishes the population-level Fourier representation from its empirical estimate. For a fixed frequency set K and underlying distribution μ, ΦK(μ) is independent of the number of observed points. Under i.i.d. sampling from μ, its empirical estimate zN=ΦK(μ^N) satisfies
zNa.s.N→∞ΦK(μ).
Moreover,
\left\\|z_N-\Phi_K(\mu)\right\\|_F^2 \right] = \frac{1}{N}\sum_{m=1}^{M} \left(1-|\phi_\mu(k_m)|^2\right) \leq \frac{M}{N}.$$ For point clouds sampled from the same distribution, variation in the empirical coefficients reflects finite-sample estimation. Thus, increasing $N$ reduces the mean squared sampling error in the shape latents used for DiT training while preserving their dimensionality. Appendix D.1 empirically examines this sampling consistency, and Table 3 shows improved generation quality with denser training point clouds on Airplane. We will clarify this statistical interpretation in the revised manuscript. **Advantages of the Fourier representation.** A key advantage of the Fourier representation is that denser training point clouds reduce the sampling-induced estimation error in the shape latents used for DiT training, without increasing the latent dimensionality or the computational complexity of the DiT. This allows the latent generative model to learn from more accurate representations of the underlying shape distributions. Table 3 demonstrates that increasing the training cardinality improves generation quality with the same model architecture and latent dimensionality. Moreover, FourierDiT achieves competitive generation quality at substantially lower training costs than existing methods (Tables 1 and 2). The Fourier representation additionally provides an explicit spectral structure, with each latent token associated with a specific spatial frequency. Our frequency-conditioned DiT exploits this structure to model dependencies among Fourier coefficients. Table 4 demonstrates the benefits of learning the frequency locations and incorporating frequency information into the DiT. **Distinction from conventional AE/VAE representations.** FourierDiT explicitly parameterizes the shape latent through characteristic-function evaluations at learnable spatial frequencies. To evaluate its advantages over modern learned representations, we compare Fourier encoding with a PVCNN-based encoder on ShapeNet Airplane under the same latent dimensionality (256), training cardinality (15,000 points), and training time. For each validation shape, we repeatedly subsample the input point cloud and measure the relative latent error against its full 15,000-point representation, together with Top-1 retrieval accuracy among all reference shape latents. | Number of points | 128 | 256 | 512 | 1024 | 2048 | 4096 | 8192 | |---|---:|---:|---:|---:|---:|---:|---:| | PVCNN (Error ↓) | 1.933 | 1.275 | 0.706 | 0.356 | 0.190 | 0.114 | 0.065 | | Fourier (Error ↓) | 0.606 | 0.425 | 0.302 | 0.210 | 0.142 | 0.092 | 0.052 | | PVCNN (Acc. ↑) | 4.0% | 14.0% | 46.5% | 84.5% | 95.6% | 97.4% | 99.1% | | Fourier (Acc. ↑) | 65.6% | 81.3% | 90.8% | 96.2% | 98.3% | 99.5% | 100% | Fourier encoding consistently achieves lower representation errors and higher retrieval accuracy across all evaluated cardinalities, despite using substantially fewer encoder parameters (384 vs. 4.27M). These results demonstrate its ability to preserve shape-specific information under varying point sampling, providing more stable training representations for latent generative modeling.