Centre dedocumentation
scientifique

Binary space partitioning visibility tree for polygonal and environment light rendering / Hiroki Okuno in The Visual Computer, vol 37 n° 9 - 11 (September 2021)  

Public [article]  inThe Visual Computer > vol 37 n° 9 - 11 (September 2021) . - pp 2499 - 2511 Titre : Binary space partitioning visibility tree for polygonal and environment light rendering Type de document : Article/Communication Auteurs : Hiroki Okuno, Auteur ; Kei Iwasaki, Auteur Année de publication : 2021 Article en page(s) : pp 2499 - 2511 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes IGN] arbre BSP [Termes IGN] distribution du coefficient de réflexion bidirectionnelle BRDF [Termes IGN] éclairage [Termes IGN] éclairement lumineux [Termes IGN] équation intégrale [Termes IGN] intensité lumineuse [Termes IGN] ombre [Termes IGN] polygone [Termes IGN] réflectance [Termes IGN] visibilité (optique) Résumé : (auteur) In this paper, we present a geometric approach to render shadows for physically based materials under polygonal light sources. Direct illumination calculation from a polygonal light source involves the triple product integral of the lighting, the bidirectional reflectance distribution function (BRDF), and the visibility function over the polygonal domain, which is computation intensive. To achieve real-time performance, work on polygonal light shading exploits analytical solutions of boundary integrals along the edges of the polygonal light at the cost of lacking shadowing effects. We introduce a hierarchical representation for the precomputed visibility function to retain the merits of closed-form solutions for boundary integrals. Our method subdivides the polygonal light into a set of polygons visible from a point to be shaded. Experimental results show that our method can render complex shadows with a GGX microfacet BRDF from polygonal light sources at interactive frame rates. In addition, our visibility representation can be easily incorporated into environment lighting. Numéro de notice : A2021-644 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.1007/s00371-021-02181-8 date de publication en ligne : 14/06/2021 En ligne : https://doi.org/10.1007/s00371-021-02181-8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=98345 [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]

An adaptive filtering algorithm of multilevel resolution point cloud / Youyuan Li in Survey review, Vol 53 n° 379 (July 2021)  

Public [article]  inSurvey review > Vol 53 n° 379 (July 2021) . - pp 300 - 311 Titre : An adaptive filtering algorithm of multilevel resolution point cloud Type de document : Article/Communication Auteurs : Youyuan Li, Auteur ; Jian Wang, Auteur ; Bin Li, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 300 - 311 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes IGN] algorithme de filtrage [Termes IGN] analyse multirésolution [Termes IGN] classification ascendante hiérarchique [Termes IGN] données lidar [Termes IGN] filtrage de points [Termes IGN] filtre adaptatif [Termes IGN] interpolation spatiale [Termes IGN] Kappa de Cohen [Termes IGN] octree [Termes IGN] pente [Termes IGN] semis de points [Termes IGN] seuillage de points Résumé : (auteur) The existing filtering methods for airborne LiDAR point cloud have low accuracy. An adaptive filtering algorithm is proposed which is improved based on multilevel resolution algorithm. First double index structure of Octree and KDtree is established. Then the initial reference surface is constructed by ground seed points. According to the slope fluctuation situation, the grid resolution of the ground referential surface is adjusted in an adaptive way. Finally, the refined surface is formed gradually by multilevel renewing resolution to provide filtered point cloud with high accuracy. Experimental results show that the error of Type II can be effectively reduced, the average Kappa coefficient increases by 0.53% and the average total error decreases by 0.44% compared with multiresolution hierarchical classification algorithm. The result tested by practically measured data shows that Kappa coefficient can reach 90%. Especially, it maintains advantages of high accuracy under complex topographic environment. Numéro de notice : A2021-544 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/00396265.2020.1755163 date de publication en ligne : 29/04/2020 En ligne : https://doi.org/10.1080/00396265.2020.1755163 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=98042 [article]

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]

Réservation

Réserver ce document

Exemplaires (1)

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

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]

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)  

Permalink

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)  

Permalink

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

Permalink

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)  

Permalink

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)  

Permalink

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)  

Permalink

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