Topologically Consistent Agricultural Parcel Vectorization with Semantic-Guided Diffusion and Topology-Aware Polygonization

• URL: http://arxiv.org/abs/2609.07520v1
• Date: Mon, 07 Sep 2026 14:02:48 GMT
• Title: Topologically Consistent Agricultural Parcel Vectorization with Semantic-Guided Diffusion and Topology-Aware Polygonization
• Abstract summary: Agricultural parcel polygons play a fundamental role in geospatial applications such as precision agriculture, land administration, and crop monitoring.<n>We propose a semantic-guided framework for topologically consistent agricultural parcel vectorization.
• Score: 3.6139826652790865
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Agricultural parcel polygons play a fundamental role in geospatial applications such as precision agriculture, land administration, and crop monitoring. Beyond regular polygon geometry and low vertex redundancy, practical parcel maps should avoid topological conflicts and preserve common boundaries between adjacent fields. Yet this requirement remains largely unresolved: segmentation-based methods mainly produce parcel masks or raster boundary cues and rely on heuristic raster-to-vector conversion, instance- and contour-based methods reconstruct parcels independently, and recent vector-oriented methods improve polygon regularity but do not explicitly recover adjacent parcels from a shared topological structure. To address this gap, we propose a semantic-guided diffusion framework for topologically consistent agricultural parcel vectorization. It couples joint edge--vertex latent diffusion with supervised multi-cue conditioning to generate geometrically regularised parcel-boundary and vertex primitives while suppressing false-positive responses. A topology-aware parcel polygon reconstruction method then converts these primitives into regular polygons by reconstructing parcel faces from a common planar graph, enabling adjacent predicted parcels to reuse shared boundaries and avoid mutual interior intrusion. Extensive experiments on the AI4SmallFarms and iFLYTEK datasets evaluate parcel vectorization in terms of pixel-level coverage, geometric fidelity, object-level correctness, and topological consistency. The results show strong and competitive performance, with zero measured intrusion ratio and the highest shared-edge recall, demonstrating the potential of the proposed framework for accurate, regular, and topologically consistent agricultural parcel vectorization.

Related papers

• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Curvature-Aware PCA with Geodesic Tangent Space Aggregation for Semi-Supervised Learning [52.452902154360565]
  GTSA-PCA is a geometric extension of Principal Component Analysis.<n>It integrates curvature awareness and geodesic consistency within a unified spectral framework.<n>Our results position GTSA-PCA as a principled bridge between statistical and geometric approaches to dimensionality reduction.
  arXiv  Detail & Related papers  (2026-04-20T20:36:36Z)
• Trajectory-Restricted Optimization Conditions and Geometry-Aware Linear Convergence [0.764671395172401]
  We develop a trajectory-restricted framework for linear convergence based on localized geometric regularity.<n>We show that classical convergence guarantees extend under these localized conditions.<n>Our work provides a geometric quantification for fast local convergence after active-set or manifold identification.
  arXiv  Detail & Related papers  (2026-04-18T17:02:06Z)
• Neural Approximation of Generalized Voronoi Diagrams [0.12744523252873352]
  VoroFields is a framework for approximating Voronoi diagrams of finite geometric site sets in low-dimensional domains.<n>A hierarchical decomposition reduces the complexity by refining only near envelope transition strata.
  arXiv  Detail & Related papers  (2026-03-27T20:13:13Z)
• Topology-Preserving Data Augmentation for Ring-Type Polygon Annotations [0.0]
  In architectural analysis, ring-type regions are often encoded as a single cyclic polygon chain connecting outer and inner boundaries.<n>In this work, we introduce an order-preserving polygon augmentation strategy that performs floorplan transformations in mask space.<n> Experiments demonstrate that the approach reliably restores connectivity, achieving near-perfect Cyclic Adjacency Preservation.
  arXiv  Detail & Related papers  (2026-03-16T02:53:37Z)
• Flatten The Complex: Joint B-Rep Generation via Compositional $k$-Cell Particles [22.846357150067927]
  Boundary Representation (B-Reps) is the widely adopted standard in Computer Design (CAD) andAided modeling.<n>Previous methods rely on sequences to handle this hierarchy which fails to fully exploit the geometric relationships between cells.
  arXiv  Detail & Related papers  (2026-01-25T08:00:28Z)
• GFLAN: Generative Functional Layouts [1.1458853556386797]
  GFLAN is a generative framework that restructures floor plan synthesis through explicit factorization into topological planning and geometric realization.<n>Our approach departs from direct pixel-to-pixel or wall-tracing generation in favor of a principled two-stage decomposition.
  arXiv  Detail & Related papers  (2025-12-18T07:52:47Z)
• GeoGNN: Quantifying and Mitigating Semantic Drift in Text-Attributed Graphs [59.61242815508687]
  Graph neural networks (GNNs) on text--attributed graphs (TAGs) encode node texts using pretrained language models (PLMs) and propagate these embeddings through linear neighborhood aggregation.<n>This work introduces a local PCA-based metric that measures the degree of semantic drift and provides the first quantitative framework to analyze how different aggregation mechanisms affect manifold structure.
  arXiv  Detail & Related papers  (2025-11-12T06:48:43Z)
• GMapLatent: Geometric Mapping in Latent Space [51.317738404571514]
  Cross-domain generative models based on encoder-decoder AI architectures have attracted much attention in generating realistic images.<n>We introduce a canonical latent space representation based on geometric mapping to align the cross-domain latent spaces in a rigorous and precise manner.<n>Experiments on gray-scale and color images validate the efficiency, efficacy and applicability of GMapLatent.
  arXiv  Detail & Related papers  (2025-03-30T12:02:36Z)
• HierRelTriple: Guiding Indoor Layout Generation with Hierarchical Relationship Triplet Losses [52.70183252341687]
  We present a hierarchical triplet-based indoor relationship learning method, coined HierRelTriple, with a focus on spatial relationship learning.<n>We introduce HierRelTriple, a hierarchical relational triplets modeling framework that first partitions functional regions and then automatically extracts three levels of spatial relationships.<n>Experiments on unconditional layout synthesis, floorplan-conditioned layout generation, and scene rearrangement demonstrate that HierRel improves spatial-relation metrics by over 15%.
  arXiv  Detail & Related papers  (2025-03-26T07:31:52Z)
• Relation Matters: Foreground-aware Graph-based Relational Reasoning for Domain Adaptive Object Detection [81.07378219410182]
  We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR) FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations. Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
  arXiv  Detail & Related papers  (2022-06-06T05:12:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.