Descripteur
Documents disponibles dans cette catégorie (933)
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
Effectiveness of Natura 2000 network in Romanian Alpine Biogeographical Region: an assessment based on forest landscape connectivity / Mihaita Iulian Niculae in Annals of forest research, vol 60 n° 1 (January - June 2017)
[article]
Titre : Effectiveness of Natura 2000 network in Romanian Alpine Biogeographical Region: an assessment based on forest landscape connectivity Type de document : Article/Communication Auteurs : Mihaita Iulian Niculae, Auteur ; Sorin Avram, Auteur ; Gabriel Ovidiu Vanau, Auteur ; Maria Patroescu, Auteur Année de publication : 2017 Article en page(s) : pp 19 - 32 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] connexité (topologie)
[Termes IGN] corridor biologique
[Termes IGN] forêt tempérée
[Termes IGN] graphe
[Termes IGN] politique de conservation (biodiversité)
[Termes IGN] Roumanie
[Termes IGN] site Natura 2000
[Vedettes matières IGN] Ecologie forestièreRésumé : (auteur) Maintaining and increasing landscape connectivity, especially of forest landscapes, are some of the main concerns regarding biodiversity conservation. The connectivity of protected areas for different species represents an indicator for evaluating the effectiveness of the Natura 2000 network. Our research aims to evaluate the connectivity of forest landscapes in the Romanian Alpine Biogeographical Region (ABR) for various terrestrial species. We analysed the distribution of forest patches and Sites of Community Importance (SCI), as part of Natura 2000 network, in the Romanian ABR. We evaluated the connectivity of forest patches for terrestrial species with different dispersal distances, identifying those patches with significant contribution to maintain the forest landscape connectivity, through the graph theory approach. To quantify the importance of each node, we evaluated the dPCconnector fraction derived from the dPC index. Of the 125 SCIs in the Romanian ABR, 71 protected areas have over 1000 ha, four of them have more than 100,000 ha. The total protected surfaces cover ~35% of the Romanian ABR, and the forest surfaces, protected in SCIs, cover 26% of the total Romanian ABR. Regarding the connectivity scores, we found that the forest surfaces across the ABR are well connected (0.89 or 1 for different dispersal distances) in comparison with the Natura 2000 forest patches. The forest patches are well connected especially for the species with large dispersal distance in both cases (d = 25 km). For the species characterized by a small dispersion distance, the connectivity is lower (0.46) in the case of protected forests. Our results evidence that the connectivity objective of the forest surfaces protected through the Nature 2000 network is not totally achieved. Furthermore new protected areas are needed where the forest are still present for increasing landscape connectivity for species. Numéro de notice : A2017-610 Affiliation des auteurs : non IGN Thématique : BIODIVERSITE/FORET Nature : Article DOI : 10.15287/afr.2016.793 En ligne : http://doi.org/10.15287/afr.2016.793 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86918
in Annals of forest research > vol 60 n° 1 (January - June 2017) . - pp 19 - 32[article]The analysis and measurement of building patterns using texton co-occurrence matrices / Wenhao Yu in International journal of geographical information science IJGIS, vol 31 n° 5-6 (May-June 2017)
[article]
Titre : The analysis and measurement of building patterns using texton co-occurrence matrices Type de document : Article/Communication Auteurs : Wenhao Yu, Auteur ; Tinghua Ai, Auteur ; Pengcheng Liu, Auteur ; Xiaoqiang Cheng, Auteur Année de publication : 2017 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Photogrammétrie numérique
[Termes IGN] données vectorielles
[Termes IGN] matrice de co-occurrence
[Termes IGN] métrique
[Termes IGN] modèle géométrique du bâti
[Termes IGN] reconnaissance de formes
[Termes IGN] reconstruction 2D du bâti
[Termes IGN] tessellation
[Termes IGN] triangulation de Delaunay
[Termes IGN] voisinage (relation topologique)Résumé : (auteur) The representation and analysis of building patterns are critical for characterizing urban scenes and making decisions in urban planning. The evaluation of building patterns is a difficult spatial analysis problem that exhibits properties of symbolization, homogeneity and regularity. Open issues in this field include the development of approaches for representing building patterns and vector-based methods for computing various pattern metrics. In the image analysis domain, there are many methods for pattern recognition (e.g., texture analysis), but there are few corresponding solutions for vector data. The aim of this research is to develop several building pattern metrics and offer a texton co-occurrence matrix (TCM)-based method to quantitatively evaluate the features of building patterns. The procedure first constructs a spatial field based on a Delaunay triangulation skeleton to partition a set of buildings into a set of tessellation cells. The tessellations of building clusters have a similar structure as image representations, in that each cell corresponds to an image pixel. We then use the texton analysis to establish a matrix to describe the tessellation structure, including the neighboring relationships and individual attribute information. Finally, a set of feature descriptors is obtained from the TCM to capture the texture-related information of building groups. Through experiments on building pattern analysis and spatial queries, we show that the results of TCM-based evaluation of building patterns are consistent with those of human cognition. Numéro de notice : A2017-242 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2016.1265121 En ligne : http://dx.doi.org/10.1080/13658816.2016.1265121 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85178
in International journal of geographical information science IJGIS > vol 31 n° 5-6 (May-June 2017)[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2017031 RAB Revue Centre de documentation En réserve L003 Disponible Approximation algorithms for visibility computation and testing over a terrain / Sharareh Alipour in Applied geomatics, vol 9 n° 1 (March 2017)
[article]
Titre : Approximation algorithms for visibility computation and testing over a terrain Type de document : Article/Communication Auteurs : Sharareh Alipour, Auteur ; Mohammad Ghodsi, Auteur ; Uğur Güdükbay, Auteur ; Morteza Golkari, Auteur Année de publication : 2017 Article en page(s) : pp 53 - 59 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] approximation
[Termes IGN] données localisées 2,5D
[Termes IGN] modèle numérique de terrain
[Termes IGN] Triangulated Irregular Network
[Termes IGN] visibilitéRésumé : (auteur) Given a 2.5D terrain and a query point p on or above it, we want to find the triangles of terrain that are visible from p. We present an approximation algorithm to solve this problem. We implement the algorithm and test it on real data sets. The experimental results show that our approximate solution is very close to the exact solution and compared to the other similar works, the computational cost of our algorithm is lower. We analyze the computational complexity of the algorithm. We consider the visibility testing problem where the goal is to test whether a given triangle of the terrain is visible or not with respect to p. We present an algorithm for this problem and show that the average running time of this algorithm is the same as the running time of the case where we want to test the visibility between two query points p and q. We also propose a randomized algorithm for providing an estimate of the portion of the visible region of a terrain for a query point. Numéro de notice : A2017-358 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s12518-016-0180-9 Date de publication en ligne : 06/01/2017 En ligne : https://doi.org/10.1007/s12518-016-0180-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85766
in Applied geomatics > vol 9 n° 1 (March 2017) . - pp 53 - 59[article]Efficient edge-aware surface mesh reconstruction for urban scenes / András Bódis-Szomorú in Computer Vision and image understanding, vol 157 (April 2017)
[article]
Titre : Efficient edge-aware surface mesh reconstruction for urban scenes Type de document : Article/Communication Auteurs : András Bódis-Szomorú, Auteur ; Hayko Riemenschneider, Auteur ; Luc Van Gool, Auteur Année de publication : 2017 Article en page(s) : pp 3 - 24 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques
[Termes IGN] carte de profondeur
[Termes IGN] données clairsemées
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] maillage par triangles
[Termes IGN] modèle 3D de l'espace urbain
[Termes IGN] modèle numérique de surface
[Termes IGN] reconstruction d'objet
[Termes IGN] scène urbaine
[Termes IGN] segmentation d'image
[Termes IGN] structure-from-motion
[Termes IGN] triangulation de DelaunayRésumé : (auteur) We propose an efficient approach for building compact, edge-preserving, view-centric triangle meshes from either dense or sparse depth data, with a focus on modeling architecture in large-scale urban scenes. Our method constructs a 2D base mesh from a preliminary view partitioning, then lifts the base mesh into 3D in a fast vertex depth optimization. Different view partitioning schemes are proposed for imagery and dense depth maps. They guarantee that mesh edges are aligned with crease edges and discontinuities. In particular, we introduce an effective plane merging procedure with a global error guarantee in order to maximally compact the resulting models. Moreover, different strategies for detecting and handling discontinuities are presented. We demonstrate that our approach provides an excellent trade-off between quality and compactness, and is eligible for fast production of polyhedral building models from large-scale urban height maps, as well as, for direct meshing of sparse street-side Structure-from-Motion (SfM) data. Numéro de notice : a2017-431 Affiliation des auteurs : non IGN Thématique : IMAGERIE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.cviu.2016.06.002 En ligne : https://doi.org/10.1016/j.cviu.2016.06.002 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86332
in Computer Vision and image understanding > vol 157 (April 2017) . - pp 3 - 24[article]A spatial anomaly points and regions detection method using multi-constrained graphs and local density / Yan Shi in Transactions in GIS, vol 21 n° 2 (April 2017)
[article]
Titre : A spatial anomaly points and regions detection method using multi-constrained graphs and local density Type de document : Article/Communication Auteurs : Yan Shi, Auteur ; Min Deng, Auteur ; Xuexi Yang, Auteur ; Qiliang Liu, Auteur Année de publication : 2017 Article en page(s) : pp 376 – 405 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] analyse de données
[Termes IGN] analyse spatiale
[Termes IGN] attribut sémantique
[Termes IGN] cartographie statistique
[Termes IGN] détection d'anomalie
[Termes IGN] graphe
[Termes IGN] interpolation spatiale
[Termes IGN] programmation par contraintes
[Termes IGN] triangulation de DelaunayRésumé : (auteur) Spatial anomalies may be single points or small regions whose non-spatial attribute values are significantly inconsistent with those of their spatial neighborhoods. In this article, a Spatial Anomaly Points and Regions Detection method using multi-constrained graphs and local density (SAPRD for short) is proposed. The SAPRD algorithm first models spatial proximity relationships between spatial entities by constructing a Delaunay triangulation, the edges of which provide certain statistical characteristics. By considering the difference in non-spatial attributes of adjacent spatial entities, two levels of non-spatial attribute distance constraints are imposed to improve the proximity graph. This produces a series of sub-graphs, and those with very few entities are identified as candidate spatial anomalies. Moreover, the spatial anomaly degree of each entity is calculated based on the local density. A spatial interpolation surface of the spatial anomaly degree is generated using the inverse distance weight, and this is utilized to reveal potential spatial anomalies and reflect their whole areal distribution. Experiments on both simulated and real-life spatial databases demonstrate the effectiveness and practicability of the SAPRD algorithm. Numéro de notice : A2017-167 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12208 En ligne : http://dx.doi.org/10.1111/tgis.12208 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=84701
in Transactions in GIS > vol 21 n° 2 (April 2017) . - pp 376 – 405[article]Geodesic equations and their numerical solutions in geodetic and cartesian coordinates on an oblate spheroid / Georgios Panou in Journal of geodetic science, vol 7 n° 1 (February 2017)PermalinkDonnées 3D et SIG en open source / Anonyme in Géomatique expert, n° 114 (janvier - février 2017)PermalinkEtude et méthodes d'intégration et d'interaction de données 3D complexes type "nuages de points" vers un web SIG / Victor Lambert (2017)PermalinkFusion of graph embedding and sparse representation for feature extraction and classification of hyperspectral imagery / Fulin Luo in Photogrammetric Engineering & Remote Sensing, PERS, vol 83 n° 1 (January 2017)PermalinkHigh-quality seamless DEM generation blending SRTM-1, ASTER GDEM v2 and ICESat/GLAS observations / Linwei Yue in ISPRS Journal of photogrammetry and remote sensing, vol 123 (January 2017)PermalinkPermalinkA taxonomy and survey of dynamic graph visualization / Fabian Beck in Computer graphics forum, vol 36 n° 1 (January 2017)PermalinkTélédétection pour l'observation des surfaces continentales, ch. 7. Modèles numériques de terrain à partir de données lidar aéroportées / Clément Mallet (2017)PermalinkExtracting building patterns with multilevel graph partition and building grouping / Shihong Du in ISPRS Journal of photogrammetry and remote sensing, vol 122 (December 2016)PermalinkmR-V: Line simplification through mnemonic rasterization / Emmanuel Stefanakis in Geomatica, vol 70 n° 4 (December 2016)Permalink