Centre dedocumentation
scientifique

Efficient continuous top-k spatial keyword queries on road networks / Long Guo in Geoinformatica [en ligne], vol 19 n° 1 (January - March 2015)  

Public [article]  inGeoinformatica [en ligne] > vol 19 n° 1 (January - March 2015) . - pp 29 - 60 Titre : Efficient continuous top-k spatial keyword queries on road networks Type de document : Article/Communication Auteurs : Long Guo, Auteur ; Jie Shao, Auteur ; Htoo Htet Aung, Auteur ; Kian-Lee Tan, Auteur Année de publication : 2015 Article en page(s) : pp 29 - 60 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] espace euclidien [Termes descripteurs IGN] extraction de données [Termes descripteurs IGN] géoétiquetage [Termes descripteurs IGN] géopositionnement [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] système d'information géographique [Termes descripteurs IGN] traitement de données localisées Résumé : (auteur) With the development of GPS-enabled mobile devices, more and more pieces of information on the web are geotagged. Spatial keyword queries, which consider both spatial locations and textual descriptions to find objects of interest, adapt well to this trend. Therefore, a considerable number of studies have focused on the interesting problem of efficiently processing spatial keyword queries. However, most of them assume Euclidean space or examine a single snapshot query only. This paper investigates a novel problem, namely, continuous top-k spatial keyword queries on road networks, for the first time. We propose two methods that can monitor such moving queries in an incremental manner and reduce repetitive traversing of network edges for better performance. Experimental evaluation using large real datasets demonstrates that the proposed methods both outperform baseline methods significantly. Discussion about the parameters affecting the efficiency of the two methods is also presented to reveal their relative advantages. Numéro de notice : A2015-485 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article En ligne : http://link.springer.com/article/10.1007/s10707-014-0204-8/fulltext.html Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=77248 [article]

Improving geographic information retrieval in spatial data infrastructures / Fabio Gomes,de Andrade in Geoinformatica, vol 18 n° 4 (October 2014)  

Public [article]  inGeoinformatica > vol 18 n° 4 (October 2014) . - pp 793-818 Titre : Improving geographic information retrieval in spatial data infrastructures Type de document : Article/Communication Auteurs : Fabio Gomes,de Andrade, Auteur ; Cláudio, de Souza Baptista, Auteur ; Clodoveu Augusto Davis Jr, Auteur Année de publication : 2014 Article en page(s) : pp 793-818 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Infrastructure de données [Termes descripteurs IGN] accès aux données localisées [Termes descripteurs IGN] infrastructure européenne de données localisées [Termes descripteurs IGN] interopérabilité sémantique [Termes descripteurs IGN] ontologie [Termes descripteurs IGN] requête spatiale Résumé : (Auteur) In recent years, spatial data infrastructures (SDIs) have gained great popularity as a solution to facilitate interoperable access to geospatial data offered by different agencies. In order to enhance the data retrieval process, current infrastructures usually offer a catalog service. Nevertheless, such catalog services still have important limitations that make it difficult for users to find the geospatial data that they are interested in. Some current catalog drawbacks include the use of a single record to describe all the feature types offered by a service, the lack of formal means to describe the semantics of the underlying data, and the lack of an effective ranking metric to organize the results retrieved from a query. Aiming to overcome these limitations, this article proposes SESDI (Semantically-Enabled Spatial Data Infrastructures), which is framework that reuses techniques of classic information retrieval to improve geographic data retrieval in a SDI. Moreover, the framework proposes several ranking metrics to solve spatial, semantic, temporal and multidimensional queries. Numéro de notice : A2014-463 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-014-0202-x date de publication en ligne : 19/01/2014 En ligne : https://doi.org/10.1007/s10707-014-0202-x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74035 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014041	SL	Revue	Centre de documentation	Revues en salle	Disponible

Large-scale geo-tagged video indexing and queries / He Ma in Geoinformatica, vol 18 n° 4 (October 2014)  

Public [article]  inGeoinformatica > vol 18 n° 4 (October 2014) . - pp 671-697 Titre : Large-scale geo-tagged video indexing and queries Type de document : Article/Communication Auteurs : He Ma, Auteur ; Sakire Arslan Ay, Auteur ; Roger Zimmermann, Auteur ; et al., Auteur Année de publication : 2014 Article en page(s) : pp 671-697 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes descripteurs IGN] angle de visée [Termes descripteurs IGN] distance [Termes descripteurs IGN] données localisées des bénévoles [Termes descripteurs IGN] données massives [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] vidéo numérique Résumé : (Auteur) With the wide spread of smartphones, a large number of user-generated videos are produced everyday. The embedded sensors, e.g., GPS and the digital compass, make it possible that videos are accessed based on their geo-properties. In our previous work, we have created a framework for integrated, sensor-rich video acquisition (with one instantiation implemented in the form of smartphone applications) which associates a continuous stream of location and viewing direction information with the collected videos, hence allowing them to be expressed and manipulated as spatio-temporal objects. These sensor meta-data are considerably smaller in size compared to the visual content and are helpful in effectively and efficiently searching for geo-tagged videos in large-scale repositories. In this study, we propose a novel three-level grid-based index structure and introduce a number of related query types, including typical spatial queries and ones based on bounded radius and viewing direction restriction. These two criteria are important in many video applications and we demonstrate the importance with a real-world dataset. Moreover, experimental results on a large-scale synthetic dataset show that our approach can provide a significant speed improvements of at least 30 %, considering a mix of queries, compared to a multi-dimensional R-tree implementation. Numéro de notice : A2014-459 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/SOCIETE NUMERIQUE Nature : Article DOI : 10.1007/s10707-013-0199-6 date de publication en ligne : 28/12/2013 En ligne : http://dx.doi.org/10.1007/s10707-013-0199-6 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74031 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014041	SL	Revue	Centre de documentation	Revues en salle	Disponible

TARS: traffic-aware route search / Roy Levin in Geoinformatica, vol 18 n° 3 (July 2014)  

Public [article]  inGeoinformatica > vol 18 n° 3 (July 2014) . - pp 461-500 Titre : TARS: traffic-aware route search Type de document : Article/Communication Auteurs : Roy Levin, Auteur ; Yaron Kanza, Auteur Année de publication : 2014 Article en page(s) : pp 461-500 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] navigation automobile [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] système d'information géographique [Termes descripteurs IGN] trafic routier Résumé : (Auteur) In a traffic-aware route search (TARS), the user provides start and target locations and sets of search terms. The goal is to find the fastest route from the start location to the target via geographic entities (points of interest) that correspond to the search terms, while taking into account variations in the travel speed due to changes in traffic conditions, and the possibility that some visited entities will not satisfy the search requirements. A TARS query may include temporal constraints and order constraints that restrict the order by which entities are visited. Since TARS generalizes the Traveling-Salesperson Problem, it is an NP-hard problem. Thus, it is unlikely to find a polynomial-time algorithm for evaluating TARS queries. Hence, we present in this paper three heuristics to answer TARS queries--a local greedy approach, a global greedy approach and an algorithm that computes a linear approximation to the travel speeds, formulates the problem as a Mixed Integer Linear Programming (MILP) problem and uses a solver to find a solution. We provide an experimental evaluation based on actual traffic data and show that using a MILP solver to find a solution is effective and can be done within a limited running time in many real-life scenarios. The local-greedy approach is the least effective in finding a fast route, however, it has the best running time and it is the most scalable. Numéro de notice : A2014-498 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article DOI : 10.1007/s10707-013-0185-z date de publication en ligne : 07/07/2013 En ligne : https://doi.org/10.1007/s10707-013-0185-z Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74090 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014031	SL	Revue	Centre de documentation	Revues en salle	Disponible

3D Hilbert space filling curves in 3D city modeling for faster spatial queries / Uznir Ujang in International journal of 3-D information modeling, vol 3 n° 2 (April - June 2014)

Public [article]  inInternational journal of 3-D information modeling > vol 3 n° 2 (April - June 2014) . - pp 1 - 18 Titre : 3D Hilbert space filling curves in 3D city modeling for faster spatial queries Type de document : Article/Communication Auteurs : Uznir Ujang, Auteur ; François Anton, Auteur ; Suhaibah Azri, Auteur ; et al., Auteur Année de publication : 2014 Article en page(s) : pp 1 - 18 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques [Termes descripteurs IGN] CityGML [Termes descripteurs IGN] courbe de Hilbert [Termes descripteurs IGN] données ouvertes [Termes descripteurs IGN] modélisation 3D [Termes descripteurs IGN] reconstruction 3D du bâti [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] SPACE-FILLING CURVE [Termes descripteurs IGN] vitesse [Termes descripteurs IGN] XML Résumé : (Auteur) The advantages of three dimensional (3D) city models can be seen in various applications including photogrammetry, urban and regional planning, computer games, etc. They expand the visualization and analysis capabilities of Geographic Information Systems on cities, and they can be developed using web standards. However, these 3D city models consume much more storage compared to two dimensional (2 D) spatial data. They involve extra geometrical and topological information together with semantic data. Without a proper spatial data clustering method and its corresponding spatial data access method, retrieving portions of and especially searching these 3D city models, will not be done optimally. Even though current developments are based on an open data model allotted by the Open Geospatial Consortium (OGC) called CityGML, its XML-based structure makes it challenging to cluster the 3D urban objects. In this research, the authors propose an opponent data constellation technique of space-filling curves (3D Hilbert curves) for 3D city model data representation. Unlike previous methods, that try to project 3D or n-dimensional data down to 2D or 3D using Principal Component Analysis (PCA) or Hilbert mappings, in this research, they extend the Hilbert space-filling curve to one higher dimension for 3D city model data implementations. The query performance was tested for single object, nearest neighbor and range search queries using a CityGML dataset of 1,000 building blocks and the results are presented in this paper. The advantages of implementing space-filling curves in 3D city modeling will improve data retrieval time by means of optimized 3D adjacency, nearest neighbor information and 3D indexing. The Hilbert mapping, which maps a sub-interval of the ([0,1]) interval to the corresponding portion of the d-dimensional Hilbert's curve, preserves the Lebesgue measure and is Lipschitz continuous. Depending on the applications, several alternatives are possible in order to cluster spatial data together in the third dimension compared to its clustering in 2 D. Numéro de notice : A2014-652 Affiliation des auteurs : non IGN Thématique : IMAGERIE/INFORMATIQUE Nature : Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=75102 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
138-2014021	RAB	Revue	Centre de documentation	En réserve 3L	Disponible

A comparative study of two approaches for supporting optimal network location queries / Parisa Ghaemi in Geoinformatica, vol 18 n° 2 (April 2014)  

Permalink

The largest empty rectangle containing only a query object in Spatial Databases / Gilberto Gutiérrez in Geoinformatica, vol 18 n° 2 (April 2014)  

Permalink

Protecting query privacy in location-based services / Xihui Chen in Geoinformatica, vol 18 n° 1 (January 2014)  

Permalink

Blind evaluation of location based queries using space transformation to preserve location privacy / Ali Khshgozaran in Geoinformatica, vol 17 n° 4 (October 2013)  

Permalink

Decentralized querying of topological relations between regions monitored by a coordinate-free geosensor network / Myeong-Hung Jeong in Geoinformatica, vol 17 n° 4 (October 2013)  

Permalink

Index-based query processing on distributed multidimensional data / George Tsatsanifos in Geoinformatica, vol 17 n° 3 (July 2013)  

Permalink

Spatial inverse query processing / Thomas Bernecker in Geoinformatica, vol 17 n° 3 (July 2013)  

Permalink

Modèle pour un serveur de données géographiques. Les services web géographiques WMS et WFS / Nissrine Souissi in Revue internationale de géomatique, vol 23 n° 2 (juin - aout 2013)

Permalink

Perception-based shape retrieval for 3D building models / M. Zhang in ISPRS Journal of photogrammetry and remote sensing, vol 75 (January 2013)

Permalink

A review of EO image information mining / M. Quartilly in ISPRS Journal of photogrammetry and remote sensing, vol 75 (January 2013)

Permalink