Centre dedocumentation
scientifique

A multi-scale representation model of polyline based on head/tail breaks / Pengcheng Liu in International journal of geographical information science IJGIS, vol 34 n°11 (November 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n°11 (November 2020) . - pp 2275 - 2295 Titre : A multi-scale representation model of polyline based on head/tail breaks Type de document : Article/Communication Auteurs : Pengcheng Liu, Auteur ; Tianyuan Xiao, Auteur ; Jia Xiao, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 2275 - 2295 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] entropie de Shannon [Termes descripteurs IGN] généralisation cartographique automatisée [Termes descripteurs IGN] polyligne [Termes descripteurs IGN] représentation multiple [Termes descripteurs IGN] série de Fourier [Vedettes matières IGN] Généralisation Résumé : (auteur) This paper proposes a model to quantify the multiscale representation of a polyline based on iterative head/tail breaks. A polyline is first transformed into a corresponding Fourier descriptor consisting of normalized Fourier-series-expansion coefficients. Then, the most significant finite components of the Fourier descriptor are selected and ranked to constitute the polyline constrained Fourier descriptor. Using Shannon’s information theory, information content of the constrained Fourier-descriptor components is defined. Next, head/tail breaks are introduced to iteratively divide the constrained Fourier descriptor into head and tail components according to the heavy-tailed distribution of information contents. Thus, simplified polylines are reconstructed using ordered heads generated from head/tail breaks. Finally, the radical law is introduced and applied to model multiscale polyline representation by quantifying the scale of each simplified polyline. Three experiments are designed and conducted to evaluate the proposed model. The results demonstrate that the proposed model is valid and efficient for quantifying multiscale polyline representation. Numéro de notice : A2020-615 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/MATHEMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1753203 date de publication en ligne : 22/04/2020 En ligne : https://doi.org/10.1080/13658816.2020.1753203 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95988 [article]

Road network simplification for location-based services / Abdeltawab M. Hendawi in Geoinformatica [en ligne], vol 24 n° 4 (October 2020)  

Public [article]  inGeoinformatica [en ligne] > vol 24 n° 4 (October 2020) . - pp 801 - 826 Titre : Road network simplification for location-based services Type de document : Article/Communication Auteurs : Abdeltawab M. Hendawi, Auteur ; John A. Stankovic, Auteur ; Ayman Taha, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 801 - 826 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de Douglas-Peucker [Termes descripteurs IGN] appariement de données localisées [Termes descripteurs IGN] appariement de graphes [Termes descripteurs IGN] carte routière [Termes descripteurs IGN] compression de données [Termes descripteurs IGN] Hidden Markov Model (HMM) [Termes descripteurs IGN] Map Matching [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] service fondé sur la position [Termes descripteurs IGN] stockage de données [Vedettes matières IGN] Généralisation Résumé : (Auteur) Road-network data compression or simplification reduces the size of the network to occupy less storage with the aim to fit small form-factor routing devices, mobile devices, or embedded systems. Simplification (a) reduces the storage cost of memory and disks, and (b) reduces the I/O and communication overhead. There are several road network compression techniques proposed in the literature. These techniques are evaluated by their compression ratios. However, none of these techniques takes into consideration the possibility that the generated compressed data can be used directly in Map-matching operation which is an essential component for all location-aware services. Map-matching matches a measured latitude and longitude of an object to an edge in the road network graph. In this paper, we propose a novel simplification technique, named COMA, that (1) significantly reduces the size of a given road network graph, (2) achieves high map-matching quality on the simplified graph, and (3) enables the generated compressed road network graph to be used directly in map-matching and location-based applications without a need to decompress it beforehand. COMA smartly deletes those nodes and edges that will not affect the graph connectivity nor causing much of ambiguity in the map-matching of objects’ location. COMA employs a controllable parameter; termed a conflict factor C, whereby location aware services can trade the compression gain with map-matching accuracy at varying granularity. We show that the time complexity of our COMA algorithm is O(|N|log|N|). Intensive experimental evaluation based on a real implementation and data demonstrates that COMA can achieve about a 75% compression-ratio while preserving high map-matching quality. Road Network, Simplification, Compression, Spatial, Location, Performance, Accuracy, Efficiency, Scalability. Numéro de notice : A2020-495 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00406-x date de publication en ligne : 01/05/2020 En ligne : https://doi.org/10.1007/s10707-020-00406-x Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96115 [article]

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 Affiliation des auteurs : non IGN 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 Affiliation des auteurs : non IGN 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 Affiliation des auteurs : non IGN 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)  

Permalink

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)  

Permalink

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