Descripteur
Documents disponibles dans cette catégorie (894)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Assessment of a numerical method for computing the spherical harmonic coefficients of the gravitational potential of a constant density polyhedron / Olivier Jamet (2010)
contenu dans Gravity, Geoid and Earth Observation, IAG Commission 2 Gravity Field, Chania, Crete, Greece, 23-27 June 2008 / Stelios Mertikas (2010)
Titre : Assessment of a numerical method for computing the spherical harmonic coefficients of the gravitational potential of a constant density polyhedron Type de document : Article/Communication Auteurs : Olivier Jamet , Auteur ; Jérome Verdun , Auteur ; Dimitrios Tsoulis, Auteur ; Nicolas Gonindard, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 2010 Collection : International Association of Geodesy Symposia, ISSN 0939-9585 num. 135 Conférence : IAG 2008 Commission 2, Gravity, Geoid and Earth Observation GGEO 23/06/2008 27/06/2008 Chania Crète - Grèce Proceedings Springer Importance : pp 437 - 443 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] géodésie physique
[Termes IGN] harmonique sphérique
[Termes IGN] modèle de géopotentiel
[Termes IGN] polyèdreRésumé : (auteur) This study focuses on the assessment of a linear algorithm for computing the spherical harmonic coefficients of the gravitational potential of a constant density polyhedron. The ability to compute such an expansion would favor several applications, in particular in the field of the interpretation and assessment of GOCE gravitational models. The studied algorithm is the only known method that would achieve this computation at a computational cost depending linearly on the number of computed coefficients. We show that although this methods suffers from severe divergence issues, it could be applied to retrieve band-limited estimates of the potential generated by a constant density polyhedron. Numéro de notice : C2008-016 Affiliation des auteurs : LAREG+Ext (1991-2011) Thématique : MATHEMATIQUE/POSITIONNEMENT Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1007/978-3-642-10634-7_58 Date de publication en ligne : 26/10/2010 En ligne : https://doi.org/10.1007/978-3-642-10634-7_58 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90744
Titre : Estimating 3D polyhedral building models by registering aerial images Type de document : Article/Communication Auteurs : Fadi Dornaika , Auteur ; Karim Hammoudi , Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 2010 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 6475 Conférence : ACIVS 2010, 12th International Conference Advanced Concepts for Intelligent Vision Systems 13/12/2010 13/12/2010 Sydney Australie Proceedings Springer Importance : pp 239 - 248 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] bâtiment
[Termes IGN] empreinte
[Termes IGN] extraction de traits caractéristiques
[Termes IGN] image aérienne
[Termes IGN] modèle numérique de surface
[Termes IGN] polyèdreRésumé : (auteur) We describe a model driven approach for extracting simple 3D polyhedral building models from aerial images. The novelty of the approach lies in the use of featureless and direct optimization based on image rawbrightness. The 3D polyhedral model is estimated by optimizing a criterion that combines a global dissimilarity measure and a gradient score over several aerial images. The proposed approach gives more accurate 3D reconstruction than feature-based approaches since it does not involve intermediate noisy data (e.g., the 3D points of a noisy Digital Elevation Model). We provide experiments and evaluations of performance. Experimental results show the feasibility and robustness of the proposed approach. Numéro de notice : C2010-056 Affiliation des auteurs : MATIS (1993-2011) Thématique : IMAGERIE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1007/978-3-642-17691-3_22 En ligne : https://doi.org/10.1007/978-3-642-17691-3_22 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101648
Titre : Extracting outlined planar clusters of street facades from 3D point clouds Type de document : Article/Communication Auteurs : Karim Hammoudi , Auteur ; Fadi Dornaika , Auteur ; Bahman Soheilian , Auteur ; Nicolas Paparoditis , Auteur Editeur : New-York : IEEE Computer society Année de publication : 2010 Conférence : CVR 2010, Canadian Conference on Computer and Robot Vision 31/05/2010 02/06/2010 Ottawa Ontario - Canada Proceedings IEEE Importance : pp 122 - 129 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] extraction automatique
[Termes IGN] façade
[Termes IGN] Paris (75)
[Termes IGN] plan (géométrie)
[Termes IGN] scène urbaine
[Termes IGN] transformation de HoughRésumé : (auteur) This paper presents an approach for extracting 3D outlined planar clusters of street facades. Terrestrial laser data are acquired using a Mobile Mapping System (MMS). Mapping of street facades is of great interest in various digital mapping and robotic research topics. After a filtering step of the 3D point cloud, the dominant hypothetical facade planes are detected using an adapted Progressive Probabilistic Hough Transform (PPHT). The corresponding planar clusters are extracted using a priori geometric knowledge of street. The clusters are horizontally and vertically delimited using heuristic approaches. The adapted PPHT allows the automatic extraction of georeferenced planar clusters of facades with a fine detection of dominant facade lines and a low computation time. The adopted approach has been tested on a set of point cloud acquired in the city of Paris under real conditions. Examples and experimental results show the efficiency and the potential of the proposed approach. Numéro de notice : C2010-058 Affiliation des auteurs : MATIS+Ext (1993-2011) Thématique : IMAGERIE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1109/CRV.2010.23 En ligne : https://doi.ieeecomputersociety.org/10.1109/CRV.2010.23 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101650
Titre : Validation of Planar Partitions Using Constrained Triangulation Type de document : Article/Communication Auteurs : Hugo Ledoux, Auteur ; Martijn Meijers, Auteur Editeur : International Society for Photogrammetry and Remote Sensing ISPRS Année de publication : 2010 Collection : International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences, ISSN 1682-1750 num. 38-2 Conférence : ISPRS 2010, Commission 2, Joint International Conference on Theory, Data Handling and Modelling 26/05/2010 28/05/2010 Hong Kong Hong Kong OA ISPRS Archives Importance : 6 p. Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] cohérence géométrique
[Termes IGN] cohérence logique
[Termes IGN] graphe planaire
[Termes IGN] partition
[Termes IGN] polygone
[Termes IGN] tessellation
[Termes IGN] triangulation de DelaunayRésumé : (auteur) Planar partitions—full tessellations of the plane into non-overlapping polygons—are frequently used in GIS to model concepts such as land cover, cadastral parcels or administrative boundaries. Since in practice planar partitions are often stored as a set of individual objects (polygons) to which attributes are attached (e.g. stored with a shapefile), and since different errors/mistakes can be introduced during their construction, manipulation or exchange, several inconsistencies will often arise in practice. The inconsistencies are for instance overlapping polygons, gaps and unconnected polygons. We present in this paper a novel algorithm to validate such planar partitions. It uses a constrained triangulation as a support for the validation, and permits us to avoid different problems that arise with existing solutions based on the construction of a planar graph. We describe in the paper the details of our algorithm, our implementation, how inconsistencies can be detected, and the experiments we have made with real-world data (the CORINE2000 dataset). Numéro de notice : 14814 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Communication DOI : sans En ligne : http://www.isprs.org/proceedings/XXXVIII/part2/Papers/24_Paper.pdf Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=73994 Modelling the erectheion: extracting information from very large datasets / J. Beraldin in GIM international, vol 23 n° 11 (November 2009)
[article]
Titre : Modelling the erectheion: extracting information from very large datasets Type de document : Article/Communication Auteurs : J. Beraldin, Auteur Année de publication : 2009 Article en page(s) : pp 13 - 17 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] données localisées 3D
[Termes IGN] image à haute résolution
[Termes IGN] jeu de données localisées
[Termes IGN] lasergrammétrie
[Termes IGN] modélisation 3D
[Termes IGN] monument historique
[Termes IGN] photogrammétrie numérique
[Termes IGN] polygone
[Termes IGN] reconstruction 3D
[Termes IGN] reconstruction d'objet
[Termes IGN] résolution multiple
[Termes IGN] télémétrie laser terrestre
[Termes IGN] texturage
[Termes IGN] visualisation 3DRésumé : (Auteur) Modern terrestrial laser scanners (TLS) generate between 10 and 50 million 3D coordinates per minutes : about 500Mbytes of data. Together with high-resolution images for texturing purposes, this is enough information to choke high-end PCs running commercial software. The National Research Council in Canada has developped a framework for extracting information from very large TLS and imagery datasets, an evolution demonstrated in the Erechtheion project. This monument has been modelled in the 3D to a spatial resolution of 2mm. The fully textured 3D model containing 348 million polygons can be interactively visualised and analysed in real time. Copyright Reed Business Numéro de notice : A2009-436 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30067
in GIM international > vol 23 n° 11 (November 2009) . - pp 13 - 17[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 061-09111 RAB Revue Centre de documentation En réserve L003 Disponible SIG et cartographie pour MacIntosh / Anonyme in Géomatique expert, n° 71 (octobre - novembre 2009)PermalinkMultihulls: Spatial representation and processing with variable shape fidelity, applied to gazetteers / J.T. Hastings in Transactions in GIS, vol 13 n°5-6 (October/december 2009)PermalinkRecursive algorithms for the computation of the potential harmonic coefficients of a constant density polyhedron / Dimitrios Tsoulis in Journal of geodesy, vol 83 n° 10 (October 2009)PermalinkPrecise, automatic and fast method for vanishing point detection / Mahzad Kalantari in Photogrammetric record, vol 24 n° 127 (September - November 2009)PermalinkLes réseaux de polygones de Thiessen : application à la géolocalisation robuste de caravanserails décrits dans les récits anciens de voyageurs / André Del in Géomatique expert, n° 70 (01/09/2009)PermalinkStreet-based topological representations and analyses for predicting traffic flow in GIS / Bin Jiang in International journal of geographical information science IJGIS, vol 23 n°9-10 (september 2009)PermalinkAssessment of sliver polygons in geographical vector data / M. Delafontaine in International journal of geographical information science IJGIS, vol 23 n° 6 (june 2009)PermalinkOcclusion-based methodology for the classification of Lidar Data / A.F. Habib in Photogrammetric Engineering & Remote Sensing, PERS, vol 75 n° 6 (June 2009)PermalinkA geodesic map projection for quadrilaterals / J. Crider in Cartography and Geographic Information Science, vol 36 n° 2 (April 2009)PermalinkUrban area and building detection using SIFT: Keypoints and Graph Theory / B. Simarcek in IEEE Transactions on geoscience and remote sensing, vol 47 n° 4 (April 2009)Permalink