Descripteur
Termes IGN > mathématiques > analyse mathématique
analyse mathématique |
Documents disponibles dans cette catégorie (935)
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
Convergence of one-step projected gradient methods for variational inequalities / Paul-Emile Maingé in Journal of Optimization Theory and Applications, vol 171 n° 1 (October 2016)
[article]
Titre : Convergence of one-step projected gradient methods for variational inequalities Type de document : Article/Communication Auteurs : Paul-Emile Maingé, Auteur ; Marie-Line Gobinddass , Auteur Année de publication : 2016 Article en page(s) : pp 146 - 168 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Mathématique
[Termes IGN] algorithme du gradient
[Termes IGN] calcul variationnel
[Termes IGN] optimisation (mathématiques)Résumé : (auteur) In this paper, we revisit the numerical approach to some classical variational inequalities, with monotone and Lipschitz continuous mapping A, by means of a projected reflected gradient-type method. A main feature of the method is that it formally requires only one projection step onto the feasible set and one evaluation of the involved mapping per iteration. Contrary to what was done so far, we establish the convergence of the method in a more general setting that allows us to use varying step-sizes without any requirement of additional projections. A linear convergence rate is obtained, when A is assumed to be strongly monotone. Preliminary numerical experiments are also performed. Numéro de notice : A2016-973 Affiliation des auteurs : LASTIG LAREG+Ext (2012-mi2018) Thématique : MATHEMATIQUE/POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10957-016-0972-4 Date de publication en ligne : 06/07/2016 En ligne : http://dx.doi.org/10.1007/s10957-016-0972-4 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94217
in Journal of Optimization Theory and Applications > vol 171 n° 1 (October 2016) . - pp 146 - 168[article]The D-FCM partitioned D-BSP tree for massive point cloud data access and rendering / Yi Zhang in ISPRS Journal of photogrammetry and remote sensing, vol 120 (october 2016)
[article]
Titre : The D-FCM partitioned D-BSP tree for massive point cloud data access and rendering Type de document : Article/Communication Auteurs : Yi Zhang, Auteur Année de publication : 2016 Article en page(s) : pp 25 - 36 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] analyse en composantes principales
[Termes IGN] arbre BSP
[Termes IGN] classification floue
[Termes IGN] densité des points
[Termes IGN] semis de points
[Termes IGN] traitement de semis de points
[Termes IGN] valeur propreRésumé : (Auteur) The spatial partitioning of massive point cloud data involves dividing the space into a multi-tree structure step by step, so as to achieve the purpose of fast access and to render the point cloud. The current methods are based on spatial regularity and equal division, which is not consistent with the irregular and non-uniform distribution of most point clouds. This paper presents a directional fuzzy c-means (D-FCM) method for irregular spatial partitioning. The distance metric is weighted by a direction coefficient, which is determined by the eigenvalue of the point cloud. The orientation of each node is adaptively calculated by principal component analysis of the point cloud, and Karhunen-Loeve (KL) transform is applied to the points coordinates in node. A binary space partitioning (BSP) tree structure is used to partition the point cloud data node by node, and a directional BSP (D-BSP) tree is formed. The D-BSP tree structure was tested with point clouds of 0.1 million to over 2 billion points (up to 60 GB). The experimental results showed that the D-BSP tree can ensure that the bounding boxes are close to the actual spatial distribution of the point cloud, it can completely expand along the spatial configuration of the point cloud without generating unnecessary partitioning, and it can achieve a higher rendering speed with less memory requirement. Numéro de notice : A2016-795 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2016.08.002 En ligne : https://doi.org/10.1016/j.isprsjprs.2016.08.002 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=82529
in ISPRS Journal of photogrammetry and remote sensing > vol 120 (october 2016) . - pp 25 - 36[article]A Topology-inferred graph-based heuristic algorithm for map simplification / QiuLei Guo in Transactions in GIS, vol 20 n° 5 (October 2016)
[article]
Titre : A Topology-inferred graph-based heuristic algorithm for map simplification Type de document : Article/Communication Auteurs : QiuLei Guo, Auteur ; Hassan A. Karimi, Auteur Année de publication : 2016 Article en page(s) : pp 775 – 789 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme de généralisation
[Termes IGN] carte heuristique
[Termes IGN] graphe
[Termes IGN] méthode heuristique
[Termes IGN] polyligne
[Termes IGN] relation topologique
[Termes IGN] temps réel
[Termes IGN] voisinage (relation topologique)
[Vedettes matières IGN] GénéralisationRésumé : (auteur) In this article, we present a heuristic map simplification algorithm based on a novel topology-inferred graph model. Compared with the existing algorithms, which only focus either on geometry simplification or on topological consistency, our algorithm simplifies the map composed of series of polylines and constraint points while maintaining the topological relationships in the map, maximizing the number of removal points, and minimizing error distance efficiently. Unlike some traditional geometry simplification algorithms, such as Douglas and Peucker's, which add points incrementally, we remove points sequentially based on a priority determined by heuristic functions. In the first stage, we build a graph to model the topology of points in the map from which we determine whether a point is removable or not. As map generalization is needed in different applications with different requirements, we present two heuristic functions to determine the priority of points removal for two different purposes: to save storage space and to reduce computation time. The time complexity of our algorithm is math formula which is efficient enough to be considered for real-time applications. Experiments on real maps were conducted and the results indicate that our algorithm produces high quality results; one heuristic function results in higher removal points saving storage space and the other improves the time performance significantly. Numéro de notice : A2016-999 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12188 En ligne : http://dx.doi.org/10.1111/tgis.12188 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=83779
in Transactions in GIS > vol 20 n° 5 (October 2016) . - pp 775 – 789[article]Building displacement based on the topological structure / Yageng Sun in Cartographic journal (the), Vol 53 n° 3 (August 2016)
[article]
Titre : Building displacement based on the topological structure Type de document : Article/Communication Auteurs : Yageng Sun, Auteur ; Qingsheng Guo, Auteur ; Yuangang Liu, Auteur ; et al., Auteur Année de publication : 2016 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme snake
[Termes IGN] déplacement d'objet géographique
[Termes IGN] généralisation automatique de données
[Termes IGN] optimisation (mathématiques)
[Termes IGN] partitionnement
[Termes IGN] pondération
[Termes IGN] relation spatiale
[Termes IGN] triangulation de Delaunay
[Vedettes matières IGN] GénéralisationRésumé : (auteur) Map data at smaller scales than their source can result in spatial conflict, whereby map symbols become too close, or overlaid. Server map generalisation operators may be applied to solve this problem, including displacement. In this paper, we show how an optimisation algorithm, the snake algorithm, was used to displace multiple objects in order to resolve spatial conflicts and maintain important spatial relationships between objects during displacement. Two principles based on the snake algorithm are proposed in this paper. First, the truss structure mirroring spatial proximity relationships between buildings and between building and road is formed based on the weighted proximity graph derived from constrained Delaunay triangulations (CDT) in each map partition. In the weighted proximity graph, each connecting line is determined as a snake and as an element unit to assemble the global stiffness matrix in snake algorithm. Second, a buffer method that calculates force between a building and a road (or other linear features) or between pair of buildings is adopted in the snake algorithm. This avoids the imbalance phenomenon caused by different force calculation methods during the displacement. The feasibility of the approach is demonstrated in obtaining real geographic data. Finally, the results are cartographically usable and in particular, the spatial relationships between objects are preserved. Numéro de notice : A2016-680 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1179/1743277414Y.0000000089 En ligne : http://dx.doi.org/10.1179/1743277414Y.0000000089 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81937
in Cartographic journal (the) > Vol 53 n° 3 (August 2016)[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 030-2016031 RAB Revue Centre de documentation En réserve L003 Disponible Improved progressive TIN densification filtering algorithm for airborne LiDAR data in forested areas / Xiaoqian Zhao in ISPRS Journal of photogrammetry and remote sensing, vol 117 (July 2016)
[article]
Titre : Improved progressive TIN densification filtering algorithm for airborne LiDAR data in forested areas Type de document : Article/Communication Auteurs : Xiaoqian Zhao, Auteur ; Qinghua Guo, Auteur ; Yanjun Su, Auteur ; Baolin Xue, Auteur Année de publication : 2016 Article en page(s) : pp 79 – 91 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] analyse comparative
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] filtrage numérique d'image
[Termes IGN] forêt
[Termes IGN] semence
[Termes IGN] test de performance
[Termes IGN] Triangulated Irregular NetworkRésumé : (auteur) Filtering of light detection and ranging (LiDAR) data into the ground and non-ground points is a fundamental step in processing raw airborne LiDAR data. This paper proposes an improved progressive triangulated irregular network (TIN) densification (IPTD) filtering algorithm that can cope with a variety of forested landscapes, particularly both topographically and environmentally complex regions. The IPTD filtering algorithm consists of three steps: (1) acquiring potential ground seed points using the morphological method; (2) obtaining accurate ground seed points; and (3) building a TIN-based model and iteratively densifying TIN. The IPTD filtering algorithm was tested in 15 forested sites with various terrains (i.e., elevation and slope) and vegetation conditions (i.e., canopy cover and tree height), and was compared with seven other commonly used filtering algorithms (including morphology-based, slope-based, and interpolation-based filtering algorithms). Results show that the IPTD achieves the highest filtering accuracy for nine of the 15 sites. In general, it outperforms the other filtering algorithms, yielding the lowest average total error of 3.15% and the highest average kappa coefficient of 89.53%. Numéro de notice : A2016-582 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2016.03.016 En ligne : https://doi.org/10.1016/j.isprsjprs.2016.03.016 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81723
in ISPRS Journal of photogrammetry and remote sensing > vol 117 (July 2016) . - pp 79 – 91[article]Location K-anonymity in indoor spaces / Joon-Seok Kim in Geoinformatica, vol 20 n° 3 (July - September 2016)PermalinkSparse and low-rank graph for discriminant analysis of hyperspectral imagery / Wei Li in IEEE Transactions on geoscience and remote sensing, vol 54 n° 7 (July 2016)PermalinkSplitArea: an algorithm for weighted splitting of faces in the context of a planar partition / Martijn Meijers in International journal of geographical information science IJGIS, vol 30 n° 7- 8 (July - August 2016)PermalinkComment concevoir des continuités écologiques en milieu urbain ? / Eugénie Schwoertzig in Sciences, eaux & territoires, article hors série n° 26 (hors-série 2016)PermalinkQualitative spatial logics for buffered geometries / Heshan Du in Journal of Artificial Intelligence Research, vol 56 (May - August 2016)PermalinkHybrid terrain rendering based on the external edge primitive / E.G. Paredes in International journal of geographical information science IJGIS, vol 30 n° 5-6 (May - June 2016)PermalinkLeveraging efficient indexing schema to support multigraph query answering / Vijay Ingalalli in Ingénierie des systèmes d'information, ISI : Revue des sciences et technologies de l'information, RSTI, vol 21 n° 3 (mai - juin 2016)PermalinkReconstruction of itineraries from annotated text with an informed spanning tree algorithm / Ludovic Moncla in International journal of geographical information science IJGIS, vol 30 n° 5-6 (May - June 2016)PermalinkStorm event representation and analysis based on a directed spatiotemporal graph model / W. Liu in International journal of geographical information science IJGIS, vol 30 n° 5-6 (May - June 2016)PermalinkChange detection between SAR images using a pointwise approach and graph theory / Minh-Tan Pham in IEEE Transactions on geoscience and remote sensing, vol 54 n° 4 (April 2016)PermalinkA framework for intelligence analysis using spatio-temporal storytelling / Raimundo F. Dos Santos Jr. in Geoinformatica, vol 20 n° 2 (April - June 2016)PermalinkGeometric algebra model for geometry-oriented topological relation computation / Zhaoyuan Yu in Transactions in GIS, vol 20 n° 2 (April 2016)PermalinkClassified and clustered data constellation: An efficient approach of 3D urban data management / Suhaibah Azri in ISPRS Journal of photogrammetry and remote sensing, vol 113 (March 2016)PermalinkMulti-agent based path planning for first responders among moving obstacles / Zhiyong Wang in Computers, Environment and Urban Systems, vol 56 (March 2016)PermalinkMulti-criteria, graph-based road centerline vectorization using ordered weighted averaging operators / Fateme Ameri in Photogrammetric Engineering & Remote Sensing, PERS, vol 82 n° 2 (February 2016)PermalinkPermalinkPermalinkConception d'algorithmes / Patrick Bosc (2016)PermalinkPermalinkGéomatique, modèles numériques de terrain / Patrick Julien (2016)Permalink