Descripteur
Termes IGN > mathématiques > analyse mathématique
analyse mathématique |
Documents disponibles dans cette catégorie (950)
![](./images/expand_all.gif)
![](./images/collapse_all.gif)
Etendre la recherche sur niveau(x) vers le bas
Weighted simplicial complex reconstruction from mobile laser scanning using sensor topology / Stéphane Guinard (2018)
![]()
![]()
Titre : Weighted simplicial complex reconstruction from mobile laser scanning using sensor topology Type de document : Article/Communication Auteurs : Stéphane Guinard , Auteur ; Bruno Vallet
, Auteur
Editeur : Saint-Mandé : Institut national de l'information géographique et forestière - IGN (2012-) Année de publication : 2018 Conférence : CFPT 2018, Conférence Française de Photogrammétrie et de Télédétection 25/06/2018 28/06/2018 Champs-sur-Marne France Open Access Proceedings Importance : 8 p. Note générale : bibliographie
The authors would like to acknowledge the DGA for their financial support of this work.Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] complexe simplicial
[Termes IGN] coplanarité
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] instrument embarqué
[Termes IGN] reconstruction 3D
[Termes IGN] relation spatiale
[Termes IGN] semis de points
[Termes IGN] voisinage (relation topologique)Résumé : (auteur) We propose a new method for the reconstruction of simplicial complexes (combining points, edges and triangles) from 3D point clouds from Mobile Laser Scanning (MLS). Our method uses the inherent topology of the MLS sensor to define a spatial adjacency relationship between points. We then investigate each possible connexion between adjacent points, weighted according to its distance to the sensor, and filter them by searching collinear structures in the scene, or structures perpendicular to the laser beams. Next, we create and filter triangles for each triplet of self-connected edges and according to their local planarity. We compare our results to an unweighted simplicial complex reconstruction. Numéro de notice : C2018-017 Affiliation des auteurs : LASTIG MATIS (2012-2019) Thématique : IMAGERIE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésNat DOI : sans Date de publication en ligne : 25/06/2018 En ligne : https://rfiap2018.ign.fr/sites/default/files/ARTICLES/CFPT2018/Oraux/CFPT2018_pa [...] Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90388 Documents numériques
en open access
Weighted simplicial complex reconstruction ... - pdf éditeurAdobe Acrobat PDFAn automated displaced proportional circle map using Delaunay triangulation and an algorithm for node overlap removal / David Lamb in Cartographica, vol 52 n° 4 (Winter 2017)
![]()
[article]
Titre : An automated displaced proportional circle map using Delaunay triangulation and an algorithm for node overlap removal Type de document : Article/Communication Auteurs : David Lamb, Auteur Année de publication : 2017 Article en page(s) : pp 364 - 370 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Cartographie thématique
[Termes IGN] cartogramme
[Termes IGN] sémiologie graphique
[Termes IGN] triangulation de DelaunayRésumé : (Auteur) Proportional circle maps are a popular method for visualizing quantitative data on a map. Circles are scaled proportionally based on the data provided; larger circles represent larger quantities. The circles require two values, a location and a numeric quantity. For data that have a wide range of values, the resulting map will produce clutter and overlap in which large symbols obscure the information contained in smaller circles. Some previous solutions to this problem are modifying and improving the contrast between symbols, or using stacking algorithms so all symbols are visible. This article proposes the displaced proportional symbol map, which displaces the symbol's location based on the amount of overlap between neighbouring circles. At the same time, it preserves the location of non-overlapping symbols, which distinguishes it from the circular cartogram. The displacement is automated through the proximity stress model algorithm for node overlap removal. This algorithm was originally designed for graph layouts with overlapping nodes, but was modified here for circular symbols and map layout. The result is a map with improved clarity and the ability to add labelling to a cluttered proportional circle map. Numéro de notice : A2017-832 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.3138/cart.52.4.2016-0007 En ligne : https://doi.org/10.3138/cart.52.4.2016-0007 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89368
in Cartographica > vol 52 n° 4 (Winter 2017) . - pp 364 - 370[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 031-2017041 SL Revue Centre de documentation Revues en salle Disponible Centrality-based hierarchy for street network generalization in multi-resolution maps / Wasim Shoman in Geocarto international, vol 32 n° 12 (December 2017)
![]()
[article]
Titre : Centrality-based hierarchy for street network generalization in multi-resolution maps Type de document : Article/Communication Auteurs : Wasim Shoman, Auteur ; Fatih Gülgen, Auteur Année de publication : 2017 Article en page(s) : pp 1352 - 1366 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] axe médian
[Termes IGN] base de données multi-représentation
[Termes IGN] extraction de traits caractéristiques
[Termes IGN] généralisation automatique de données
[Termes IGN] graphe
[Termes IGN] processus de hiérarchisation analytique floue
[Termes IGN] réseau routier
[Termes IGN] route
[Termes IGN] zoom
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) This paper introduces a new hierarchy for cartographic generalisation processes, applied in street networks. The aims of implementing this hierarchy are to emphasise on significant street features, and to provide more free spaces between street features. The hierarchy is obtained from the functional classes of the features and four centrality measures in a street network, i.e. betweenness, reach, straightness and closeness extracted from a primary graph. The values of centrality measures change in every zoom level by calculating a radius parameter, which depends on the users’ field of view. The coefficients for the measures are constructed using a decision-making technique called fuzzy analytical hierarchy process (FAHP). The weights for each of the centrality measures are computed and normalised to form the proposed hierarchy. The hierarchy is applied and used later in the thinning process to omit insignificant features from the street network in medium scales. Numéro de notice : A2017-673 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/10106049.2016.1208683 En ligne : https://doi.org/10.1080/10106049.2016.1208683 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=87164
in Geocarto international > vol 32 n° 12 (December 2017) . - pp 1352 - 1366[article]Cut Pursuit: Fast algorithms to learn piecewise constant functions on general weighted graphs / Loïc Landrieu in SIAM Journal on Imaging Sciences, vol 10 n° 4 (November 2017)
![]()
[article]
Titre : Cut Pursuit: Fast algorithms to learn piecewise constant functions on general weighted graphs Type de document : Article/Communication Auteurs : Loïc Landrieu , Auteur ; Guillaume Obozinski, Auteur
Année de publication : 2017 Projets : 2-Pas d'info accessible - article non ouvert / Article en page(s) : pp 1724 - 1766 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] algorithme Cut Pursuit
[Termes IGN] graphe
[Termes IGN] pondérationRésumé : (auteur) We propose working set/greedy algorithms to efficiently solve problems penalized, respectively, by the total variation on a general weighted graph and its $\ell_0$ counterpart the total level-set boundary size when the piecewise constant solutions have a small number of distinct level sets; this is typically the case when the total level-set boundary size is small, which is encouraged by these two forms of penalization. Our algorithms exploit this structure by recursively splitting the level sets of a piecewise constant candidate solution using graph cuts. We obtain significant speedups over state-of-the-art algorithms for images that are well approximated with few level sets. Numéro de notice : A2017-891 Affiliation des auteurs : LASTIG MATIS+Ext (2012-2019) Thématique : IMAGERIE/MATHEMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1137/17M1113436 Date de publication en ligne : 10/10/2017 En ligne : https://doi.org/10.1137/17M1113436 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91884
in SIAM Journal on Imaging Sciences > vol 10 n° 4 (November 2017) . - pp 1724 - 1766[article]Hub Labels on the database for large-scale graphs with the COLD framework / Alexandros Efentakis in Geoinformatica, vol 21 n° 4 (October - December 2017)
![]()
[article]
Titre : Hub Labels on the database for large-scale graphs with the COLD framework Type de document : Article/Communication Auteurs : Alexandros Efentakis, Auteur ; Christodoulos Efstathiades, Auteur ; Dieter Pfoser, Auteur Année de publication : 2017 Article en page(s) : pp 703 - 732 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] base de données localisées
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] compression de données
[Termes IGN] graphe
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] SQLRésumé : (Auteur) Shortest-path computation on graphs is one of the most well-studied problems in algorithmic theory. An aspect that has only recently attracted attention is the use of databases in combination with graph algorithms, so-called distance oracles, to compute shortest-path queries on large graphs. To this purpose, we propose a novel, efficient, pure-SQL framework for answering exact distance queries on large-scale graphs, implemented entirely on an open-source database engine. Our COLD framework (COmpressed Labels on the Database) can answer multiple distance queries (vertex-to-vertex, one-to-many, k-Nearest Neighbors, Reverse k-Nearest Neighbors, Reverse k-Farthest Neighbors and Top-k Range) not handled by previous methods, rendering it a complete database solution for a variety of practical large-scale graph applications. Our experimentation shows that COLD outperforms existing approaches (including popular graph databases) in terms of query time and efficiency, while requiring significantly less storage space than these methods. Numéro de notice : A2017-601 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-016-0287-5 En ligne : https://doi.org/10.1007/s10707-016-0287-5 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86909
in Geoinformatica > vol 21 n° 4 (October - December 2017) . - pp 703 - 732[article]Uncertain Voronoi cell computation based on space decomposition / Klaus Arthur Schmid in Geoinformatica, vol 21 n° 4 (October - December 2017)
PermalinkExploiting illusory grid lines for object-location memory performance in urban topographic maps / Frank Dickmann in Cartographic journal (the), Vol 54 n° 3 (August 2017)
PermalinkA graph-based approach to detect spatiotemporal dynamics in satellite image time series / Fabio Guttler in ISPRS Journal of photogrammetry and remote sensing, vol 130 (August 2017)
PermalinkMulti-view performance capture of surface details / Nadia Robertini in International journal of computer vision, vol 124 n° 1 (August 2017)
PermalinkPermalinkApplication of 3D triangulations of airborne laser scanning data to estimate boreal forest leaf area index / Titta Majasalmi in International journal of applied Earth observation and geoinformation, vol 59 (July 2017)
PermalinkConstrained Palette-Space Exploration / Nicolas Mellado in ACM Transactions on Graphics, TOG, Vol 36 n° 4 (July 2017)
![]()
PermalinkEfficient maximal reverse skyline query processing / Farnoush Banaei-Kashani in Geoinformatica, vol 21 n° 3 (July - September 2017)
PermalinkGraph mapping: Multi-scale community visualization of massive graph data / David Jonker in Information visualization, vol 16 n° 3 (July 2017)
PermalinkA morphologically preserved multi-resolution TIN surface modeling and visualization method for virtual globes / Xianwei Zheng in ISPRS Journal of photogrammetry and remote sensing, vol 129 (July 2017)
Permalink