KRAFT: A Knowledge Graph-Based Framework for Automated Map Conflation

• URL: http://arxiv.org/abs/2509.04684v1
• Date: Thu, 04 Sep 2025 22:15:11 GMT
• Title: KRAFT: A Knowledge Graph-Based Framework for Automated Map Conflation
• Abstract summary: Digital maps play a crucial role in various applications such as navigation, fleet management, and ride-sharing.<n>Map conflation is the process of augmentation of a GDB using another GDB to conflate missing spatial features.<n>We develop KRAFT, a learning based approach consisting of three parts: Knowledge Graph Construction, Map Matching, and Map Merging.
• Score: 25.65637931342837
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Digital maps play a crucial role in various applications such as navigation, fleet management, and ride-sharing, necessitating their accuracy and currency, which require timely updates. While the majority of geospatial databases (GDBs) provide high-quality information, their data is (i) limited to specific regions and/or (ii) missing some entities, even in their covered areas. Map conflation is the process of augmentation of a GDB using another GDB to conflate missing spatial features. Existing map conflation methods suffer from two main limitations: (1) They are designed for the conflation of linear objects (e.g., road networks) and cannot simply be extended to non-linear objects, thus missing information about most entities in the map. (2) They are heuristic algorithmic approaches that are based on pre-defined rules, unable to learn entities matching in a data-driven manner. To address these limitations, we design KRAFT, a learning based approach consisting of three parts: (1) Knowledge Graph Construction - where each GDB is represented by a knowledge graph, (2) Map Matching - where we use a knowledge graph alignment method as well as a geospatial feature encoder to match entities in obtained knowledge graphs, and (3) Map Merging - where we merge matched entities in the previous modules in a consistent manner, using a mixed integer linear programming formulation that fully merges the GDBs without adding any inconsistencies. Our experimental evaluation shows that not only does KRAFT achieve outstanding performance compared to state-of-the-art and baseline methods in map conflation tasks, but each of its modules (e.g., Map Matching and Map Merging) also separately outperforms traditional matching and merging methods.

Related papers

• HGeo-TopoMap: Boosting Topological Mapping with Hierarchical Geometric Priors [21.87112367760861]
  Topological maps are key outputs of autonomous driving perception systems, delivering essential road information for path planning.<n>Due to the lack of explicit markings for centerlines in real-world environments, the detection of centerline instances remains a significant challenge.<n>We propose HGeo-TopoMap, which leverages an explicit prior map and implicit spatial relations to hierarchically boost topological mapping.
  arXiv  Detail & Related papers  (2026-07-23T13:02:18Z)
• UM3: Unsupervised Map to Map Matching [9.65888302364086]
  Map-to-map matching is a critical task for aligning spatial data across heterogeneous sources.<n>We propose an unsupervised graph-based framework that addresses these challenges through three key innovations.<n>Our method achieves state-of-the-art accuracy in matching tasks, surpassing existing methods by a large margin.
  arXiv  Detail & Related papers  (2025-08-23T02:14:52Z)
• Align-GRAG: Reasoning-Guided Dual Alignment for Graph Retrieval-Augmented Generation [75.9865035064794]
  Large language models (LLMs) have demonstrated remarkable capabilities, but still struggle with issues like hallucinations and outdated information.<n>Retrieval-augmented generation (RAG) addresses these issues by grounding LLM outputs in external knowledge with an Information Retrieval (IR) system.<n>We propose Align-GRAG, a novel reasoning-guided dual alignment framework in post-retrieval phrase.
  arXiv  Detail & Related papers  (2025-05-22T05:15:27Z)
• GeoRDF2Vec Learning Location-Aware Entity Representations in Knowledge Graphs [1.6658912537684454]
  We introduce a variant of RDF2Vec that incorporates geometric information to learn location-aware embeddings of entities.<n>Our approach expands different nodes by flooding the graph from geographic nodes, ensuring that each reachable node is considered.
  arXiv  Detail & Related papers  (2025-04-23T21:17:31Z)
• InteractionMap: Improving Online Vectorized HDMap Construction with Interaction [0.4551615447454768]
  State-of-the-art map vectorization methods are mainly based on DETR-like framework to generate HD maps in an end-to-end manner.<n>In this paper, we propose InteractionMap, which improves previous map vectorization methods by fully leveraging local-to-global information interaction.
  arXiv  Detail & Related papers  (2025-03-27T16:23:15Z)
• An Automatic Graph Construction Framework based on Large Language Models for Recommendation [49.51799417575638]
  We introduce AutoGraph, an automatic graph construction framework based on large language models for recommendation.<n>LLMs infer the user preference and item knowledge, which is encoded as semantic vectors.<n>Latent factors are incorporated as extra nodes to link the user/item nodes, resulting in a graph with in-depth global-view semantics.
  arXiv  Detail & Related papers  (2024-12-24T07:51:29Z)
• Coupled Laplacian Eigenmaps for Locally-Aware 3D Rigid Point Cloud Matching [0.0]
  We propose a new technique, based on graph Laplacian eigenmaps, to match point clouds by taking into account fine local structures. To deal with the order and sign ambiguity of Laplacian eigenmaps, we introduce a new operator, called Coupled Laplacian. We show that the similarity between those aligned high-dimensional spaces provides a locally meaningful score to match shapes.
  arXiv  Detail & Related papers  (2024-02-27T10:10:12Z)
• Jointly Learning Representations for Map Entities via Heterogeneous Graph Contrastive Learning [38.415692986360995]
  We propose a novel method named HOME-GCL for learning representations of multiple categories of map entities. Our approach utilizes a heterogeneous map entity graph (HOME graph) that integrates both road segments and land parcels into a unified framework. To the best of our knowledge, HOME-GCL is the first attempt to jointly learn representations for road segments and land parcels using a unified model.
  arXiv  Detail & Related papers  (2024-02-09T01:47:18Z)
• MGeo: Multi-Modal Geographic Pre-Training Method [49.78466122982627]
  We propose a novel query-POI matching method Multi-modal Geographic language model (MGeo) MGeo represents GC as a new modality and is able to fully extract multi-modal correlations for accurate query-POI matching. Our proposed multi-modal pre-training method can significantly improve the query-POI matching capability of generic PTMs.
  arXiv  Detail & Related papers  (2023-01-11T03:05:12Z)
• Learning Implicit Feature Alignment Function for Semantic Segmentation [51.36809814890326]
  Implicit Feature Alignment function (IFA) is inspired by the rapidly expanding topic of implicit neural representations. We show that IFA implicitly aligns the feature maps at different levels and is capable of producing segmentation maps in arbitrary resolutions. Our method can be combined with improvement on various architectures, and it achieves state-of-the-art accuracy trade-off on common benchmarks.
  arXiv  Detail & Related papers  (2022-06-17T09:40:14Z)
• DAGMapper: Learning to Map by Discovering Lane Topology [84.12949740822117]
  We focus on drawing the lane boundaries of complex highways with many lanes that contain topology changes due to forks and merges. We formulate the problem as inference in a directed acyclic graphical model (DAG), where the nodes of the graph encode geometric and topological properties of the local regions of the lane boundaries. We show the effectiveness of our approach on two major North American Highways in two different states and show high precision and recall as well as 89% correct topology.
  arXiv  Detail & Related papers  (2020-12-22T21:58:57Z)
• Relational Message Passing for Knowledge Graph Completion [78.47976646383222]
  We propose a relational message passing method for knowledge graph completion. It passes relational messages among edges iteratively to aggregate neighborhood information. Results show our method outperforms stateof-the-art knowledge completion methods by a large margin.
  arXiv  Detail & Related papers  (2020-02-17T03:33:41Z)

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.