Centre de documentation
scientifique

The development and analysis of quasi-linear map projections / Jonathan Charles Lliffe in Cartography and Geographic Information Science, Vol 45 n° 3 (May 2018)  

Public [article]  inCartography and Geographic Information Science > Vol 45 n° 3 (May 2018) . - pp 270 - 283 Titre : The development and analysis of quasi-linear map projections Type de document : Article/Communication Auteurs : Jonathan Charles Lliffe, Auteur Année de publication : 2018 Article en page(s) : pp 270 - 283 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Projections [Termes IGN] algorithme snake [Termes IGN] facteur d'échelle [Termes IGN] projection conforme [Termes IGN] réseau ferroviaire Résumé : (Auteur) Map projections are an essential component of coordinate systems used in applications such as surveying, topographic mapping, and engineering, and care needs to be taken to select ones that minimize distortion for each case. This article explores the selection process for near-linear features on the surface of the Earth and derives limits for the extent of a project that can be projected within specified distortion tolerances. It is then demonstrated that a multifaceted set of projections of the Earth may be used to extend this concept to the mapping of features such as highways and railways that are quasi-linear but do not exactly follow a standard geometrical line (a great circle or a small circle) on the surface of the Earth. A continuous, conformal coordinate system may be derived in such situations, extending to indefinite length and applicable over a swath of several kilometers width, but it cannot be extended to cover situations with extensive variations in height. Instead, the Snake Projection is analyzed, and it is shown that this can be used to develop continuous (non-zonal) projected coordinate systems for major engineering projects extending for hundreds of kilometers and having extensive height ranges. Examples are shown of the application to railway projects. Numéro de notice : A2018-133 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/15230406.2017.1325332 Date de publication en ligne : 19/05/2017 En ligne : https://doi.org/10.1080/15230406.2017.1325332 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89664 [article]

Exemplaires(1)

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

Building displacement based on the topological structure / Yageng Sun in Cartographic journal (the), Vol 53 n° 3 (August 2016)  

Public [article]  inCartographic journal (the) > Vol 53 n° 3 (August 2016) Titre : Building displacement based on the topological structure Type de document : Article/Communication Auteurs : Yageng Sun, Auteur ; Qingsheng Guo, Auteur ; Yuangang Liu, Auteur ; et al., Auteur Année de publication : 2016 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme snake [Termes IGN] déplacement d'objet géographique [Termes IGN] généralisation automatique de données [Termes IGN] optimisation (mathématiques) [Termes IGN] partitionnement [Termes IGN] pondération [Termes IGN] relation spatiale [Termes IGN] triangulation de Delaunay [Vedettes matières IGN] Généralisation Résumé : (auteur) Map data at smaller scales than their source can result in spatial conflict, whereby map symbols become too close, or overlaid. Server map generalisation operators may be applied to solve this problem, including displacement. In this paper, we show how an optimisation algorithm, the snake algorithm, was used to displace multiple objects in order to resolve spatial conflicts and maintain important spatial relationships between objects during displacement. Two principles based on the snake algorithm are proposed in this paper. First, the truss structure mirroring spatial proximity relationships between buildings and between building and road is formed based on the weighted proximity graph derived from constrained Delaunay triangulations (CDT) in each map partition. In the weighted proximity graph, each connecting line is determined as a snake and as an element unit to assemble the global stiffness matrix in snake algorithm. Second, a buffer method that calculates force between a building and a road (or other linear features) or between pair of buildings is adopted in the snake algorithm. This avoids the imbalance phenomenon caused by different force calculation methods during the displacement. The feasibility of the approach is demonstrated in obtaining real geographic data. Finally, the results are cartographically usable and in particular, the spatial relationships between objects are preserved. Numéro de notice : A2016-680 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1179/1743277414Y.0000000089 En ligne : http://dx.doi.org/10.1179/1743277414Y.0000000089 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81937 [article]

Exemplaires(1)

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

Automatic construction of 3-D building model from airborne LIDAR data through 2-D snake algorithm / Jianhua Yan in IEEE Transactions on geoscience and remote sensing, vol 53 n° 1 (January 2015)  

Public [article]  inIEEE Transactions on geoscience and remote sensing > vol 53 n° 1 (January 2015) . - pp 3 - 14 Titre : Automatic construction of 3-D building model from airborne LIDAR data through 2-D snake algorithm Type de document : Article/Communication Auteurs : Jianhua Yan, Auteur ; Keqi Zhang, Auteur ; Chengcui Zhang, Auteur ; et al., Auteur Année de publication : 2015 Article en page(s) : pp 3 - 14 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques [Termes IGN] algorithme snake [Termes IGN] données lidar [Termes IGN] modèle numérique du bâti [Termes IGN] reconstruction 2D du bâti [Termes IGN] reconstruction 3D du bâti [Termes IGN] topologie Résumé : (Auteur) The snake algorithm has been proposed to solve many remote sensing and computer vision problems such as object segmentation, surface reconstruction, and object tracking. This paper introduces a framework for 3-D building model construction from LIDAR data based on the snake algorithm. It consists of nonterrain object identification, building and tree separation, building topology extraction, and adjustment by the snake algorithm. The challenging task in applying the snake algorithm to building topology adjustment is to find the global minima of energy functions derived for 2-D building topology. The traditional snake algorithm uses dynamic programming for computing the global minima of energy functions which is limited to snake problems with 1-D topology (i.e., a contour) and cannot handle problems with 2-D topology. In this paper, we have extended the dynamic programming method to address the snake problems with a 2-D planar topology using a novel graph reduction technique. Given a planar snake, a set of reduction operations is defined and used to simplify the graph of the planar snake into a set of isolated vertices while retaining the minimal energy of the graph. Another challenging task for 3-D building model reconstruction is how to enforce different kinds of geometric constraints during building topology refinement. This framework proposed two energy functions, deviation and direction energy functions, to enforce multiple geometric constraints on 2-D topology refinement naturally and efficiently. To examine the effectiveness of the framework, the framework has been applied on different data sets to construct 3-D building models from airborne LIDAR data. The results demonstrate that the proposed snake algorithm successfully found the global optima in polynomial time for all of the building topologies and generated satisfactory 3-D models for most of the buildings in the study areas. Numéro de notice : A2015-039 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2014.2312393 En ligne : https://doi.org/10.1109/TGRS.2014.2312393 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=75121 [article]

Exemplaires(1)

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

Using snakes for the registration of topographic road database objects to ALS features / J. Göpfert in ISPRS Journal of photogrammetry and remote sensing, vol 66 n° 6 (November 2011)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 66 n° 6 (November 2011) . - pp 858 - 871 Titre : Using snakes for the registration of topographic road database objects to ALS features Type de document : Article/Communication Auteurs : J. Göpfert, Auteur ; Franz Rottensteiner, Auteur ; Christian Heipke, Auteur Année de publication : 2011 Article en page(s) : pp 858 - 871 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] algorithme snake [Termes IGN] appariement de données localisées [Termes IGN] base de données routières [Termes IGN] contour [Termes IGN] données lidar [Termes IGN] données localisées 3D [Termes IGN] données topographiques [Termes IGN] modèle numérique de paysage [Termes IGN] objet géographique [Termes IGN] optimisation (mathématiques) [Termes IGN] réseau routier Résumé : (Auteur) For historical reasons many national mapping agencies store their topographic data in a dual system consisting of a Digital Landscape Model (DLM) and a Digital Terrain Model (DTM). The DLM contains 2D vector data representing objects on the Earth’s surface, such as roads and rivers, whereas the DTM is a 2.5D representation of the related height information, often acquired by Airborne Laser Scanning (ALS). Today, many applications require reliable 3D topographic data. Therefore, it is advantageous to convert the dual system into a 3D DLM. However, as a result of different methods of acquisition, processing, and modelling, the registration of the two data sets often presents difficulties. Thus, a straightforward integration of the DTM and DLM might lead to inaccurate and semantically incorrect 3D objects. $In this paper we propose a new method for the fusion of the two data sets that exploits parametric active contours (also called snakes), focusing on road networks. For that purpose, the roads from a DLM initialise the snakes, defining their topology and their internal energy, whereas ALS features exert external forces to the snake via the image energy. After the optimisation process the shape and position of the snakes should coincide with the ALS features. With respect to the robustness of the method several known modifications of snakes are combined in a consistent framework for DLM road network adaptation. One important modification redefines the standard internal energy and thus the geometrical model of the snake in order to prevent changes in shape or position not caused by significant features in the image energy. For this purpose, the initial shape is utilized creating template-like snakes with the ability of local adaptation. This is one crucial point towards the applicability of the entire method considering the strongly varying significance of the ALS features. Other concepts related to snakes are integrated which enable our method to model network and ribbon-like characteristics simultaneously. Additionally, besides ALS road features information about context objects, such as bridges and buildings, is introduced as part of the image energy to support the optimisation process. Meaningful examples are presented that emphasize and evaluate the applicability of the proposed method. Numéro de notice : A2011-473 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2011.08.008 En ligne : https://doi.org/10.1016/j.isprsjprs.2011.08.008 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31367 [article]

Exemplaires(1)

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

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)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 22 n° 8-9 (august 2008) . - pp 847 - 870 Titre : Cartographic generalisation of lines based on a B-spline snake model Type de document : Article/Communication Auteurs : E. Guilbert, Auteur ; Eric Saux, Auteur Année de publication : 2008 Article en page(s) : pp 847 - 870 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme snake [Termes IGN] fonction spline [Termes IGN] généralisation cartographique automatisée [Termes IGN] lissage de courbe [Termes IGN] navigation maritime [Termes IGN] objet géographique linéaire [Termes IGN] simplification de contour [Termes IGN] système d'information géographique [Termes IGN] visualisation [Vedettes matières IGN] Généralisation Résumé : (Auteur) The automation of cartographic map production is still an important research field in Geographical Information Systems (GIS). With the increasing development of monitoring and decision-aid systems either on computer networks or wireless networks, efficient methods are needed to visualise geographical data while respecting some application constraints (accuracy, legibility, security, etc.). This paper introduces a B-spline snake model to deal with the current operators involved in the cartographic generalisation process of lines. This model enables us to perform those operators with a continuous approach. In order to avoid local conflicts such as intersections or self-intersections, the consistency of the lines is checked and discrete operations such as segment removal are performed during the process. We apply the method to map production in the highly constrained domain of maritime navigation systems. Experimental results of marine chart generalisation yield some discussions about generalisation robustness and quality. Copyright Taylor & Francis Numéro de notice : A2008-305 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810701689846 En ligne : https://doi.org/10.1080/13658810701689846 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29298 [article]

Exemplaires(2)

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

A new model for cloud tracking and analysis on satellite images / E. Guilbert in Geoinformatica, vol 11 n° 3 (September - November 2007)  

Permalink

Conflict removal between B-spline curves for isobathymetric line generalization using a snake model / E. Guilbert in Cartography and Geographic Information Science, vol 33 n° 1 (January 2006)  

Permalink

Extraction de réseaux de rues en milieu urbain à partir d'images satellites à très haute résolution spatiale / Renaud Péteri (2003)  

Permalink

Road extraction based on snakes and sophisticated line extraction / Ivan Laptev (1997)

Permalink

Modèles déformables 2-D et 3-D : application à la segmentation d’images médicales / Isaac Cohen (1992)  

Permalink

Les contours actifs : modélisation, comportement et convergence / Marie-Odile Berger (1991)  

Permalink