Centre dedocumentation
scientifique

An indoor spatial accessible area generation approach considering distance constraints / Lina Yang in Annals of GIS, Vol 26 n°1 (January 2020)  

Public [article]  inAnnals of GIS > Vol 26 n°1 (January 2020) . - pp 25 - 34 Titre : An indoor spatial accessible area generation approach considering distance constraints Type de document : Article/Communication Auteurs : Lina Yang, Auteur ; Hongru Bi, Auteur ; Xiaojing Yao, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 25 - 34 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes descripteurs IGN] analyse spatiale [Termes descripteurs IGN] contrainte géométrique [Termes descripteurs IGN] distance [Termes descripteurs IGN] espace intérieur [Termes descripteurs IGN] modèle conceptuel de données localisées [Termes descripteurs IGN] modèle géométrique [Termes descripteurs IGN] zone tampon Résumé : (auteur) Indoor objects’ accessible area generation considering distance constraints is of important realistic significance for spatial analysis. To the best of our knowledge, few studies have been conducted on indoor accessible area generation considering distance constraints. And because of different spatial characteristics between indoor and outdoor environment, the commonly used approach in outdoor space is not suitable for indoor space. In this paper, based on the hybrid spatial data model of geometric and symbolic model, an accessible area generation approach considering distance constraints for indoor environment is proposed by improving traditional spatial buffer zone generation technique. The buffer zone generation with a predefined distance around indoor objects within their located subspace is executed first; then, based on the indoor spatial connectivity, buffer generation around exit points is successively executed in its next connected subspaces until the distance decreases to zero. The merge of these generated buffer zones is the result of accessible area generation with a predefined distance constraint. During the process, two kinds of spatial search strategies, depth-first search and breadth-first search, are presented. Two sets of experiments are conducted to validate the correctness and efficiency of the proposed approach. Results show that the approach can be effectively used to solve the problem of indoor objects’ accessible area generation with distance constraints. Moreover, the potential use, as well as the limitation of the proposed approach is discussed in this paper. Numéro de notice : A2020-118 Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/19475683.2019.1680575 date de publication en ligne : 18/10/2019 En ligne : https://doi.org/10.1080/19475683.2019.1680575 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94737 [article]

A graph-based approach for the structural analysis of road and building layouts / Mathieu Domingo in Geo-spatial Information Science, vol 22 n° 1 (March 2019)  

Public [article]  inGeo-spatial Information Science > vol 22 n° 1 (March 2019) . - pp 59 - 72 Titre : A graph-based approach for the structural analysis of road and building layouts Type de document : Article/Communication Auteurs : Mathieu Domingo, Auteur ; Rémy Thibaud, Auteur ; Christophe Claramunt, Auteur Année de publication : 2019 Article en page(s) : pp 59 - 72 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] bati [Termes descripteurs IGN] distance [Termes descripteurs IGN] espace urbain [Termes descripteurs IGN] graphe [Termes descripteurs IGN] réseau routier Résumé : (Auteur) A better understanding of the relationship between the structure and functions of urban and suburban spaces is one of the avenues of research still open for geographical information science. The research presented in this paper develops several graph-based metrics whose objective is to characterize some local and global structural properties that reflect the way the overall building layout can be cross-related to the one of the road layout. Such structural properties are modeled as an aggregation of parcels, buildings, and road networks. We introduce several computational measures (Ratio Minimum Distance, Minimum Ratio Minimum Distance, and Metric Compactness) that respectively evaluate the capability for a given road to be connected with the whole road network. These measures reveal emerging sub-network structures and point out differences between less-connective and more-connective parts of the network. Based on these local and global properties derived from the topological and graph-based representation, and on building density metrics, this paper proposes an analysis of road and building layouts at different levels of granularity. The metrics developed are applied to a case study in which the derived properties reveal coherent as well as incoherent neighborhoods that illustrate the potential of the approach and the way buildings and roads can be relatively connected in a given urban environment. Overall, and by integrating the parcels and buildings layouts, this approach complements other previous and related works that mainly retain the configurational structure of the urban network as well as morphological studies whose focus is generally limited to the analysis of the building layout. Numéro de notice : A2019-242 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/10095020.2019.1568736 date de publication en ligne : 15/02/2019 En ligne : https://doi.org/10.1080/10095020.2019.1568736 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92936 [article]

Unveiling movement uncertainty for robust trajectory similarity analysis / Andre Salvaro Furtado in International journal of geographical information science IJGIS, vol 32 n° 1-2 (January - February 2018)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 32 n° 1-2 (January - February 2018) . - pp 140 - 168 Titre : Unveiling movement uncertainty for robust trajectory similarity analysis Type de document : Article/Communication Auteurs : Andre Salvaro Furtado, Auteur ; Luis Otavio Alvares, Auteur ; Nikos Pelekis, Auteur ; et al., Auteur Année de publication : 2018 Article en page(s) : pp 140 - 168 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] distance [Termes descripteurs IGN] données localisées [Termes descripteurs IGN] incertitude des données [Termes descripteurs IGN] mesure de similitude multidimensionnelle [Termes descripteurs IGN] méthode robuste [Termes descripteurs IGN] trace GPS [Termes descripteurs IGN] trajet Résumé : (Auteur) Trajectory data analysis and mining require distance and similarity measures, and the quality of their results is directly related to those measures. Several similarity measures originally proposed for time-series were adapted to work with trajectory data, but these approaches were developed for well-behaved data that usually do not have the uncertainty and heterogeneity introduced by the sampling process to obtain trajectories. More recently, similarity measures were proposed specifically for trajectory data, but they rely on simplistic movement uncertainty representations, such as linear interpolation. In this article, we propose a new distance function, and a new similarity measure that uses an elliptical representation of trajectories, being more robust to the movement uncertainty caused by the sampling rate and the heterogeneity of this kind of data. Experiments using real data show that our proposal is more accurate and robust than related work. Numéro de notice : A2018-023 Thématique : GEOMATIQUE/INFORMATIQUE/MATHEMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2017.1372763 En ligne : https://doi.org/10.1080/13658816.2017.1372763 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89175 [article]

Réservation

Réserver ce document

Exemplaires (1)

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

Social Distance metric: from coordinates to neighborhoods / Vagan Terziyan in International journal of geographical information science IJGIS, vol 31 n° 11-12 (November - December 2017)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 31 n° 11-12 (November - December 2017) . - pp 2401 - 2426 Titre : Social Distance metric: from coordinates to neighborhoods Type de document : Article/Communication Auteurs : Vagan Terziyan, Auteur Année de publication : 2017 Article en page(s) : pp 2401 - 2426 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] base de données localisées [Termes descripteurs IGN] classification [Termes descripteurs IGN] distance [Termes descripteurs IGN] exploration de données géographiques [Termes descripteurs IGN] géographie sociale [Termes descripteurs IGN] interpolation [Termes descripteurs IGN] métrique [Termes descripteurs IGN] plus proche voisin (algorithme) [Termes descripteurs IGN] système d'information géographique [Termes descripteurs IGN] voisinage (topologie) Résumé : (Auteur) Choice of a distance metric is a key for the success in many machine learning and data processing tasks. The distance between two data samples traditionally depends on the values of their attributes (coordinates) in a data space. Some metrics also take into account the distribution of samples within the space (e.g. local densities) aiming to improve potential classification or clustering performance. In this paper, we suggest the Social Distance metric that can be used on top of any traditional metric. For a pair of samples x and y, it averages the two numbers: the place (rank), which sample y holds in the list of ordered nearest neighbors of x; and vice versa, the rank of x in the list of the nearest neighbors of y. Average is a contraharmonic Lehmer mean, which penalizes the difference between the numbers by giving values greater than the Arithmetic mean for the unequal arguments. We consider normalized average as a distance function and we prove it to be a metric. We present several modifications of such metric and show that their properties are useful for a variety of classification and clustering tasks in data spaces or graphs in a Geographic Information Systems context and beyond. Numéro de notice : A2017-701 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2017.1367796 En ligne : https://doi.org/10.1080/13658816.2017.1367796 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=88082 [article]

Réservation

Réserver ce document

Exemplaires (2)

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

Snapshot and continuous points-based trajectory search / Shuyao Qi in Geoinformatica [en ligne], vol 21 n° 4 (October - December 2017)  

Public [article]  inGeoinformatica [en ligne] > vol 21 n° 4 (October - December 2017) . - pp 669 - 701 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 descripteurs IGN] analyse combinatoire (maths) [Termes descripteurs IGN] calcul d'itinéraire [Termes descripteurs IGN] distance [Termes descripteurs IGN] itinéraire voisin le plus proche [Termes descripteurs IGN] temps [Termes descripteurs IGN] temps instantané [Termes descripteurs IGN] théorie des possibilités Ré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 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 [article]

Barycentre method for solving distance equations / X. Shuqiang in Survey review, vol 48 n° 348 (May 2016)  

Permalink

The Minkowski approach for choosing the distance metric in geographically weighted regression / B. Lu in International journal of geographical information science IJGIS, vol 30 n° 1-2 (January - February 2016)  

Permalink

Polygonal clustering analysis using multilevel graph-partition / Wanyi Wang in Transactions in GIS, vol 19 n° 5 (October 2015)  

Permalink

The TM-RTree: an index on generic moving objects for range queries / Jianqiu Xu in Geoinformatica [en ligne], vol 19 n° 3 (July - September 2015)  

Permalink

Combined adjustment of angle and distance measurements in a dam monitoring network / J. Casaca in Survey review, vol 47 n° 342 (May 2015)  

Permalink

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

Permalink

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

Permalink

Analysing imperfect temporal information in GIS using the triangular model / T. Qiang in Cartographic journal (the), vol 49 n° 3 (August 2012)  

Permalink

Area aggregation in map generalisation by mixed-integer programming / Jan‐Henrik Haunert in International journal of geographical information science IJGIS, vol 24 n°11-12 (december 2010)  

Permalink

A cell-based algorithm for evaluating directional distances in GIS / S. Yang in International journal of geographical information science IJGIS, vol 24 n°3-4 (march 2010)  

Permalink