Descripteur
Termes IGN > mathématiques > statistique mathématique > probabilités > stochastique > processus stochastique > arbre aléatoire > algorithme STA
algorithme STAVoir aussi |
Documents disponibles dans cette catégorie (6)
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
Efficient structure from motion for oblique UAV images based on maximal spanning tree expansion / San Jiang in ISPRS Journal of photogrammetry and remote sensing, vol 132 (October 2017)
[article]
Titre : Efficient structure from motion for oblique UAV images based on maximal spanning tree expansion Type de document : Article/Communication Auteurs : San Jiang, Auteur ; Wanshou Jiang, Auteur Année de publication : 2017 Article en page(s) : pp 140 - 161 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques
[Termes IGN] algorithme STA
[Termes IGN] compensation par faisceaux
[Termes IGN] drone
[Termes IGN] image aérienne oblique
[Termes IGN] reconstruction 3D
[Termes IGN] structure-from-motionRésumé : (Auteur) The primary contribution of this paper is an efficient Structure from Motion (SfM) solution for oblique unmanned aerial vehicle (UAV) images. First, an algorithm, considering spatial relationship constraints between image footprints, is designed for match pair selection with the assistance of UAV flight control data and oblique camera mounting angles. Second, a topological connection network (TCN), represented by an undirected weighted graph, is constructed from initial match pairs, which encodes the overlap areas and intersection angles into edge weights. Then, an algorithm, termed MST-Expansion, is proposed to extract the match graph from the TCN, where the TCN is first simplified by a maximum spanning tree (MST). By further analysis of the local structure in the MST, expansion operations are performed on the vertices of the MST for match graph enhancement, which is achieved by introducing critical connections in the expansion directions. Finally, guided by the match graph, an efficient SfM is proposed. Under extensive analysis and comparison, its performance is verified by using three oblique UAV datasets captured with different multi-camera systems. Experimental results demonstrate that the efficiency of image matching is improved, with speedup ratios ranging from 19 to 35, and competitive orientation accuracy is achieved from both relative bundle adjustment (BA) without GCPs (Ground Control Points) and absolute BA with GCPs. At the same time, images in the three datasets are successfully oriented. For the orientation of oblique UAV images, the proposed method can be a more efficient solution. Numéro de notice : A2017-642 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2017.09.004 En ligne : https://doi.org/10.1016/j.isprsjprs.2017.09.004 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86999
in ISPRS Journal of photogrammetry and remote sensing > vol 132 (October 2017) . - pp 140 - 161[article]Exemplaires(3)
Code-barres Cote Support Localisation Section Disponibilité 081-2017101 RAB Revue Centre de documentation En réserve L003 Disponible 081-2017102 DEP-EAF Revue Nancy Dépôt en unité Exclu du prêt 081-2017103 DEP-EXM Revue Saint-Mandé Dépôt en unité Exclu du prêt 3D tree modeling from incomplete point clouds via optimization and L1-MST / Jie Mei in International journal of geographical information science IJGIS, vol 31 n° 5-6 (May-June 2017)
[article]
Titre : 3D tree modeling from incomplete point clouds via optimization and L1-MST Type de document : Article/Communication Auteurs : Jie Mei, Auteur ; Liqiang Zhang, Auteur ; Shihao Wu, Auteur ; et al., Auteur Année de publication : 2017 Article en page(s) : pp 999 - 1021 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] algorithme STA
[Termes IGN] arbre (flore)
[Termes IGN] branche (arbre)
[Termes IGN] densité des points
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] méthode robuste
[Termes IGN] modèle numérique d'objet
[Termes IGN] optimisation (mathématiques)
[Termes IGN] semis de points
[Termes IGN] semis de points clairsemés
[Termes IGN] squelettisationRésumé : (auteur) Reconstruction of 3D trees from incomplete point clouds is a challenging issue due to their large variety and natural geometric complexity. In this paper, we develop a novel method to effectively model trees from a single laser scan. First, coarse tree skeletons are extracted by utilizing the L1-median skeleton to compute the dominant direction of each point and the local point density of the point cloud. Then we propose a data completion scheme that guides the compensation for missing data. It is an iterative optimization process based on the dominant direction of each point and local point density. Finally, we present a L1-minimum spanning tree (MST) algorithm to refine tree skeletons from the optimized point cloud, which integrates the advantages of both L1-median skeleton and MST algorithms. The proposed method has been validated on various point clouds captured from single laser scans. The experiment results demonstrate the effectiveness and robustness of our method for coping with complex shapes of branching structures and occlusions. Numéro de notice : A2017-239 Affiliation des auteurs : non IGN Thématique : FORET/IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2016.1264075 En ligne : http://dx.doi.org/10.1080/13658816.2016.1264075 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85173
in International journal of geographical information science IJGIS > vol 31 n° 5-6 (May-June 2017) . - pp 999 - 1021[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2017031 RAB Revue Centre de documentation En réserve L003 Disponible Reconstruction of itineraries from annotated text with an informed spanning tree algorithm / Ludovic Moncla in International journal of geographical information science IJGIS, vol 30 n° 5-6 (May - June 2016)
[article]
Titre : Reconstruction of itineraries from annotated text with an informed spanning tree algorithm Type de document : Article/Communication Auteurs : Ludovic Moncla , Auteur ; Mauro Gaio, Auteur ; Javier Nogueras-Iso, Auteur ; Sébastien Mustière , Auteur Année de publication : 2016 Projets : 3-projet - voir note / Article en page(s) : pp 1137 - 1160 Note générale : Bibliographie
projet PerdidoLangues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] algorithme STA
[Termes IGN] analyse multicritère
[Termes IGN] approximation
[Termes IGN] arbre de décision
[Termes IGN] graphe
[Termes IGN] langage naturel (informatique)
[Termes IGN] reconstruction d'itinéraire ou de trajectoire
[Termes IGN] traitement du langage naturelRésumé : (Auteur) Considerable amounts of geographical data are still collected not in form of GIS data but just as natural language texts. This paper proposes an approach for the automatic geocoding of itineraries described in natural language. This approach needs as an input a text annotated with part-of-speech and geo-semantic tags. The proposed method is divided into three main steps. First, we build a complete graph where vertices represent locations, and all vertices are connected to each other by undirected edges. We assign a weight to all the edges of the complete graph using a multi-criteria analysis approach. Then we compute a minimum spanning tree to obtain an undirected acyclic graph connecting all vertices. And finally, we transform this graph into a partially directed acyclic graph in order to identify the sequence of waypoints and build an approximation of a plausible footprint of the itinerary described. Additionally, the rationale of the proposed approach has been verified with a set of experiments on a corpus of hiking descriptions. Numéro de notice : A2016-297 Affiliation des auteurs : LASTIG COGIT+Ext (2012-2019) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2015.1108422 Date de publication en ligne : 09/11/2015 En ligne : https://doi.org/10.1080/13658816.2015.1108422 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=80883
in International journal of geographical information science IJGIS > vol 30 n° 5-6 (May - June 2016) . - pp 1137 - 1160[article]Voir aussiExemplaires(2)
Code-barres Cote Support Localisation Section Disponibilité 079-2016032 RAB Revue Centre de documentation En réserve L003 Disponible 079-2016031 RAB Revue Centre de documentation En réserve L003 Disponible
contenu dans Geographic Information Science, 8th International Conference, GIScience 2014, Vienna Austria, September 24-26, 2014 / Matt Duckham (2014)
Titre : Automatic itinerary reconstruction from texts Type de document : Article/Communication Auteurs : Ludovic Moncla , Auteur ; Mauro Gaio, Auteur ; Sébastien Mustière , Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 2014 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 8728 Conférence : GIScience 2014, 8th international conference on geographic information science 23/09/2014 26/09/2014 Vienne Autriche Proceedings Springer Importance : pp 253 - 267 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] algorithme STA
[Termes IGN] calcul d'itinéraire
[Termes IGN] itinéraire
[Termes IGN] langage naturel (informatique)
[Termes IGN] traitement du langage naturelRésumé : (auteur) This paper proposes an approach for the reconstruction of itineraries extracted from narrative texts. This approach is divided into two main tasks. The first extracts geographical information with natural language processing. Its outputs are annotations of so called expanded entities and expressions of displacement or perception from hiking descriptions. In order to reconstruct a plausible footprint of an itinerary described in the text, the second task uses the outputs of the first task to compute a minimum spanning tree. Numéro de notice : C2014-004 Affiliation des auteurs : LASTIG COGIT+Ext (2012-2019) Thématique : GEOMATIQUE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1007/978-3-319-11593-1_17 En ligne : http://dx.doi.org/10.1007/978-3-319-11593-1_17 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=78475 Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees / Renato Martins Assuncao in International journal of geographical information science IJGIS, vol 20 n° 7 (august 2006)
[article]
Titre : Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees Type de document : Article/Communication Auteurs : Renato Martins Assuncao, Auteur ; M.C. Neves, Auteur ; G. Camara, Auteur ; et al., Auteur Année de publication : 2006 Article en page(s) : pp 797 - 811 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] algorithme STA
[Termes IGN] arbre (mathématique)
[Termes IGN] données socio-économiques
[Termes IGN] graphe
[Termes IGN] objet géographique
[Termes IGN] optimisation (mathématiques)
[Termes IGN] régionalisation (segmentation)Résumé : (Auteur) Regionalization is a classification procedure applied to spatial objects with an areal representation, which groups them into homogeneous contiguous regions. This paper presents an efficient method for regionalization. The first step creates a connectivity graph that captures the neighbourhood relationship between the spatial objects. The cost of each edge in the graph is inversely proportional to the similarity between the regions it joins. We summarize the neighbourhood structure by a minimum spanning tree (MST), which is a connected tree with no circuits. We partition the MST by successive removal of edges that link dissimilar regions. The result is the division of the spatial objects into connected regions that have maximum internal homogeneity. Since the MST partitioning problem is NP-hard, we propose a heuristic to speed up the tree partitioning significantly. Our results show that our proposed method combines performance and quality, and it is a good alternative to other regionalization methods found in the literature. Copyright Taylor & Francis. Numéro de notice : A2006-295 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810600665111 En ligne : https://doi.org/10.1080/13658810600665111 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28022
in International journal of geographical information science IJGIS > vol 20 n° 7 (august 2006) . - pp 797 - 811[article]Exemplaires(2)
Code-barres Cote Support Localisation Section Disponibilité 079-06071 RAB Revue Centre de documentation En réserve L003 Disponible 079-06072 RAB Revue Centre de documentation En réserve L003 Disponible Building displacement over a ductile truss / M. Bader in International journal of geographical information science IJGIS, vol 19 n° 8 - 9 (september 2005)Permalink