Descripteur
Documents disponibles dans cette catégorie (1059)
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
«Blockchain» et géomatique / Anonyme in Géomatique expert, n° 122 (mai-juin 2018)
[article]
Titre : «Blockchain» et géomatique Type de document : Article/Communication Auteurs : Anonyme, Auteur Année de publication : 2018 Article en page(s) : pp 42 - 47 Langues : Français (fre) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] base de données répartie
[Termes IGN] blockchain
[Termes IGN] cryptage
[Termes IGN] cryptographie
[Termes IGN] Infrastructure à clé publiqueRésumé : (éditeur) La « blockchain » désigne cette technologie, mystérieuse pour la plupart, qui sous-tend et permet au sulfureux « Bitcoin » de fonctionner. Mais voilà que dernièrement, certains experts ont évoqué le nom « blockchain » comme utilisable dans le contexte de l’information géographique. Alors, de quoi s’agit-il exactement, et comment pourrait-on s’en servir ? Numéro de notice : A2018-265 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90323
in Géomatique expert > n° 122 (mai-juin 2018) . - pp 42 - 47[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité IFN-001-P002060 PER Revue Nogent-sur-Vernisson Salle périodiques Exclu du prêt Combined geo-social search : computing top-k join queries over incomplete information / Yaron Kanza in Geoinformatica, vol 22 n° 3 (July 2018)
[article]
Titre : Combined geo-social search : computing top-k join queries over incomplete information Type de document : Article/Communication Auteurs : Yaron Kanza, Auteur ; Mirit Shalem, Auteur Année de publication : 2018 Article en page(s) : pp 615 - 660 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] approximation
[Termes IGN] données localisées
[Termes IGN] jointure
[Termes IGN] requête spatiale
[Termes IGN] réseau socialRésumé : (Auteur) Geo-social data sets, which fuse the social and the geospatial facets of data, are vibrant data sources that associate people and activities with locations. In a combined geo-social search, several search queries are posed over geospatial and social data sources, or over data sources with both geospatial and social facets; and the search results, provided as ranked lists of items, are integrated by associating matching items, yielding combinations. Each combination has a score which is a function of the scores of the items it comprises, and the goal is to compute the k combinations with the highest score, that is, the top-k combinations. However, since geo-social data sources are heterogeneous, data items may not have matching items in all the ranked lists. Such items cannot be included in complete combinations. Hence, we study the approach where combinations are padded by nulls for missing items, as in outer-join. A combination is maximal if it cannot be extended by replacing a null by an item. We show that if some of the top-k maximal combinations contain null values, the computation requires reading entire lists, and hence, traditional top-k algorithms and optimization techniques are not as effective as in the case of an ordinary top-k join. Thus, we present two novel algorithms for computing the top-k maximal combinations. One novel algorithm is instance optimal over the class of algorithms that compute a ??approximation to the answer. The second algorithm is more efficient than the modification of two common top-k algorithms to compute maximal combinations. We show this analytically, and experimentally over real and synthetic data. Numéro de notice : A2018-370 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-017-0297-y Date de publication en ligne : 25/03/2017 En ligne : https://doi.org/10.1007/s10707-017-0297-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90762
in Geoinformatica > vol 22 n° 3 (July 2018) . - pp 615 - 660[article]A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks / Shaohua Wang in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)
[article]
Titre : A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks Type de document : Article/Communication Auteurs : Shaohua Wang, Auteur ; Song Gao, Auteur ; Xin Feng, Auteur ; Alan T. Murray, Auteur ; Yuan Zeng Année de publication : 2018 Article en page(s) : pp 1368 - 1390 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG
[Termes IGN] arbre-R
[Termes IGN] chaîne de traitement
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] démonstration de faisabilité
[Termes IGN] méthode heuristique
[Termes IGN] objet mobile
[Termes IGN] optimisation (mathématiques)
[Termes IGN] position
[Termes IGN] prise en compte du contexte
[Termes IGN] réseau routierRésumé : (Editeur) Given different types of constraints on human life, people must make decisions that satisfy social activity needs. Minimizing costs (i.e. distance, time, or money) associated with travel plays an important role in perceived and realized social quality of life. Identifying optimal interaction locations on road networks when there are multiple moving objects (MMO) with space–time constraints remains a challenge. In this research, we formalize the problem of finding dynamic ideal interaction locations for MMO as a spatial optimization model and introduce a context-based geoprocessing heuristic framework to address this problem. As a proof of concept, a case study involving identification of a meetup location for multiple people under traffic conditions is used to validate the proposed geoprocessing framework. Five heuristic methods with regard to efficient shortest-path search space have been tested. We find that the R* tree-based algorithm performs the best with high quality solutions and low computation time. This framework is implemented in a geographic information systems environment to facilitate integration with external geographic contextual information, e.g. temporary road barriers, points of interest, and real-time traffic information, when dynamically searching for ideal meetup sites. The proposed method can be applied in trip planning, carpooling services, collaborative interaction, and logistics management. Numéro de notice : A2018-278 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658816.2018.1431838 En ligne : https://doi.org/10.1080/13658816.2018.1431838 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90360
in International journal of geographical information science IJGIS > vol 32 n° 7-8 (July - August 2018) . - pp 1368 - 1390[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2018041 RAB Revue Centre de documentation En réserve L003 Disponible Label propagation with ensemble of pairwise geometric relations : towards robust large-scale retrieval of object instances / Xiaomeng Wu in International journal of computer vision, vol 126 n° 7 (July 2018)
[article]
Titre : Label propagation with ensemble of pairwise geometric relations : towards robust large-scale retrieval of object instances Type de document : Article/Communication Auteurs : Xiaomeng Wu, Auteur ; Kaoru Hiramatsu, Auteur ; Kunio Kashino, Auteur Année de publication : 2018 Article en page(s) : pp 689 - 713 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] étiquette
[Termes IGN] instance
[Termes IGN] méthode robuste
[Termes IGN] recherche d'image basée sur le contenu
[Termes IGN] relation spatialeRésumé : (Auteur) Spatial verification methods permit geometrically stable image matching, but still involve a difficult trade-off between robustness as regards incorrect rejection of true correspondences and discriminative power in terms of mismatches. To address this issue, we ask whether an ensemble of weak geometric constraints that correlates with visual similarity only slightly better than a bag-of-visual-words model performs better than a single strong constraint. We consider a family of spatial verification methods and decompose them into fundamental constraints imposed on pairs of feature correspondences. Encompassing such constraints leads us to propose a new method, which takes the best of existing techniques and functions as a unified Ensemble of pAirwise GEometric Relations (EAGER), in terms of both spatial contexts and between-image transformations. We also introduce a novel and robust reranking method, in which the object instances localized by EAGER in high-ranked database images are reissued as new queries. EAGER is extended to develop a smoothness constraint where the similarity between the optimized ranking scores of two instances should be maximally consistent with their geometrically constrained similarity. Reranking is newly formulated as two label propagation problems: one is to assess the confidence of new queries and the other to aggregate new independently executed retrievals. Extensive experiments conducted on four datasets show that EAGER and our reranking method outperform most of their state-of-the-art counterparts, especially when large-scale visual vocabularies are used. Numéro de notice : A2018-411 Affiliation des auteurs : non IGN Thématique : IMAGERIE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s11263-018-1063-9 Date de publication en ligne : 31/01/2018 En ligne : https://doi.org/10.1007/s11263-018-1063-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90886
in International journal of computer vision > vol 126 n° 7 (July 2018) . - pp 689 - 713[article]Using interactions and dynamics for mining groups of moving objects from trajectory data / Corrado Loglisci in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)
[article]
Titre : Using interactions and dynamics for mining groups of moving objects from trajectory data Type de document : Article/Communication Auteurs : Corrado Loglisci, Auteur Année de publication : 2018 Article en page(s) : pp 1436 - 1468 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] analyse de groupement
[Termes IGN] analyse spatio-temporelle
[Termes IGN] données spatiotemporelles
[Termes IGN] objet mobile
[Termes IGN] similitude
[Termes IGN] trajectoire (véhicule non spatial)
[Vedettes matières IGN] GéovisualisationRésumé : (auteur) Advances in tracking technology enable the gathering of spatio-temporal data in the form of trajectories, which when analysed can convey useful knowledge. In particular, discovering groups of moving objects is a valuable means for a wide class of problems related to mobility. The task of group mining has been investigated by considering mostly the spatial closeness and similarity of the trajectories, while little attention has been paid to the relationships between the trajectories and time-changing nature of the trajectories. The relationships may provide evidence of interactions between the moving objects. The time-changing nature may provide evidence of dynamics of the movements. Therefore, interactions and dynamics can be sources of information to be considered in order to discover new forms of groups. Motivated by this, we introduce the concept of crews and propose a method to discover crews. A crew gathers moving objects with similar interactions and similar dynamics. The proposed method relies on i) new movement parameters, which explicitly consider interactions and dynamics, and ii) a distance-free clustering algorithm, which groups objects based on the similarity of the movement parameters. We conduct extensive experiments, which include a quantitative evaluation of the quality of the crews and comparison with alternative solutions. Numéro de notice : A2018-280 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658816.2017.1416473 Date de publication en ligne : 21/12/2017 En ligne : https://doi.org/10.1080/13658816.2017.1416473 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90362
in International journal of geographical information science IJGIS > vol 32 n° 7-8 (July - August 2018) . - pp 1436 - 1468[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2018041 RAB Revue Centre de documentation En réserve L003 Disponible GIS Coop: networks of silvicultural trials for supporting forest management under changing environment / Ingrid Seynave in Annals of Forest Science, vol 75 n° 2 (June 2018)PermalinkRange-image: Incorporating sensor topology for lidar point cloud processing / Pierre Biasutti in Photogrammetric Engineering & Remote Sensing, PERS, vol 84 n° 6 (juin 2018)PermalinkThe map as knowledge base / Dalia E. Varanka in International journal of cartography, vol 4 n° 2 (June 2018)PermalinkWithin- and between-tree variation of wood density components in Pinus nigra at six sites in Portugal / Alexandra Dias in Annals of Forest Science, vol 75 n° 2 (June 2018)PermalinkAttribute trajectory analysis : a framework to analyse attribute changes using trajectory analysis techniques / Long Zhang in International journal of geographical information science IJGIS, vol 32 n° 5-6 (May - June 2018)PermalinkAggregate keyword nearest neighbor queries on road networks / Pengfei Zhang in Geoinformatica, vol 22 n° 2 (April 2018)PermalinkClassification of topological relations between spatial objects in two‐dimensional space within the dimensionally extended 9‐intersection model / Jingwei Shen in Transactions in GIS, vol 22 n° 2 (April 2018)PermalinkA spatio-temporal scenario model for emergency decision / Cheng Liu in Geoinformatica, vol 22 n° 2 (April 2018)PermalinkAnalyse de l'incertitude et de la précision thématique de classifications GEOBIA d'une image WorldView-2 / François Messner in Revue Française de Photogrammétrie et de Télédétection, n° 216 (février 2018)PermalinkImproving the upscaling of land cover maps by fusing uncertainty and spatial structure information / Peijun Sun in Photogrammetric Engineering & Remote Sensing, PERS, vol 84 n° 2 (February 2018)Permalink