Descripteur
Documents disponibles dans cette catégorie (891)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Finding the most navigable path in road networks / Ramneek Kaur in Geoinformatica, vol 25 n° 1 (January 2021)
[article]
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 IGN] arc
[Termes IGN] calcul d'itinéraire
[Termes IGN] durée de trajet
[Termes IGN] programmation dynamique
[Termes IGN] réseau routierRé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
in Geoinformatica > vol 25 n° 1 (January 2021) . - pp 207 - 240[article]Hyperspectral and multispectral image fusion via graph Laplacian-guided coupled tensor decomposition / Yuanyang Bu in IEEE Transactions on geoscience and remote sensing, vol 59 n° 1 (January 2021)
[article]
Titre : Hyperspectral and multispectral image fusion via graph Laplacian-guided coupled tensor decomposition Type de document : Article/Communication Auteurs : Yuanyang Bu, Auteur ; Yong-Qiang Zhao, Auteur ; Jize Xue, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 648 - 662 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] analyse spectrale
[Termes IGN] calcul tensoriel
[Termes IGN] équation de Laplace
[Termes IGN] fusion d'images
[Termes IGN] graphe
[Termes IGN] image hyperspectrale
[Termes IGN] image multibande
[Termes IGN] optimisation (mathématiques)
[Termes IGN] tenseur
[Termes IGN] théorie des variétésRésumé : (auteur) We propose a novel graph Laplacian-guided coupled tensor decomposition (gLGCTD) model for fusion of hyperspectral image (HSI) and multispectral image (MSI) for spatial and spectral resolution enhancements. The coupled Tucker decomposition is employed to capture the global interdependencies across the different modes to fully exploit the intrinsic global spatial–spectral information. To preserve local characteristics, the complementary submanifold structures embedded in high-resolution (HR)-HSI are encoded by the graph Laplacian regularizations. The global spatial–spectral information captured by the coupled Tucker decomposition and the local submanifold structures are incorporated into a unified framework. The gLGCTD fusion framework is solved by a hybrid framework between the proximal alternating optimization (PAO) and the alternating direction method of multipliers (ADMM). Experimental results on both synthetic and real data sets demonstrate that the gLGCTD fusion method is superior to state-of-the-art fusion methods with a more accurate reconstruction of the HR-HSI. Numéro de notice : A2021-036 Affiliation des auteurs : non IGN Thématique : IMAGERIE/MATHEMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2020.2992788 Date de publication en ligne : 18/05/2020 En ligne : https://doi.org/10.1109/TGRS.2020.2992788 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96738
in IEEE Transactions on geoscience and remote sensing > vol 59 n° 1 (January 2021) . - pp 648 - 662[article]Inferencing hourly traffic volume using data-driven machine learning and graph theory / Zhiyan Yi in Computers, Environment and Urban Systems, vol 85 (January 2021)
[article]
Titre : Inferencing hourly traffic volume using data-driven machine learning and graph theory Type de document : Article/Communication Auteurs : Zhiyan Yi, Auteur ; Xiaoyue Cathy Liu, Auteur ; Nikola Markovic, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : n° 101548 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] apprentissage automatique
[Termes IGN] classification barycentrique
[Termes IGN] échantillonnage de données
[Termes IGN] Extreme Gradient Machine
[Termes IGN] inférence statistique
[Termes IGN] modèle de simulation
[Termes IGN] planification
[Termes IGN] théorie des graphes
[Termes IGN] trafic routier
[Termes IGN] Utah (Etas-Unis)Résumé : (auteur) Traffic volume is a critical piece of information in many applications, such as transportation long-range planning and traffic operation analysis. Effectively capturing traffic volumes on a network scale is beneficial to Transportation Systems Management & Operations (TSM&O). Yet it is impractical to install sensors to cover a large road network. To address this issue, spatial prediction techniques are widely performed to estimate traffic volumes at sites without sensors. In retrospect, most relevant studies resort to machine learning methods and treat each prediction location independently during the training process, ignoring the potential spatial dependency among them. This paper presents an innovative spatial prediction method of hourly traffic volume on a network scale. To achieve this, we applied a state-of-the-art tree ensemble model - extreme gradient boosting tree (XGBoost) - to handle the large-scale features and hourly traffic volume samples, due to the model's powerful scalability. Moreover, spatial dependency among road segments is taken into account in the proposed model using graph theory. Specifically, we created a traffic network graph leveraging probe trajectory data, and implemented a graph-based approach - breadth first search (BFS) - to search neighboring sites in this graph for computing spatial dependency. The proposed spatial dependency feature is subsequently incorporated as a new feature fed into XGBoost. The proposed model is tested on the road network in the state of Utah. Numerical results not only indicate high computational efficiency of the proposed model, but also demonstrate significant improvement in prediction accuracy of hourly traffic volume comparing with the benchmarked models. Numéro de notice : A2021-004 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1016/j.compenvurbsys.2020.101548 Date de publication en ligne : 24/09/2020 En ligne : https://doi.org/10.1016/j.compenvurbsys.2020.101548 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96271
in Computers, Environment and Urban Systems > vol 85 (January 2021) . - n° 101548[article]Introducing diversion graph for real-time spatial data analysis with location based social networks / Sameera Kannangara (2021)
Titre : Introducing diversion graph for real-time spatial data analysis with location based social networks Type de document : Article/Communication Auteurs : Sameera Kannangara, Auteur ; Hairuo Xie, Auteur ; Egemen Tanin, Auteur ; Aaron Harwood, Auteur ; Shanika Karunasekera, Auteur Editeur : Leibniz [Allemagne] : Schloss Dagstuhl – Leibniz-Zentrum für Informatik Année de publication : 2021 Conférence : GIScience 2021, 11th International Conference on Geographic Information Science 27/09/2021 30/09/2021 Poznań Pologne Open Access Proceedings Note générale : bibliographie Langues : Français (fre) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] graphe
[Termes IGN] image Flickr
[Termes IGN] objet mobile
[Termes IGN] réseau social géodépendant
[Termes IGN] temps réel
[Termes IGN] triangulation de Delaunay
[Termes IGN] TwitterRésumé : (auteur) Neighbourhood graphs are useful for inferring the travel network between locations posted in the Location Based Social Networks (LBSNs). Existing neighbourhood graphs, such as the Stepping Stone Graph lack the ability to process a high volume of LBSN data in real time. We propose a neighbourhood graph named Diversion Graph, which uses an efficient edge filtering method from the Delaunay triangulation mechanism for fast processing of LBSN data. This mechanism enables Diversion Graph to achieve a similar accuracy level as Stepping Stone Graph for inferring travel networks, but with a reduction of the execution time of over 90%. Using LBSN data collected from Twitter and Flickr, we show that Diversion Graph is suitable for travel network processing in real time. Numéro de notice : C2021-079 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Communication DOI : 10.4230/LIPIcs.GIScience.2021.I.7 Date de publication en ligne : 25/09/2020 En ligne : https://doi.org/10.4230/LIPIcs.GIScience.2021.I.7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=100930 Learning-based representations and methods for 3D shape analysis, manipulation and reconstruction / Marie-Julie Rakotosaona (2021)
Titre : Learning-based representations and methods for 3D shape analysis, manipulation and reconstruction Type de document : Thèse/HDR Auteurs : Marie-Julie Rakotosaona, Auteur ; Maks Ovsjanikov, Directeur de thèse Editeur : Palaiseau : Ecole Polytechnique EP Année de publication : 2021 Importance : 148 p. Format : 21 x 30 cm Note générale : bibliographie
These de doctorat de l’Institut Polytechnique de Paris préparée à l’Ecole polytechnique spécialité InformatiqueLangues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] apprentissage profond
[Termes IGN] figure géométrique
[Termes IGN] filtrage de points
[Termes IGN] filtrage du bruit
[Termes IGN] image 3D
[Termes IGN] interpolation
[Termes IGN] maillage
[Termes IGN] maille triangulaire
[Termes IGN] reconstruction 3D
[Termes IGN] semis de points
[Termes IGN] triangulation de Delaunay
[Termes IGN] voxelIndex. décimale : THESE Thèses et HDR Résumé : (auteur) Efficiently processing and analysing 3D data is a crucial challenge in modern applications as 3D shapes are becoming more and more widespread with the proliferation of acquisition devices and modeling tools. While successes of 2D deep learning have become commonplace and surround our daily life, applications that involve 3D data are lagging behind. Due to the more complex non-uniform structure of 3D shapes, successful methods from 2D deep learning cannot be easily extended and there is a strong demand for novel approaches that can both exploit and enable learning using geometric structure. Moreover, being able to handle the various existing representations of 3D shapes such as point clouds and meshes, as well as the artefacts produced from 3D acquisition devices increases the difficulty of the task. In this thesis, we propose systematic approaches that fully exploit geometric information of 3D data in deep learning architectures. We contribute to point cloud denoising, shape interpolation and shape reconstruction methods. We observe that deep learning architectures facilitate learning the underlying surface structure on point clouds that can then be used for denoising as well as shape interpolation. Encoding local patch-based learned priors, as well as complementary geometric information such as edge lengths, leads to powerful pipelines that generate realistic shapes. The key common thread throughout our contributions is facilitating seamless conversion between different representations of shapes. In particular, while using deep learning on triangle meshes is highly challenging due to their combinatorial nature we introduce methods inspired from geometry processing that enable the creation and manipulation of triangle faces. Our methods are robust and generalize well to unseen data despite limited training sets. Our work, therefore, paves the way towards more general, robust and universally useful manipulation of 3D data. Note de contenu : 1- Introduction
2- Introduction en français
3- PointCleanNet: Learning to denoise and remove outliers from dense point clouds
4- Intrinsic point cloud interpolation via dual latent space navigation
5- Learning Delaunay surface elements for mesh reconstruction
6- Differentiable surface triangulation
7- ConclusionNuméro de notice : 28649 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Thèse française Note de thèse : Thèse de Doctorat : Informatique : Ecole Polytechnique : 2021 Organisme de stage : Laboratoire d'informatique de l'École polytechnique DOI : sans En ligne : https://tel.hal.science/tel-03541331/ Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=99744 Learning embeddings for cross-time geographic areas represented as graphs / Margarita Khokhlova (2021)PermalinkPermalinkObject detection using component-graphs and ConvNets with application to astronomical images / Thanh Xuan Nguyen (2021)PermalinkPlanimetric simplification and lexicographic optimal chains for 3D urban scene reconstruction / Julien Vuillamy (2021)PermalinkProbabilistic positioning in mobile phone network and its consequences for the privacy of mobility data / Aleksey Ogulenko in Computers, Environment and Urban Systems, vol 85 (January 2021)PermalinkPermalinkAdjusting the regular network of squares resolution to the digital terrain model surface shape / Dariusz Gościewski in ISPRS International journal of geo-information, vol 9 n° 12 (December 2020)PermalinkNonlocal graph convolutional networks for hyperspectral image classification / Lichao Mou in IEEE Transactions on geoscience and remote sensing, Vol 58 n° 12 (December 2020)PermalinkA comparison of neighbourhood relations based on ordinary Delaunay diagrams and area Delaunay diagrams: an application to define the neighbourhood relations of buildings / Hiroyuki Usui in International journal of geographical information science IJGIS, vol 34 n° 11 (November 2020)PermalinkA framework for group converging pattern mining using spatiotemporal trajectories / Bin Zhao in Geoinformatica, vol 24 n° 4 (October 2020)Permalink