Centre de documentation
scientifique

Is the radial distance really a distance? An analysis of its properties and interest for the matching of polygon features / Yann Méneroux in International journal of geographical information science IJGIS, vol 37 n° 2 (February 2023)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 37 n° 2 (February 2023) . - pp 438 - 475 Titre : Is the radial distance really a distance? An analysis of its properties and interest for the matching of polygon features Type de document : Article/Communication Auteurs : Yann Méneroux , Auteur ; Ibrahim Maidaneh Abdi , Auteur ; Arnaud Le Guilcher , Auteur ; Ana-Maria Olteanu-Raimond , Auteur Année de publication : 2023 Projets : 3-projet - voir note / Article en page(s) : pp 438 - 475 Note générale : bibliographie This work was supported by the French National Mapping Agency: Institut National de l’Information Géographique et Forestière (IGN) and by the University of Djibouti Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] abaque [Termes IGN] algorithme de Douglas-Peucker [Termes IGN] appariement de formes [Termes IGN] bâtiment [Termes IGN] BD Topo [Termes IGN] distance [Termes IGN] généralisation [Termes IGN] géométrie analytique [Termes IGN] modèle analytique [Termes IGN] polygone [Termes IGN] propagation d'erreur [Termes IGN] transformation rapide de Fourier Résumé : (auteur) In this paper, we examine the properties of the radial distance which has been used as a tool to compare the shape of simple surfacic objects. We give a rigorous definition of the radial distance and derive its theoretical properties, and in particular under which conditions it satisfies the distance properties. We show how the computation of the radial distance can be implemented in practice and made faster by the use of an analytical formula and a Fast Fourier Transform. Finally, we conduct experiments to measure how the radial distance is impacted by perturbation and generalization and we give abacuses and thresholds to deduce when buildings are likely to be homologous or non-homologous given their radial distance. Numéro de notice : A2023-074 Affiliation des auteurs : UGE-LASTIG (2020- ) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2022.2123487 Date de publication en ligne : 23/09/2022 En ligne : https://doi.org/10.1080/13658816.2022.2123487 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101671 [article]

Evaluation of automatic prediction of small horizontal curve attributes of mountain roads in GIS environments / Sercan Gülci in ISPRS International journal of geo-information, vol 11 n° 11 (November 2022)  

Public [article]  inISPRS International journal of geo-information > vol 11 n° 11 (November 2022) . - n° 560 Titre : Evaluation of automatic prediction of small horizontal curve attributes of mountain roads in GIS environments Type de document : Article/Communication Auteurs : Sercan Gülci, Auteur ; Afiz Hulusi Acar, Auteur ; Abdullah E. Akay, Auteur ; et al., Auteur Année de publication : 2022 Article en page(s) : n° 560 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme de Douglas-Peucker [Termes IGN] attribut géomètrique [Termes IGN] coefficient de corrélation [Termes IGN] courbe [Termes IGN] matrice de confusion [Termes IGN] montagne [Termes IGN] réseau routier [Termes IGN] système d'information géographique [Termes IGN] tracé routier [Termes IGN] Turquie [Vedettes matières IGN] Généralisation Résumé : (auteur) Road curve attributes can be determined by using Geographic Information System (GIS) to be used in road vehicle traffic safety and planning studies. This study involves analyzing the GIS-based estimation accuracy in the length, radius and the number of small horizontal road curves on a two-lane rural road and a forest road. The prediction success of horizontal curve attributes was investigated using digitized raw and generalized/simplified road segments. Two different roads were examined, involving 20 test groups and two control groups, using 22 datasets obtained from digitized and surveyed roads based on satellite imagery, GIS estimates, and field measurements. Confusion matrix tables were also used to evaluate the prediction accuracy of horizontal curve geometry. F-score, Mathews Correlation Coefficient, Bookmaker Informedness and Balanced Accuracy were used to investigate the performance of test groups. The Kruskal–Wallis test was used to analyze the statistical relationships between the data. Compared to the Bezier generalization algorithm, the Douglas–Peucker algorithm showed the most accurate horizontal curve predictions at generalization tolerances of 0.8 m and 1 m. The results show that the generalization tolerance level contributes to the prediction accuracy of the number, curve radius, and length of the horizontal curves, which vary with the tolerance value. Thus, this study underlined the importance of calculating generalizations and tolerances following a manual road digitization. Numéro de notice : A2022-847 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/ijgi11110560 Date de publication en ligne : 09/11/2022 En ligne : https://doi.org/10.3390/ijgi11110560 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102083 [article]

Automatic building detection with polygonizing and attribute extraction from high-resolution images / Samitha Daranagama in ISPRS International journal of geo-information, vol 10 n° 9 (September 2021)  

Public [article]  inISPRS International journal of geo-information > vol 10 n° 9 (September 2021) . - n° 606 Titre : Automatic building detection with polygonizing and attribute extraction from high-resolution images Type de document : Article/Communication Auteurs : Samitha Daranagama, Auteur ; Apichon Witayangkurn, Auteur Année de publication : 2021 Article en page(s) : n° 606 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes IGN] algorithme de Douglas-Peucker [Termes IGN] apprentissage profond [Termes IGN] détection du bâti [Termes IGN] image à haute résolution [Termes IGN] image captée par drone [Termes IGN] lissage de courbe [Termes IGN] orthophotoplan numérique [Termes IGN] polygonation [Termes IGN] segmentation sémantique Résumé : (auteur) Buildings can be introduced as a fundamental element for forming a city. Therefore, up-to-date building maps have become vital for many applications, including urban mapping and urban expansion analysis. With the development of deep learning, segmenting building footprints from high-resolution remote sensing imagery has become a subject of intense study. Here, a modified version of the U-Net architecture with a combination of pre- and post-processing techniques was developed to extract building footprints from high-resolution aerial imagery and unmanned aerial vehicle (UAV) imagery. Data pre-processing with the logarithmic correction image enhancing algorithm showed the most significant improvement in the building detection accuracy for aerial images; meanwhile, the CLAHE algorithm improved the most concerning UAV images. This study developed a post-processing technique using polygonizing and polygon smoothing called the Douglas–Peucker algorithm, which made the building output directly ready to use for different applications. The attribute information, land use data, and population count data were applied using two open datasets. In addition, the building area and perimeter of each building were calculated as geometric attributes. Numéro de notice : A2021-684 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.3390/ijgi10090606 Date de publication en ligne : 14/09/2021 En ligne : https://doi.org/10.3390/ijgi10090606 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=98410 [article]

A typification method for linear building groups based on stroke simplification / Xiao Wang in Geocarto international, vol 36 n° 15 ([15/08/2021])  

Public [article]  inGeocarto international > vol 36 n° 15 [15/08/2021] . - pp 1732 - 1751 Titre : A typification method for linear building groups based on stroke simplification Type de document : Article/Communication Auteurs : Xiao Wang, Auteur ; Dirk Burghardt, Auteur Année de publication : 2021 Article en page(s) : pp 1732 - 1751 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme de Douglas-Peucker [Termes IGN] alignement [Termes IGN] bâtiment [Termes IGN] généralisation du bâti [Termes IGN] noeud [Termes IGN] objet géographique linéaire [Termes IGN] reconnaissance de formes [Termes IGN] simplification de contour [Termes IGN] triangulation de Delaunay [Vedettes matières IGN] Généralisation Résumé : (auteur) Linear building groups are common patterns and important local structures in large scale maps, which should be carefully generalized. This paper uses the idea of line simplification to typify linear building groups. Firstly, based on the stroke idea, the linear building groups are detected that each building group is related by only one stroke; the collinear and curvilinear patterns are distinguished by calculating the overlap rate between the defined auxiliary polygon and its oriented bounding box. Secondly, the stroke is simplified by removing one node in each iterative step; and the remained nodes are reallocated to the new positions, which serves as the centroids location of the newly typified buildings. Third, the representation (size, shape, elongation, and orientation) of the newly typified buildings are calculated by the geometry information of their corresponding parent buildings. The typification method can be carried out as a progressive process, which iterates over the three steps to derive continuous typification results. The method is tested on two building datasets, and the experimental results demonstrate that the proposed method can achieve good performance by well preserving the original linear patterns in the generalized building groups. Numéro de notice : A2021-569 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/10106049.2019.1669725 Date de publication en ligne : 26/09/2019 En ligne : https://doi.org/10.1080/10106049.2019.1669725 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=98184 [article]

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 IGN] algorithme de Douglas-Peucker [Termes IGN] analyse de groupement [Termes IGN] entropie de Shannon [Termes IGN] généralisation cartographique automatisée [Termes IGN] polyligne [Termes IGN] représentation multiple [Termes 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]

Exemplaires(1)

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

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

Permalink

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)  

Permalink

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

Permalink

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

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

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

Permalink

Classics in cartography / Martin Dodge (2011)

Permalink

A three-dimensional Douglas-Peucker algorithm and its application to automated generalization of DEMs / Fei Lifan in International journal of geographical information science IJGIS, vol 23 n° 6 (june 2009)  

Permalink

Vers un fond vert commun IGN-IFN / Françoise de Blomac in SIG la lettre, n° 86 (avril 2007)

Permalink