Centre dedocumentation
scientifique

A hierarchical deep learning framework for the consistent classification of land use objects in geospatial databases / Chun Yang in ISPRS Journal of photogrammetry and remote sensing, vol 177 (July 2021)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 177 (July 2021) . - pp 38 - 56 Titre : A hierarchical deep learning framework for the consistent classification of land use objects in geospatial databases Type de document : Article/Communication Auteurs : Chun Yang, Auteur ; Franz Rottensteiner, Auteur ; Christian Heipke, Auteur Année de publication : 2021 Article en page(s) : pp 38 - 56 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] Allemagne [Termes IGN] apprentissage profond [Termes IGN] approche hiérarchique [Termes IGN] classification automatique d'objets [Termes IGN] classification par réseau neuronal convolutif [Termes IGN] image aérienne [Termes IGN] jointure [Termes IGN] objet géographique [Termes IGN] occupation du sol [Termes IGN] optimisation (mathématiques) [Termes IGN] utilisation du sol Résumé : (Auteur) Land use as contained in geospatial databases constitutes an essential input for different applications such as urban management, regional planning and environmental monitoring. In this paper, a hierarchical deep learning framework is proposed to verify the land use information. For this purpose, a two-step strategy is applied. First, given high-resolution aerial images, the land cover information is determined. To achieve this, an encoder-decoder based convolutional neural network (CNN) is proposed. Second, the pixel-wise land cover information along with the aerial images serves as input for another CNN to classify land use. Because the object catalogue of geospatial databases is frequently constructed in a hierarchical manner, we propose a new CNN-based method aiming to predict land use in multiple levels hierarchically and simultaneously. A so called Joint Optimization (JO) is proposed where predictions are made by selecting the hierarchical tuple over all levels which has the maximum joint class scores, providing consistent results across the different levels. The conducted experiments show that the CNN relying on JO outperforms previous results, achieving an overall accuracy up to 92.5%. In addition to the individual experiments on two test sites, we investigate whether data showing different characteristics can improve the results of land cover and land use classification, when processed together. To do so, we combine the two datasets and undertake some additional experiments. The results show that adding more data helps both land cover and land use classification, especially the identification of underrepresented categories, despite their different characteristics. Numéro de notice : A2021-370 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2021.04.022 date de publication en ligne : 13/05/2021 En ligne : https://doi.org/10.1016/j.isprsjprs.2021.04.022 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97774 [article]

Vectorized indoor surface reconstruction from 3D point cloud with multistep 2D optimization / Jiali Han in ISPRS Journal of photogrammetry and remote sensing, vol 177 (July 2021)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 177 (July 2021) . - pp 57 - 74 Titre : Vectorized indoor surface reconstruction from 3D point cloud with multistep 2D optimization Type de document : Article/Communication Auteurs : Jiali Han, Auteur ; Mengqi Rong, Auteur ; Hanqing Jiang, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 57 - 74 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes IGN] champ aléatoire de Markov [Termes IGN] données lidar [Termes IGN] espace intérieur [Termes IGN] maillage [Termes IGN] programmation linéaire [Termes IGN] Ransac (algorithme) [Termes IGN] reconstruction 3D [Termes IGN] reconstruction d'objet [Termes IGN] segmentation sémantique [Termes IGN] semis de points [Termes IGN] vectorisation Résumé : (Auteur) Vectorized reconstruction from indoor point cloud has attracted increasing attention in recent years due to its high regularity and low memory consumption. Compared with aerial mapping of outdoor urban environments, indoor point cloud generated by LiDAR scanning or image-based 3D reconstruction usually contain more clutter and missing areas, which greatly increase the difficulty of vectorized reconstruction. In this paper, we propose an effective multistep pipeline to reconstruct vectorized models from indoor point cloud without the Manhattan or Atlanta world assumptions. The core idea behind our method is the combination of a sequence of 2D segment or cell assembly problems that are defined as global optimizations while reducing the reconstruction complexity and enhancing the robustness to different scenes. The proposed method includes a semantic segmentation stage and a reconstruction stage. First, we segment the permanent structures of indoor scenes, including ceilings, floors, walls and cylinders, from the input data, and then, we reconstruct these structures in sequence. The floorplan is first generated by detecting wall planes and selecting optimal subsets of projected wall segments with Integer Linear Programming (ILP), followed by constructing a 2D arrangement and recovering the ceiling and floor structures by Markov Random Field (MRF) labeling on the arrangement. Finally, the wall structures are modeled by lifting each edge of the arrangement to a proper height by means of another global optimization. Merging the respective results yields the final model. The experimental results show that the proposed method could obtain accurate and compact vectorized models on both precise LiDAR data and defect-laden MVS data compared with other state-of-the-art approaches. Numéro de notice : A2021-371 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2021.04.019 date de publication en ligne : 15/05/2021 En ligne : https://doi.org/10.1016/j.isprsjprs.2021.04.019 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97779 [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, V-4-2021 (July 2021)  

Public [article]  inISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences > V-4-2021 (July 2021) . - pp 61 - 68 Titre : A framework to manage uncertainty in the computation of waste collection routes after a flood Type de document : Article/Communication Auteurs : Arnaud Le Guilcher , Auteur ; Sofiane Martel, Auteur ; Mickaël Brasebin , Auteur ; Yann Méneroux, Auteur Année de publication : 2021 Article en page(s) : pp 61 - 68 Note générale : biblographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] cadre conceptuel [Termes IGN] calcul d'itinéraire [Termes IGN] catastrophe naturelle [Termes IGN] collecte des déchets [Termes IGN] discrétisation spatiale [Termes IGN] incertitude géométrique [Termes IGN] inondation [Termes IGN] programmation stochastique [Termes IGN] variable aléatoire Résumé : (auteur) In this paper, we describe a framework to find a good quality waste collection tour after a flood, without having to solve a complicated optimization problem from scratch in limited time. We model the computation of a waste collection tour as a capacitated routing problem, on the vertices or on the edges of a graph, with uncertain waste quantities and uncertain road availability. Multiple models have been conceived to manage uncertainty in routing problems, and we build on the ideas of discretizing the uncertain parameters and computing master solutions that can be adapted to propose an original method to compute efficient solutions. We first introduce our model for the progressive removal of the uncertainty, then outline our method to compute solutions: our method first considers a low-dimensional set of random variables that govern the behaviour of the problem parameters, discretizes these variables and computes a solution for each discrete point before the flood, and then uses these solutions as a basis to build operational solutions when there are enough information about the parameters of the routing problem. We then give computational tools to implement this method. We give a framework to compute the basis of solutions in an efficient way, by computing all the solutions simultaneously and sharing information (that can lead to good quality solutions) between the different problems based on how close their parameters are, and we also describe how real solutions can be derived from this basis. Our main contributions are our model for the progressive removal of uncertainty, our multi-step method to compute efficient solutions, and our intrusive framework to compute solutions on the discrete grid of parameters. Numéro de notice : A2021-316 Affiliation des auteurs : UGE-LaSTIG (2020- ) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.5194/isprs-annals-V-4-2021-61-2021 En ligne : https://doi.org/10.5194/isprs-annals-V-4-2021-61-2021 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97946 [article]

Increasing efficiency of the robust deformation analysis methods using genetic algorithm and generalised particle swarm optimisation / Mehmed Batilović in Survey review, Vol 53 n° 378 (May 2021)  

Public [article]  inSurvey review > Vol 53 n° 378 (May 2021) . - pp 193 - 205 Titre : Increasing efficiency of the robust deformation analysis methods using genetic algorithm and generalised particle swarm optimisation Type de document : Article/Communication Auteurs : Mehmed Batilović, Auteur ; Zoran Sušić, Auteur ; Željko Kanović, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 193 - 205 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Topographie [Termes IGN] algorithme génétique [Termes IGN] barrage [Termes IGN] déformation de la croute terrestre [Termes IGN] itération [Termes IGN] méthode de Monte-Carlo [Termes IGN] méthode des moindres carrés [Termes IGN] méthode robuste [Termes IGN] optimisation par essaim de particules [Termes IGN] Serbie [Termes IGN] surveillance d'ouvrage [Termes IGN] transformation IWST Résumé : (auteur) The paper analyses the possibility of increasing efficiency of the Iterative Weighted Similarity Transformation (IWST) method, which is a prototype of classic robust methods, using global optimisation approach instead of classical one, available in the literature. For the purpose of solving the optimisation problem of the IWST method, in addition to the Iterative Reweighted Least Squares (IRLS) method, the Genetic algorithm (GA) and Generalised Particle Swarm Optimisation (GPSO) algorithm were applied, in order to overcome some flaws of IRLS method. Experimental research was performed based on the Monte Carlo simulation using the mean success rate (MSR) on the example of the geodetic control network for monitoring the Šelevrenac dam in the Republic of Serbia. By using the GA and GPSO algorithms, the overall efficiency of the IWST method has been increased by about 18% compared to the IRLS method. Also, it has been determined that the efficiency of the IRLS method significantly reduces with the increase in the number of displaced potential reference points (PRPs), while the GA and GPSO algorithms’ efficiency does not change significantly. The values of overall absolute true errors due to the increased number of displaced PRPs in the GA and GPSO algorithms did not change notably while with the IRLS method their values increased significantly. Numéro de notice : A2021-402 Affiliation des auteurs : non IGN Thématique : MATHEMATIQUE/POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/00396265.2019.1706294 date de publication en ligne : 04/01/2020 En ligne : https://doi.org/10.1080/00396265.2019.1706294 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97715 [article]

A Voronoi-based method for land-use optimization using semidefinite programming and gradient descent algorithm / Vorapong Suppakitpaisarn in International journal of geographical information science IJGIS, vol 35 n° 5 (May 2021)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 35 n° 5 (May 2021) . - pp 999 - 1031 Titre : A Voronoi-based method for land-use optimization using semidefinite programming and gradient descent algorithm Type de document : Article/Communication Auteurs : Vorapong Suppakitpaisarn, Auteur ; Atthaphon Ariyarit, Auteur ; Supanut Chaidee, Auteur Année de publication : 2021 Article en page(s) : pp 999 - 1031 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] algorithme du gradient [Termes IGN] algorithme génétique [Termes IGN] benchmark spatial [Termes IGN] diagramme de Voronoï [Termes IGN] mode d'occupation du sol [Termes IGN] Thaïlande [Termes IGN] utilisation du sol Résumé : (Auteur) The land-use optimization involves divisions of land into subregions to obtain spatial configuration of compact subregions and desired connections among them. Computational geometry-based algorithms, such as Voronoi diagram, are known to be efficient and suitable for iterative design processes to achieve land-use optimization. However, such algorithms assume that generating point positions are given as inputs, while we usually do not know the positions in advance. In this study, we propose a method to automatically calculate the suitable point positions. The method uses (1) semidefinite programming to approximate locations while maintaining relative positions among locations; and (2) gradient descent to iteratively update locations subject to area constraints. We apply the proposed framework to a practical case at Chiang Mai University and compare its performance with a benchmark, the differential genetic algorithm. The results show that the proposed method is 28 times faster than the differential genetic algorithm, while the resulting land allocation error is slightly larger than that of the benchmark but still acceptable. Additionally, the output does not contain disconnected areas, as found in all evolutionary computations, and the compactness is almost equal to the maximum possible value. Numéro de notice : A2021-336 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1841203 date de publication en ligne : 23/11/2020 En ligne : https://doi.org/10.1080/13658816.2020.1841203 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97555 [article]

Detecting ground deformation in the built environment using sparse satellite InSAR data with a convolutional neural network / Nantheera Anantrasirichai in IEEE Transactions on geoscience and remote sensing, vol 59 n° 4 (April 2021)  

Permalink

Aggregating land-use polygons considering line features as separating map elements / Sven Gedicke in Cartography and Geographic Information Science, vol 48 n° 2 (March 2021)  

Permalink

Agricultural land partitioning model based on irrigation efficiency using a multi‐objective artificial bee colony algorithm / Mehrdad Bijandi in Transactions in GIS, Vol 25 n° 1 (February 2021)  

Permalink

An improved ant colony optimization-based algorithm for user-centric multi-objective path planning for ubiquitous environments / Zohreh Masoumi in Geocarto international, vol 36 n° 2 ([01/02/2021])  

Permalink

Optimization of multi-ecosystem model ensembles to simulate vegetation growth at the global scale / Linling Tang in IEEE Transactions on geoscience and remote sensing, vol 59 n° 2 (February 2021)  

Permalink

A points of interest matching method using a multivariate weighting function with gradient descent optimization / Zhou Yang in Transactions in GIS, Vol 25 n° 1 (February 2021)  

Permalink

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

Permalink

From point clouds to high-fidelity models - advanced methods for image-based 3D reconstruction / Audrey Richard (2021)  

Permalink

Georeferencing with self-calibration for airborne full-waveform Lidar data using digital elevation model / Qinghua Li in Photogrammetric Engineering & Remote Sensing, PERS, vol 87 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