Centre dedocumentation
scientifique

Regression modeling of reduction in spatial accuracy and detail for multiple geometric line simplification procedures / Timofey Samsonov in International journal of cartography, Vol 6 n° 1 (March 2020)  

Public [article]  inInternational journal of cartography > Vol 6 n° 1 (March 2020) . - pp 47 - 70 Titre : Regression modeling of reduction in spatial accuracy and detail for multiple geometric line simplification procedures Type de document : Article/Communication Auteurs : Timofey Samsonov, Auteur ; Olga P. Yakimova, Auteur Année de publication : 2020 Article en page(s) : pp 47 - 70 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de Douglas-Peucker [Termes descripteurs IGN] algorithme de Visvalingam [Termes descripteurs IGN] modèle de régression [Termes descripteurs IGN] niveau de détail [Termes descripteurs IGN] précision cartographique [Termes descripteurs IGN] représentation des détails topographiques [Termes descripteurs IGN] simplification de contour [Vedettes matières IGN] Généralisation Résumé : (auteur) One of the important stages of map generalization is the selection of optimal simplification procedure for each spatial feature or feature type. Selected algorithms are then applied collaboratively to simplify the whole set of features. However, there is a lack of investigations that report a systematic approach of deriving a similar reduction in accuracy and detail by using different algorithms. In current paper we propose the solution to this problem on the basis of regression modeling between tolerance value of each algorithm and the value of some geometric measure which describes changes in accuracy and detail of the line. This allows fitting the regression model between tolerance values of the two selected algorithms which can be used to obtain similar simplification results. Regressions between Douglas-Peucker, Li-Openshaw and Visvalingam-Whyatt algorithm tolerance values are investigated. Application of methodology is illustrated on the example of three coastlines with significantly different spatial character. Results of the study show that regression coefficients depend highly both on the combination of the two algorithms, and on the character of the line. Finally, it is shown that a weighted combination of accuracy and detail regression models can be used to model the changes in level of detail of the line. Numéro de notice : A2020-071 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/23729333.2019.1615745 date de publication en ligne : 29/07/2019 En ligne : https://doi.org/10.1080/23729333.2019.1615745 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94634 [article]

Building detection and regularisation using DSM and imagery information / Yousif A. Mousa in Photogrammetric record, vol 34 n° 165 (March 2019)  

Public [article]  inPhotogrammetric record > vol 34 n° 165 (March 2019) . - pp 85 - 107 Titre : Building detection and regularisation using DSM and imagery information Type de document : Article/Communication Auteurs : Yousif A. Mousa, Auteur ; Petra Helmholz, Auteur ; David Belton, Auteur ; Dimitri Bulatov, Auteur Année de publication : 2019 Article en page(s) : pp 85 - 107 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes descripteurs IGN] détection du bâti [Termes descripteurs IGN] extraction automatique [Termes descripteurs IGN] masque [Termes descripteurs IGN] modèle numérique de surface [Termes descripteurs IGN] polygone [Termes descripteurs IGN] régularisation [Termes descripteurs IGN] simplification de contour Résumé : (Auteur) An automatic method for the regularisation of building outlines is presented, utilising a combination of data‐ and model‐driven approaches to provide a robust solution. The core part of the method includes a novel data‐driven approach to generate approximate building polygons from a list of given boundary points. The algorithm iteratively calculates and stores likelihood values between an arbitrary starting boundary point and each of the following boundary points using a function derived from the geometrical properties of a building. As a preprocessing step, building segments have to be identified using a robust algorithm for the extraction of a digital elevation model. Evaluation results on a challenging dataset achieved an average correctness of 96·3% and 95·7% for building detection and regularisation, respectively. Numéro de notice : A2019-454 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/phor.12275 date de publication en ligne : 26/03/2019 En ligne : https://doi.org/10.1111/phor.12275 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92867 [article]

Simultaneous chain-forming and generalization of road networks / Susanne Wenzel in Photogrammetric Engineering & Remote Sensing, PERS, vol 85 n° 1 (January 2019)  

Public [article]  inPhotogrammetric Engineering & Remote Sensing, PERS > vol 85 n° 1 (January 2019) . - pp 19 - 28 Titre : Simultaneous chain-forming and generalization of road networks Type de document : Article/Communication Auteurs : Susanne Wenzel, Auteur ; Dimitri Bulatov, Auteur Année de publication : 2019 Article en page(s) : pp 19 - 28 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de Douglas-Peucker [Termes descripteurs IGN] analyse de groupement [Termes descripteurs IGN] axe médian [Termes descripteurs IGN] classification bayesienne [Termes descripteurs IGN] extraction du réseau routier [Termes descripteurs IGN] Graz [Termes descripteurs IGN] itération [Termes descripteurs IGN] mise à jour automatique [Termes descripteurs IGN] Munich [Termes descripteurs IGN] objet géographique linéaire [Termes descripteurs IGN] orthoimage [Termes descripteurs IGN] polyligne [Termes descripteurs IGN] primitive géométrique [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] segmentation sémantique [Termes descripteurs IGN] squelettisation [Termes descripteurs IGN] zone urbaine [Vedettes matières IGN] Généralisation Résumé : (auteur) Streets are essential entities of urban terrain and their automatic extraction from airborne sensor data is cumbersome because of a complex interplay of geometric, topological, and semantic aspects. Given a binary image representing the road class, centerlines of road segments are extracted by means of skeletonization. The focus of this paper lies in a well-reasoned representation of these segments by means of geometric primitives, such as straight line segments as well as circle and ellipse arcs. Thereby, we aim at a fusion of raw segments to longer chains which better match to the intuitive perception of what a street is. We propose a two-step approach for simultaneous chain-forming and generalization. First, we obtain an over-segmentation of the raw polylines. Then, a model selection approach is applied to decide whether two neighboring segments should be fused to a new geometric entity. For this purpose, we propose an iterative greedy optimization procedure in order to find a strong minimum of a cost function based on a Bayesian information criterion. Starting at the given initial raw segments, we thus can obtain a set of chains describing long alleys and important roundabouts. Within the procedure, topological attributes, such as junctions and neighborhood structures, are consistently updated, in a way that for the greedy optimization procedure, accuracy, model complexity, and topology are considered simultaneously. The results on two challenging datasets indicate the benefits of the proposed procedure and provide ideas for future work. Numéro de notice : A2019-026 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.14358/PERS.85.1.19 date de publication en ligne : 01/01/2019 En ligne : https://doi.org/10.14358/PERS.85.1.19 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91962 [article]

Réservation

Réserver ce document

Exemplaires (1)

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

Teragons for testing implementations of point reduction algorithms / Mahes Visvalingam in Cartographic journal (the), Vol 55 n° 3 (August 2018)  

Public [article]  inCartographic journal (the) > Vol 55 n° 3 (August 2018) . - pp 256 - 272 Titre : Teragons for testing implementations of point reduction algorithms Type de document : Article/Communication Auteurs : Mahes Visvalingam, Auteur Année de publication : 2018 Article en page(s) : pp 256 - 272 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de Douglas-Peucker [Termes descripteurs IGN] algorithme de Visvalingam [Termes descripteurs IGN] généralisation automatique de données [Termes descripteurs IGN] simplification de contour [Vedettes matières IGN] Généralisation Résumé : (Auteur) There are several open source and commercial implementations of the Visvalingam algorithm for line generalization. The algorithm provides scope for implementation-specific interpretations, with different outcomes. This is inevitable and sometimes necessary and, it does not imply that an implementation is flawed. The only restriction is that the output must not be so inconsistent with the intent of the algorithm that it becomes inappropriate. The aim of this paper is to place the algorithm within the literature, and demonstrate the value of the teragon-test for evaluating the appropriateness of implementations; Mapshaper v 0.2.28 and earlier versions are used for illustrative purposes. Data pertaining to natural features, such as coastlines, are insufficient for establishing whether deviations in output are significant. The teragon-test revealed an unexpected loss of symmetry from both the Visvalingam and Douglas-Peucker options, making the tested versions unsuitable for some applications, especially outside of cartography. This paper describes the causes, and discusses their implications. Mapshaper 0.3.17 passes the teragon test. Other developers and users should check their implementations using contrived geometric data, such as the teragon data used in this paper, especially when the source code is not available for inspection. The teragon-test is also useful for evaluating other point reduction algorithms. Numéro de notice : A2018-518 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/00087041.2017.1414017 date de publication en ligne : 18/10/2018 En ligne : https://doi.org/10.1080/00087041.2017.1414017 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91323 [article]

Réservation

Réserver ce document

Exemplaires (1)

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

An efficient visualization method for polygonal data with dynamic simplification / Mingguang Wu in ISPRS International journal of geo-information, vol 7 n° 4 (April 2018)  

Public [article]  inISPRS International journal of geo-information > vol 7 n° 4 (April 2018) Titre : An efficient visualization method for polygonal data with dynamic simplification Type de document : Article/Communication Auteurs : Mingguang Wu, Auteur ; Taisheng Chen, Auteur ; Kun Zhang, Auteur ; Zhimin Jing, Auteur ; et al., Auteur Année de publication : 2018 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de Douglas-Peucker [Termes descripteurs IGN] données localisées [Termes descripteurs IGN] intégrité topologique [Termes descripteurs IGN] maillage [Termes descripteurs IGN] OpenStreetMap [Termes descripteurs IGN] polygone [Termes descripteurs IGN] polyligne [Termes descripteurs IGN] simplification de contour [Termes descripteurs IGN] tessellation [Termes descripteurs IGN] visualisation de données [Vedettes matières IGN] Généralisation Résumé : (Auteur) Polygonal data often require rendering with symbolization and simplification in geovisualization. A common issue in existing methods is that simplification, symbolization and rendering are addressed separately, causing computational and data redundancies that reduce efficiency, especially when handling large complex polygonal data. Here, we present an efficient polygonal data visualization method by organizing the simplification, tessellation and rendering operations into a single mesh generalization process. First, based on the sweep line method, we propose a topology embedded trapezoidal mesh data structure to organize the tessellated polygons. Second, we introduce horizontal and vertical generalization operations to simplify the trapezoidal meshes. Finally, we define a heuristic testing algorithm to efficiently preserve the topological consistency. The method is tested using three OpenStreetMap datasets and compared with the Douglas Peucker algorithm and the Binary Line Generalization tree-based method. The results show that the proposed method improves the rendering efficiency by a factor of six. Efficiency-sensitive mapping applications such as emergency mapping could benefit from this method, which would significantly improve their visualization performances. Numéro de notice : A2018-108 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/ijgi7040138 En ligne : https://doi.org/10.3390/ijgi7040138 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89537 [article]

Partial polygon pruning of hydrographic features in automated generalization / Alexander K. Stum in Transactions in GIS, vol 21 n° 5 (October 2017)  

Permalink

Shape-adaptive geometric simplification of heterogeneous line datasets / Timofey Samsonov in International journal of geographical information science IJGIS, vol 31 n° 7-8 (July - August 2017)  

Permalink

Enriched geometric simplification of linear features / Rajesh Tamilmani in Geomatica [en ligne], vol 71 n° 1 (March 2017)  

Permalink

A method for assessing generalized data accuracy with linear object resolution verification / Tadeusz Chrobak in Geocarto international, vol 32 n° 3 (March 2017)  

Permalink

Continuously generalizing buildings to built-up areas by aggregating and growing / Dongliang Peng (2017)  

Permalink

mR-V: Line Simplification through Mnemonic Rasterization / Emmanuel Stefanakis in Geomatica [en ligne], vol 70 n° 4 (December 2016)  

Permalink

Implications of weighting metrics for line generalization with Visvalingam's algorithm / Mahes Visvalingam 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

Morphing linear features based on their entire structures / Min Deng in Transactions in GIS, vol 19 n° 5 (October 2015)  

Permalink

SELF: Semantically Enriched Line simpliFication / Emmanuel Stefanakis in International journal of geographical information science IJGIS, vol 29 n° 10 (October 2015)  

Permalink