Centre dedocumentation
scientifique

Dynamic mechanism of blown sand hazard formation at the Jieqiong section of the Lhasa–Shigatse railway / Shengbo Xie in Geomatics, Natural Hazards and Risk, vol 12 n° 1 (2021)  

Public [article]  inGeomatics, Natural Hazards and Risk > vol 12 n° 1 (2021) . - pp 154 - 166 Titre : Dynamic mechanism of blown sand hazard formation at the Jieqiong section of the Lhasa–Shigatse railway Type de document : Article/Communication Auteurs : Shengbo Xie, Auteur ; Jianjun Qu, Auteur ; Yingjun Pang, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 154 - 166 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] météorologie locale [Termes descripteurs IGN] modèle dynamique [Termes descripteurs IGN] prévention des risques [Termes descripteurs IGN] sable [Termes descripteurs IGN] Tibet [Termes descripteurs IGN] variation saisonnière [Termes descripteurs IGN] vent de sable [Termes descripteurs IGN] vitesse [Termes descripteurs IGN] voie ferrée Résumé : (auteur) Blown sand hazards at the Jieqiong section of the Lhasa–Shigatse railway are severe, and their formation mechanism is unclear. Moreover, sand prevention and control work cannot be carried out. Therefore, the dynamic mechanism of blown sand at the Jieqiong section of the Lhasa–Shigatse Railway was investigated by field observation, laboratory analysis, and calculation. Results show that the yearly sand–moving wind at the Jieqiong section commonly originates from the SW direction. The yearly resultant drift direction and the yearly resultant angle of the maximum possible sand transport quantity are NE direction. The angle between railway trend and sand transport direction is 5°–30°. During dry season, sand materials are blown up by the wind, forming wind–sand flow and movement to the NE direction, at which they are blocked by the railway roadbed. Consequently, accumulation occurs and causes serious damage. Strong wind and dryness are synchronous within a season. The directions of sand source and prevailing wind are consistent, thereby aggravating the blown sand dynamic further. The present results provide a reference for controlling sand hazards in the locale. Numéro de notice : A2021-109 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/19475705.2020.1863268 date de publication en ligne : 28/12/2020 En ligne : https://doi.org/10.1080/19475705.2020.1863268 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96906 [article]

Extraction of street pole-like objects based on plane filtering from mobile LiDAR data / Jingming Tu in IEEE Transactions on geoscience and remote sensing, vol 59 n° 1 (January 2021)  

Public [article]  inIEEE Transactions on geoscience and remote sensing > vol 59 n° 1 (January 2021) . - pp 749 - 768 Titre : Extraction of street pole-like objects based on plane filtering from mobile LiDAR data Type de document : Article/Communication Auteurs : Jingming Tu, Auteur ; Jian Yao, Auteur ; Li Li, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 749 - 768 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes descripteurs IGN] analyse d'image orientée objet [Termes descripteurs IGN] carte routière [Termes descripteurs IGN] détection d'objet [Termes descripteurs IGN] données lidar [Termes descripteurs IGN] extraction de traits caractéristiques [Termes descripteurs IGN] forme caractéristique [Termes descripteurs IGN] méthode robuste [Termes descripteurs IGN] octree [Termes descripteurs IGN] réseau routier Résumé : (auteur) Pole-like objects provide important street infra- structure for road inventory and road mapping. In this article, we proposed a novel pole-like object extraction algorithm based on plane filtering from mobile Light Detection and Ranging (LiDAR) data. The proposed approach is composed of two parts. In the first part, a novel octree-based split scheme was proposed to fit initial planes from off-ground points. The results of the plane fitting contribute to the extraction of pole-like objects. In the second part, we proposed a novel method of pole-like object extraction by plane filtering based on local geometric feature restriction and isolation detection. The proposed approach is a new solution for detecting pole-like objects from mobile LiDAR data. The innovation in this article is that we assumed that each of the pole-like objects can be represented by a plane. Thus, the essence of extracting pole-like objects will be converted to plane selecting problem. The proposed method has been tested on three data sets captured from different scenes. The average completeness, correctness, and quality of our approach can reach up to 87.66%, 88.81%, and 79.03%, which is superior to state-of-the-art approaches. The experimental results indicate that our approach can extract pole-like objects robustly and efficiently. Numéro de notice : A2021-042 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2020.2993454 date de publication en ligne : 20/05/2020 En ligne : https://doi.org/10.1109/TGRS.2020.2993454 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96758 [article]

Finding the most navigable path in road networks / Ramneek Kaur in Geoinformatica [en ligne], vol 25 n° 1 (January 2021)  

Public [article]  inGeoinformatica [en ligne] > vol 25 n° 1 (January 2021) . - pp 207 - 240 Titre : Finding the most navigable path in road networks Type de document : Article/Communication Auteurs : Ramneek Kaur, Auteur ; Vikram Goyal, Auteur ; Venkata M. V. Gunturi, Auteur Année de publication : 2021 Article en page(s) : pp 207 - 240 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] arc [Termes descripteurs IGN] calcul d'itinéraire [Termes descripteurs IGN] programmation dynamique [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] temps de trajet Résumé : (Auteur) Input to the Most Navigable Path (MNP) problem consists of the following: (a) a road network represented as a directed graph, where each edge is associated with numeric attributes of cost and “navigability score” values; (b) a source and a destination and; (c) a budget value which denotes the maximum permissible cost of the solution. Given the input, MNP aims to determine a path between the source and the destination which maximizes the navigability score while constraining its cost to be within the given budget value. The problem can be modeled as the arc orienteering problem which is known to be NP-hard. The current state-of-the-art for this problem may generate paths having loops, and its adaptation for MNP that yields simple paths, was found to be inefficient. In this paper, we propose five novel algorithms for the MNP problem. Our algorithms first compute a seed path from the source to the destination, and then modify the seed path to improve its navigability. We explore two approaches to compute the seed path. For modification of the seed path, we explore different Dynamic Programming based approaches. We also propose an indexing structure for the MNP problem which helps in reducing the running time of some of our algorithms. Our experimental results indicate that the proposed solutions yield comparable or better solutions while being orders of magnitude faster than the current state-of-the-art for large real road networks. Numéro de notice : A2021-095 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00428-5 date de publication en ligne : 03/01/2021 En ligne : https://doi.org/10.1007/s10707-020-00428-5 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96935 [article]

Hidden Markov map matching based on trajectory segmentation with heading homogeneity / Ge Cui in Geoinformatica [en ligne], vol 25 n° 1 (January 2021)  

Public [article]  inGeoinformatica [en ligne] > vol 25 n° 1 (January 2021) . - pp 179 - 206 Titre : Hidden Markov map matching based on trajectory segmentation with heading homogeneity Type de document : Article/Communication Auteurs : Ge Cui, Auteur ; Wentao Bian, Auteur ; Xin Wang, Auteur Année de publication : 2021 Article en page(s) : pp 179 - 206 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] appariement de données localisées [Termes descripteurs IGN] Hidden Markov Model (HMM) [Termes descripteurs IGN] Map Matching [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] segmentation [Termes descripteurs IGN] trajectographie par GPS Résumé : (Auteur) Map matching is to locate GPS trajectories onto the road networks, which is an important preprocessing step for many applications based on GPS trajectories. Currently, hidden Markov model is one of the most widely used methods for map matching. However, both effectiveness and efficiency of conventional map matching methods based on hidden Markov model will decline in the dense road network, as the number of candidate road segments enormously increases around GPS point. To overcome the deficiency, this paper proposes a segment-based hidden Markov model for map matching. The proposed method first partitions GPS trajectory into several GPS sub-trajectories based on the heading homogeneity and length constraint; next, the candidate road segment sequences are searched out for each GPS sub-trajectory; last, GPS sub-trajectories and road segment sequences are matched in hidden Markov model, and the road segment sequences with the maximum probability is identified. A case study is conducted on a real GPS trajectory dataset, and the experiment result shows that the proposed method improves the effectiveness and efficiency of the conventional HMM map matching method. Numéro de notice : A2021-094 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00429-4 date de publication en ligne : 02/01/2021 En ligne : https://doi.org/10.1007/s10707-020-00429-4 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96934 [article]

Route intersection reduction with connected autonomous vehicles / Sadegh Motallebi in Geoinformatica [en ligne], vol 25 n° 1 (January 2021)  

Public [article]  inGeoinformatica [en ligne] > vol 25 n° 1 (January 2021) . - pp 99 - 125 Titre : Route intersection reduction with connected autonomous vehicles Type de document : Article/Communication Auteurs : Sadegh Motallebi, Auteur ; Hairuo Xie, Auteur ; Egemen Tanin, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 99 - 125 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] calcul d'itinéraire [Termes descripteurs IGN] carrefour [Termes descripteurs IGN] chemin le plus court (algorithme) [Termes descripteurs IGN] gestion de trafic [Termes descripteurs IGN] optimisation (mathématiques) [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] trafic routier Résumé : (Auteur) A common cause of traffic congestions is the concentration of intersecting vehicle routes. It can be difficult to reduce the intersecting routes in existing traffic systems where the routes are decided independently from vehicle to vehicle. The development of connected autonomous vehicles provides the opportunity to address the intersecting route problem as the route of vehicles can be coordinated globally. We prototype a traffic management system for optimizing traffic with connected autonomous vehicles. The system allocates routes to the vehicles based on streaming traffic data. We develop two route assignment algorithms for the system. The algorithms can help to mitigate traffic congestions by reducing intersecting routes. Extensive experiments are conducted to compare the proposed algorithms and two state-of-the-art route assignment algorithms with both synthetic and real road networks in a simulated traffic management system. The experimental results show that the proposed algorithms outperform the competitors in terms of the travel time of the vehicles. Numéro de notice : A2021-093 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00420-z date de publication en ligne : 23/08/2020 En ligne : https://doi.org/10.1007/s10707-020-00420-z Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96933 [article]

Automated labeling of schematic maps by optimization with knowledge acquired from existing maps / Tian Lan in Transactions in GIS, Vol 24 n° 6 (December 2020)  

Permalink

Empirical assessment of road network resilience in natural hazards using crowdsourced traffic data / Yi Qiang in International journal of geographical information science IJGIS, vol 34 n° 12 (December 2020)  

Permalink

Les stations virtuelles au service de la cartographie mobile / Mathieu Regul in XYZ, n° 165 (décembre 2020)

Permalink

Follow the road: historical GIS for evaluating the development of routes in the Negev region during the twentieth century / Motti Zohar in Cartography and Geographic Information Science, vol 47 n° 6 (October 2020)  

Permalink

Network-constrained bivariate clustering method for detecting urban black holes and volcanoes / Qiliang Liu in International journal of geographical information science IJGIS, vol 34 n° 10 (October 2020)  

Permalink

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

Permalink

An empirical study on the intra-urban goods movement patterns using logistics big data / Pengxiang Zhao in International journal of geographical information science IJGIS, vol 34 n° 6 (June 2020)  

Permalink

A multi-factor spatial optimization approach for emergency medical facilities in Beijing / Liang Zhou in ISPRS International journal of geo-information, vol 9 n° 6 (June 2020)  

Permalink

Methodology of the automatic generalization of buildings, road networks, forests and surface waters: a case study based on the Topographic Objects Database in Poland / Izabela Karsznia in Geocarto international, vol 35 n° 7 ([15/05/2020])  

Permalink

Automatic extraction of road intersection points from USGS historical map series using deep convolutional neural networks / Mahmoud Saeedimoghaddam in International journal of geographical information science IJGIS, vol 34 n° 5 (May 2020)  

Permalink