Centre dedocumentation
scientifique

A new small area estimation algorithm to balance between statistical precision and scale / Cédric Vega in International journal of applied Earth observation and geoinformation, vol 97 (May 2021)  

Public [article]  inInternational journal of applied Earth observation and geoinformation > vol 97 (May 2021) . - n° 102303 Titre : A new small area estimation algorithm to balance between statistical precision and scale Type de document : Article/Communication Auteurs : Cédric Vega , Auteur ; Jean-Pierre Renaud, Auteur ; Ankit Sagar , Auteur ; Olivier Bouriaud , Auteur Année de publication : 2021 Projets : LUE / Université de Lorraine, DIABOLO / Packalen, Tuula, ARBRE/CHM-era / Jolly, Anne Article en page(s) : n° 102303 Note générale : bibliographie This research was funded by The French Environmental Management Agency (ADEME), grant number 16-60-C0007. The methods and algorithms for processing photogrammetric data were supported by DIABOLO project from the European Union’s Horizon 2020 research and innovation program under grant agreement No 633464, as well as CHM-ERA project from the French National Research Agency (ANR) as part of the “Investissements d’Avenir” program (ANR-11-LABX-0002-01, Lab of Excellence ARBRE). Ankit Sagar received the financial support of the French PIA project “Lorraine Université d’Excellence”, reference ANR-15-IDEX-04-LUE, through the project Impact DeepSurf. Langues : Anglais (eng) Descripteur : [Termes IGN] arbre BSP [Termes IGN] capital sur pied [Termes IGN] données auxiliaires [Termes IGN] données de terrain [Termes IGN] estimation bayesienne [Termes IGN] inventaire forestier national (données France) [Termes IGN] réduction d'échelle [Termes IGN] seuillage [Termes IGN] surface terrière [Vedettes matières IGN] Sylviculture Résumé : (auteur) Combining national forest inventory (NFI) data with auxiliary information allows downscaling and improving the precision of NFI estimates for small domains, where normally too few field plots are available to produce reliable estimates. In most situations, small domains represent administrative units that could greatly vary in size and forested area. In small and poorly sampled domains, the precision of estimates often drop below expected standards. To tackle this issue, we introduce a downscaling algorithm generating the smallest possible groups of domains satisfying prescribed sampling density and estimation error. The binary space partitioning algorithm recursively divides the population of domains in two groups while the prescribed precision conditions are fulfilled. The algorithm was tested on two major forest attributes (i.e. growing stock and basal area) in an area of 7,500 km2 dominated by hardwood forests in the centre of France. The estimation domains consisted in 157 municipalities. The field data included 819 NFI plots surveyed during a 5 years period. The auxiliary data consisted in 48 metrics derived from a forest map, photogrammetric models and Landsat images. A model-assisted framework was used for estimation. For each forest attribute, the best model was selected using a best-subset approach using a Bayesian Information Criteria. The retained models explained 58% and 41% of the observed variance for the growing stocks and basal areas respectively. The performance of the algorithm was evaluated using a minimum of 3 NFI points per domain and estimation errors varying from 10 to 50%. For a target estimation error set to 10%, the algorithm led to a limited number of estimation domains ( The algorithm provides a flexible estimation framework for small area estimation. The key advantages of the approach are relying on its capacity to produce estimations based on a preselected precision threshold and to produce results over the whole area of interest, avoiding areas without any estimates. The algorithm could also be used on any kind of polygon layers (not only administrative ones), provided that the field sampling design enable estimation. This makes the proposed algorithm a convenient tool notably for decision makers and forest managers. Numéro de notice : A2021-067 Affiliation des auteurs : LIF+Ext (2020- ) Thématique : FORET Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.jag.2021.102303 date de publication en ligne : 25/01/2021 En ligne : https://doi.org/10.1016/j.jag.2021.102303 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96992 [article]

A BiLSTM-CNN model for predicting users’ next locations based on geotagged social media / Yi Bao in International journal of geographical information science IJGIS, vol 35 n° 4 (April 2021)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 35 n° 4 (April 2021) . - pp 639 - 660 Titre : A BiLSTM-CNN model for predicting users’ next locations based on geotagged social media Type de document : Article/Communication Auteurs : Yi Bao, Auteur ; Zhou Huang, Auteur ; Linna Li, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 639 - 660 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse de groupement [Termes IGN] classification par réseau neuronal convolutif [Termes IGN] données spatiotemporelles [Termes IGN] géopositionnement [Termes IGN] graphe [Termes IGN] modèle de simulation [Termes IGN] point d'intérêt [Termes IGN] réseau social [Termes IGN] service fondé sur la position [Termes IGN] utilisateur [Termes IGN] Wuhan (Chine) Résumé : (auteur) Location prediction based on spatio-temporal footprints in social media is instrumental to various applications, such as travel behavior studies, crowd detection, traffic control, and location-based service recommendation. In this study, we propose a model that uses geotags of social media to predict the potential area containing users’ next locations. In the model, we utilize HiSpatialCluster algorithm to identify clustering areas (CAs) from check-in points. CA is the basic spatial unit for predicting the potential area containing users’ next locations. Then, we use the LINE (Large-scale Information Network Embedding) to obtain the representation vector of each CA. Finally, we apply BiLSTM-CNN (Bidirectional Long Short-Term Memory-Convolutional Neural Network) for location prediction. The results show that the proposed ensemble model outperforms the single LSTM or CNN model. In the case study that identifies 100 CAs out of Weibo check-ins collected in Wuhan, China, the Top-5 predicted areas containing next locations amount to an 80% accuracy. The high accuracy is of great value for recommendation and prediction on areal unit. Numéro de notice : A2021-268 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1808896 date de publication en ligne : 26/08/2020 En ligne : https://doi.org/10.1080/13658816.2020.1808896 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97324 [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]

Graph convolutional autoencoder model for the shape coding and cognition of buildings in maps / Xiongfeng Yan in International journal of geographical information science IJGIS, vol 35 n° 3 (March 2021)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 35 n° 3 (March 2021) . - pp 490 - 512 Titre : Graph convolutional autoencoder model for the shape coding and cognition of buildings in maps Type de document : Article/Communication Auteurs : Xiongfeng Yan, Auteur ; Tinghua Ai, Auteur ; Min Yang, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 490 - 512 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] apprentissage non-dirigé [Termes IGN] apprentissage profond [Termes IGN] codage [Termes IGN] données vectorielles [Termes IGN] graphe [Termes IGN] mesure géométrique [Termes IGN] modélisation du bâti [Termes IGN] représentation cognitive [Termes IGN] représentation spatiale Résumé : (auteur) The shape of a geospatial object is an important characteristic and a significant factor in spatial cognition. Existing shape representation methods for vector-structured objects in the map space are mainly based on geometric and statistical measures. Considering that shape is complicated and cognitively related, this study develops a learning strategy to combine multiple features extracted from its boundary and obtain a reasonable shape representation. Taking building data as example, this study first models the shape of a building using a graph structure and extracts multiple features for each vertex based on the local and regional structures. A graph convolutional autoencoder (GCAE) model comprising graph convolution and autoencoder architecture is proposed to analyze the modeled graph and realize shape coding through unsupervised learning. Experiments show that the GCAE model can produce a cognitively compliant shape coding, with the ability to distinguish different shapes. It outperforms existing methods in terms of similarity measurements. Furthermore, the shape coding is experimentally proven to be effective in representing the local and global characteristics of building shape in application scenarios such as shape retrieval and matching. Numéro de notice : A2021-166 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1768260 date de publication en ligne : 25/05/2020 En ligne : https://doi.org/10.1080/13658816.2020.1768260 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97100 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2021031	SL	Revue	Centre de documentation	Revues en salle	Disponible

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

A spatiotemporal structural graph for characterizing land cover changes / Bin Wu in International journal of geographical information science IJGIS, vol 35 n° 2 (February 2021)  

Permalink

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)  

Permalink

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

Permalink

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)  

Permalink

Spatial dataset search: Building a dedicated knowledge graph / Mehdi Zhral (2021)  

Permalink

Nonlocal graph convolutional networks for hyperspectral image classification / Lichao Mou in IEEE Transactions on geoscience and remote sensing, Vol 58 n° 12 (December 2020)  

Permalink

A graph convolutional network model for evaluating potential congestion spots based on local urban built environments / Kun Qin in Transactions in GIS, Vol 24 n° 5 (October 2020)  

Permalink

Recognition of building group patterns using graph convolutional network / Rong Zhao in Cartography and Geographic Information Science, Vol 47 n° 5 (September 2020)  

Permalink

A semantic graph database for the interoperability of 3D GIS data / Eva Savina Malinverni in Applied geomatics, vol 12 n° 3 (September 2020)  

Permalink

A point cloud feature regularization method by fusing judge criterion of field force / Xijiang Chen in IEEE Transactions on geoscience and remote sensing, vol 58 n° 5 (May 2020)  

Permalink