Descripteur
Termes IGN > mathématiques > analyse mathématique > topologie > théorie des graphes
théorie des graphes |
Documents disponibles dans cette catégorie (528)
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
Hub Labels on the database for large-scale graphs with the COLD framework / Alexandros Efentakis in Geoinformatica, vol 21 n° 4 (October - December 2017)
[article]
Titre : Hub Labels on the database for large-scale graphs with the COLD framework Type de document : Article/Communication Auteurs : Alexandros Efentakis, Auteur ; Christodoulos Efstathiades, Auteur ; Dieter Pfoser, Auteur Année de publication : 2017 Article en page(s) : pp 703 - 732 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] base de données localisées
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] compression de données
[Termes IGN] graphe
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] SQLRésumé : (Auteur) Shortest-path computation on graphs is one of the most well-studied problems in algorithmic theory. An aspect that has only recently attracted attention is the use of databases in combination with graph algorithms, so-called distance oracles, to compute shortest-path queries on large graphs. To this purpose, we propose a novel, efficient, pure-SQL framework for answering exact distance queries on large-scale graphs, implemented entirely on an open-source database engine. Our COLD framework (COmpressed Labels on the Database) can answer multiple distance queries (vertex-to-vertex, one-to-many, k-Nearest Neighbors, Reverse k-Nearest Neighbors, Reverse k-Farthest Neighbors and Top-k Range) not handled by previous methods, rendering it a complete database solution for a variety of practical large-scale graph applications. Our experimentation shows that COLD outperforms existing approaches (including popular graph databases) in terms of query time and efficiency, while requiring significantly less storage space than these methods. Numéro de notice : A2017-601 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-016-0287-5 En ligne : https://doi.org/10.1007/s10707-016-0287-5 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86909
in Geoinformatica > vol 21 n° 4 (October - December 2017) . - pp 703 - 732[article]A graph-based approach to detect spatiotemporal dynamics in satellite image time series / Fabio Guttler in ISPRS Journal of photogrammetry and remote sensing, vol 130 (August 2017)
[article]
Titre : A graph-based approach to detect spatiotemporal dynamics in satellite image time series Type de document : Article/Communication Auteurs : Fabio Guttler, Auteur ; Dino Ienco, Auteur ; Jordi Nin, Auteur ; et al., Auteur Année de publication : 2017 Article en page(s) : pp 92 - 107 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] agriculture
[Termes IGN] analyse d'image orientée objet
[Termes IGN] dynamique spatiale
[Termes IGN] extraction automatique
[Termes IGN] France (administrative)
[Termes IGN] graphe
[Termes IGN] image Landsat
[Termes IGN] série temporelleRésumé : (Auteur) Enhancing the frequency of satellite acquisitions represents a key issue for Earth Observation community nowadays. Repeated observations are crucial for monitoring purposes, particularly when intra-annual process should be taken into account. Time series of images constitute a valuable source of information in these cases. The goal of this paper is to propose a new methodological framework to automatically detect and extract spatiotemporal information from satellite image time series (SITS). Existing methods dealing with such kind of data are usually classification-oriented and cannot provide information about evolutions and temporal behaviors. In this paper we propose a graph-based strategy that combines object-based image analysis (OBIA) with data mining techniques. Image objects computed at each individual timestamp are connected across the time series and generates a set of evolution graphs. Each evolution graph is associated to a particular area within the study site and stores information about its temporal evolution. Such information can be deeply explored at the evolution graph scale or used to compare the graphs and supply a general picture at the study site scale. We validated our framework on two study sites located in the South of France and involving different types of natural, semi-natural and agricultural areas. The results obtained from a Landsat SITS support the quality of the methodological approach and illustrate how the framework can be employed to extract and characterize spatiotemporal dynamics. Numéro de notice : A2017-511 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2017.05.013 En ligne : https://doi.org/10.1016/j.isprsjprs.2017.05.013 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86457
in ISPRS Journal of photogrammetry and remote sensing > vol 130 (August 2017) . - pp 92 - 107[article]Réservation
Réserver ce documentExemplaires(3)
Code-barres Cote Support Localisation Section Disponibilité 081-2017081 RAB Revue Centre de documentation En réserve L003 Disponible 081-2017083 DEP-EXM Revue LASTIG Dépôt en unité Exclu du prêt 081-2017082 DEP-EAF Revue Nancy Dépôt en unité Exclu du prêt Multi-view performance capture of surface details / Nadia Robertini in International journal of computer vision, vol 124 n° 1 (August 2017)
[article]
Titre : Multi-view performance capture of surface details Type de document : Article/Communication Auteurs : Nadia Robertini, Auteur ; Dan Casas, Auteur ; Edilson De Aguiar, Auteur ; Christian Theobalt, Auteur Année de publication : 2017 Article en page(s) : pp 96 – 113 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] courbe de Gauss
[Termes IGN] échelle d'intensité
[Termes IGN] image numérique
[Termes IGN] image vidéo
[Termes IGN] maille triangulaire
[Termes IGN] modèle de déformation des images
[Termes IGN] niveau de détail
[Termes IGN] noeud
[Termes IGN] optimisation (mathématiques)
[Termes IGN] reconstruction d'objetRésumé : (auteur) This paper presents a novel approach to recover true fine surface detail of deforming meshes reconstructed from multi-view video. Template-based methods for performance capture usually produce a coarse-to-medium scale detail 4D surface reconstruction which does not contain the real high-frequency geometric detail present in the original video footage. Fine scale deformation is often incorporated in a second pass by using stereo constraints, features, or shading-based refinement. In this paper, we propose an alternative solution to this second stage by formulating dense dynamic surface reconstruction as a global optimization problem of the densely deforming surface. Our main contribution is an implicit representation of a deformable mesh that uses a set of Gaussian functions on the surface to represent the initial coarse mesh, and a set of Gaussians for the images to represent the original captured multi-view images. We effectively find the fine scale deformations for all mesh vertices, which maximize photo-temporal-consistency, by densely optimizing our model-to-image consistency energy on all vertex positions. Our formulation yields a smooth closed form energy with implicit occlusion handling and analytic derivatives. Furthermore, it does not require error-prone correspondence finding or discrete sampling of surface displacement values. We demonstrate our approach on a variety of datasets of human subjects wearing loose clothing and performing different motions. We qualitatively and quantitatively demonstrate that our technique successfully reproduces finer detail than the input baseline geometry. Numéro de notice : A2017-401 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.1007%2Fs11263-016-0979-1 En ligne : https://doi.org/10.1007/s11263-016-0979-1 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85943
in International journal of computer vision > vol 124 n° 1 (August 2017) . - pp 96 – 113[article]
[article]
Titre : On visibility and empty-region graphs Type de document : Article/Communication Auteurs : Sagi Katz, Auteur ; Ayellet Tal, Auteur Année de publication : 2017 Article en page(s) : pp 45 - 52 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] graphe
[Termes IGN] semis de points
[Termes IGN] traitement de données localisées
[Termes IGN] triangulation de Delaunay
[Termes IGN] visibilitéRésumé : (auteur) Empty-region graphs are well-studied in Computer Graphics, Geometric Modeling, Computational Geometry, as well as in Robotics and Computer Vision. The vertices of these graphs are points in space, and two vertices are connected by an arc if there exists an empty region of a certain shape and size between them. In most of the graphs discussed in the literature, the empty region is assumed to be a circle or the union/intersection of circles. In this paper we propose a new type of empty-region graphs—the γ-visibility graph. This graph can accommodate a variety of shapes of empty regions and may be defined in any dimension. Interestingly, we will show that commonly-used shapes are a special case of our graph. In this sense, our graph generalizes some empty-region graphs. Though this paper is mostly theoretical, it may have practical implication—the numerous applications that make use of empty-region graphs would be able to select the best shape that suits the problem at hand. Numéro de notice : A2017-564 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.cag.2017.05.007 En ligne : https://doi.org/10.1016/j.cag.2017.05.007 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86646
in Computers and graphics > vol 66 (August 2017) . - pp 45 - 52[article]Constrained Palette-Space Exploration / Nicolas Mellado in ACM Transactions on Graphics, TOG, Vol 36 n° 4 (July 2017)
[article]
Titre : Constrained Palette-Space Exploration Type de document : Article/Communication Auteurs : Nicolas Mellado, Auteur ; David Vanderhaeghe, Auteur ; Charlotte Hoarau , Auteur ; Sidonie Christophe , Auteur ; Mathieu Brédif , Auteur ; Loïc Barthe, Auteur Année de publication : 2017 Projets : 1-Pas de projet / Conférence : SIGGRAPH 2017, ACM conference 30/07/2017 03/08/2017 Los Angeles Californie - Etats-Unis Article en page(s) : 14 p. Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] cartologie
[Termes IGN] chromatopsie
[Termes IGN] graphe
[Termes IGN] interpolation
[Termes IGN] palette de couleurs
[Termes IGN] personne malvoyante
[Termes IGN] programmation par contraintes
[Vedettes matières IGN] GéovisualisationRésumé : (Auteur) Color palettes are widely used by artists to define colors of artworks and explore color designs. In general, artists select the colors of a palette by following a set of rules, e.g. contrast or relative luminance. Existing interactive palette exploration tools explore palette spaces following limited constraints defined as geometric configurations in color space e.g. harmony rules on the color wheel. Palette search algorithms sample palettes from color relations learned from an input dataset, however they cannot provide interactive user edits and palette refinement. We introduce in this work a new versatile formulation enabling the creation of constraint-based interactive palette exploration systems. Our technical contribution is a graph-based palette representation, from which we define palette exploration as a minimization problem that can be solved efficiently and provide real-time feedback. Based on our formulation, we introduce two interactive palette exploration strategies: constrained palette exploration, and for the first time, constrained palette interpolation. We demonstrate the performances of our approach on various application cases and evaluate how it helps users finding trade-offs between concurrent constraints. Numéro de notice : A2017-404 Affiliation des auteurs : LASTIG COGIT+Ext (2012-2019) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1145/3072959.3073650 Date de publication en ligne : 20/07/2017 En ligne : https://doi.org/10.1145/3072959.3073650 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86220
in ACM Transactions on Graphics, TOG > Vol 36 n° 4 (July 2017) . - 14 p.[article]Documents numériques
peut être téléchargé
A2017-404_Constrained Palette-Space ExplorationAdobe Acrobat PDF Graph mapping: Multi-scale community visualization of massive graph data / David Jonker in Information visualization, vol 16 n° 3 (July 2017)PermalinkPopularity-aware collective keyword queries in road networks / Sen Zhao in Geoinformatica, vol 21 n° 3 (July - September 2017)PermalinkEffectiveness 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)PermalinkA 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)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)PermalinkPermalinkA taxonomy and survey of dynamic graph visualization / Fabian Beck in Computer graphics forum, vol 36 n° 1 (January 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)PermalinkThe D-FCM partitioned D-BSP tree for massive point cloud data access and rendering / Yi Zhang in ISPRS Journal of photogrammetry and remote sensing, vol 120 (october 2016)PermalinkA Topology-inferred graph-based heuristic algorithm for map simplification / QiuLei Guo in Transactions in GIS, vol 20 n° 5 (October 2016)PermalinkLocation K-anonymity in indoor spaces / Joon-Seok Kim in Geoinformatica, vol 20 n° 3 (July - September 2016)PermalinkSparse and low-rank graph for discriminant analysis of hyperspectral imagery / Wei Li in IEEE Transactions on geoscience and remote sensing, vol 54 n° 7 (July 2016)PermalinkComment concevoir des continuités écologiques en milieu urbain ? / Eugénie Schwoertzig in Sciences, eaux & territoires, article hors série n° 26 (hors-série 2016)PermalinkLeveraging efficient indexing schema to support multigraph query answering / Vijay Ingalalli in Ingénierie des systèmes d'information, ISI : Revue des sciences et technologies de l'information, RSTI, vol 21 n° 3 (mai - juin 2016)PermalinkReconstruction 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)PermalinkStorm event representation and analysis based on a directed spatiotemporal graph model / W. Liu in International journal of geographical information science IJGIS, vol 30 n° 5-6 (May - June 2016)PermalinkChange detection between SAR images using a pointwise approach and graph theory / Minh-Tan Pham in IEEE Transactions on geoscience and remote sensing, vol 54 n° 4 (April 2016)PermalinkA framework for intelligence analysis using spatio-temporal storytelling / Raimundo F. Dos Santos Jr. in Geoinformatica, vol 20 n° 2 (April - June 2016)PermalinkClassified and clustered data constellation: An efficient approach of 3D urban data management / Suhaibah Azri in ISPRS Journal of photogrammetry and remote sensing, vol 113 (March 2016)PermalinkMulti-agent based path planning for first responders among moving obstacles / Zhiyong Wang in Computers, Environment and Urban Systems, vol 56 (March 2016)PermalinkMulti-criteria, graph-based road centerline vectorization using ordered weighted averaging operators / Fateme Ameri in Photogrammetric Engineering & Remote Sensing, PERS, vol 82 n° 2 (February 2016)PermalinkPermalinkConception d'algorithmes / Patrick Bosc (2016)PermalinkPermalinkPointwise approach for texture analysis and characterization from very high resolution remote sensing images / Minh-Tan Pham (2016)PermalinkDes Systèmes d’Information Géographiques à une Information Spatiale Sémantisée. Focus sur la topologie des vecteurs / Nathalie Abadie (2016)PermalinkA wildlife movement approach to optimally locate wildlife crossing structures / Rebecca W. Loraamm in International journal of geographical information science IJGIS, vol 30 n° 1-2 (January - February 2016)PermalinkA hybrid link-node approach for finding shortest paths in road networks with turn restrictions / Qingquan Li in Transactions in GIS, vol 19 n° 6 (December 2015)PermalinkGeneration of navigation graphs for indoor space / L. Yang in International journal of geographical information science IJGIS, vol 29 n° 10 (October 2015)PermalinkMorphing linear features based on their entire structures / Min Deng in Transactions in GIS, vol 19 n° 5 (October 2015)PermalinkPolygonal clustering analysis using multilevel graph-partition / Wanyi Wang in Transactions in GIS, vol 19 n° 5 (October 2015)PermalinkStreet environment change detection from mobile laser scanning point clouds / Wen Xiao in ISPRS Journal of photogrammetry and remote sensing, vol 107 (September 2015)PermalinkDétection à haute résolution spatiale de la desserte forestière en milieu montagneux / António Ferraz in Revue Française de Photogrammétrie et de Télédétection, n° 211 - 212 (juillet - décembre 2015)PermalinkQuerying visible points in large obstructed space / Jianqiu Xu in Geoinformatica, vol 19 n° 3 (July - September 2015)PermalinkThe TM-RTree: an index on generic moving objects for range queries / Jianqiu Xu in Geoinformatica, vol 19 n° 3 (July - September 2015)PermalinkA graph-based segmentation algorithm for tree crown extraction using airborne LiDAR data / Victor F. Strimbu in ISPRS Journal of photogrammetry and remote sensing, vol 104 (June 2015)PermalinkA structural-lexical measure of semantic similarity for geo-knowledge graphs / Andrea Ballatore in ISPRS International journal of geo-information, vol 4 n°2 (June 2015)PermalinkPattern-mining approach for conflating crowdsourcing road networks with POIs / Bisheng Yang in International journal of geographical information science IJGIS, vol 29 n° 5 (May 2015)PermalinkA dilution-matching-encoding compaction of trajectories over road networks / Ranit Gotsman in Geoinformatica, vol 19 n° 2 (April - June 2015)PermalinkGMOBench: Benchmarking generic moving objects / Jianqiu Xu in Geoinformatica, vol 19 n° 2 (April - June 2015)PermalinkThematic signatures for cleansing and enriching place-related linked data / Benjamin Adams in International journal of geographical information science IJGIS, vol 29 n° 4 (April 2015)PermalinkFlexible building primitives for 3D building modeling / B. Xiong in ISPRS Journal of photogrammetry and remote sensing, vol 101 (March 2015)PermalinkAn aggregated graph to qualify historical spatial networks using temporal patterns detection / Benoit Costes (2015)Permalink