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]

Modelling of buildings from aerial LiDAR point clouds using TINs and label maps / Minglei Li in ISPRS Journal of photogrammetry and remote sensing, vol 154 (August 2019)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 154 (August 2019) . - pp 127 - 138 Titre : Modelling of buildings from aerial LiDAR point clouds using TINs and label maps Type de document : Article/Communication Auteurs : Minglei Li, Auteur ; Franz Rottensteiner, Auteur ; Christian Heipke, Auteur Année de publication : 2019 Article en page(s) : pp 127 - 138 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes descripteurs IGN] données lidar [Termes descripteurs IGN] données localisées 3D [Termes descripteurs IGN] modèle numérique du bâti [Termes descripteurs IGN] semis de points [Termes descripteurs IGN] toit [Termes descripteurs IGN] Triangulated Irregular Network Résumé : (Auteur) This paper presents a new framework for automatically creating compact building models from aerial LiDAR point clouds, where each point is known to belong to the class building. The approach addresses the issues of non-uniform point density and outlier detection to extract and refine semantic roof structures by a sequence of operations on a label map. We first partition the points into some coarse regions based on a region growing method over the Triangulated Irregular Network (TIN) model. The region label IDs are then projected to a 2D grid map, which is used to refine the roof regions and their boundaries. We design an energy optimization approach on the label map to optimize the region labels. In order to regularize the contours of roof regions extracted from the label map, we propose a new method for refining contour segment vertices, which iteratively filters the normals of contour segments and uses them to guide the update of contour vertices. The effectiveness of this method is evaluated on LiDAR point clouds from different scenes, and its performance is validated by extensive comparisons to state-of-the-art techniques. Numéro de notice : A2019-267 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2019.06.003 date de publication en ligne : 11/06/2019 En ligne : https://doi.org/10.1016/j.isprsjprs.2019.06.003 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93082 [article]

Réservation

Réserver ce document

Exemplaires (3)

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

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

Reliable image matching via photometric and geometric constraints structured by Delaunay triangulation / San Jiang in ISPRS Journal of photogrammetry and remote sensing, vol 153 (July 2019)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 153 (July 2019) . - pp 1 - 2O Titre : Reliable image matching via photometric and geometric constraints structured by Delaunay triangulation Type de document : Article/Communication Auteurs : San Jiang, Auteur ; Wanshou Jiang, Auteur Année de publication : 2019 Article en page(s) : pp 1 - 2O Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes descripteurs IGN] appariement d'images [Termes descripteurs IGN] cohérence photométrique [Termes descripteurs IGN] contrainte d'objet [Termes descripteurs IGN] contrainte géométrique [Termes descripteurs IGN] élimination [Termes descripteurs IGN] processus d'analyse hiérarchisée [Termes descripteurs IGN] triangulation de Delaunay [Termes descripteurs IGN] valeur aberrante Résumé : (Auteur) Image matching is a basic task in the field of photogrammetry and remote sensing. By using the advantages of the Delaunay triangulation, this paper proposes a novel image matching method. First, neighboring structures of randomly distributed feature points are formed with the assistance of the Delaunay triangulation and its corresponding graph, and the image planes are simultaneously divided into patches of near-regular triangles. Second, two constraints, a photometric constraint and a geometric constraint, are implemented based on the constructed neighboring structures, which incorporate the hierarchical elimination and left-right checking strategies to deliver the influences of outliers on the decision of inliers and ensure the high precision of the final matches. The former utilizes a line descriptor as a second-order photometric constraint, and the latter adopts the spatial angular order (SAO) to achieve a geometric constraint for the calculation of dissimilarity scores between correspondences. In addition, with the constraints between triangles of the refined Delaunay triangulation and its corresponding graph, a match expansion is designed to exploit as many inliers as possible. Finally, a reliable image matching algorithm is proposed by sequentially executing the three constraints for outlier elimination and match expansion. Under comprehensive analysis and comparison with five state-of-the-art algorithms, the performance of the proposed method is verified by using both rigid and non-rigid datasets. The experimental results demonstrate that the Delaunay triangulation is sufficient to construct neighboring structures for the implementation of local photometric and geometric constraints, and the proposed method can achieve good performance in terms of the precision, recall and number of inliers, and provide reliable matches for stereo image pairs with both rigid and non-rigid transformations. Numéro de notice : A2019-260 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2019.04.006 date de publication en ligne : 01/05/2019 En ligne : https://doi.org/10.1016/j.isprsjprs.2019.04.006 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93073 [article]

Réservation

Réserver ce document

Exemplaires (3)

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

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)  

Permalink

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)  

Permalink

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

Automatic determination of stream networks from DEMs by using road network data to locate culverts / Ville Mäkinen in International journal of geographical information science IJGIS, Vol 33 n° 1-2 (January - 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