Centre de documentation
scientifique

Dépouillements

Compression of trajectory data: a comprehensive evaluation and new approach / Jonathan Muckell in Geoinformatica, vol 18 n° 3 (July 2014)  

Public [article]  inGeoinformatica > vol 18 n° 3 (July 2014) . - pp 435-460 Titre : Compression of trajectory data: a comprehensive evaluation and new approach Type de document : Article/Communication Auteurs : Jonathan Muckell, Auteur ; Paul W. Olsen, Auteur ; Jeong-Hyon Hwang, Auteur ; et al., Auteur Année de publication : 2014 Article en page(s) : pp 435-460 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement [Termes IGN] analyse comparative [Termes IGN] calcul d'itinéraire [Termes IGN] compression de données [Termes IGN] évaluation des données [Termes IGN] positionnement par GPS [Termes IGN] système d'information géographique Résumé : (Auteur) GPS-equipped mobile devices such as smart phones and in-car navigation units are collecting enormous amounts of spatial and temporal information that traces a moving object's path. The exponential increase in the amount of such trajectory data has caused three major problems. First, transmission of large amounts of data is expensive and time-consuming. Second, queries on large amounts of trajectory data require computationally expensive operations to extract useful patterns and information. Third, GPS trajectories often contain large amounts of redundant data that waste storage and cause increased disk I/O time. These issues can be addressed by algorithms that reduce the size of trajectory data. A key requirement for these algorithms is to minimize the loss of information essential to location-based applications. This paper presents a new compression method called SQUISH-E (Spatial QUalIty Simplification Heuristic - Extended) that provides improved run-time performance and usability. A comprehensive comparison of SQUISH-E with other algorithms is carried out through an empirical study across three types of real-world datasets and a variety of error metrics. Numéro de notice : A2014-497 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article DOI : 10.1007/s10707-013-0184-0 Date de publication en ligne : 04/07/2013 En ligne : https://doi.org/10.1007/s10707-013-0184-0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74089 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014031	RAB	Revue	Centre de documentation	En réserve L003	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 IGN] méthode heuristique [Termes IGN] navigation automobile [Termes IGN] requête spatiale [Termes IGN] système d'information géographique [Termes 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]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

On detecting spatial categorical outliers / X. Liu in Geoinformatica, vol 18 n° 3 (July 2014)  

Public [article]  inGeoinformatica > vol 18 n° 3 (July 2014) . - pp 501 - 536 Titre : On detecting spatial categorical outliers Type de document : Article/Communication Auteurs : X. Liu, Auteur ; Feng Chen, Auteur ; Tien Lu, Auteur Année de publication : 2014 Article en page(s) : pp 501 - 536 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] détection d'anomalie [Termes IGN] valeur aberrante Résumé : (Auteur)Spatial outlier detection is an important research problem that has received much attentions in recent years. Most existing approaches are designed for numerical attributes, but are not applicable to categorical ones (e.g., binary, ordinal, and nominal) that are popular in many applications. The main challenges are the modeling of spatial categorical dependency as well as the computational efficiency. This paper presents the first outlier detection framework for spatial categorical data. Specifically, a new metric, named as Pair Correlation Ratio (PCR), is measured for each pair of category sets based on their co-occurrence frequencies at specific spatial distance ranges. The relevances among spatial objects are then calculated using PCR values with regard to their spatial distances. The outlierness for each object is defined as the inverse of the average relevance between an object and its spatial neighbors. Those objects with the highest outlier scores are returned as spatial categorical outliers. A set of algorithms are further designed for single-attribute and multi-attribute spatial categorical datasets. Extensive experimental evaluations on both simulated and real datasets demonstrated the effectiveness and efficiency of our proposed approaches. Numéro de notice : A2014-499 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-013-0188-9 Date de publication en ligne : 28/09/2013 En ligne : https://doi.org/10.1007/s10707-013-0188-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74091 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

An assisting, constrained 3D navigation technique for multiscale virtual 3D city models / Dieter Hildebrandt in Geoinformatica, vol 18 n° 3 (July 2014)  

Public [article]  inGeoinformatica > vol 18 n° 3 (July 2014) . - pp 537 -567 Titre : An assisting, constrained 3D navigation technique for multiscale virtual 3D city models Type de document : Article/Communication Auteurs : Dieter Hildebrandt, Auteur ; Robert Timm, Auteur Année de publication : 2014 Article en page(s) : pp 537 -567 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement [Termes IGN] analyse multiéchelle [Termes IGN] calcul d'itinéraire [Termes IGN] modèle 3D de l'espace urbain [Termes IGN] navigation automobile [Termes IGN] système de positionnement par satellites Résumé : (Auteur) Virtual 3D city models serve as integration platforms for complex geospatial and georeferenced information and as medium for effective communication of spatial information. In order to explore these information spaces, navigation techniques for controlling the virtual camera are required to facilitate wayfinding and movement. However, navigation is not a trivial task and many available navigation techniques do not support users effectively and efficiently with their respective skills and tasks. In this article, we present an assisting, constrained navigation technique for multiscale virtual 3D city models that is based on three basic principles: users point to navigate, users are lead by suggestions, and the exploitation of semantic, multiscale, hierarchical structurings of city models. The technique particularly supports users with low navigation and virtual camera control skills but is also valuable for experienced users. It supports exploration, search, inspection, and presentation tasks, is easy to learn and use, supports orientation, is efficient, and yields effective view properties. In particular, the technique is suitable for interactive kiosks and mobile devices with a touch display and low computing resources and for use in mobile situations where users only have restricted resources for operating the application. We demonstrate the validity of the proposed navigation technique by presenting an implementation and evaluation results. The implementation is based on service-oriented architectures, standards, and image-based representations and allows exploring massive virtual 3D city models particularly on mobile devices with limited computing resources. Results of a user study comparing the proposed navigation technique with standard techniques suggest that the proposed technique provides the targeted properties, and that it is more advantageous to novice than to expert users. Numéro de notice : A2014-500 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article DOI : 10.1007/s10707-013-0189-8 Date de publication en ligne : 07/09/2013 En ligne : https://doi.org/10.1007/s10707-013-0189-8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74092 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

A polygon-based clustering and analysis framework for mining spatial datasets / Sujing Wang in Geoinformatica, vol 18 n° 3 (July 2014)  

Public [article]  inGeoinformatica > vol 18 n° 3 (July 2014) . - pp 569 - 594 Titre : A polygon-based clustering and analysis framework for mining spatial datasets Type de document : Article/Communication Auteurs : Sujing Wang, Auteur ; Christoph F. Eick, Auteur Année de publication : 2014 Article en page(s) : pp 569 - 594 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] exploration de données géographiques [Termes IGN] polygone [Termes IGN] regroupement de données Résumé : (Auteur) Polygons provide natural representations for many types of geospatial objects, such as countries, buildings, and pollution hotspots. Thus, polygon-based data mining techniques are particularly useful for mining geospatial datasets. In this paper, we propose a polygon-based clustering and analysis framework for mining multiple geospatial datasets that have inherently hidden relations. In this framework, polygons are first generated from multiple geospatial point datasets by using a density-based contouring algorithm called DCONTOUR. Next, a density-based clustering algorithm called Poly-SNN with novel dissimilarity functions is employed to cluster polygons to create meta-clusters of polygons. Finally, post-processing analysis techniques are proposed to extract interesting patterns and user-guided summarized knowledge from meta-clusters. These techniques employ plug-in reward functions that capture a domain expert's notion of interestingness to guide the extraction of knowledge from meta-clusters. The effectiveness of our framework is tested in a real-world case study involving ozone pollution events in Texas. The experimental results show that our framework can reveal interesting relationships between different ozone hotspots represented by polygons; it can also identify interesting hidden relations between ozone hotspots and several meteorological variables, such as outdoor temperature, solar radiation, and wind speed. Numéro de notice : A2014-501 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-013-0190-2 Date de publication en ligne : 30/08/2013 En ligne : https://doi.org/10.1007/s10707-013-0190-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74093 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Comparing G-maps with other topological data structures / Patrick Erik Bradley in Geoinformatica, vol 18 n° 3 (July 2014)  

Public [article]  inGeoinformatica > vol 18 n° 3 (July 2014) . - pp 595 - 620 Titre : Comparing G-maps with other topological data structures Type de document : Article/Communication Auteurs : Patrick Erik Bradley, Auteur ; Norbert Paul, Auteur Année de publication : 2014 Article en page(s) : pp 595 - 620 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] information géographique [Termes IGN] modélisation spatiale [Termes IGN] stockage de données [Termes IGN] topologie Résumé : (Auteur) This article compares two approaches to storing spatial information: On the one hand there are topological datatypes where primitives and their connectivity are explicitly stored, on the other hand there is the G-maps-approach storing abstract "darts" and groups acting on these darts such that their orbits implicitly give the elements and topology of the stored space. First these concepts are mutually related from a categorial viewpoint and, second, their storage complexity is compared. Numéro de notice : A2014-502 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-013-0191-1 Date de publication en ligne : 26/10/2013 En ligne : https://doi.org/10.1007/s10707-013-0191-1 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74094 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Estimation of an unknown cartographic projection and its parameters from the map / Thomas Bayer in Geoinformatica, vol 18 n° 3 (July 2014)  

Public [article]  inGeoinformatica > vol 18 n° 3 (July 2014) . - pp 621 -669 Titre : Estimation of an unknown cartographic projection and its parameters from the map Type de document : Article/Communication Auteurs : Thomas Bayer, Auteur Année de publication : 2014 Article en page(s) : pp 621 -669 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géodésie [Termes IGN] cartographie [Termes IGN] projection Résumé : (Auteur) This article presents a new off-line method for the detection, analysis and estimation of an unknown cartographic projection and its parameters from a map. Several invariants are used to construct the objective function ϕ that describes the relationship between the 0D, 1D, and 2D entities on the analyzed and reference maps. It is minimized using the Nelder-Mead downhill simplex algorithm. A simplified and computationally cheaper version of the objective function ϕ involving only 0D elements is also presented. The following parameters are estimated: a map projection type, a map projection aspect given by the meta pole K coordinates [φ k , λ k ], a true parallel latitude φ 0, central meridian longitude λ 0, a map scale, and a map rotation. Before the analysis, incorrectly drawn elements on the map can be detected and removed using the IRLS. Also introduced is a new method for computing the L 2 distance between the turning functions Θ1, Θ2 of the corresponding faces using dynamic programming. Our approach may be used to improve early map georeferencing; it can also be utilized in studies of national cartographic heritage or land use applications. The results are presented both for the real cartographic data, representing early maps from the David Rumsay Map Collection, and for the synthetic tests. Numéro de notice : A2014-503 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-013-0200-4 Date de publication en ligne : 21/03/2014 En ligne : https://doi.org/10.1007/s10707-013-0200-4 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=74095 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2014031	RAB	Revue	Centre de documentation	En réserve L003	Disponible