Centre de documentation
scientifique

Fourier-based multi-scale representation and progressive transmission of cartographic curves on the internet / Pengcheng Liu in Cartography and Geographic Information Science, vol 43 n° 5 (November 2016)  

Public [article]  inCartography and Geographic Information Science > vol 43 n° 5 (November 2016) . - pp 454 - 468 Titre : Fourier-based multi-scale representation and progressive transmission of cartographic curves on the internet Type de document : Article/Communication Auteurs : Pengcheng Liu, Auteur ; Xingong Li, Auteur ; Weibo Liu, Auteur ; Tinghua Ai, Auteur Année de publication : 2016 Article en page(s) : pp 454 - 468 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] carte topographique [Termes IGN] contour [Termes IGN] généralisation cartographique automatisée [Termes IGN] géomatique web [Termes IGN] ligne (géométrie) [Termes IGN] représentation multiple [Termes IGN] série de Fourier [Termes IGN] transmission de données [Vedettes matières IGN] Généralisation Résumé : (Auteur) Automatic generation of multi-scale representations from the same spatial data source has been the research focus in map generalization for a long time. Based on the Fourier technique, this paper proposes a continuous, multi-scale representation model for progressive transformation of cartographic curves on the Internet. In our method, all the curves, whether closed or open, are depicted as periodical functions which are further expressed as Fourier series. The convergence degrees of the Fourier series are explored for different kinds of curves, and truncating frequencies are derived based on the similarity between the original and reconstructed curves. Using information theory and the Radical Law in cartography, the relationship between map scales and Fourier frequencies is established. Based on the proposed multi-scale model, we also introduce the principles and implementation of a progressive transmission method. Our method is evaluated using the contours from a topographic map. The results show that our model is a valid approach to multi-scale representation of cartographic curves. Numéro de notice : A2016-695 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/15230406.2015.1088799 En ligne : https://doi.org/10.1080/15230406.2015.1088799 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=82034 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
032-2016051	RAB	Revue	Centre de documentation	En réserve L003	Disponible

How many samples are needed? An investigation of binary logistic regression for selective omission in a road network / Qi Zhou in Cartography and Geographic Information Science, vol 43 n° 5 (November 2016)  

Public [article]  inCartography and Geographic Information Science > vol 43 n° 5 (November 2016) . - pp 405 - 416 Titre : How many samples are needed? An investigation of binary logistic regression for selective omission in a road network Type de document : Article/Communication Auteurs : Qi Zhou, Auteur ; Zhilin Li, Auteur Année de publication : 2016 Article en page(s) : pp 405 - 416 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] apprentissage dirigé [Termes IGN] échantillonnage [Termes IGN] généralisation cartographique automatisée [Termes IGN] régression logistique [Termes IGN] réseau routier [Vedettes matières IGN] Généralisation Résumé : (Auteur) Selective omission in a road network (or road selection) means to retain more important roads, and it is a necessary operator to transform a road network at a large scale to that at a smaller scale. This study discusses the use of the supervised learning approach to road selection, and investigates how many samples are needed for a good performance of road selection. More precisely, the binary logistic regression is employed and three road network data with different sizes and different target scales are involved for testing. The different percentages and numbers of strokes are randomly chosen for training a logistic regression model, which is further applied into the untrained strokes for validation. The performances of using the different sample sizes are mainly evaluated by an error rate estimate. Significance tests are also employed to investigate whether the use of different sample sizes shows statistically significant differences. The experimental results show that in most cases, the error rate estimate is around 0.1–0.2; more importantly, only a small number (e.g., 50–100) of training samples is needed, which indicates the usability of binary logistic regression for road selection. Numéro de notice : A2016-691 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/15230406.2015.1104265 En ligne : https://doi.org/10.1080/15230406.2015.1104265 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=82019 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
032-2016051	RAB	Revue	Centre de documentation	En réserve L003	Disponible

A Topology-inferred graph-based heuristic algorithm for map simplification / QiuLei Guo in Transactions in GIS, vol 20 n° 5 (October 2016)  

Public [article]  inTransactions in GIS > vol 20 n° 5 (October 2016) . - pp 775 – 789 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éralisation Ré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 [article]

Enhancing building footprints with squaring operations / Imran Lokhat in Journal of Spatial Information Science, JoSIS, n° 13 (September 2016)    

Public [article]  inJournal of Spatial Information Science, JoSIS > n° 13 (September 2016) . - pp 33 - 60 Titre : Enhancing building footprints with squaring operations Type de document : Article/Communication Auteurs : Imran Lokhat , Auteur ; Guillaume Touya , Auteur Année de publication : 2016 Article en page(s) : pp 33 - 60 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] base de données localisées [Termes IGN] bati [Termes IGN] empreinte [Termes IGN] généralisation cartographique automatisée [Termes IGN] méthode des moindres carrés [Termes IGN] OpenStreetMap [Termes IGN] quadrillage [Vedettes matières IGN] Généralisation Résumé : (Auteur) Whatever the data source, or the capture process, the creation of a building footprint in a geographical dataset is error prone. Building footprints are designed with square angles, but once in a geographical dataset, the angles may not be exactly square. The almost-square angles blur the legibility of the footprints when displayed on maps, but might also be propagated in further applications based on the footprints, e.g., 3D city model construction. This paper proposes two new methods to square such buildings: a simple one, and a more complex one based on nonlinear least squares. The latter squares right and flat angles by iteratively moving vertices, while preserving the initial shape and position of the buildings. The methods are tested on real datasets and assessed against existing methods, proving the usefulness of the contribution. Direct applications of the squaring transformation, such as OpenStreetMap enhancement, or map generalization are presented. Numéro de notice : A2016--117 Affiliation des auteurs : LASTIG COGIT (2012-2019) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.5311/JOSIS.2016.13.276 En ligne : http://josis.org/index.php/josis/article/view/276 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=84777 [article]

Documents numériques

en open access Enhancing building footprints ... - pdf éditeur Adobe Acrobat PDF

An immune genetic algorithm to buildings displacement in cartographic generalization / Yageng Sun in Transactions in GIS, vol 20 n° 4 (August 2016)  

Public [article]  inTransactions in GIS > vol 20 n° 4 (August 2016) . - pp 585 - 612 Titre : An immune genetic algorithm to buildings displacement in cartographic generalization Type de document : Article/Communication Auteurs : Yageng Sun, Auteur ; Qingsheng Guo, Auteur ; Yuangang Liu, Auteur ; et al., Auteur Année de publication : 2016 Article en page(s) : pp 585 - 612 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme génétique [Termes IGN] bâtiment [Termes IGN] contrainte géométrique [Termes IGN] contrainte relationnelle [Termes IGN] déplacement d'objet géographique [Termes IGN] généralisation automatique de données [Termes IGN] généralisation cartographique [Vedettes matières IGN] Généralisation Résumé : (auteur) Spatial conflicts may occur when map data are displayed at a scale smaller than that of the source map. This study applies the displacement operator in cartographic generalization to resolve such spatial conflicts and to improve the clarity and legibility of map. The immune genetic algorithm (IGA) is used in this study for buildings displacement to solve conflicts. IGA is based on the genetic algorithm (GA) and employs the self-adjusting mechanism of antibody concentration to enhance population diversity. Meanwhile, the elitism retention strategy is adopted in IGA to guarantee that the best individual (antibody) is not lost and destroyed in the next generation to strengthen convergence efficiency. The compared experiment between IGA and GA shows that the displacement result produced by IGA performs better than GA. Finally, in order to make the displaced map more attractive to cartographers, two constraints – the building alignment constraint and building tangent relation constraint – are applied in IGA to restrict the buildings’ displacement. The same experimental data are adopted to prove that the improved IGA is useful for maintaining the two constraints. Numéro de notice : A2016--053 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12165 En ligne : http://dx.doi.org/10.1111/tgis.12165 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=83771 [article]

Building displacement based on the topological structure / Yageng Sun in Cartographic journal (the), Vol 53 n° 3 (August 2016)  

Permalink

The Visvalingam algorithm: metrics, measures and heuristics / Mahes Visvalingam in Cartographic journal (the), Vol 53 n° 3 (August 2016)  

Permalink

SplitArea: 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)  

Permalink

An evaluation of unsupervised and supervised learning algorithms for clustering landscape types in the United States / Jochen Wendel in Cartography and Geographic Information Science, Vol 43 n° 3 (June 2016)  

Permalink

Assessing the variation of visual complexity in multi-scale maps with clutter measures / Marion Dumont (2016)    

Permalink

Automated generalisation within NMAS in 2016 / Jantien E. Stoter (2016)  

Permalink

Automatisation de la généralisation cartographique : Relations et interactions, orchestration et approches multi-agents / Cécile Duchêne (2016) 

Permalink

Empirical determination of geometric parameters for selective omission in a road network / Qi Zhou in International journal of geographical information science IJGIS, vol 30 n° 1-2 (January - February 2016)  

Permalink

Parallélisation des processus de traitement des données spatiales / Justin Berli (2016)

Permalink

Enrichissement automatique et généralisation de réseaux ferrés / Guillaume Touya in Cartes & Géomatique, n° 226 (décembre 2015) 

Permalink