Centre dedocumentation
scientifique

Graph-based leaf–wood separation method for individual trees using terrestrial lidar point clouds / Zhilin Tian in IEEE Transactions on geoscience and remote sensing, vol 60 n° 11 (November 2022)  

Public [article]  inIEEE Transactions on geoscience and remote sensing > vol 60 n° 11 (November 2022) . - n° 5705111 Titre : Graph-based leaf–wood separation method for individual trees using terrestrial lidar point clouds Type de document : Article/Communication Auteurs : Zhilin Tian, Auteur ; Shihua Li, Auteur Année de publication : 2022 Article en page(s) : n° 5705111 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes IGN] bois [Termes IGN] branche (arbre) [Termes IGN] chemin le plus court, algorithme du [Termes IGN] données lidar [Termes IGN] échantillonnage de données [Termes IGN] extraction de traits caractéristiques [Termes IGN] feuille (végétation) [Termes IGN] graphe [Termes IGN] Python (langage de programmation) [Termes IGN] segmentation [Termes IGN] semis de points Résumé : (auteur) Terrestrial light detection and ranging (lidar) is capable of resolving trees at the branch/leaf level with accurate and dense point clouds. The separation of leaf and wood components is a prerequisite for the estimation of branch/leaf-scale biophysical properties and realistic tree model reconstruction. Most existing methods have been tested on trees with similar structures; their robustness for trees of different species and sizes remains relatively unexplored. This study proposed a new graph-based leaf–wood separation (GBS) method for individual trees purely using the xyz -information of the point cloud. The GBS method fully utilized the shortest path-based features, as the shortest path can effectively reflect the structures for trees of different species and sizes. Ten types of tree data—covering tropical, temperate, and boreal species—with heights ranging from 5.4 to 43.7 m, were used to test the method performance. The mean accuracy and kappa coefficient at the point level were 94% and 0.78, respectively, and our method outperformed two other state-of-the-art methods. Through further analysis and testing, the GBS method exhibited a strong ability for detecting small and leaf-surrounded branches, and was also sufficiently robust in terms of data subsampling. Our research further demonstrated the potential of the shortest path-based features in leaf–wood separation. The entire framework was provided for use as an open-source Python package, along with our labeled validation data. Numéro de notice : A2022-853 Affiliation des auteurs : non IGN Thématique : FORET/IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2022.3218603 Date de publication en ligne : 01/11/2022 En ligne : https://doi.org/10.1109/TGRS.2022.3218603 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102099 [article]

Predicting the variability in pedestrian travel rates and times using crowdsourced GPS data / Michael J. Campbell in Computers, Environment and Urban Systems, vol 97 (October 2022)  

Public [article]  inComputers, Environment and Urban Systems > vol 97 (October 2022) . - n° 101866 Titre : Predicting the variability in pedestrian travel rates and times using crowdsourced GPS data Type de document : Article/Communication Auteurs : Michael J. Campbell, Auteur ; Philip E. Dennison, Auteur ; Matthew Thompson, Auteur Année de publication : 2022 Article en page(s) : n° 101866 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] base de données localisées [Termes IGN] Californie (Etats-Unis) [Termes IGN] chemin le moins coûteux, algorithme du [Termes IGN] données issues des réseaux sociaux [Termes IGN] durée de trajet [Termes IGN] mobilité urbaine [Termes IGN] navigation pédestre [Termes IGN] pente [Termes IGN] planification urbaine [Termes IGN] trace GPS [Termes IGN] Utah (Etas-Unis) Résumé : (auteur) Accurately predicting pedestrian travel times is critically valuable in emergency response, wildland firefighting, disaster management, law enforcement, and urban planning. However, the relationship between pedestrian movement and landscape conditions is highly variable between individuals, making it difficult to estimate how long it will take broad populations to get from one location to another on foot. Although functions exist for predicting travel rates, they typically oversimplify the inherent variability of pedestrian travel by assuming the effects of landscapes on movement are universal. In this study, we present an approach for predicting the variability in pedestrian travel rates and times using a large, crowdsourced database of GPS tracks. Acquired from the outdoor recreation website AllTrails, these tracks represent nearly 2000 hikes on a diverse range of trails in Utah and California, USA. We model travel rates as a function of the slope of the terrain by generating a series of non-linear percentile models from the 2.5 th to the 97.5 th by 2.5 percentiles. The 50 th percentile model, representing the hiking speed of the typical individual, demonstrates marked improvement over existing slope-travel rate functions when compared to an independent test dataset. Our results demonstrate novel capacity to estimate travel time variability, with modeled percentiles being able to predict actual percentiles with less than 10% error. Travel rate functions can also be applied to least cost path analysis to provide variability in travel times. Numéro de notice : A2022-599 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.compenvurbsys.2022.101866 Date de publication en ligne : 20/08/2022 En ligne : https://doi.org/10.1016/j.compenvurbsys.2022.101866 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101452 [article]

Cost distances and least cost paths respond differently to cost scenario variations: a sensitivity analysis of ecological connectivity modeling / Paul Savary in International journal of geographical information science IJGIS, vol 36 n° 8 (August 2022)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 36 n° 8 (August 2022) . - pp 1652-1676 Titre : Cost distances and least cost paths respond differently to cost scenario variations: a sensitivity analysis of ecological connectivity modeling Type de document : Article/Communication Auteurs : Paul Savary, Auteur ; Jean-Christophe Foltête, Auteur ; Stéphane Garnier, Auteur Année de publication : 2022 Article en page(s) : pp 1652-1676 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse de sensibilité [Termes IGN] chemin le moins coûteux, algorithme du [Termes IGN] connexité (topologie) [Termes IGN] coût Résumé : (auteur) Biodiversity conservation measures designed to ensure ecological connectivity depend on the reliable modeling of species movements. Least-cost path modeling makes it possible to identify the most likely dispersal paths within a landscape and provide two items of ecological relevance: (i) the spatial location of these least-cost paths (LCPs) and (ii) the accumulated cost along them (’cost distance’, CD). This spatial analysis requires that cost values be assigned to every type of land cover. The sensitivity of both LCPs and CDs to the cost scenarios has not been comprehensively assessed across realistic landscapes and diverging cost scenarios. We therefore assessed it in diverse landscapes sampled over metropolitan France and with widely diverging cost scenarios. The spatial overlap of the LCPs was more sensitive to the cost scenario than the CD values were. In addition, highly correlated CD matrices can be derived from very different cost scenarios. Although the range of the cost values and the properties of each cost scenario significantly influenced the outputs of LCP modeling, landscape composition and configuration variables also explained their variations. Accordingly, we provide guidelines for the use of LCP modeling in ecological studies and conservation planning. Numéro de notice : A2022-614 Affiliation des auteurs : non IGN Thématique : BIODIVERSITE/GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2021.2014852 Date de publication en ligne : 21/12/2021 En ligne : https://doi.org/10.1080/13658816.2021.2014852 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101368 [article]

BuyTheDips : PathLoss for improved topology-preserving deep learning-based image segmentation / Minh On Vu Ngoc (2022)  

Public Titre : BuyTheDips : PathLoss for improved topology-preserving deep learning-based image segmentation Type de document : Article/Communication Auteurs : Minh On Vu Ngoc, Auteur ; Yizi Chen , Auteur ; Nicolas Boutry, Auteur ; Jonathan Fabrizio, Auteur ; Clément Mallet , Auteur Editeur : Ithaca [New York - Etats-Unis] : ArXiv - Université Cornell Année de publication : 2022 Projets : SODUCO / Perret, Julien Importance : 13 p. Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes IGN] apprentissage profond [Termes IGN] chemin le plus court, algorithme du [Termes IGN] fonction de perte [Termes IGN] image numérique [Termes IGN] proximité sémantique [Termes IGN] segmentation d'image Résumé : (auteur) Capturing the global topology of an image is essential for proposing an accurate segmentation of its domain. However, most of existing segmentation methods do not preserve the initial topology of the given input, which is detrimental for numerous downstream object-based tasks. This is all the more true for deep learning models which most work at local scales. In this paper, we propose a new topology-preserving deep image segmentation method which relies on a new leakage loss: the Pathloss. Our method is an extension of the BALoss [1], in which we want to improve the leakage detection for better recovering the closeness property of the image segmentation. This loss allows us to correctly localize and fix the critical points (a leakage in the boundaries) that could occur in the predictions, and is based on a shortest-path search algorithm. This way, loss minimization enforces connectivity only where it is necessary and finally provides a good localization of the boundaries of the objects in the image. Moreover, according to our research, our Pathloss learns to preserve stronger elongated structure compared to methods without using topology-preserving loss. Training with our topological loss function, our method outperforms state-of-the-art topology-aware methods on two representative datasets of different natures: Electron Microscopy and Historical Map. Numéro de notice : P2022-005 Affiliation des auteurs : UGE-LASTIG+Ext (2020- ) Thématique : IMAGERIE/INFORMATIQUE Nature : Preprint nature-HAL : Préprint DOI : 10.48550/arXiv.2207.11446 En ligne : https://doi.org/10.48550/arXiv.2207.11446 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101338

Constrained shortest path problems in bi-colored graphs: a label-setting approach / Amin AliAbdi in Geoinformatica [en ligne], vol 25 n° 3 (July 2021)  

Public [article]  inGeoinformatica [en ligne] > vol 25 n° 3 (July 2021) . - pp 513 - 531 Titre : Constrained shortest path problems in bi-colored graphs: a label-setting approach Type de document : Article/Communication Auteurs : Amin AliAbdi, Auteur ; Ali Mohades, Auteur ; Mansoor Davoodi, Auteur Année de publication : 2021 Article en page(s) : pp 513 - 531 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] calcul d'itinéraire [Termes IGN] chemin le plus court, algorithme du [Termes IGN] données d'entrainement sans étiquette [Termes IGN] graphe [Termes IGN] programmation par contraintes Résumé : (auteur) Definition of an optimal path in the real-world routing problems is not necessarily the shortest one, because parameters such as travel time, safety, quality, and smoothness also played essential roles in the definition of optimality. In this paper, we use bi-colored graphs for modeling urban and heterogeneous environments and introduce variations of constraint routing problems. Bi-colored graphs are a kind of directed graphs whose vertices are divided into two subsets of white and gray. We consider two criteria, minimizing the length and minimizing the number of gray vertices and present two problems called gray vertices bounded shortest path problem and length bounded shortest path problem on bi-colored graphs. We propose an efficient time label-setting algorithm to solve these problems. Likewise, we simulate the algorithm and compare it with the related path planning methods on random graphs as well as real-world environments. The simulation results show the efficiency of the proposed algorithm. Numéro de notice : A2021-974 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-019-00385-8 Date de publication en ligne : 03/12/2019 En ligne : https://doi.org/10.1007/s10707-019-00385-8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=100393 [article]

A framework to manage uncertainty in the computation of waste collection routes after a flood / Arnaud Le Guilcher in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol V-4-2021 (July 2021)  

Permalink

PgRouting : des fonctions de graphe pour PostGreSQL et POstGIS / Anonyme in Géomatique expert, n° 134 (avril 2021)

Permalink

A trajectory restoration algorithm for low-sampling-rate floating car data and complex urban road networks / Bozhao Li in International journal of geographical information science IJGIS, vol 35 n° 4 (April 2021)  

Permalink

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

Permalink

Introducing diversion graph for real-time spatial data analysis with location based social networks / Sameera Kannangara (2021)  

Permalink

Machine learning for the distributed and dynamic management of a fleet of taxis and autonomous shuttles / Tatiana Babicheva (2021)  

Permalink

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

Permalink

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

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

Permalink

Generation of crowd arrival and destination locations/times in complex transit facilities / Brian Ricks in The Visual Computer, vol 36 n° 8 (August 2020)  

Permalink