- Rating
- 2(+1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes TopoReg for point cloud registration. It computes persistent homology using graph geodesic distances and builds a six-dimensional descriptor from persistence lifetimes. This descriptor is added to a PointPWC-based network through input features and FiLM conditioning. The method also uses a local edge-length consistency loss. The authors provide theoretical analysis and evaluate the method on Lung250M-4B and KITTI.
Critical strengths
The descriptor is compact and can be added to an existing registration network. The KITTI results show a clear improvement over the methods listed in the paper. The mean Chamfer distance decreases from 0.2206 m for PointMamba, the strongest listed baseline, to 0.1944 m for TopoReg. This suggests that the full system may have useful empirical benefits.
Critical weaknesses
The main idea and motivation of this paper are very close to “TopoPointPWC: Manifold Topology-Aware Point Cloud Registration via Persistent Homology,” ICLR 2026 GRaM Workshop, Tiny Paper Track. That work already uses persistent homology on local neighborhood graphs to guide hierarchical point cloud registration. Moreover, Figure 2 of the current submission still labels the proposed method “TopoPointPWC.” Prior work has explored persistent homology for 3D shape registration and point cloud alignment. Please clarify how the proposed use of persistent homology differs from these earlier approaches.
On Lung250M-4B, the mean TRE decreases from 2.21 mm for PointPWC to 2.18 mm for TopoReg. This is an absolute improvement of only 0.03 mm, or about 1.4%. The median improves by only 0.02 mm. Seems effectiveness of author's method is limited.
Questions for authors
Please address the concern raised in the Weaknesses section.
3 comments
Response to Reviewer u1PP [2/3]
Weakness 2: Experiments do not isolate the components
Weakness 2. "The experiments do not isolate the benefits of the new components or sufficiently support the topology-preservation and SOTA claims."
We agree this was the central evidential gap, and we thank the reviewer for naming it so precisely.
Question 3. "Can the authors provide the missing PointPWC-plus-L_topo control and a direct comparison with the earlier TopoPointPWC formulation? Can they also report uncertainty estimates for the small improvement on Lung250M-4B?"
The control you asked for. We ran it: PointPWC with the same edge-length loss, descriptor and FiLM removed. Its parameter count is 7,720,236, identical to the PointPWC baseline, which confirms no topological signal enters the network, while the loss stays active.
| Configuration | Descriptor | Three runs (Lung TRE, mm) | Mean ± std | |
|---|---|---|---|---|
| PointPWC + (control) | no | yes | 2.31 / 2.22 / 2.28 | 2.270 ± 0.037 |
| TopoReg (full) | yes | yes | 2.18 / 2.20 / 2.18 | 2.187 ± 0.009 |
| Difference | 0.083 mm |
The comparison against the earlier formulation is given by the component-level table in our response to Weakness 1, which specifies exactly which elements differ.
Both configurations contain the auxiliary loss, so the comparison isolates the descriptor-plus-FiLM branch. The gap is about 2.2× the control's spread and about 9× that of the full model.
The uncertainty you asked for. Three training seeds plus a three-by-three sampling matrix:
| Training seed | Subsample 1 | Subsample 2 | Subsample 3 |
|---|---|---|---|
| 0 | 2.20 | 2.20 | 2.20 |
| 1 | 2.27 | 2.23 | 2.23 |
| 2 | 2.23 | 2.20 | 2.22 |
Resampling within a fixed training seed changes TRE by at most 0.04 mm, so subsampling is not the dominant variance source; the training seed contributes more. Both spreads are now reported so that the mean differences can be read against them.
Weakness 3: Theoretical issues — shortcut edges and the Theorem 4.2 proof
Weakness 3. "There are also problems with the theoretical explanation. If a shortcut edge already exists in the Euclidean-weighted neighborhood graph, computing shortest paths cannot remove it... In addition, the proof of Theorem 4.2/A.2 assumes that a path whose length equals the Euclidean distance must contain only one edge. This is incorrect: several edges along the same straight line can give the same total distance."
We thank the reviewer for both objections: the first concerns how our claim is worded, the second identified a genuine error in the proof.
Question 2. "How does the implemented graph construction prevent or remove cross-boundary shortcut edges? How should the statement or assumptions of Theorem 4.2 be corrected?"
On shortcut edges: you are right that an existing edge cannot be removed. It keeps its Euclidean length, so its endpoints retain that graph distance. Our claim concerns penalty rather than removal: the geodesic metric forces detours around boundary-crossing pairs. The magnitude of that penalty is measurable, and we report it here:
| Quantity (27 lung cases, 2048-point subsample, , fixed seed) | Value |
|---|---|
| Median ratio | 1.206 ± 0.102 |
| 95th percentile of | 1.830 ± 0.585 |
| Share of pairs with | 14.6 ± 16.9% |
| Same share at / | 60.3% / 13.2% |
Roughly 15% of sampled pairs pay a detour of more than 50%, while the rest are essentially unaffected. This is what "penalty, not removal" means quantitatively, and it also explains why the effect weakens as grows: larger neighbourhoods create more shortcuts, so the detectable penalty shrinks.
It also bears on the theory: the strict inequality of Theorem 4.2 requires an additional hypothesis, but the mechanism it describes does not depend on that hypothesis holding everywhere. On real data the penalty is present and sizeable for a clear minority of pairs, which is what the method relies on.
On the proof: you are correct that the hypothesis was missing. The claim that an equal-length path contains only one edge is false — collinear unit edges give the same total length. The corrected statement is , with equality exactly when some pair realising the gap is joined by graph edges that follow the straight segment in order. The appendix proof is rewritten as a triangle-inequality argument, and the condition is stated inside the theorem.
We would add that the correction concerns the boundary case, not the operative regime: the inequality still guarantees that graph distance never understates the separation, and the measured distribution above shows that it exceeds it substantially for the pairs that matter.
Response to Reviewer u1PP [3/3]
On the topology-preservation claim
Weakness 2 (continued). "The graph-level analyses also do not isolate whether the proposed descriptor reduces topology errors in the predicted deformation... Better input-graph statistics and lower registration error are not sufficient evidence that the new components preserve the topology of the output deformation."
We appreciate this distinction; it is one the original draft did not make.
This is a fair criticism. We added an output-side measurement: for each test case we compute the same 6-D persistence descriptor on the predicted warped cloud and on the ground-truth target cloud, and take their relative difference.
The median relative difference is about 20% (p90 ≈ 0.85). The metric is also uncorrelated with registration accuracy — the variant with the lowest descriptor difference (a learned readout) has the worst TRE. We therefore do not claim that the method preserves the topology of the output deformation. The revision states this in the limitations: the method improves registration accuracy, and output-level persistence consistency is left as future work.
We thank the reviewer again for the time spent on this paper, and in particular for the two observations that changed it most: that the equal-length-path hypothesis in Theorem 4.2 was missing, and that the control experiment was needed to make the attribution meaningful. We hope the revisions above address the concerns raised.
Response to Reviewer u1PP [1/3]
Dear Reviewer u1PP,
Thank you for the detailed and precise review. Your three weaknesses identified the gaps that mattered most: the relationship to the earlier workshop report was not stated, the experiments did not isolate the descriptor from the auxiliary loss, and the proof of Theorem 4.2 was incorrect as written. We address all three below.
Weakness 1: Overlap with the workshop paper, and incremental contribution
We thank the reviewer for laying out the specific overlaps; the relationship should have been stated and was not.
We should have stated this relationship and did not. The revision adds an explicit statement, and we answer the four specific points below.
On the identical Table 4 entries. The 24 numerical entries, together with the median displacement of 11.91 mm and median smoothness of 1.76, are baseline-row statistics computed once on the same public split with the same preprocessing. They are shared because they describe the dataset and the baselines, not our method. Every row in Table 4 that reports our model is newly computed for this submission. The revision marks reused baseline rows explicitly so that the provenance of each row is unambiguous.
On the Figure 2 label. In an earlier visualisation we compared against an early topological variant; when that panel was dropped, the name of our own method was deleted by mistake and the older label was left in its place. The figure content has always been ours. The revision restores the correct label, "TopoReg".
On what is new. The differences from the earlier version are at the component level:
On what the submission contributes. The earlier version is a non-archival workshop report and is therefore not a prior publication of these results. The filtration construction itself is established theory, and we now cite that lineage. What this submission contributes is the cross-domain transfer of that construction into a registration architecture, where it acquires a function beyond description: the descriptor modulates the feature pathway through FiLM and measurably changes what the network can fit. That transfer, together with the controlled measurement of what the filtration choice costs, is what the earlier version does not report.