Geoinformatica . vol 12 n° 4Paru le : 01/12/2008 ISBN/ISSN/EAN : 1384-6175 |
[n° ou bulletin]
[n° ou bulletin]
|
Exemplaires(1)
Code-barres | Cote | Support | Localisation | Section | Disponibilité |
---|---|---|---|---|---|
057-08041 | RAB | Revue | Centre de documentation | En réserve L003 | Disponible |
Dépouillements
Ajouter le résultat dans votre panierProcessing optimal sequenced route queries using Voronoi diagrams / M. Sharifzadeh in Geoinformatica, vol 12 n° 4 (December 2008)
[article]
Titre : Processing optimal sequenced route queries using Voronoi diagrams Type de document : Article/Communication Auteurs : M. Sharifzadeh, Auteur ; C. Shahabi, Auteur Année de publication : 2008 Article en page(s) : pp 411 - 433 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] calcul d'itinéraire
[Termes IGN] diagramme de Voronoï
[Termes IGN] espace métrique
[Termes IGN] recherche du chemin optimal, algorithme de
[Termes IGN] requête spatialeRésumé : (Auteur) The Optimal Sequenced Route (OSR) query strives to find a route of minimum length starting from a given source location and passing through a number of typed locations in a specific sequence imposed on the types of the locations. In this paper, we propose a pre-computation approach to OSR query in both vector and metric spaces. We exploit the geometric properties of the solution space and theoretically prove its relation to additively weighted Voronoi diagrams. Our approach recursively accesses these diagrams to incrementally build the OSR. Introducing the analogous diagrams for the space of road networks, we show that our approach is also efficiently applicable to this metric space. Our experimental results verify that our pre-computation approach outperforms the previous index-based approaches in terms of query response time. Copyright Springer Numéro de notice : A2008-377 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-007-0034-z En ligne : https://doi.org/10.1007/s10707-007-0034-z Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29370
in Geoinformatica > vol 12 n° 4 (December 2008) . - pp 411 - 433[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-08041 RAB Revue Centre de documentation En réserve L003 Disponible Matching networks with different levels of detail / Sébastien Mustière in Geoinformatica, vol 12 n° 4 (December 2008)
[article]
Titre : Matching networks with different levels of detail Type de document : Article/Communication Auteurs : Sébastien Mustière , Auteur ; Thomas Devogele , Auteur Année de publication : 2008 Article en page(s) : pp 435 - 453 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] appariement de graphes
[Termes IGN] conflation
[Termes IGN] distance de Fréchet
[Termes IGN] objet géographique linéaireRésumé : (Auteur) This paper deals with the issue of automatically matching networks with different levels of details. We first present why this issue is complex through an analysis of the differences that can be encountered between networks. We also present different criteria, tools and approaches used for network matching. We then propose a matching process, named NetMatcher. This process is a several steps process looking for potential candidates and then analysing them in order to determine the final results. It relies on the comparison of geometrical, attributive, and topological properties of objects. It determines one-to-many links between networks: in particular a node of the less detailed network can be matched to several arcs and nodes forming a complex junction in the most detailed network. An important strength of the process is to self-evaluate its results through the comparison of topological organisation of networks. This paves the way to an interactive editing of the results. The NetMatcher process has been intensively tested on a wide range of actual datasets, thus highlighting its effectiveness as well as its limits. Copyright Springer Numéro de notice : A2008-378 Affiliation des auteurs : COGIT+Ext (1988-2011) Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-007-0040-1 Date de publication en ligne : 20/10/2007 En ligne : http://dx.doi.org/10.1007/s10707-007-0040-1 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29371
in Geoinformatica > vol 12 n° 4 (December 2008) . - pp 435 - 453[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-08041 RAB Revue Centre de documentation En réserve L003 Disponible
[article]
Titre : On detecting spatial outliers Type de document : Article/Communication Auteurs : D. Chen, Auteur ; C.T. Lu, Auteur ; Y. Kou, Auteur ; et al., Auteur Année de publication : 2008 Article en page(s) : pp 455 - 475 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] exploration de données géographiques
[Termes IGN] méthode robuste
[Termes IGN] qualité des données
[Termes IGN] valeur aberranteRésumé : (Auteur) The ever-increasing volume of spatial data has greatly challenged our ability to extract useful but implicit knowledge from them. As an important branch of spatial data mining, spatial outlier detection aims to discover the objects whose non-spatial attribute values are significantly different from the values of their spatial neighbors. These objects, called spatial outliers, may reveal important phenomena in a number of applications including traffic control, satellite image analysis, weather forecast, and medical diagnosis. Most of the existing spatial outlier detection algorithms mainly focus on identifying single attribute outliers and could potentially misclassify normal objects as outliers when their neighborhoods contain real spatial outliers with very large or small attribute values. In addition, many spatial applications contain multiple non-spatial attributes which should be processed altogether to identify outliers. To address these two issues, we formulate the spatial outlier detection problem in a general way, design two robust detection algorithms, one for single attribute and the other for multiple attributes, and analyze their computational complexities. Experiments were conducted on a real-world data set, West Nile virus data, to validate the effectiveness of the proposed algorithms. Copyright Springer Numéro de notice : A2008-379 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-007-0038-8 En ligne : https://doi.org/10.1007/s10707-007-0038-8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29372
in Geoinformatica > vol 12 n° 4 (December 2008) . - pp 455 - 475[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-08041 RAB Revue Centre de documentation En réserve L003 Disponible Modeling motion relations for moving objects on road networks / Kathleen Stewart Hornsby in Geoinformatica, vol 12 n° 4 (December 2008)
[article]
Titre : Modeling motion relations for moving objects on road networks Type de document : Article/Communication Auteurs : Kathleen Stewart Hornsby, Auteur ; K. King, Auteur Année de publication : 2008 Article en page(s) : pp 477 - 495 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] modèle relationnel
[Termes IGN] objet mobile
[Termes IGN] ontologie
[Termes IGN] réseau routierRésumé : (Auteur) In this paper, a basic set of motion relations capturing specific prototypical movements of vehicles on US road networks are introduced. Vehicle positional data collected from a geosensor network and stored in a spatio-temporal database serve as the basis for computing the relations that include isBehind, inFrontOf, driveBeside, and passBy. Relational SQL queries are used to derive the relations, returning information about pairs of moving objects and their relative positions. This information provides additional user contexts for binary vehicle patterns relative to a reference object. A framework for the kinds of moving objects that participate in these relations is supplied through an associated TransportationDevice ontology. Depending on the class of moving object, a relation such as isBehind captures scenarios that are facilitating or inhibiting with respect to the movement of traffic. For example, if a police car is known to be behind an automobile, the automobile typically slows to correspond with the legal speed limit. In this work, we show how linking the spatio-temporal database to an ontology can augment and extend the motion relation information, providing multi-granular perspectives of moving vehicles. Copyright Springer Numéro de notice : A2008-380 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-007-0039-7 En ligne : https://doi.org/10.1007/s10707-007-0039-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29373
in Geoinformatica > vol 12 n° 4 (December 2008) . - pp 477 - 495[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-08041 RAB Revue Centre de documentation En réserve L003 Disponible Reporting leaders and followers among trajectories of moving point objects / M. Andersson in Geoinformatica, vol 12 n° 4 (December 2008)
[article]
Titre : Reporting leaders and followers among trajectories of moving point objects Type de document : Article/Communication Auteurs : M. Andersson, Auteur ; J. Gudmundsson, Auteur ; P. Laube, Auteur ; et al., Auteur Année de publication : 2008 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] base de données d'objets mobiles
[Termes IGN] données spatiotemporelles
[Termes IGN] géomètrie algorithmique
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] objet mobile
[Termes IGN] quantité continue
[Termes IGN] quantité discrète
[Termes IGN] reconstruction d'itinéraire ou de trajectoireRésumé : (Auteur) Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving objects, opening new options for a better understanding of the processes involved. In this paper we investigate spatio-temporal movement patterns in large tracking data sets. We present a natural definition of the pattern ‘one object is leading others’, which is based on behavioural patterns discussed in the behavioural ecology literature. Such leadership patterns can be characterised by a minimum time length for which they have to exist and by a minimum number of entities involved in the pattern. Furthermore, we distinguish two models (discrete and continuous) of the time axis for which patterns can start and end. For all variants of these leadership patterns, we describe algorithms for their detection, given the trajectories of a group of moving entities. A theoretical analysis as well as experiments show that these algorithms efficiently report leadership patterns. Copyright Springer Numéro de notice : A2008-381 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-007-0037-9 En ligne : https://doi.org/10.1007/s10707-007-0037-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29374
in Geoinformatica > vol 12 n° 4 (December 2008)[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-08041 RAB Revue Centre de documentation En réserve L003 Disponible