- Rating
- 2
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper addresses the computational cost and correspondence ambiguity in flow-matching-based point cloud upsampling. The authors propose FLUSSO, which separates sparse global feature extraction from dense local generation using anchor-conditioned flows. The framework further introduces sliced optimal-transport flow matching (SOT-FM) and multi-step local endpoint distribution matching (LEDM) to improve transport supervision and reconstruction quality. Experiments on PU1K and PUGAN demonstrate competitive reconstruction accuracy, improved inference efficiency, and generalization to unseen upsampling ratios.
Critical strengths
-
The paper identifies an important scalability limitation of generative point cloud upsampling and proposes a meaningful separation between sparse global reasoning and dense local generation. This design directly addresses the computational bottleneck and supports variable output cardinalities without retraining.
-
FLUSSO demonstrates improvements in reconstruction quality, particularly in Hausdorff and point-to-surface distances, under controlled comparisons with PUFM. The experiments further examine inference latency, memory consumption, unseen upsampling ratios, and the contributions of the proposed training objectives, providing useful evidence of its practical effectiveness.
Critical weaknesses
-
PUFM has already addressed point correspondence ambiguity through transport-based pre-alignment, while PUFM++ further introduces endpoint refinement to improve the terminal distribution. Although FLUSSO develops a different local formulation, the proposed SOT-FM and LEDM largely build upon established transport and distribution-matching techniques. The paper does not sufficiently establish the distinctive methodological advantages of these components, particularly without a direct comparison with PUFM++.
-
The substantial high-ratio speedups are measured mainly against recursively applied PUFM, making it difficult to separate the benefits of local generation from those of avoiding recursive inference. Moreover, the ablations do not directly measure the claimed trajectory mismatch reduction or isolate the architectural contribution of sparse-global/local-dense decomposition from the training objectives. Consequently, the evidence does not fully establish which proposed mechanisms are responsible for the reported gains.
Questions for authors
-
Since PUFM++ already incorporates endpoint refinement and enhanced flow-matching optimization, could the authors provide a controlled comparison with PUFM++ under identical evaluation protocols, including reconstruction accuracy, inference latency, and memory consumption? This comparison is important for establishing the novelty and practical significance of FLUSSO.
-
Could the authors provide controlled ablations that isolate the sparse-global/local-dense architecture from SOT-FM and LEDM, preferably with comparable training computation? In particular, can the claimed reduction in trajectory mismatch be directly quantified rather than inferred solely from improvements in final reconstruction metrics?
-
To what extent do the reported speedups arise from local flow computation rather than avoiding recursive upsampling and global point selection? A comparison that better separates these factors would help establish the intrinsic computational advantages of the proposed architecture.