Centre dedocumentation
scientifique

A scalable method to construct compact road networks from GPS trajectories / Yuejun Guo in International journal of geographical information science IJGIS, vol 35 n° 7 (July 2021)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 35 n° 7 (July 2021) . - pp 1309 - 1345 Titre : A scalable method to construct compact road networks from GPS trajectories Type de document : Article/Communication Auteurs : Yuejun Guo, Auteur ; Anton Bardera, Auteur ; Marta Fort, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 1309 - 1345 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] chevauchement [Termes IGN] compensation par faisceaux [Termes IGN] contour [Termes IGN] généralisation automatique de données [Termes IGN] méthode heuristique [Termes IGN] noeud [Termes IGN] réseau routier [Termes IGN] segmentation par décomposition-fusion [Termes IGN] squelettisation [Termes IGN] trajectographie par GPS [Termes IGN] trajectoire Résumé : (auteur) The automatic generation of road networks from GPS tracks is a challenging problem that has been receiving considerable attention in the last years. Although dozens of methods have been proposed, current techniques suffer from two main shortcomings: the quality of the produced road networks is still far from those produced manually, and the methods are slow, making them not scalable to large inputs. In this paper, we present a fast four-step density-based approach to construct a road network from a set of trajectories. A key aspect of our method is the use of an improved version of the Slide method to adjust trajectories to build a more compact density surface. The network has comparable or better quality than that of state-of-the-art methods and is simpler (includes fewer nodes and edges). Furthermore, we also propose a split-and-merge strategy that allows splitting the data domain into smaller regions that can be processed independently, making the method scalable to large inputs. The performance of our method is evaluated with extensive experiments on urban and hiking data. Numéro de notice : A2021-447 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1832229 date de publication en ligne : 16/10/2020 En ligne : https://doi.org/10.1080/13658816.2020.1832229 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97859 [article]

A topology-preserving simplification method for 3D building models / Biao Wang in ISPRS International journal of geo-information, vol 10 n° 6 (June 2021)  

Public [article]  inISPRS International journal of geo-information > vol 10 n° 6 (June 2021) . - n° 422 Titre : A topology-preserving simplification method for 3D building models Type de document : Article/Communication Auteurs : Biao Wang, Auteur ; Guoping Wu, Auteur ; Qiang Zhao, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : n° 422 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] analyse comparative [Termes IGN] CityGML [Termes IGN] erreur de mesure [Termes IGN] modèle topologique de données [Termes IGN] modélisation 3D du bâti BIM [Termes IGN] noeud [Termes IGN] primitive géométrique [Termes IGN] relation topologique [Termes IGN] segmentation Résumé : (auteur) Simplification of 3D building models is an important way to improve rendering efficiency. When existing algorithms are directly applied to simplify multi-component models, generally composed of independent components with strong topological dependence, each component is simplified independently. The consequent destruction of topological dependence can cause unreasonable separation of components and even result in inconsistent conclusions of spatial analysis among different levels of details (LODs). To solve these problems, a novel simplification method, which considers the topological dependence among components as constraints, is proposed. The vertices of building models are divided into boundary vertices, hole vertices, and other ordinary vertices. For the boundary vertex, the angle between the edge and component (E–C angle), denoting the degree of component separation, is introduced to derive an error metric to limit the collapse of the edge located at adjacent areas of neighboring components. An improvement to the quadratic error metric (QEM) algorithm was developed for the hole vertex to address the unexpected error caused by the QEM’s defect. A series of experiments confirmed that the proposed method could effectively maintain the overall appearance features of building models. Compared with the traditional method, the consistency of visibility analysis among different LODs is much better. Numéro de notice : A2021-514 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.3390/ijgi10060422 date de publication en ligne : 20/06/2021 En ligne : https://doi.org/10.3390/ijgi10060422 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97934 [article]

Graph convolutional networks by architecture search for PolSAR image classification / Hongying Liu in Remote sensing, vol 13 n° 7 (April 2021)  

Public [article]  inRemote sensing > vol 13 n° 7 (April 2021) . - n° 1404 Titre : Graph convolutional networks by architecture search for PolSAR image classification Type de document : Article/Communication Auteurs : Hongying Liu, Auteur ; Derong Xu, Auteur ; Tianwen Zhu, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : n° 1404 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image radar et applications [Termes IGN] apprentissage profond [Termes IGN] bande L [Termes IGN] classification par nuées dynamiques [Termes IGN] classification par réseau neuronal convolutif [Termes IGN] classification par séparateurs à vaste marge [Termes IGN] classification semi-dirigée [Termes IGN] échantillon [Termes IGN] graphe [Termes IGN] image AIRSAR [Termes IGN] image radar moirée [Termes IGN] noeud [Termes IGN] polarimétrie radar [Termes IGN] réseau neuronal de graphes Résumé : (auteur) Classification of polarimetric synthetic aperture radar (PolSAR) images has achieved good results due to the excellent fitting ability of neural networks with a large number of training samples. However, the performance of most convolutional neural networks (CNNs) degrades dramatically when only a few labeled training samples are available. As one well-known class of semi-supervised learning methods, graph convolutional networks (GCNs) have gained much attention recently to address the classification problem with only a few labeled samples. As the number of layers grows in the network, the parameters dramatically increase. It is challenging to determine an optimal architecture manually. In this paper, we propose a neural architecture search method based GCN (ASGCN) for the classification of PolSAR images. We construct a novel graph whose nodes combines both the physical features and spatial relations between pixels or samples to represent the image. Then we build a new searching space whose components are empirically selected from some graph neural networks for architecture search and develop the differentiable architecture search method to construction our ASGCN. Moreover, to address the training of large-scale images, we present a new weighted mini-batch algorithm to reduce the computing memory consumption and ensure the balance of sample distribution, and also analyze and compare with other similar training strategies. Experiments on several real-world PolSAR datasets show that our method has improved the overall accuracy as much as 3.76% than state-of-the-art methods. Numéro de notice : A2021-350 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/rs13071404 date de publication en ligne : 06/04/2021 En ligne : https://doi.org/10.3390/rs13071404 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97600 [article]

Identification of common points in hybrid geodetic networks to determine vertical movements of the Earth’s crust / Kamil Kowalczyk in Journal of applied geodesy, vol 15 n° 2 (April 2021)  

Public [article]  inJournal of applied geodesy > vol 15 n° 2 (April 2021) . - pp 153 - 167 Titre : Identification of common points in hybrid geodetic networks to determine vertical movements of the Earth’s crust Type de document : Article/Communication Auteurs : Kamil Kowalczyk, Auteur ; Anna Maria Kowalczyk, Auteur ; Jacek Rapinski, Auteur Année de publication : 2021 Article en page(s) : pp 153 - 167 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications de géodésie spatiale [Termes IGN] déformation verticale de la croute terrestre [Termes IGN] géodynamique [Termes IGN] noeud [Termes IGN] réseau géodésique [Termes IGN] réseau hybride [Termes IGN] station GNSS Résumé : (Auteur) Simultaneous use of data repeated levelling measurements and continuous GNSS observations allows increasing the spatial resolution of geodynamics models. For this purpose, it is necessary to create a single network, a so-called hybrid network. This paper aims at examining the possibility of using scale-free network theory to determine the most relevant common points in hybrid networks using the distance criterion. Used on European network points: UELN (United European Levelling Network) and EPN (European Permanent GPS Network) and the regional network. In the hybrid network (UELN + EPN), 18 pseudo-nodal points with the highest number of links were identified. The accepted distance criterion shows that about 90 % of the EPN points can be used as common points. The application of the scale-free network theory allows determining the significance of points in a hybrid network. Numéro de notice : A2021-322 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1515/jag-2021-0002 date de publication en ligne : 25/03/2021 En ligne : https://doi.org/10.1515/jag-2021-0002 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97479 [article]

An anchor-based graph method for detecting and classifying indoor objects from cluttered 3D point clouds / Fei Su in ISPRS Journal of photogrammetry and remote sensing, vol 172 (February 2021)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 172 (February 2021) . - pp 114 - 131 Titre : An anchor-based graph method for detecting and classifying indoor objects from cluttered 3D point clouds Type de document : Article/Communication Auteurs : Fei Su, Auteur ; Haihong Zhu, Auteur ; Taoyi Chen, Auteur Année de publication : 2021 Article en page(s) : pp 114 - 131 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes IGN] adjacence [Termes IGN] appariement de graphes [Termes IGN] arc [Termes IGN] bloc d'ancrage [Termes IGN] classification orientée objet [Termes IGN] données lidar [Termes IGN] données localisées 3D [Termes IGN] jeu de données localisées [Termes IGN] méthode du maximum de vraisemblance (estimation) [Termes IGN] noeud [Termes IGN] objet 3D [Termes IGN] orientation [Termes IGN] positionnement en intérieur [Termes IGN] semis de points Résumé : (auteur) Most of the existing 3D indoor object classification methods have shown impressive achievements on the assumption that all objects are oriented in the upward direction with respect to the ground. To release this assumption, great effort has been made to handle arbitrarily oriented objects in terrestrial laser scanning (TLS) point clouds. As one of the most promising solutions, anchor-based graphs can be used to classify freely oriented objects. However, this approach suffers from missing anchor detection since valid detection relies heavily on the completeness of an anchor’s point clouds and is sensitive to missing data. This paper presents an anchor-based graph method to detect and classify arbitrarily oriented indoor objects. The anchors of each object are extracted by the structurally adjacent relationship among parts instead of the parts’ geometric metrics. In the case of adjacency, an anchor can be correctly extracted even with missing parts since the adjacency between an anchor and other parts is retained irrespective of the area extent of the considered parts. The best graph matching is achieved by finding the optimal corresponding node-pairs in a super-graph with fully connecting nodes based on maximum likelihood. The performances of the proposed method are evaluated with three indicators (object precision, object recall and object F1-score) in seven datasets. The experimental tests demonstrate the effectiveness of dealing with TLS point clouds, RGBD point clouds and Panorama RGBD point clouds, resulting in performance scores of approximately 0.8 for object precision and recall and over 0.9 for chair precision and table recall. Numéro de notice : A2021-087 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2020.12.007 date de publication en ligne : 29/12/2020 En ligne : https://doi.org/10.1016/j.isprsjprs.2020.12.007 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96852 [article]

Réservation

Réserver ce document

Exemplaires (2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2021021	SL	Revue	Centre de documentation	Revues en salle	Disponible
081-2021022	DEP-RECF	Revue	Nancy	Bibliothèque Nancy IFN	Disponible

Learning embeddings for cross-time geographic areas represented as graphs / Margarita Khokhlova (2021)  

Permalink

A novel orthoimage mosaic method using a weighted A∗ algorithm : Implementation and evaluation / Maoteng Zheng in ISPRS Journal of photogrammetry and remote sensing, vol 138 (April 2018)  

Permalink

Multi-view performance capture of surface details / Nadia Robertini in International journal of computer vision, vol 124 n° 1 (August 2017)  

Permalink

Classified and clustered data constellation: An efficient approach of 3D urban data management / Suhaibah Azri in ISPRS Journal of photogrammetry and remote sensing, vol 113 (March 2016)  

Permalink

A wildlife movement approach to optimally locate wildlife crossing structures / Rebecca W. Loraamm in International journal of geographical information science IJGIS, vol 30 n° 1-2 (January - February 2016)  

Permalink

A hybrid link-node approach for finding shortest paths in road networks with turn restrictions / Qingquan Li in Transactions in GIS, vol 19 n° 6 (December 2015)  

Permalink

Querying visible points in large obstructed space / Jianqiu Xu in Geoinformatica [en ligne], vol 19 n° 3 (July - September 2015)  

Permalink

A structural-lexical measure of semantic similarity for geo-knowledge graphs / Andrea Ballatore in ISPRS International journal of geo-information, vol 4 n°2 (June 2015)  

Permalink

A dilution-matching-encoding compaction of trajectories over road networks / Ranit Gotsman in Geoinformatica [en ligne], vol 19 n° 2 (April - June 2015)  

Permalink

Scale-specific automated line simplification by vertex clustering on a hexagonal tessellation / Paulo Raposo in Cartography and Geographic Information Science, vol 40 n° 5 (November 2013)  

Permalink