Centre de documentation
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]

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

Road traffic crashes and emergency response optimization: a geo-spatial analysis using closest facility and location-allocation methods / Sulaiman Yunus in Geomatics, Natural Hazards and Risk, vol 13 (2022)  

Public [article]  inGeomatics, Natural Hazards and Risk > vol 13 (2022) . - pp 1535 - 1555 Titre : Road traffic crashes and emergency response optimization: a geo-spatial analysis using closest facility and location-allocation methods Type de document : Article/Communication Auteurs : Sulaiman Yunus, Auteur ; Ishaq A. Abdulkarim, Auteur Année de publication : 2022 Article en page(s) : pp 1535 - 1555 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] accident de la route [Termes IGN] allocation [Termes IGN] chemin le plus court, algorithme du [Termes IGN] distribution spatiale [Termes IGN] données localisées [Termes IGN] équipement sanitaire [Termes IGN] itinéraire [Termes IGN] Nigéria [Termes IGN] optimisation (mathématiques) [Termes IGN] réseau routier [Termes IGN] secours d'urgence Résumé : (auteur) Increased occurrence of road traffic crashes in Kano metropolis has resulted in a steady loss of lives, injuries, and increased people's risk exposure. This study looked into the emergency response to road traffic crashes in Kano, with a view to improving efficiency by developing linkages and synergy between Emergency Healthcare Facilities (EHCF), ambulances, and crash hotspots. The geographical location and attributes of the major EHCF, crash hotspots along highway intersections, and the two existent ambulances at the Kano State Fire Service (KSFS) and Federal Road Safety Corp head offices (FRSC) were obtained using GPS surveying. Road traffic network data (vector format) was digitized from satellite image, from which two major road classes (highways and minor roads) were identified, as well as their respective speed limits. The length and speed constraints were used to calculate time distances. Nearest Neighbor and Network (closest facility, shortest route, and location-allocation) analyses were carried out. Location-allocation analysis was to determine based on defined criteria the best locations to allocate EHCF or ambulance for optimum coverage. The results demonstrated that EHCF, ambulances, and crash places have different distribution patterns with almost no linkages. Closest ambulance facility analysis revealed the FRSC ambulance takes 9.41 minutes to arrive to crash spot 18 (Maiduguri Road, following NNPC) and 7.52 minutes to arrive at AKTH, the nearest EHCF. Comparatively, getting to Court road incident scene (spot 16) and IRPH as the closest EHCF takes about 3 times the time it takes to get to spot 18 and 4 times the time it takes to get to AKTH. This means that practically almost all victims in the city suffocate before reaching to the hospital. This signifies that, in cases of demand for CPR at the incident scene, there are higher likelihood of dying as it is expected to be provided within the first four minutes after the crash. Based on a maximum of 4 minutes impedance cutoff from all directions towards the occurrences areas, location-allocation analysis found eight new locations to maximize coverage and improve efficiency. It is concluded that current road traffic crash emergency response system has been determined to be ineffective. As a result, more ambulances should be strategically placed to improve emergency response times. Numéro de notice : A2022-884 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/19475705.2022.2086829 Date de publication en ligne : 16/06/2022 En ligne : https://doi.org/10.1080/19475705.2022.2086829 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102209 [article]

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

Public [article]  inGeoinformatica > 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]

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

Public [article]  inGéomatique expert > n° 134 (avril 2021) . - pp 34 - 41 Titre : PgRouting : des fonctions de graphe pour PostGreSQL et POstGIS Type de document : Article/Communication Auteurs : Anonyme, Auteur Année de publication : 2021 Article en page(s) : pp 34 - 41 Langues : Français (fre) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes IGN] chemin le plus court, algorithme du [Termes IGN] PostGIS [Termes IGN] PostgreSQL Résumé : (auteur) Extension relativement peu connue du duo PostGreSQL/POstGIS, PgRouting enrichit la base de données avec des fonctions destinées à opérer sur des graphes : on pourra ainsi s'en servir pour calculer des plus courts chemins ou bien résoudre des problèmes de logistique. Numéro de notice : A2021-902 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=99195 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
IFN-001-P00263	PER	Revue	Nogent-sur-Vernisson	Salle périodiques	Exclu du prêt

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

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

Permalink

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

Permalink

A topographically preserved road‐network tile model and optimal routing method for virtual globes / Quanhua Dong in Transactions in GIS, vol 23 n° 2 (April 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

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

Sea-land interdependence in the global maritime network: the case of Australian port cities / Justin Berli in Networks and Spatial Economics, vol 18 n° 3 (September 2018)  

Permalink

A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks / Shaohua Wang in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)  

Permalink

The characteristics of asymmetric pedestrian behavior : A preliminary study using passive smartphone location data / Nick Malleson in Transactions in GIS, vol 22 n° 2 (April 2018)  

Permalink

Hub Labels on the database for large-scale graphs with the COLD framework / Alexandros Efentakis in Geoinformatica, vol 21 n° 4 (October - December 2017)  

Permalink