Centre de documentation
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]

Image matching from handcrafted to deep features: A survey / Jiayi Ma in International journal of computer vision, vol 29 n° 1 (January 2021)  

Public [article]  inInternational journal of computer vision > vol 29 n° 1 (January 2021) . - pp 23 - 79 Titre : Image matching from handcrafted to deep features: A survey Type de document : Article/Communication Auteurs : Jiayi Ma, Auteur ; Xingyu Jiang, Auteur ; Aoxiang Fan, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 23 - 79 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes IGN] appariement d'images [Termes IGN] appariement de graphes [Termes IGN] apprentissage profond [Termes IGN] classification par réseau neuronal convolutif [Termes IGN] extraction de traits caractéristiques [Termes IGN] lissage de courbe [Termes IGN] recalage d'image Résumé : (auteur) As a fundamental and critical task in various visual applications, image matching can identify then correspond the same or similar structure/content from two or more images. Over the past decades, growing amount and diversity of methods have been proposed for image matching, particularly with the development of deep learning techniques over the recent years. However, it may leave several open questions about which method would be a suitable choice for specific applications with respect to different scenarios and task requirements and how to design better image matching methods with superior performance in accuracy, robustness and efficiency. This encourages us to conduct a comprehensive and systematic review and analysis for those classical and latest techniques. Following the feature-based image matching pipeline, we first introduce feature detection, description, and matching techniques from handcrafted methods to trainable ones and provide an analysis of the development of these methods in theory and practice. Secondly, we briefly introduce several typical image matching-based applications for a comprehensive understanding of the significance of image matching. In addition, we also provide a comprehensive and objective comparison of these classical and latest techniques through extensive experiments on representative datasets. Finally, we conclude with the current status of image matching technologies and deliver insightful discussions and prospects for future works. This survey can serve as a reference for (but not limited to) researchers and engineers in image matching and related fields. Numéro de notice : A2021-131 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s11263-020-01359-2 Date de publication en ligne : 04/08/2020 En ligne : https://doi.org/https://doi.org/10.1007/s11263-020-01359-2 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96967 [article]

A smooth curve as a fractal under the third definition / Ding Ma in Cartographica, vol 53 n° 3 (Fall 2018)  

Public [article]  inCartographica > vol 53 n° 3 (Fall 2018) . - pp 203 - 210 Titre : A smooth curve as a fractal under the third definition Type de document : Article/Communication Auteurs : Ding Ma, Auteur ; Bin Jiang, Auteur Année de publication : 2018 Article en page(s) : pp 203 - 210 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Cartographie [Termes IGN] approche hiérarchique [Termes IGN] courbe [Termes IGN] lissage de courbe [Termes IGN] logarithme [Termes IGN] objet fractal Résumé : (Auteur) It is commonly believed in the literature that smooth curves, such as circles, are not fractal, and only non-smooth curves, such as coastlines, are fractal. However, this article demonstrates that a smooth curve can be fractal, under a new, relaxed, third definition of fractal – a set or pattern is fractal if the scaling of far more small things than large ones recurs at least twice. The scaling can be rephrased as a hierarchy, consisting of numerous smallest, a very few largest, and some in between the smallest and the largest. The logarithmic spiral, as a smooth curve, is apparently fractal because it bears the self-similarity property, or the scaling of far more small squares than large ones recurs multiple times, or the scaling of far more small bends than large ones recurs multiple times. A half-circle or half-ellipse and the UK coastline (before or after smooth processing) are fractal if the scaling of far more small bends than large ones recurs at least twice. Numéro de notice : A2018-483 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3138/cart.53.3.2017-0032 Date de publication en ligne : 01/10/2018 En ligne : https://doi.org/10.3138/cart.53.3.2017-0032 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91208 [article]

Exemplaires(1)

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

Topological gradient connection analysis for feature detection / Chao-Yuan Lo in Photogrammetric record, vol 28 n° 141 (March - May 2013)  

Public [article]  inPhotogrammetric record > vol 28 n° 141 (March - May 2013) . - pp 7 - 26 Titre : Topological gradient connection analysis for feature detection Type de document : Article/Communication Auteurs : Chao-Yuan Lo, Auteur ; Lieng-Chien Chen, Auteur Année de publication : 2013 Article en page(s) : pp 7 - 26 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes IGN] analyse comparative [Termes IGN] connexité (topologie) [Termes IGN] détection de contours [Termes IGN] extraction de traits caractéristiques [Termes IGN] filtre de Canny [Termes IGN] gradient [Termes IGN] ligne caractéristique [Termes IGN] lissage de courbe [Termes IGN] niveau de gris (image) [Termes IGN] relation topologique Résumé : (Auteur) Edges and corners are two major image features in the modelling of man-made objects; an edge provides strong geometric orientation and corners possess good localisation. Feature detection is the basis of image processing for numerous applications such as image registration and object modelling. Completeness and localisation are the two major considerations for these applications; however, illumination, reflectance and shadows may interfere with image grey values to produce various gradients along an edge. Thus, threshold selection is an important step in obtaining suitable features in target-dependent methods as improper selection might cause information loss and broken edges. Instead of threshold selection, this study therefore proposes a feature extraction method using topological gradient connection (TGC) analysis involving three steps: grey value refinement, gradient computation and topological connection analysis. The first step uses a Gaussian filter to smooth the grey value image. The second step computes directional gradients to identify ridge pixels and collect feature candidates. The third step analyses adjacent candidates based on the criterion of topological connection. This three-step tracing procedure combines these connected candidates into a single object. The proposed scheme employs different images derived from various sensors and compares them with the Canny operator (using manually selected thresholds) and manually plotted corners for detection ability assessment. Experimental results indicate that the automatic results are more complete for subtle feature lines than the Canny edges. In addition, the proposed method provides higher flexibility in selecting suitable feature layers for different applications. Numéro de notice : A2013-149 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.1111/j.1477-9730.2012.00703.x Date de publication en ligne : 16/12/2012 En ligne : https://doi.org/10.1111/j.1477-9730.2012.00703.x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32287 [article]

Exemplaires(1)

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

Simultaneous & topologically-safe line simplification for a variable-scale planar partition / Martijn Meijers (31/01/2011) 

Public contenu dans Advancing geoinformation science for a changing world / Stan Geertman (2011)   Titre : Simultaneous & topologically-safe line simplification for a variable-scale planar partition Type de document : Article/Communication Auteurs : Martijn Meijers, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 31/01/2011 Conférence : AGILE 2011, 14th International Conference on Geographic Information Science, Advancing Geoinformation Science for a Changing World 18/04/2011 21/04/2011 Utrecht Pays-Bas Proceedings Springer Importance : pp 337 - 358 Format : 21 x 30 cm Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] généralisation automatique de données [Termes IGN] graphe planaire [Termes IGN] lissage de courbe [Termes IGN] partition de surface [Termes IGN] simplification de contour [Vedettes matières IGN] Généralisation Résumé : (Auteur) We employ a batch generalization process for obtaining a variable-scale planar partition. We describe an algorithm to simplify the boundary lines after a map generalization operation (either a merge or a split operation) has been applied on a polygonal area and its neighbours. The simplification is performed simultaneously on the resulting boundaries of the new polygonal areas that replace the areas that were processed. As the simplification strategy has to keep the planar partition valid, we define what we consider to be a valid planar partition (among other requirements, no zero-sized areas and no unwanted intersections in the boundary polylines). Furthermore, we analyse the effects of the line simplification for the content of the data structures in which the planar partition is stored. Numéro de notice : C2011-023 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=64364

Documents numériques

en open access 14509_ctap_line_simplification_for_variable-scale.pdf Adobe Acrobat PDF

Epipolar arrangement of satellite imagery by projection trajectory simplification / M. Wang in Photogrammetric record, vol 25 n° 132 (December 2010 - February 2011)  

Permalink

Cartographic generalisation of lines based on a B-spline snake model / E. Guilbert in International journal of geographical information science IJGIS, vol 22 n° 8-9 (august 2008)  

Permalink

Classified road detection from satellite images based on perceptual organization / J. Yang in International Journal of Remote Sensing IJRS, vol 28 n°19-20 (October 2007)  

Permalink

Controlled line smoothing by snakes / Dirk Burghardt in Geoinformatica, vol 9 n° 3 (September - November 2005)  

Permalink

A new approach for the simplification of contours / T. Gökgöz in Cartographica, vol 39 n° 4 (December 2004)  

Permalink

Estimation of the positional uncertainty in line simplification in GIS / C.K. Cheung in Cartographic journal (the), vol 41 n° 1 (June 2004)  

Permalink

Modélisation 3D du milieu urbain / G. Despine (2004)

Permalink

Using an energy minimization technique for polygon generalization / M. Galanda in Cartography and Geographic Information Science, vol 30 n° 3 (July 2003)  

Permalink

B-spline functions and wavelets for geographic line generalization / Eric Saux in Cartography and Geographic Information Science, vol 30 n° 1 (January 2003)  

Permalink

Migration de CALTOPO, lissage de courbes de niveau / K.R. Kouadio (2003)

Permalink