Centre dedocumentation
scientifique

A space-time varying graph for modelling places and events in a network / Ikechukwu Maduako in International journal of geographical information science IJGIS, vol 33 n° 10 (October 2019)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 33 n° 10 (October 2019) . - pp 1915 - 1935 Titre : A space-time varying graph for modelling places and events in a network Type de document : Article/Communication Auteurs : Ikechukwu Maduako, Auteur ; Monica Wachowicz, Auteur Année de publication : 2019 Article en page(s) : pp 1915 - 1935 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] accident de la route [Termes descripteurs IGN] analyse des risques [Termes descripteurs IGN] analyse spatio-temporelle [Termes descripteurs IGN] connexité (graphes) [Termes descripteurs IGN] graphe [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] représentation spatiale [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] système d'information géographique [Termes descripteurs IGN] voisinage (topologie) Résumé : (auteur) Modelling topological relationships between places and events is challenging especially because these relationships are dynamic, and their evolutionary analysis relies on the explanatory power of representing their interactions across different temporal resolutions. In this paper, we introduce the Space-Time Varying Graph (STVG) based on the whole graph approach that combines directed and bipartite subgraphs with a time-tree for representing the complex interaction between places and events across time. We demonstrate how the proposed STVG can be exploited to identify and extract evolutionary patterns of traffic accidents using graph metrics, ad-hoc graph queries and clustering algorithms. The results reveal evolutionary patterns that uncover the places with high incidence of accidents over different time resolutions, reveal the main reasons why the traffic accidents have occurred, and disclose evolving communities of densely connected traffic accidents over time. Numéro de notice : A2019-393 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2019.1603386 date de publication en ligne : 17/04/2019 En ligne : https://doi.org/10.1080/13658816.2019.1603386 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93497 [article]

Analysis of collaboration networks in OpenStreetMap through weighted social multigraph mining / Quy Thy Truong in International journal of geographical information science IJGIS, vol 33 n° 7 - 8 (July - august 2019)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 33 n° 7 - 8 (July - august 2019) . - pp 1651 - 1682 Titre : Analysis of collaboration networks in OpenStreetMap through weighted social multigraph mining Type de document : Article/Communication Auteurs : Quy Thy Truong , Auteur ; Cyril de Runz, Auteur ; Guillaume Touya , Auteur Année de publication : 2019 Projets : 1-Pas de projet / Article en page(s) : pp 1651 - 1682 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes descripteurs IGN] cartographie collaborative [Termes descripteurs IGN] comportement [Termes descripteurs IGN] données localisées des bénévoles [Termes descripteurs IGN] exploration de données [Termes descripteurs IGN] graphe [Termes descripteurs IGN] OpenStreetMap [Termes descripteurs IGN] pondération [Termes descripteurs IGN] qualité des données [Termes descripteurs IGN] travail coopératif Résumé : (auteur) This paper aims to qualify the behaviour of contributors to OpenStreetMap (OSM), a volunteered geographic information (VGI) project, through a multigraph approach. The main purpose is to reproduce contributor’s interactions in a more comprehensive way. First, we define a multigraph that combines existing spatial collaboration networks from the literature with new graphs that illustrate collaboration based on specific aspects of the VGI modes of contribution through semantics, geometry and topology. Indeed, the ways that contributors interact with one another through editing, completion, or even consumption may provide additional information on each user’s operation mode and therefore, on the quality of the contributed data. Social collaborations drawn from indirect criteria – for example, comparisons between contributors’ activity areas – can also be contemplated under another network. Second, the resulting multigraph is analysed using data mining approaches to characterise individuals and identify behavioural groups. The implementation of a multiplex network based on an OSM data sample and an initial analysis make it possible to identify useful behaviours for data qualification. The initial results characterise some contributors as pioneers, moderators and truthful contributors, according to their special roles in the graphs. Mapping elements that include these contributors’ participation are likely to be reliable data. Numéro de notice : A2019-025 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2018.1556395 date de publication en ligne : 17/12/2018 En ligne : https://doi.org/10.1080/13658816.2018.1556395 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91958 [article]

Réservation

Réserver ce document

Exemplaires (2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2019062	SL	Revue	Centre de documentation	Revues en salle	Disponible
079-2019061	SL	Revue	Centre de documentation	Revues en salle	Disponible

Computing and querying strict, approximate, and metrically refined topological relations in linked geographic data / Blake Regalia in Transactions in GIS, vol 23 n° 3 (June 2019)  

Public [article]  inTransactions in GIS > vol 23 n° 3 (June 2019) . - pp 601 - 619 Titre : Computing and querying strict, approximate, and metrically refined topological relations in linked geographic data Type de document : Article/Communication Auteurs : Blake Regalia, Auteur ; Krzysztof Janowicz, Auteur ; Grant McKenzie, Auteur Année de publication : 2019 Article en page(s) : pp 601 - 619 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes descripteurs IGN] DBpedia [Termes descripteurs IGN] données localisées [Termes descripteurs IGN] entité géographique [Termes descripteurs IGN] graphe [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] Web des données Résumé : (Auteur) Geographic entities and the information associated with them play a major role in Web‐scale knowledge graphs such as Linked Data. Interestingly, almost all major datasets represent places and even entire regions as point coordinates. There are two key reasons for this. First, complex geometries are difficult to store and query using the current Linked Data technology stack to a degree where many queries take minutes to return or will simply time out. Second, the absence of complex geometries confirms a common suspicion among GIScientists, namely that for many everyday queries place‐based relational knowledge is more relevant than raw geometries alone. To give an illustrative example, the statement that the White House is in Washington, DC is more important for gaining an understating of the city than the exact geometries of both entities. This does not imply that complex geometries are unimportant but that (topological) relations should also be extracted from them. As Egenhofer and Mark (1995b) put it in their landmark paper on naive geography, topology matters, metric refines. In this work we demonstrate how to compute and utilize strict, approximate, and metrically refined topological relations between several geographic feature types in DBpedia and compare our results to approaches that compute result sets for topological queries on the fly. Numéro de notice : A2019-256 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12548 date de publication en ligne : 26/06/2019 En ligne : https://doi.org/10.1111/tgis.12548 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93014 [article]

Deeply integrating linked data with geographic information systems / Gengchen Mai in Transactions in GIS, vol 23 n° 3 (June 2019)  

Public [article]  inTransactions in GIS > vol 23 n° 3 (June 2019) . - pp 579 - 600 Titre : Deeply integrating linked data with geographic information systems Type de document : Article/Communication Auteurs : Gengchen Mai, Auteur ; Krzysztof Janowicz, Auteur ; Bo Yan, Auteur ; Simon Scheider, Auteur Année de publication : 2019 Article en page(s) : pp 579 - 600 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes descripteurs IGN] connecteur logiciel [Termes descripteurs IGN] graphe [Termes descripteurs IGN] ontologie [Termes descripteurs IGN] système d'information géographique [Termes descripteurs IGN] Web des données Résumé : (Auteur) The realization that knowledge often forms a densely interconnected graph has fueled the development of graph databases, Web‐scale knowledge graphs and query languages for them, novel visualization and query paradigms, as well as new machine learning methods tailored to graphs as data structures. One such example is the densely connected and global Linked Data cloud that contains billions of statements about numerous domains, including life science and geography. While Linked Data has found its way into everyday applications such as search engines and question answering systems, there is a growing disconnect between the classical ways in which Geographic Information Systems (GIS) are still used today and the open‐ended, exploratory approaches used to retrieve and consume data from knowledge graphs such as Linked Data. In this work, we conceptualize and prototypically implement a Linked Data connector framework as a set of toolboxes for Esri's ArcGIS to close this gap and enable the retrieval, integration, and analysis of Linked Data from within GIS. We discuss how to connect to Linked Data endpoints, how to use ontologies to probe data and derive appropriate GIS representations on the fly, how to make use of reasoning, how to derive data that are ready for spatial analysis out of RDF triples, and, most importantly, how to utilize the link structure of Linked Data to enable analysis. The proposed Linked Data connector framework can also be regarded as the first step toward a guided geographic question answering system over geographic knowledge graphs. Numéro de notice : A2019-255 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12538 date de publication en ligne : 11/06/2019 En ligne : https://doi.org/10.1111/tgis.12538 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93013 [article]

Pairwise coarse registration of point clouds in urban scenes using voxel-based 4-planes congruent sets / Yusheng Xu in ISPRS Journal of photogrammetry and remote sensing, vol 151 (May 2019)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 151 (May 2019) . - pp 106 - 123 Titre : Pairwise coarse registration of point clouds in urban scenes using voxel-based 4-planes congruent sets Type de document : Article/Communication Auteurs : Yusheng Xu, Auteur ; Richard Boerner, Auteur ; Wei Yao, Auteur ; et al., Auteur Année de publication : 2019 Article en page(s) : pp 106 - 123 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes descripteurs IGN] appariement d'images [Termes descripteurs IGN] congruence [Termes descripteurs IGN] données 4D [Termes descripteurs IGN] données lidar [Termes descripteurs IGN] données spatiotemporelles [Termes descripteurs IGN] modèle stéréoscopique [Termes descripteurs IGN] octree [Termes descripteurs IGN] Ransac (algorithme) [Termes descripteurs IGN] scène urbaine [Termes descripteurs IGN] semis de points [Termes descripteurs IGN] surface plane [Termes descripteurs IGN] voxel Résumé : (Auteur) To ensure complete coverage when measuring a large-scale urban area, pairwise registration between point clouds acquired via terrestrial laser scanning or stereo image matching is usually necessary when there is insufficient georeferencing information from additional GNSS and INS sensors. In this paper, we propose a semi-automatic and target-less method for coarse registration of point clouds using geometric constraints of voxel-based 4-plane congruent sets (V4PCS). The planar patches are firstly extracted from voxelized point clouds. Then, the transformation invariant, 4-plane congruent sets are constructed from extracted planar surfaces in each point cloud. Initial transformation parameters between point clouds are estimated via corresponding congruent sets having the highest registration scores in the RANSAC process. Finally, a closed-form solution is performed to achieve optimized transformation parameters by finding all corresponding planar patches using the initial transformation parameters. Experimental results reveal that our proposed method can be effective for registering point clouds acquired from various scenes. A success rate of better than 80% was achieved, with average rotation errors of about 0.5 degrees and average translation errors less than approximately 0.6 m. In addition, our proposed method is more efficient than other baseline methods when using the same hardware and software configuration conditions. Numéro de notice : A2019-207 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2019.02.015 date de publication en ligne : 18/03/2019 En ligne : https://doi.org/10.1016/j.isprsjprs.2019.02.015 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92673 [article]

Réservation

Réserver ce document

Exemplaires (3)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2019051	SL	Revue	Centre de documentation	Revues en salle	Disponible
081-2019053	DEP-RECP	Revue	MATIS	Dépôt en unité	Exclu du prêt
081-2019052	DEP-RECF	Revue	Nancy	Dépôt en unité	Exclu du prêt

Central place indexing : hierarchical linear indexing systems for mixed-aperture hexagonal discrete global grid systems / Kevin Sahr in Cartographica, vol 54 n° 1 (spring 2019)  

Permalink

A graph-based approach for the structural analysis of road and building layouts / Mathieu Domingo in Geo-spatial Information Science, vol 22 n° 1 (March 2019)  

Permalink

A derivative-free optimization-based approach for detecting architectural symmetries from 3D point clouds / Fan Xue in ISPRS Journal of photogrammetry and remote sensing, vol 148 (February 2019)  

Permalink

Improving LiDAR classification accuracy by contextual label smoothing in post-processing / Nan Li in ISPRS Journal of photogrammetry and remote sensing, vol 148 (February 2019)  

Permalink

Point clouds for direct pedestrian pathfinding in urban environments / Jesus Balado in ISPRS Journal of photogrammetry and remote sensing, vol 148 (February 2019)  

Permalink

Point cloud oversegmentation with graph-structured deep metric learning / Loïc Landrieu (2019)  

Permalink

Spatial data management in apache spark: the GeoSpark perspective and beyond / Jia Yu in Geoinformatica [en ligne], vol 23 n° 1 (January 2019)  

Permalink

Supervized segmentation with graph-structured deep metric learning / Loïc Landrieu (2019)  

Permalink

Un algorithme pour battre le record du SwissTrainChallenge : poser le pied dans chacun des 26 cantons le plus rapidement possible en utilisant uniquement des transports publics / Emmanuel Cledat in XYZ, n° 157 (décembre 2018 - février 2019)

Permalink

An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model / Rosen Ivanov in International journal of geographical information science IJGIS, vol 32 n° 11-12 (November - December 2018)  

Permalink