Centre de documentation
scientifique

A graph-based approach for representing addresses in geocoding / Chen Zhang in Computers, Environment and Urban Systems, vol 100 (March 2023)  

Public [article]  inComputers, Environment and Urban Systems > vol 100 (March 2023) . - n° 101937 Titre : A graph-based approach for representing addresses in geocoding Type de document : Article/Communication Auteurs : Chen Zhang, Auteur ; Biao He, Auteur ; Renzhong Guo, Auteur ; et al., Auteur Année de publication : 2023 Article en page(s) : n° 101937 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] appariement d'adresses [Termes IGN] base de données d'adresses [Termes IGN] géocodage par adresse postale [Termes IGN] graphe [Termes IGN] stockage de données [Termes IGN] toponyme Résumé : (auteur) Addresses, one of the most important geographical reference systems in natural languages, are usually used to search spatial objects in daily life. Geocoding concatenates text with georeferenced coordinates and is an essential middleware service in geographic information applications. Despite its importance, geocoding remains challenging with only text as input, hindering text matching in reference databases without the specific text. To optimize the storage and retrieval of addresses in databases, this work proposes a graph-based approach for representing addresses. The approach clarifies the characteristics of relative concepts, designs a graph structure and identifies modelling strategies. Furthermore, a schema is proposed to perform address matching and toponym disambiguation using an address graph. The model is implemented on a graph database, and experimental tasks are employed to demonstrate its effectiveness. The approach provides a new reference for developers when creating address databases. Numéro de notice : A2023-126 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1016/j.compenvurbsys.2022.101937 Date de publication en ligne : 04/01/2023 En ligne : https://doi.org/10.1016/j.compenvurbsys.2022.101937 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102505 [article]

A spatiotemporal data model and an index structure for computational time geography / Bi Yu Chen in International journal of geographical information science IJGIS, vol 37 n° 3 (March 2023)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 37 n° 3 (March 2023) . - pp 550 - 583 Titre : A spatiotemporal data model and an index structure for computational time geography Type de document : Article/Communication Auteurs : Bi Yu Chen, Auteur ; Yu-Bo Luo, Auteur ; Tao Jia, Auteur ; et al., Auteur Année de publication : 2023 Article en page(s) : pp 550 - 583 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] approche hiérarchique [Termes IGN] données massives [Termes IGN] données spatiotemporelles [Termes IGN] modèle conceptuel de données spatio-temporelles [Termes IGN] requête spatiotemporelle [Termes IGN] stockage de données [Termes IGN] Time-geography Résumé : (auteur) The availability of Spatiotemporal Big Data has provided a golden opportunity for time geographical studies that have long been constrained by the lack of individual-level data. However, how to store, manage, and query a huge number of time geographic entities effectively and efficiently with complex spatiotemporal characteristics and relationships poses a significant challenge to contemporary GIS platforms. In this article, a hierarchical compressed linear reference (CLR) model is proposed to transform network-constrained time geographic entities from three-dimensional (3D) (x, y, t) space into two-dimensional (2D) space. Accordingly, time geographic entities can be represented as 2D spatial entities and stored in a classical spatial database. The proposed CLR model supports a hierarchical linear reference system (LRS) including not only underlying a link-based LRS but also multiple higher-level route-based LRSs. In addition, an LRS-based spatiotemporal index structure is developed to index both time geographic entities and the corresponding hierarchical network. The results of computational experiments on large datasets of space–time paths and prisms show that the proposed hierarchical CLR model is effective at storing and managing time geographic entities in road networks. The developed index structure achieves satisfactory query performance in milliseconds on large datasets of time geographic entities. Numéro de notice : A2023-153 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2022.2128192 Date de publication en ligne : 03/10/2023 En ligne : https://doi.org/10.1080/13658816.2022.2128192 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102836 [article]

Performance benchmark on semantic web repositories for spatially explicit knowledge graph applications / Wenwen Li in Computers, Environment and Urban Systems, vol 98 (December 2022)  

Public [article]  inComputers, Environment and Urban Systems > vol 98 (December 2022) . - n° 101884 Titre : Performance benchmark on semantic web repositories for spatially explicit knowledge graph applications Type de document : Article/Communication Auteurs : Wenwen Li, Auteur ; Sizhe Wang, Auteur ; Sheng wu, Auteur ; et al., Auteur Année de publication : 2022 Article en page(s) : n° 101884 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Infrastructure de données [Termes IGN] base de données relationnelles [Termes IGN] entrepôt de données [Termes IGN] ontologie [Termes IGN] RDF [Termes IGN] référentiel sémantique [Termes IGN] requête spatiale [Termes IGN] réseau sémantique [Termes IGN] SPARQL [Termes IGN] stockage de données [Termes IGN] test de performance [Termes IGN] web sémantique Résumé : (auteur) Knowledge graph has become a cutting-edge technology for linking and integrating heterogeneous, cross-domain datasets to address critical scientific questions. As big data has become prevalent in today's scientific analysis, semantic data repositories that can store and manage large knowledge graph data have become critical in successfully deploying spatially explicit knowledge graph applications. This paper provides a comprehensive evaluation of the popular semantic data repositories and their computational performance in managing and providing semantic support for spatial queries. There are three types of semantic data repositories: (1) triple store solutions (RDF4j, Fuseki, GraphDB, Virtuoso), (2) property graph databases (Neo4j), and (3) an Ontology-Based Data Access (OBDA) approach (Ontop). Experiments were conducted to compare each repository's efficiency (e.g., query response time) in handling geometric, topological, and spatial-semantic related queries. The results show that Virtuoso achieves the overall best performance in both non-spatial and spatial-semantic queries. The OBDA solution, Ontop, has the second-best query performance in spatial and complex queries and the best storage efficiency, requiring the least data-to-RDF conversion efforts. Other triple store solutions suffer from various issues that cause performance bottlenecks in handling spatial queries, such as inefficient memory management and lack of proper query optimization. Numéro de notice : A2022-720 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1016/j.compenvurbsys.2022.101884 En ligne : https://doi.org/10.1016/j.compenvurbsys.2022.101884 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101654 [article]

A geospatial workflow for the assessment of public transit system performance using near real-time data / Anastassios Dardas in Transactions in GIS, vol 26 n° 4 (June 2022)  

Public [article]  inTransactions in GIS > vol 26 n° 4 (June 2022) . - pp 1642 - 1664 Titre : A geospatial workflow for the assessment of public transit system performance using near real-time data Type de document : Article/Communication Auteurs : Anastassios Dardas, Auteur ; Brent Hall, Auteur ; Jon Salter, Auteur ; et al., Auteur Année de publication : 2022 Article en page(s) : pp 1642 - 1664 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG [Termes IGN] ArcGIS [Termes IGN] Calgary [Termes IGN] collecte de données [Termes IGN] données spatiotemporelles [Termes IGN] itinéraire [Termes IGN] planification urbaine [Termes IGN] Python (langage de programmation) [Termes IGN] stockage de données [Termes IGN] temps réel [Termes IGN] trafic routier [Termes IGN] transport public [Termes IGN] WebSIG Résumé : (auteur) This article presents the development of a Geographical Information Systems (GIS) workflow that harvests high-volume and high-frequency near real-time data from a public General Transit Feed Specification (GTFS) and calculates metrics for the assessment of on-time and route speed performance for a public transit system. The approach is applied to near real-time and static GTFS data collected over a 9-month period for the City of Calgary, Alberta, Canada. The workflow uses two Azure Virtual Machines (VMs), one to harvest the data and the other to process observations in parallel using Python and the ArcGIS API libraries. A Web GIS application is described that queries data from MongoDB to visualize the performance results in spatiotemporal form. The purpose of the workflow and Web GIS application is to provide actionable information to transit planners to improve public transportation systems. The data management and analysis workflow is transferable to similar GTFS data from other cities. Numéro de notice : A2022-531 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : sans Date de publication en ligne : 02/05/2022 En ligne : https://doi.org/10.1111/tgis.12942 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101078 [article]

Deep learning-based point cloud compression / Maurice Quach (2022)  

Public Titre : Deep learning-based point cloud compression Titre original : Compression de nuages de points par apprentissage profond Type de document : Thèse/HDR Auteurs : Maurice Quach, Auteur ; Frédéric Dufaux, Directeur de thèse ; Giuseppe Valenzise, Directeur de thèse Editeur : Bures-sur-Yvette : Université Paris-Saclay Année de publication : 2022 Importance : 165 p. Format : 21 x 30 cm Note générale : Bibliographie Thèse de Doctorat de l'Université de Saclay, spécialité Traitement du signal et des images Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes IGN] apprentissage profond [Termes IGN] attribut [Termes IGN] compression d'image [Termes IGN] compression de données [Termes IGN] géométrie [Termes IGN] semis de points [Termes IGN] stockage de données Index. décimale : THESE Thèses et HDR Résumé : (auteur) Point clouds are becoming essential in key applications with advances in capture technologies leading to large volumes of data.Compression is thus essential for storage and transmission.Point Cloud Compression can be divided into two parts: geometry and attribute compression.In addition, point cloud quality assessment is necessary in order to evaluate point cloud compression methods.Geometry compression, attribute compression and quality assessment form the three main parts of this dissertation.The common challenge across these three problems is the sparsity and irregularity of point clouds.Indeed, while other modalities such as images lie on a regular grid, point cloud geometry can be considered as a sparse binary signal over 3D space and attributes are defined on the geometry which can be both sparse and irregular.First, the state of the art for geometry and attribute compression methods with a focus on deep learning based approaches is reviewed.The challenges faced when compressing geometry and attributes are considered, with an analysis of the current approaches to address them, their limitations and the relations between deep learning and traditional ones.We present our work on geometry compression: a convolutional lossy geometry compression approach with a study on the key performance factors of such methods and a generative model for lossless geometry compression with a multiscale variant addressing its complexity issues.Then, we present a folding-based approach for attribute compression that learns a mapping from the point cloud to a 2D grid in order to reduce point cloud attribute compression to an image compression problem.Furthermore, we propose a differentiable deep perceptual quality metric that can be used to train lossy point cloud geometry compression networks while being well correlated with perceived visual quality and a convolutional neural network for point cloud quality assessment based on a patch extraction approach.Finally, we conclude the dissertation and discuss open questions in point cloud compression, existing solutions and perspectives. We highlight the link between existing point cloud compression research and research problems to relevant areas of adjacent fields, such as rendering in computer graphics, mesh compression and point cloud quality assessment. Note de contenu : 1- Introduction 2- State of the Art on point cloud compression 3- Convolutional neural networks for lossy PCGC 4- Deep generative model for lossless PCGC 5- Deep multiscale lossless PCGC 6- Folding-based PCAC 7- Deep perceptual point cloud quality metric 8- Convolutional Neural Network for PCQA Numéro de notice : 24081 Affiliation des auteurs : non IGN Thématique : IMAGERIE/INFORMATIQUE Nature : Thèse française Note de thèse : Thèse de doctorat : Traitement du signal et des images : Paris-Saclay : 2022 Organisme de stage : Laboratoire des signaux et systèmes DOI : sans En ligne : https://theses.hal.science/tel-03894261 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102331

Guidelines for the management of cultural heritage using 3D models for the insertion of heterogeneous data / Gianna Bertacchi (2022)  

Permalink

Introduction à la géomatique pour le statisticien : quelques concepts et outils innovants de gestion, traitement et diffusion de l’information spatiale / François Sémécurbe (2022)  

Permalink

La 3D dans tous ses états [à Cergy-Pontoise] / Marielle Mayo in Géomètre, n° 2197 (décembre 2021)

Permalink

Curved buildings reconstruction from airborne LiDAR data by matching and deforming geometric primitives / Jingwei Song in IEEE Transactions on geoscience and remote sensing, vol 59 n° 2 (February 2021)  

Permalink

Intégration et analyse de données massives et hétérogènes pour une observation intelligente du territoire / Rodrigue Kafando (2021)  

Permalink

Knowledge graph management and streaming in the context of edge computing / Weiqin Xu (2021)  

Permalink

Road network simplification for location-based services / Abdeltawab M. Hendawi in Geoinformatica, vol 24 n° 4 (October 2020)  

Permalink

A semantic graph database for the interoperability of 3D GIS data / Eva Savina Malinverni in Applied geomatics, vol 12 n° 3 (September 2020)  

Permalink

Pratique des relevés en zones urbaines denses intégrant les nouvelles technologies / Théo Laporte (2020) 

Permalink

Prestation SIG : les enjeux de la cartographie / Aymeric Dutremble (2020) 

Permalink