Centre dedocumentation
scientifique

Scalable surface reconstruction with Delaunay-Graph neural networks / Raphaël Sulzer in Computer graphics forum, vol 40 n° 5 (2021)  

Public [article]  inComputer graphics forum > vol 40 n° 5 (2021) . - pp 157 - 167 Titre : Scalable surface reconstruction with Delaunay-Graph neural networks Type de document : Article/Communication Auteurs : Raphaël Sulzer, Auteur ; Loïc Landrieu , Auteur ; Renaud Marlet, Auteur ; Bruno Vallet , Auteur Année de publication : 2021 Projets : BIOM / Vallet, Bruno Conférence : SGP 2021, Symposium on Geometry Processing 12/07/2021 14/07/2021 Toronto Ontario - Canada open access proceedings Article en page(s) : pp 157 - 167 Note générale : bibliographie The presentation of this work at SGP 2021 is available at https://youtu.be/KIrCDGhS10o Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques [Termes IGN] algorithme Graph-Cut [Termes IGN] apprentissage profond [Termes IGN] prise en compte du contexte [Termes IGN] reconstruction d'objet [Termes IGN] réseau neuronal de graphes [Termes IGN] semis de points [Termes IGN] tétraèdre [Termes IGN] triangulation de Delaunay Résumé : (auteur) We introduce a novel learning-based, visibility-aware, surface reconstruction method for large-scale, defect-laden point clouds. Our approach can cope with the scale and variety of point cloud defects encountered in real-life Multi-View Stereo (MVS) acquisitions. Our method relies on a 3D Delaunay tetrahedralization whose cells are classified as inside or outside the surface by a graph neural network and an energy model solvable with a graph cut. Our model, making use of both local geometric attributes and line-of-sight visibility information, is able to learn a visibility model from a small amount of synthetic training data and generalizes to real-life acquisitions. Combining the efficiency of deep learning methods and the scalability of energy-based models, our approach outperforms both learning and non learning-based reconstruction algorithms on two publicly available reconstruction benchmarks. Numéro de notice : A2021-400 Affiliation des auteurs : UGE-LASTIG+Ext (2020- ) Thématique : IMAGERIE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/cgf14364 En ligne : https://doi.org/10.1111/cgf.14364 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=98219 [article]

A typification method for linear building groups based on stroke simplification / Xiao Wang in Geocarto international, vol 36 n° 15 ([10/08/2021])  

Public [article]  inGeocarto international > vol 36 n° 15 [10/08/2021] . - pp 1732 - 1751 Titre : A typification method for linear building groups based on stroke simplification Type de document : Article/Communication Auteurs : Xiao Wang, Auteur ; Dirk Burghardt, Auteur Année de publication : 2021 Article en page(s) : pp 1732 - 1751 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme de Douglas-Peucker [Termes IGN] alignement [Termes IGN] bâtiment [Termes IGN] généralisation du bâti [Termes IGN] noeud [Termes IGN] objet géographique linéaire [Termes IGN] reconnaissance de formes [Termes IGN] simplification de contour [Termes IGN] triangulation de Delaunay [Vedettes matières IGN] Généralisation Résumé : (auteur) Linear building groups are common patterns and important local structures in large scale maps, which should be carefully generalized. This paper uses the idea of line simplification to typify linear building groups. Firstly, based on the stroke idea, the linear building groups are detected that each building group is related by only one stroke; the collinear and curvilinear patterns are distinguished by calculating the overlap rate between the defined auxiliary polygon and its oriented bounding box. Secondly, the stroke is simplified by removing one node in each iterative step; and the remained nodes are reallocated to the new positions, which serves as the centroids location of the newly typified buildings. Third, the representation (size, shape, elongation, and orientation) of the newly typified buildings are calculated by the geometry information of their corresponding parent buildings. The typification method can be carried out as a progressive process, which iterates over the three steps to derive continuous typification results. The method is tested on two building datasets, and the experimental results demonstrate that the proposed method can achieve good performance by well preserving the original linear patterns in the generalized building groups. Numéro de notice : A2021-569 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : https://doi.org/10.1080/10106049.2019.1669725 Date de publication en ligne : 26/09/2019 En ligne : https://doi.org/10.1080/10106049.2019.1669725 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=98184 [article]

Forest height retrieval using P-band airborne multi-baseline SAR data: A novel phase compensation method / Hongliang Lu in ISPRS Journal of photogrammetry and remote sensing, vol 175 (May 2021)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 175 (May 2021) . - pp 99 - 118 Titre : Forest height retrieval using P-band airborne multi-baseline SAR data: A novel phase compensation method Type de document : Article/Communication Auteurs : Hongliang Lu, Auteur ; Heng Zhang, Auteur ; Huaitao Fan, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 99 - 118 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image radar et applications [Termes IGN] bande P [Termes IGN] Chine [Termes IGN] compensation [Termes IGN] erreur de mesure [Termes IGN] erreur de phase [Termes IGN] Guyane (département français) [Termes IGN] hauteur des arbres [Termes IGN] image radar moirée [Termes IGN] ligne de base [Termes IGN] polarisation [Termes IGN] tomographie radar [Termes IGN] triangulation de Delaunay Résumé : (auteur) Synthetic aperture radar (SAR) tomography (TomoSAR) has been well-established for three-dimensional (3-D) information extraction of forests using the multi-baseline SAR data stacks. The multi-baseline SAR data stacks can be acquired by spaceborne and airborne SAR systems, but for forest scenarios, the data stacks acquired by the airborne SAR system are mostly used. Such a data stack has the advantages of short revisiting time and weak temporal decorrelation. However, due to the baseline errors (caused by the residual platform motion and the measurement errors of the navigation instruments), phase errors (PEs) will occur. PEs are independent of one track to the other, resulting in spreading and defocusing in tomographic imaging. In this paper, we proposed a novel phase compensation method named NC-PGA, which combines the methods of network construction (NC) and phase gradient autofocus (PGA) to estimate and compensate the PEs. The NC method uses the Delaunay triangulation network and beamforming to obtain an accurate elevation estimate of the selected permanent scatterers, which can be used as the prior information for subsequent processing to overcome the shortcomings of the PGA method in PEs estimation. The PGA method uses the spatial invariance of PEs in a limited area to compensate for the PE of each track. The applicability of the NC-PGA method is demonstrated using simulated data and real data. The real data contains two data stacks. The one is acquired by a full-polarization P-band airborne SAR system (developed independently by our project research team) over the study area in Saihanba Forest Farm in Hebei, China. The other one is acquired by ONERA SETHI airborne system over Paracou, French Guiana, in the frame of the European Space Agency’s campaign TropiSAR. We select a test area in the study area and successfully retrieve the height of the forest, and use LiDAR data for results validation and evaluation. Numéro de notice : A2021-271 Affiliation des auteurs : non IGN Thématique : FORET/IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2021.02.022 Date de publication en ligne : 14/03/2021 En ligne : https://doi.org/10.1016/j.isprsjprs.2021.02.022 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97329 [article]

Réservation

Réserver ce document

Exemplaires (3)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2021051	SL	Revue	Centre de documentation	Revues en salle	Disponible
081-2021052	DEP-RECF	Revue	Nancy	Dépôt en unité	Exclu du prêt
081-2021053	DEP-RECP	Revue	Saint-Mandé	Dépôt en unité	Exclu du prêt

A heuristic approach to the generalization of complex building groups in urban villages / Wenhao Yu in Geocarto international, vol 36 n° 2 ([01/02/2021])  

Public [article]  inGeocarto international > vol 36 n° 2 [01/02/2021] . - pp 155 - 179 Titre : A heuristic approach to the generalization of complex building groups in urban villages Type de document : Article/Communication Auteurs : Wenhao Yu, Auteur ; Qi Zhou, Auteur ; Rong Zhao, Auteur Année de publication : 2021 Article en page(s) : pp 155 - 179 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] analyse de groupement [Termes IGN] empreinte [Termes IGN] généralisation du bâti [Termes IGN] méthode heuristique [Termes IGN] représentation multiple [Termes IGN] triangulation de Delaunay [Termes IGN] zone urbaine [Vedettes matières IGN] Généralisation Résumé : (auteur) The generalization of building footprints acts as the basis of multi-scale mapping. Most of the previous studies focus on the generalization of regular building clusters within a wide neighbourhood, but only few has concerned about the generalization of cluttered building clusters within the narrow space such as urban village. The buildings in urban villages show special characteristics in terms of individual properties and group properties, and thus their map generalization processes are often limited. This study proposes a framework to generalize the cluttered building clusters that allows for multi-scale mapping. It first adopts a heuristic method to group adjacent buildings based on the Delaunay triangulation model and then aggregates and simplifies each building group separately. Given that the aggregated buildings in urban villages often show cluttered alignments, our method further trims the jagged boundaries of building footprints by extracting the gap space between neighbouring buildings from the Delaunay triangulation model. Numéro de notice : A2021-084 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/10106049.2019.159046 Date de publication en ligne : 25/03/2019 En ligne : https://doi.org/10.1080/10106049.2019.1590463 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96843 [article]

Efficiently distributed watertight surface reconstruction / Laurent Caraffa (2021)  

Public Titre : Efficiently distributed watertight surface reconstruction Type de document : Article/Communication Auteurs : Laurent Caraffa , Auteur ; Yanis Marchand, Auteur ; Mathieu Brédif , Auteur ; Bruno Vallet , Auteur Editeur : New York : Institute of Electrical and Electronics Engineers IEEE Année de publication : 2021 Projets : 1-Pas de projet / Vallet, Bruno Conférence : 3DV 2021, International Conference on 3D Vision 2021 01/12/2021 03/12/2021 Londres online Royaume-Uni open access proceedings Importance : pp 1432 - 1441 Format : 21 x 30 cm Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes IGN] algorithme Graph-Cut [Termes IGN] données lidar [Termes IGN] données localisées 3D [Termes IGN] reconstruction d'objet [Termes IGN] scène [Termes IGN] semis de points [Termes IGN] Spark [Termes IGN] triangulation de Delaunay Résumé : (auteur) We present an out-of-core and distributed surface reconstruction algorithm which scales efficiently on arbitrarily large point clouds (with optical centres) and produces a 3D watertight triangle mesh representing the surface of the underlying scene. Surface reconstruction from a point cloud is a difficult problem and existing state of the art approaches are usually based on complex pipelines making use of global algorithms (i.e. Delaunay triangulation, graph-cut optimisation). For one of these approaches, we investigate the distribution of all the steps (in particular Delaunay triangulation and graph-cut optimisation) in order to propose a fully scalable method. We show that the problem can be tiled and distributed across a cloud or a cluster of PCs by paying a careful attention to the interactions between tiles and using Spark computing framework. We confirm the efficiency of this approach with an in-depth quantitative evaluation and the successful reconstruction of a surface from a very large data set which combines more than 350 million aerial and terrestrial LiDAR points. Numéro de notice : C2021-037 Affiliation des auteurs : UGE-LASTIG+Ext (2020- ) Autre URL associée : vers HAL Thématique : IMAGERIE/INFORMATIQUE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1109/3DV53792.2021.00150 En ligne : https://doi.org/10.1109/3DV53792.2021.00150 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=99167

A 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)  

Permalink

Comparison of two methods for multiresolution terrain modelling in GIS / Turkay Gokgoz in Geocarto international, vol 35 n° 12 ([01/09/2020])  

Permalink

Provably consistent distributed Delaunay triangulation / Mathieu Brédif in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, V-2 (August 2020)  

Permalink

Small‐area patch‐merging method accounting for both local constraints and the overall area balance / Chengming Li in Transactions in GIS, Vol 24 n° 4 (August 2020)  

Permalink

Recognizing linear building patterns in topographic data by using two new indices based on Delaunay triangulation / Xianjin He in ISPRS International journal of geo-information, vol 9 n° 4 (April 2020)  

Permalink

Reliable image matching via photometric and geometric constraints structured by Delaunay triangulation / San Jiang in ISPRS Journal of photogrammetry and remote sensing, vol 153 (July 2019)  

Permalink

Tile & merge: Distributed Delaunay triangulations for cloud computing / Laurent Caraffa (2019)  

Permalink

Road safety evaluation through automatic extraction of road horizontal alignments from Mobile LiDAR System and inductive reasoning based on a decision tree / José Antonio Martin-Jimenez in ISPRS Journal of photogrammetry and remote sensing, vol 146 (December 2018)  

Permalink

Voronoi tessellation on the ellipsoidal earth for vector data / Christos Kastrisios in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)  

Permalink

Optimization of deformation monitoring networks using finite element strain analysis / M. Amin Alizadeh-Khameneh in Journal of applied geodesy, vol 12 n° 2 (April 2018)  

Permalink