Descripteur
Documents disponibles dans cette catégorie (990)
![](./images/expand_all.gif)
![](./images/collapse_all.gif)
Etendre la recherche sur niveau(x) vers le bas
An efficient point cloud management method based on a 3D R-tree / J. Gong in Photogrammetric Engineering & Remote Sensing, PERS, vol 78 n° 4 (April 2012)
![]()
[article]
Titre : An efficient point cloud management method based on a 3D R-tree Type de document : Article/Communication Auteurs : J. Gong, Auteur ; Q. Zhu, Auteur ; R. Zhong, Auteur ; et al., Auteur Année de publication : 2012 Article en page(s) : pp 373 - 381 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] arbre-R
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] octree
[Termes IGN] performance
[Termes IGN] semis de pointsRésumé : (Auteur) Vehicle-borne laser-scanned point clouds have become increasingly important 3D data sources in fields such as digital city modeling and emergency response management. Aiming at reducing the technical bottlenecks of management and visualization of very large point cloud data sets, this paper proposes a new spatial organization method called 3DOR-Tree, which integrates Octree and 3D R-Tree data structures. This method utilizes Octree's rapid convergence to generate R-Tree leaf nodes, which are inserted directly into the R-Tree, thus avoiding time-consuming point-by-point insertion operations. Furthermore, this paper extends the R-Tree structure to support LOD (level of detail) models. Based on the extended structure, a practical data management method is presented. Finally, an adaptive control method for LODS of point clouds is illustrated. Typical experimental results show that our method possesses quasi-real-time index construction speed, a good storage utilization rate, and efficient visualization performance. Numéro de notice : A2012-180 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.14358/PERS.78.4.373 En ligne : https://doi.org/10.14358/PERS.78.4.373 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31627
in Photogrammetric Engineering & Remote Sensing, PERS > vol 78 n° 4 (April 2012) . - pp 373 - 381[article]An interactive framework for spatial joins : a statistical approach to data analysis in GIS / S. Alkobaisi in Geoinformatica, vol 16 n° 2 (April 2012)
![]()
[article]
Titre : An interactive framework for spatial joins : a statistical approach to data analysis in GIS Type de document : Article/Communication Auteurs : S. Alkobaisi, Auteur ; W. Bae, Auteur ; P. Vojtechovsky, Auteur ; S. Narayanappa, Auteur Année de publication : 2012 Article en page(s) : pp 329 - 355 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse de données
[Termes IGN] arbre quadratique
[Termes IGN] arbre-R
[Termes IGN] système d'information géographiqueRésumé : (Auteur) Many Geographic Information Systems (GIS) handle a large volume of geospatial data. Spatial joins over two or more geospatial datasets are very common operations in GIS for data analysis and decision support. However, evaluating spatial joins can be very time intensive due to the size of datasets. In this paper, we propose an interactive framework that provides faster approximate answers of spatial joins. The proposed framework utilizes two statistical methods: probabilistic join and sampling based join. The probabilistic join method provides speedup of two orders of magnitude with no correctness guarantee, while the sampling based method provides an order of magnitude improvement over the full indexing tree joins of datasets and also provides running confidence intervals. The framework allows users to trade-off speed versus bounded accuracy, hence it provides truly interactive data exploration. The two methods are evaluated empirically with real and synthetic datasets. Numéro de notice : A2012-090 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-011-0134-7 Date de publication en ligne : 19/08/2011 En ligne : https://doi.org/10.1007/s10707-011-0134-719/08/2011 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31538
in Geoinformatica > vol 16 n° 2 (April 2012) . - pp 329 - 355[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2012021 RAB Revue Centre de documentation En réserve L003 Disponible Tree topology representation from TLS point clouds using depth-first search in voxel space / A. Schilling in Photogrammetric Engineering & Remote Sensing, PERS, vol 78 n° 4 (April 2012)
![]()
[article]
Titre : Tree topology representation from TLS point clouds using depth-first search in voxel space Type de document : Article/Communication Auteurs : A. Schilling, Auteur ; A. Schmidt, Auteur ; Hans-Gerd Maas, Auteur Année de publication : 2012 Article en page(s) : pp 383 - 392 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] arbre (mathématique)
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] relation topologique
[Termes IGN] semis de points
[Termes IGN] transformation de Hough
[Termes IGN] voxelRésumé : (Auteur) For a fundamental understanding of environmental processes and for the management of forests, information on the tree structure, preferably in 3D, is vital. Therefore, we propose a method to retrieve the spatial tree structure from 3D point clouds captured by a terrestrial laser scanner. The procedure addresses dense and noisy data sets of separate trees. Our method involves a variation of the Circular Hough Transform to determine trunk positions and a sequence of operations in voxel space. The core of the approach is the depth-first search algorithm, known from graph theory, to actually recover the tree as a graph. Furthermore, we compare results obtained from the tree graph to reference measurements of forest inventory parameters. The computation time of our method for topology representation is low and the method provides a reasonably accurate approximation of the 3D tree structure. Numéro de notice : A2012-181 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.14358/PERS.78.4.383 En ligne : https://doi.org/10.14358/PERS.78.4.383 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31628
in Photogrammetric Engineering & Remote Sensing, PERS > vol 78 n° 4 (April 2012) . - pp 383 - 392[article]Integrated point and edge matching on poor textural images constrained by self-adaptive triangulations / B. Wu in ISPRS Journal of photogrammetry and remote sensing, vol 68 (March 2012)
![]()
[article]
Titre : Integrated point and edge matching on poor textural images constrained by self-adaptive triangulations Type de document : Article/Communication Auteurs : B. Wu, Auteur ; Y. Zhang, Auteur ; Q. Zhu, Auteur Année de publication : 2012 Article en page(s) : pp 40 - 55 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] appariement d'images
[Termes IGN] détection de contours
[Termes IGN] point d'appui
[Termes IGN] reconstruction 3D
[Termes IGN] triangulation de DelaunayRésumé : (Auteur) This paper presents an innovative image matching method for reliable and dense image matching on poor textural images, which is the integrated point and edge matching based on the self-adaptive edge-constrained triangulations. Firstly, several seed points and seed edges are obtained on the stereo images, and they are used to construct a pair of initial edge-constrained triangulations on the images. Then, points and edges are matched based on the triangle constraint and other constraints. The newly matched points and edges are inserted into the triangulations and the constrained triangulations are updated dynamically along with the matching propagation. The final results will be the final edge-constrained triangulations generated from the successfully matched points and edges. Experiments using typical space-borne, airborne, and terrestrial images with poor textures revealed that the integrated point and edge matching method based on self-adaptive triangulations is able to produce dense and reliable matching results. Moreover, from the final matched points and edges, 3D points and edges preserving the physical boundaries of objects can be further derived based on photogrammetric techniques, which is ideal for further object modeling applications. Numéro de notice : A2012-146 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2011.12.005 En ligne : https://doi.org/10.1016/j.isprsjprs.2011.12.005 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31593
in ISPRS Journal of photogrammetry and remote sensing > vol 68 (March 2012) . - pp 40 - 55[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 081-2012021 SL Revue Centre de documentation Revues en salle Disponible Filtering and segmentation of polarimetric SAR data based on binary partition trees / A. Alonso-Gonzalez in IEEE Transactions on geoscience and remote sensing, vol 50 n° 2 (February 2012)
![]()
[article]
Titre : Filtering and segmentation of polarimetric SAR data based on binary partition trees Type de document : Article/Communication Auteurs : A. Alonso-Gonzalez, Auteur ; C. Lopez-Martinez, Auteur ; P. Salembier, Auteur Année de publication : 2012 Article en page(s) : pp 593 - 605 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image radar et applications
[Termes IGN] arbre-B
[Termes IGN] données polarimétriques
[Termes IGN] filtre de déchatoiement
[Termes IGN] polarimétrie radar
[Termes IGN] segmentation d'imageRésumé : (Auteur) In this paper, we propose the use of binary partition trees (BPT) to introduce a novel region-based and multi-scale polarimetric SAR (PolSAR) data representation. The BPT structure represents homogeneous regions in the data at different detail levels. The construction process of the BPT is based, firstly, on a region model able to represent the homogeneous areas, and, secondly, on a dissimilarity measure in order to identify similar areas and define the merging sequence. Depending on the final application, a BPT pruning strategy needs to be introduced. In this paper, we focus on the application of BPT PolSAR data representation for speckle noise filtering and data segmentation on the basis of the Gaussian hypothesis, where the average covariance or coherency matrices are considered as a region model. We introduce and quantitatively analyze different dissimilarity measures. In this case, and with the objective to be sensitive to the complete polarimetric information under the Gaussian hypothesis, dissimilarity measures considering the complete covariance or coherency matrices are employed. When confronted to PolSAR speckle filtering, two pruning strategies are detailed and evaluated. As presented, the BPT PolSAR speckle filter defined filters data according to the complete polarimetric information. As shown, this novel filtering approach is able to achieve very strong filtering while preserving the spatial resolution and the polarimetric information. Finally, the BPT representation structure is employed for high spatial resolution image segmentation applied to coastline detection. The analyses detailed in this work are based on simulated, as well as on real PolSAR data acquired by the ESAR system of DLR and the RADARSAT-2 system. Numéro de notice : A2012-048 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2011.2160647 Date de publication en ligne : 04/08/2011 En ligne : https://doi.org/10.1109/TGRS.2011.2160647 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31496
in IEEE Transactions on geoscience and remote sensing > vol 50 n° 2 (February 2012) . - pp 593 - 605[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 065-2012021 RAB Revue Centre de documentation En réserve L003 Disponible Généralisation du diagramme de Voronoï et placement de formes géométriques complexes dans un nuage de points / Thomas Iwaszko (2012)
PermalinkPermalinkPermalinkPermalinkNote de géométrie différentielle : application de la méthode du repère mobile à l’ellipsoïde de référence / Abdelmajid Ben Hadj Salem (2012)
PermalinkPIRVE, Programme Interdisciplinaire Ville et Environnement, programme 2010 et suites 2011-2012, Modélisation du développement urbain à travers le réseau des rues, construction d'une approche interdisciplinaire / Morphocity (2012)
PermalinkAutomatic roof model reconstruction from ALS data and 2D ground plans based on side projection and the TMR [TIN-Merging and Reshaping] algorithm / J. Rau in ISPRS Journal of photogrammetry and remote sensing, vol 66 n° 6 supplement (December 2011)
PermalinkModélisation des changements d’occupation et d’utilisation du sol: Cadres formels et exemple d’application / M. Theriault in Revue internationale de géomatique, vol 21 n° 3 (septembre - novembre 2011)
PermalinkPermalinkImproving web mapping with generalization / Julien Gaffuri in Cartographica, vol 46 n° 2 (June 2011)
Permalink