Centre dedocumentation
scientifique

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 ([10/08/2021])  

Public [article]  inGeocarto international > Vol 36 n° 15 [10/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 : https://doi.org/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]

Réservation

Réserver ce document

Exemplaires (1)

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

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 IGN] algorithme de Douglas-Peucker [Termes IGN] appariement de cartes [Termes IGN] appariement de données localisées [Termes IGN] appariement de graphes [Termes IGN] carte routière [Termes IGN] compression de données [Termes IGN] modèle de Markov caché [Termes IGN] réseau routier [Termes IGN] service fondé sur la position [Termes IGN] simplification de contour [Termes 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 IGN] algorithme de Douglas-Peucker [Termes IGN] algorithme de Visvalingam [Termes IGN] modèle de régression [Termes IGN] niveau de détail [Termes IGN] précision cartographique [Termes IGN] représentation des détails topographiques [Termes 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)  

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

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