Descripteur
Documents disponibles dans cette catégorie (1067)
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
Localisation des caméras ANPR sur le réseau routier pour le profilage géographique / Marie Trotta in Revue internationale de géomatique, vol 27 n° 4 (octobre - décembre 2017)
[article]
Titre : Localisation des caméras ANPR sur le réseau routier pour le profilage géographique Type de document : Article/Communication Auteurs : Marie Trotta, Auteur ; Jean-Paul Donnay, Auteur Année de publication : 2017 Article en page(s) : pp 503 - 521 Langues : Français (fre) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse multicritère
[Termes IGN] estimation par noyau
[Termes IGN] infraction
[Termes IGN] Liège
[Termes IGN] réseau routier
[Termes IGN] trafic routierRésumé : (auteur) Malgré un recours croissant à la technologie des caméras ANPR, en particulier dans les investigations criminelles, la littérature et l’expérience des forces de police avec lesquelles nous avons travaillé, semblent montrer qu’il n’existe pas de méthode systématique afin de localiser le plus adéquatement possible ces installations coûteuses. Partant d’un ensemble de délits localisés, relevant de quatre catégories de vols perpétrés sur une année au sein de la province de Liège (Belgique), nous proposons une méthodologie exploitant, dans une analyse multicritère, la densité de délits, la densité de voirie et la distance entre les sites des caméras. L’approche multicritère permet d’ajuster la pondération des facteurs selon les types de délits. En outre, la méthodologie est itérative, dans la mesure où les sites des caméras sont localisés par phases successives. Un critère de validation des résultats est fourni sous la forme d’un taux de couverture du territoire considéré, qui est fonction du nombre de sites de caméras retenus et du temps de parcours depuis chacun de ces sites. De plus, les conséquences des tentatives d’évitement des sites installés en matière de profilage géographique sont rapidement évoquées. Numéro de notice : A2017-833 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.3166/rig.2017.00047 En ligne : https://doi.org/10.3166/rig.2017.00047 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89372
in Revue internationale de géomatique > vol 27 n° 4 (octobre - décembre 2017) . - pp 503 - 521[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 047-2017041 SL Revue Centre de documentation Revues en salle Disponible Snapshot and continuous points-based trajectory search / Shuyao Qi in Geoinformatica, vol 21 n° 4 (October - December 2017)
[article]
Titre : Snapshot and continuous points-based trajectory search Type de document : Article/Communication Auteurs : Shuyao Qi, Auteur ; Dimitri Sacharidis, Auteur ; Panagiotis Bouros, Auteur ; Nikos Mamoulis, Auteur Année de publication : 2017 Article en page(s) : pp 669 - 701 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse combinatoire (maths)
[Termes IGN] calcul d'itinéraire
[Termes IGN] distance
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] temps
[Termes IGN] temps instantané
[Termes IGN] théorie des possibilitésRésumé : (Auteur) Trajectory data capture the traveling history of moving objects such as people or vehicles. With the proliferation of GPS and tracking technologies, huge volumes of trajectories are rapidly generated and collected. Under this, applications such as route recommendation and traveling behavior mining call for efficient trajectory retrieval. In this paper, we first focus on distance-to-points trajectory search; given a collection of trajectories and a set query points, the goal is to retrieve the top-k trajectories that pass as close as possible to all query points. We advance the state-of-the-art by combining existing approaches to a hybrid nearest neighbor-based method while also proposing an alternative, more efficient spatial range-based approach. Second, we investigate the continuous counterpart of distance-to-points trajectory search where the query is long-standing and the set of returned trajectories needs to be maintained whenever updates occur to the query and/or the data. Third, we propose and study two practical variants of distance-to-points trajectory search, which take into account the temporal characteristics of the searched trajectories. Through an extensive experimental analysis with real trajectory data, we show that our range-based approach outperforms previous methods by at least one order of magnitude for the snapshot and up to several times for the continuous version of the queries. Numéro de notice : A2017-600 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-016-0267-9 En ligne : https://doi.org/10.1007/s10707-016-0267-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86908
in Geoinformatica > vol 21 n° 4 (October - December 2017) . - pp 669 - 701[article]Uncertain Voronoi cell computation based on space decomposition / Klaus Arthur Schmid in Geoinformatica, vol 21 n° 4 (October - December 2017)
[article]
Titre : Uncertain Voronoi cell computation based on space decomposition Type de document : Article/Communication Auteurs : Klaus Arthur Schmid, Auteur ; Andreas Züfle, Auteur ; Tobias Emrich, Auteur ; et al., Auteur Année de publication : 2017 Article en page(s) : pp 763 -795 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] décomposition spatiale
[Termes IGN] diagramme de Voronoï
[Termes IGN] incertitude des données
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] traitement parallèleRésumé : (Auteur) To facilitate (k)-Nearest Neighbor queries, the concept of Voronoi decomposition is widely used. In this work, we propose solutions to extend the concept of Voronoi-cells to uncertain data. Due to data uncertainty, the location, the shape and the extent of a Voronoi cell are random variables. To facilitate reliable query processing despite the presence of uncertainty, we employ the concept of possible-Voronoi cells and introduce the novel concept of guaranteed-Voronoi cells: The possible-Voronoi cell of an object U consists of all points in space that have a non-zero probability of having U as their nearest-neighbor; and the guaranteed-Voronoi cell, which consists of all points in space which must have U as their nearest-neighbor. Since exact computation of both types of Voronoi cells is computationally hard, we propose approximate solutions. Therefore, we employ hierarchical access methods for both data and object space. Our proposed algorithm descends both index structures simultaneously, constantly trying to prune branches in both trees by employing the concept of spatial domination. To support (k)-Nearest Neighbor queries having k > 1, this work further pioneers solutions towards the computation of higher-order possible and higher-order guaranteed Voronoi cells, which consist of all points in space which may (respectively must) have U as one of their k-nearest neighbors. For this purpose, we develop three algorithms to explore our index structures and show that the approach that descends both index structures in parallel yields the fastest query processing times. Our experiments show that we are able to approximate uncertain Voronoi cells of any order much more effectively than the state-of-the-art while improving run-time performance. Since our approach is the first to compute guaranteed-Voronoi cells and higher order (possible and guaranteed) Voronoi cells, we extend the existing state-of-the-art solutions to these concepts, in order to allow a fair experimental evaluation. Numéro de notice : A2017-604 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-017-0293-2 En ligne : https://doi.org/10.1007/s10707-017-0293-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86913
in Geoinformatica > vol 21 n° 4 (October - December 2017) . - pp 763 -795[article]A GPU-accelerated adaptive kernel density estimation approach for efficient point pattern analysis on spatial big data / Guiming Zhang in International journal of geographical information science IJGIS, vol 31 n° 9-10 (September - October 2017)
[article]
Titre : A GPU-accelerated adaptive kernel density estimation approach for efficient point pattern analysis on spatial big data Type de document : Article/Communication Auteurs : Guiming Zhang, Auteur ; A - Xing Zhu, Auteur ; Qunying Huang, Auteur Année de publication : 2017 Article en page(s) : pp 2068 - 2097 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] données massives
[Termes IGN] estimation par noyau
[Termes IGN] jeu de données localisées
[Termes IGN] optimisation (mathématiques)
[Termes IGN] processeur graphiqueRésumé : (Auteur) Kernel density estimation (KDE) is a classic approach for spatial point pattern analysis. In many applications, KDE with spatially adaptive bandwidths (adaptive KDE) is preferred over KDE with an invariant bandwidth (fixed KDE). However, bandwidths determination for adaptive KDE is extremely computationally intensive, particularly for point pattern analysis tasks of large problem sizes. This computational challenge impedes the application of adaptive KDE to analyze large point data sets, which are common in this big data era. This article presents a graphics processing units (GPUs)-accelerated adaptive KDE algorithm for efficient spatial point pattern analysis on spatial big data. First, optimizations were designed to reduce the algorithmic complexity of the bandwidth determination algorithm for adaptive KDE. The massively parallel computing resources on GPU were then exploited to further speed up the optimized algorithm. Experimental results demonstrated that the proposed optimizations effectively improved the performance by a factor of tens. Compared to the sequential algorithm and an Open Multiprocessing (OpenMP)-based algorithm leveraging multiple central processing unit cores for adaptive KDE, the GPU-enabled algorithm accelerated point pattern analysis tasks by a factor of hundreds and tens, respectively. Additionally, the GPU-accelerated adaptive KDE algorithm scales reasonably well while increasing the size of data sets. Given the significant acceleration brought by the GPU-enabled adaptive KDE algorithm, point pattern analysis with the adaptive KDE approach on large point data sets can be performed efficiently. Point pattern analysis on spatial big data, computationally prohibitive with the sequential algorithm, can be conducted routinely with the GPU-accelerated algorithm. The GPU-accelerated adaptive KDE approach contributes to the geospatial computational toolbox that facilitates geographic knowledge discovery from spatial big data. Numéro de notice : A2017-509 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2017.1324975 En ligne : http://dx.doi.org/10.1080/13658816.2017.1324975 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86455
in International journal of geographical information science IJGIS > vol 31 n° 9-10 (September - October 2017) . - pp 2068 - 2097[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2017051 RAB Revue Centre de documentation En réserve L003 Disponible The geometry of space-time prisms with uncertain anchors / Bart Kuijpers in International journal of geographical information science IJGIS, vol 31 n° 9-10 (September - October 2017)
[article]
Titre : The geometry of space-time prisms with uncertain anchors Type de document : Article/Communication Auteurs : Bart Kuijpers, Auteur ; Walied Othman, Auteur Année de publication : 2017 Article en page(s) : pp 1722 - 1748 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse spatio-temporelle
[Termes IGN] données spatiotemporelles
[Termes IGN] erreur de mesure
[Termes IGN] géométrie
[Termes IGN] incertitude géométrique
[Termes IGN] modèle conceptuel de données spatio-temporelles
[Termes IGN] objet mobile
[Termes IGN] prisme spatio-temporel
[Termes IGN] Time-geography
[Termes IGN] zone d'intérêtRésumé : (Auteur) Space-time prisms envelop all spatio-temporal locations that moving objects may have visited between two of their known spatio-temporal locations, given a bound on their travel speed. In this context, the known locations are often the result of observations or measurements, and they are called ‘anchor points’. The classic space-time prism, in isotropic two-dimensional space, as well as in transportation networks, assumes that the measurements of these anchor points are exact. Whereas, in many applications, we can assume that time can be measured fairly precisely, this assumption is unrealistic for the spatial components of measured locations (we think of Global Positioning System (GPS) errors, for instance). In this paper, we extend the classical prism from anchor points to circular ‘anchor regions’ that capture the uncertainty or error on their measurement. We define the notion of a space-time prism with uncertain anchor points, called uncertain prism, for short. We study the geometry of uncertain prisms in an arbitrary metric space to make this concept as widely applicable as possible. We also focus on the rims of uncertain space-time prisms, which demarcate the area that a moving object can have visited between two anchor regions (given some local speed limitations). Numéro de notice : A2017-504 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2017.1319950 En ligne : https://doi.org/10.1080/13658816.2017.1319950 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86449
in International journal of geographical information science IJGIS > vol 31 n° 9-10 (September - October 2017) . - pp 1722 - 1748[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2017051 RAB Revue Centre de documentation En réserve L003 Disponible Geospatial analysis as experimental archaeology / Thomas G. Whitley in Journal of archaeological science, vol 84 (August 2017)PermalinkDepicting urban boundaries from a mobility network of spatial interactions : a case study of Great Britain with geo-located Twitter data / Junjun Yin in International journal of geographical information science IJGIS, vol 31 n° 7-8 (July - August 2017)PermalinkGlobal multi-layer network of human mobility / Alexander Belyi in International journal of geographical information science IJGIS, vol 31 n° 7-8 (July - August 2017)PermalinkMapping changes of residence with passive mobile positioning data : the case of Estonia / Pilleriine Kamenjuk in International journal of geographical information science IJGIS, vol 31 n° 7-8 (July - August 2017)PermalinkVers un observatoire agro-environnemental des territoires : Un système décisionnel multi-échelle pour le bassin de la Charente / Françoise Vernier in Revue internationale de géomatique, vol 27 n° 3 (juillet-septembre 2017)PermalinkCartographic analysis of transformations of the spatial structure of lands of Podgorze in Krakow in Poland in the period of 1847–2016 / Wojciech Przegon in Geodetski vestnik, vol 61 n° 2 (June - August 2017)PermalinkExtracting urban functional regions from points of interest and human activities on location-based social networks / Song Gao in Transactions in GIS, vol 21 n° 3 (June 2017)PermalinkPerformance evaluation of land change simulation models using landscape metrics / Sadeq Dezhkam in Geocarto international, vol 32 n° 6 (June 2017)PermalinkViCTOr : paysage virtuel pour explorer les dynamiques de la VIticulture et de la Consommation en TouRaine / Etienne Delay in Cybergeo, European journal of geography, n° 2017 ([01/06/2017])PermalinkAn intelligent spatial land use planning support system using socially rational agents / Seyed Moral Ghavami in International journal of geographical information science IJGIS, vol 31 n° 5-6 (May-June 2017)Permalink