- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper addresses the failure of independent mask contouring to produce valid cadastral polygons, which routinely leaves overlaps and sliver gaps along adjacent boundaries. The authors attach a lightweight geometry prediction head and LoRA adapters to a frozen SAM 3 backbone. During inference, the predicted boundaries, corner heatmaps, and sub-pixel offsets are vectorized into a planar graph. Polygons are extracted as the faces of this graph and labeled by majority overlap with the segmentation masks, ensuring adjacent parcels share identical arcs by planar construction rather than post-hoc geometric repair.
Contribution
Replaces loss-based penalties and post-processing heuristics with planar graph face decoding, enforcing non-overlap and shared boundaries by construction. Uncovers an evaluation limitation in standard region overlap metrics, demonstrating that F1 scores remain largely unchanged even when underlying feature representations become structurally undecodable. Clarifies the practical limits of foundation model prompting for structured geometries, showing that zero-shot text prompting fails to transfer edge topology across distinct object classes without low-shot retraining of the geometric features.
Validation
The method was evaluated on three agricultural parcel datasets and one building dataset. Evaluation focused on both instance matching and downstream topological validity, measuring polygon overlaps, gap frequency, and shared boundary continuity against dedicated cropland and building baselines as well as standard GIS cleaning routines.
Critical strengths
Topological decoding by construction: Instead of post-hoc GIS fixes or loss penalties, the decoder builds a planar graph directly from predicted edge and corner fields, ensuring adjacent faces share the same simplified segments. The setup eliminates boundary slivers, and while the residual fallback reintroduces a small amount of overlap (~0.004), it remains well below contour baselines. The prompt-switching experiments are also grounded realistically: zero-shot transfer on buildings drops to 0.08 F1, but adapts to 0.817 with just 10 annotated images.
Limitations of F1 for structural evaluation: The ablation in Table 3 shows that standard region metrics fail to measure polygon decodability. Dropping the geometric branch during LoRA adaptation changes micro F1 by only 0.54 points, yet uncovered instances jump from 11.3% to 96.7%. This clearly shows that instance F1 alone is insufficient for evaluating representation quality in vectorization.
Critical weaknesses
Prompt switching fails on buildings zero-shot (0.08 micro F1), so the model really relies on 10-shot PEFT to do anything useful. More importantly, testing only cropland and buildings avoids the real problem. Cropland is pure tiling and buildings are isolated islands; the paper never evaluates whether this promptable pipeline can handle mixed maps where parcels, roads, and structures meet at shared nodes.
The main pitch is replacing post-hoc repairs with planar graph construction. But the planar graph misses up to 21% of instances, forcing the authors to glue contour polygons back in via the residual fallback. This puts interior overlaps back into the delivered layer and voids the exact topological guarantee of eq. (2).
The network just stacks LoRA and a CenterNet head onto a frozen SAM 3. The topological decoding contains no learned graph operators—it is standard morphological skeletonization, Douglas-Peucker, and GIS polygonization tied together with heuristic thresholds.
Baselines are evaluated out-of-the-box without adaptation, while the proposed model is trained on two domains, fine-tuned on the third, and has its post-processing thresholds searched directly on the AI4Boundaries evaluation split.
Questions for authors
I find the downstream GIS evaluation and the paper's transparency compelling. Addressing the following points directly in the rebuttal would help me reconsider my score:
Evaluation-split tuning: In Appendix D, the post-processing grid search ran directly on the AI4Boundaries evaluation images. What is the performance if thresholds are tuned on a held-out training split instead? Alternatively, how do the baselines perform if given an equivalent post-processing search on this split?
Cross-category and road-network consistency: Experiments are confined to isolated cropland tiling or standalone buildings. In operational mapping, parcels, road networks, and building footprints meet at shared junctions and linear boundaries. If prompts for fields, roads, and structures are executed on the same scene, can the planar graph preserve topological consistency across layers, or do cross-category slivers and overlaps inevitably reappear?
Fallback proportion: Across the test splits, what exact percentage of delivered polygons comes from the planar graph versus the residual fallback? How should users distinguish polygons that actually satisfy the Eq. (2) guarantee from those that do not?
Summary for AC, SAC and PC
Thank you for handling our submission. To assist your assessment, we summarize the main concerns raised by the reviewers and the evidence added to address them. The reviews prompted further tests of model selection, baseline comparability, geometric-gradient coupling, and the distinction between structural guarantees and instance accuracy.
Independent model selection and comparable baselines (BBpC, zZkL; Section 5, Table 4, Appendix F). We retrained using 3,224 training images and 792 development images. Development loss selects checkpoints; 161 AI4Boundaries development images select post-processing parameters, which are then fixed across all three cropland domains. Development and evaluation image IDs are disjoint, and PASTIS contributes no training or selection data. We added direct SAM3 instance masks with Contour decoding and supervised adaptation of BsiNet and ACPV-Net on the same training/development split. Both our Contour and Topo outputs outperform these three baselines across all three cropland domains. Topo achieves micro F1 of 0.6008, 0.4867, and 0.6037 on AI4Boundaries, PASTIS, and iFLYTEK, respectively.
A controlled test of geometric-gradient coupling (BBpC, zZkL; Table 5, Appendix F). Following the proposed stop-gradient control, both branches remain supervised while only the geometry-loss gradient into LoRA is blocked. With identical initialization, seed, 25,792 updates, and decoder settings, retaining geometric gradients improves strict graph F1 by 1.36, 2.23, and 1.41 percentage points across the three domains. This supports the contribution of geometric gradients at a matched training budget. We also report development-selected checkpoints separately: stop-gradient has higher strict graph F1 under that selection procedure. The evidence therefore supports a fixed-budget effect, rather than uniform superiority under every checkpoint-selection setting.
Structural correctness measured against ground truth (BBpC, zZkL, 2sXQ; Table 5, Appendix F). We added GT-referenced adjacency evaluation and shared-boundary localization, rather than relying only on proximity between predicted boundaries. Unmatched objects remain accounted for in global adjacency precision and recall. Using the same weights, strict graph achieves exact adjacency F1 of 0.1298, 0.2175, and 0.1995, compared with 0.0026, 0.0000, and 0.0071 for Contour. These results show improved recovery of annotated adjacency, while their absolute values also expose the remaining structural errors.
Explicit separation of graph guarantees and fallback output (BBpC, zZkL, 2sXQ; Sections 3.4 and 5, Appendix F). Strict graph disables both image and residual fallback and returns only graph faces; Topo adds fallback polygons to recover instances. We report their instance accuracy separately and record polygon provenance. Strict graph has zero mean internal overlap across the four evaluated domains; fallback polygons in Topo lie outside this guarantee. Graph faces account for 81.32%–86.37% of cropland Topo polygons. We also distinguish predicted-instance assignment diagnostics from GT recall, and clarify that shared boundary coordinates do not implement persistent shared-edge identifiers or linked editing.
A bounded category-transfer claim and complete annotation budget (BBpC, zZkL, 2sXQ; Section 5). We claim prompt-switchable geometric adaptation, rather than zero-shot open-vocabulary vectorization. WHU experiments use 10 adaptation images plus 50 independent development images: 60 labelled images in total. Across three seeds, Topo reaches F1 of 0.8253 ± 0.0154 and Contour 0.8715 ± 0.0024. Buildings test adaptation and instance geometry; contiguous parcels test shared-boundary recovery. Fixed-checkpoint prompt controls and multiclass joint decoding remain outside the demonstrated scope.
Together, these additions clarify what the method guarantees, what its learned geometry contributes, and where fallback or target geometry limits the conclusions. The controlled experiments and supporting implementation details are included in the revised manuscript in dark blue. Thank you for your time and consideration.