Descripteur
Termes IGN > mathématiques > analyse mathématique
analyse mathématique |
Documents disponibles dans cette catégorie (973)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
DEM refinement by low vegetation removal based on the combination of full waveform data and progressive TIN densification / Hongchao Ma in ISPRS Journal of photogrammetry and remote sensing, vol 146 (December 2018)
[article]
Titre : DEM refinement by low vegetation removal based on the combination of full waveform data and progressive TIN densification Type de document : Article/Communication Auteurs : Hongchao Ma, Auteur ; Weiwei Zhou, Auteur ; Liang Zhang, Auteur Année de publication : 2018 Article en page(s) : pp 260 - 271 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] algorithme de Levenberg-Marquardt
[Termes IGN] coefficient de rétrodiffusion
[Termes IGN] contour
[Termes IGN] décomposition de Gauss
[Termes IGN] densification
[Termes IGN] extraction de la végétation
[Termes IGN] filtrage de la végétation
[Termes IGN] forme d'onde pleine
[Termes IGN] hauteur de la végétation
[Termes IGN] modèle numérique de surface
[Termes IGN] semis de points
[Termes IGN] signal laser
[Termes IGN] Triangulated Irregular NetworkRésumé : (Auteur) Filtering of low vegetation with height less than approximately 1.5 m is a challenging problem, especially in mountainous areas covered by heavy low foliage, bushes and sub-shrubberies, etc. The paper proposes an approach for obtaining a more accurate Digital Elevation Model (DEM) by removing low vegetation from point cloud. The approach combines point cloud with full waveform data, and begins by filtering point cloud by way of progressive TIN densification (PTD) method. Ground points are thus extracted, but mixed with false ground points, which are mainly from low vegetation and other manmade low objects. Gaussian decomposition by grouping Levenberg–Marquardt (LM) algorithm with F test is performed for the full waveforms corresponding to the extracted ground points. Echo widths and backscattering coefficients are calculated based on the parameters extracted from the decomposition, and used to discriminate points of low vegetation from points of other low objects, allowing the false ground points reflected from low vegetation to be labeled. New elevation values are calculated from the last echoes of the waveforms from low vegetation, and the DEM is updated by replacing the original elevations with the calculated ones. The resultants are assessed both quantitatively by check points and qualitatively by rendered DEM and contour lines generated from it. The accuracy of the refined DEM with low vegetation removal increases by 31% compared with the original DEM in the experiment, showing the effectiveness of the proposed approach. Numéro de notice : A2018-539 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2018.09.009 Date de publication en ligne : 21/10/2018 En ligne : https://doi.org/10.1016/j.isprsjprs.2018.09.009 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91553
in ISPRS Journal of photogrammetry and remote sensing > vol 146 (December 2018) . - pp 260 - 271[article]Réservation
Réserver ce documentExemplaires(3)
Code-barres Cote Support Localisation Section Disponibilité 081-2018131 RAB Revue Centre de documentation En réserve L003 Disponible 081-2018133 DEP-EXM Revue LASTIG Dépôt en unité Exclu du prêt 081-2018132 DEP-EAF Revue Nancy Dépôt en unité Exclu du prêt 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)
[article]
Titre : Road safety evaluation through automatic extraction of road horizontal alignments from Mobile LiDAR System and inductive reasoning based on a decision tree Type de document : Article/Communication Auteurs : José Antonio Martin-Jimenez, Auteur ; Santiago Zazo, Auteur ; José Juan Arranz Justel, Auteur ; et al., Auteur Année de publication : 2018 Article en page(s) : pp 334 - 346 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] accident de la route
[Termes IGN] arbre de décision
[Termes IGN] cohérence géométrique
[Termes IGN] données GNSS
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] Espagne
[Termes IGN] extraction du réseau routier
[Termes IGN] indice de risque
[Termes IGN] lidar mobile
[Termes IGN] raisonnement
[Termes IGN] sécurité routière
[Termes IGN] segmentation
[Termes IGN] semis de points
[Termes IGN] triangulation de DelaunayRésumé : (auteur) Safe roads are a necessity for any society because of the high social costs of traffic accidents. This challenge is addressed by a novel methodology that allows us to evaluate road safety from Mobile LiDAR System data, taking advantage of the road alignment due to its influence on the accident rate. Automation is obtained through an inductive reasoning process based on a decision tree that provides a potential risk assessment. To achieve this, a 3D point cloud is classified by an iterative and incremental algorithm based on a 2.5D and 3D Delaunay triangulation, which apply different algorithms sequentially. Next, an automatic extraction process of road horizontal alignment parameters is developed to obtain geometric consistency indexes, based on a joint triple stability criterion. Likewise, this work aims to provide a powerful and effective preventive and/or predictive tool for road safety inspections. The proposed methodology was implemented on three stretches of Spanish roads, each with different traffic conditions that represent the most common road types. The developed methodology was successfully validated through as-built road projects, which were considered as “ground truth.” Numéro de notice : A2018-541 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2018.10.004 Date de publication en ligne : 21/10/2018 En ligne : https://doi.org/10.1016/j.isprsjprs.2018.10.004 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91565
in ISPRS Journal of photogrammetry and remote sensing > vol 146 (December 2018) . - pp 334 - 346[article]Réservation
Réserver ce documentExemplaires(3)
Code-barres Cote Support Localisation Section Disponibilité 081-2018131 RAB Revue Centre de documentation En réserve L003 Disponible 081-2018133 DEP-EXM Revue LASTIG Dépôt en unité Exclu du prêt 081-2018132 DEP-EAF Revue Nancy Dépôt en unité Exclu du prêt An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model / Rosen Ivanov in International journal of geographical information science IJGIS, vol 32 n° 11-12 (November - December 2018)
[article]
Titre : An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model Type de document : Article/Communication Auteurs : Rosen Ivanov, Auteur Année de publication : 2018 Article en page(s) : pp 2362 - 2385 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement
[Termes IGN] bati
[Termes IGN] calcul d'itinéraire
[Termes IGN] cartographie à la volée
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] connexité (graphes)
[Termes IGN] connexité (topologie)
[Termes IGN] modèle topologique de données
[Termes IGN] modélisation 3D du bâti BIM
[Termes IGN] positionnement en intérieurRésumé : (Auteur) This article presents an approach to computing K shortest paths in large buildings with complex horizontal and vertical connectivity. The building topology is obtained from Building Information Model (BIM) and implemented using directed multigraphs. Hierarchical design allows the calculation of feasible paths without the need to load into memory the topology of the entire building. It is possible to expand the graph with new connectivity on-the-fly. The paths calculated may be composed of traversable building components that are located inside the buildings or those that are both inside and outside buildings. The performance (computational time and heap size used) is optimized by using the appropriate collections (maps, lists and sets). The proposed algorithm is evaluated in several use-case scenarios – complete graphs and real building environments. In all test scenarios, the proposed path finding algorithm is faster and uses less memory when compared to the fast version of the Yen’s KSP algorithm. The proposed approach can be successfully used as a first level of coarse-to-fine path finding algorithms. Numéro de notice : A2018-525 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE/POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2018.1510126 Date de publication en ligne : 24/08/2018 En ligne : https://doi.org/10.1080/13658816.2018.1510126 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91352
in International journal of geographical information science IJGIS > vol 32 n° 11-12 (November - December 2018) . - pp 2362 - 2385[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2018061 RAB Revue Centre de documentation En réserve L003 Disponible Compactly representing massive terrain models as TINs in CityGML / Kavisha Kumar in Transactions in GIS, vol 22 n° 5 (October 2018)
[article]
Titre : Compactly representing massive terrain models as TINs in CityGML Type de document : Article/Communication Auteurs : Kavisha Kumar, Auteur ; Hugo Ledoux, Auteur ; Jantien E. Stoter, Auteur Année de publication : 2018 Article en page(s) : pp 1152 - 1178 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] CityGML
[Termes IGN] données massives
[Termes IGN] modèle numérique de terrain
[Termes IGN] module d'extension
[Termes IGN] relation topologique
[Termes IGN] Triangulated Irregular Network
[Termes IGN] UML
[Termes IGN] XML schemaRésumé : (Auteur) Terrains form an important part of 3D city models. GIS practitioners often model terrains with 2D grids. However, TINs (Triangulated Irregular networks) are also increasingly used in practice. One such example is the 3D city model of the Netherlands (3DTOP10NL), which covers the whole country as one massive triangulation with more than one billion triangles. Due to the massive size of terrain datasets, the main issue is how to efficiently store and maintain them. The international 3D GIS standard CityGML allows us to store TINs using the Simple Feature representation. However, we argue that it is not appropriate for storing massive TINs and has limitations. We focus in this article on an improved storage representation for massive terrain models as TINs. We review different data structures for compactly representing TINs and explore how they can be implemented in CityGML as an ADE (Application Domain Extension) to efficiently store massive terrains. We model our extension using UML, and XML schemas for the extension are automatically derived from these UML models. Experiments with massive real‐world terrains show that, with this approach, we can compress CityGML files up to a factor of ~20 with one billion+ triangles, and our method has the added benefit of explicitly storing the topological relationships of a TIN model. Numéro de notice : A2018-572 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12456 Date de publication en ligne : 11/10/2018 En ligne : https://doi.org/10.1111/tgis.12456 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92296
in Transactions in GIS > vol 22 n° 5 (October 2018) . - pp 1152 - 1178[article]A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks / Shaohua Wang in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)
[article]
Titre : A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks Type de document : Article/Communication Auteurs : Shaohua Wang, Auteur ; Song Gao, Auteur ; Xin Feng, Auteur ; Alan T. Murray, Auteur ; Yuan Zeng Année de publication : 2018 Article en page(s) : pp 1368 - 1390 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG
[Termes IGN] arbre-R
[Termes IGN] chaîne de traitement
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] démonstration de faisabilité
[Termes IGN] méthode heuristique
[Termes IGN] objet mobile
[Termes IGN] optimisation (mathématiques)
[Termes IGN] position
[Termes IGN] prise en compte du contexte
[Termes IGN] réseau routierRésumé : (Editeur) Given different types of constraints on human life, people must make decisions that satisfy social activity needs. Minimizing costs (i.e. distance, time, or money) associated with travel plays an important role in perceived and realized social quality of life. Identifying optimal interaction locations on road networks when there are multiple moving objects (MMO) with space–time constraints remains a challenge. In this research, we formalize the problem of finding dynamic ideal interaction locations for MMO as a spatial optimization model and introduce a context-based geoprocessing heuristic framework to address this problem. As a proof of concept, a case study involving identification of a meetup location for multiple people under traffic conditions is used to validate the proposed geoprocessing framework. Five heuristic methods with regard to efficient shortest-path search space have been tested. We find that the R* tree-based algorithm performs the best with high quality solutions and low computation time. This framework is implemented in a geographic information systems environment to facilitate integration with external geographic contextual information, e.g. temporary road barriers, points of interest, and real-time traffic information, when dynamically searching for ideal meetup sites. The proposed method can be applied in trip planning, carpooling services, collaborative interaction, and logistics management. Numéro de notice : A2018-278 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658816.2018.1431838 En ligne : https://doi.org/10.1080/13658816.2018.1431838 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90360
in International journal of geographical information science IJGIS > vol 32 n° 7-8 (July - August 2018) . - pp 1368 - 1390[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2018041 RAB Revue Centre de documentation En réserve L003 Disponible From hierarchy to networking: the evolution of the “twenty-first-century Maritime Silk Road” container shipping system / Liehui Wang in Transport reviews, vol 38 n° 4 ([01/07/2018])PermalinkL’opérateur de collage : Gestion de plusieurs points de vue dans un contexte spatial / Géraldine Del Mondo in Revue internationale de géomatique, vol 28 n° 3 (juillet - septembre 2018)PermalinkVoronoi 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)PermalinkPré-estimation et analyse de la précision pour la cartographie par drone / Laurent Valentin Jospin in XYZ, n° 155 (juin - août 2018)PermalinkA voxel- and graph-based strategy for segmenting man-made infrastructures using perceptual grouping laws: comparison and evaluation / Yusheng Xu in Photogrammetric Engineering & Remote Sensing, PERS, vol 84 n° 6 (juin 2018)PermalinkWeighted simplicial complex reconstruction from mobile laser scanning using sensor topology / Stéphane Guinard in Revue Française de Photogrammétrie et de Télédétection, n° 217-218 (juin - septembre 2018)PermalinkComparison of the performances of ground filtering algorithms and DTM generation from a UAV-based point cloud / Cigdem Serifoglu Yilmaz in Geocarto international, vol 33 n° 5 (May 2018)PermalinkA 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)PermalinkOptimization of deformation monitoring networks using finite element strain analysis / M. Amin Alizadeh-Khameneh in Journal of applied geodesy, vol 12 n° 2 (April 2018)PermalinkSpace-time tree ensemble for action recognition and localization / Shugao Ma in International journal of computer vision, vol 126 n° 2-4 (April 2018)Permalink