Centre dedocumentation
scientifique

A comparison of neighbourhood relations based on ordinary Delaunay diagrams and area Delaunay diagrams: an application to define the neighbourhood relations of buildings / Hiroyuki Usui in International journal of geographical information science IJGIS, vol 34 n°11 (November 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n°11 (November 2020) . - pp 2177 - 2203 Titre : A comparison of neighbourhood relations based on ordinary Delaunay diagrams and area Delaunay diagrams: an application to define the neighbourhood relations of buildings Type de document : Article/Communication Auteurs : Hiroyuki Usui, Auteur ; Akihiro Teraki, Auteur ; Kei-ichi Okunuki, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 2177 - 2203 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] adjacence [Termes descripteurs IGN] analyse de groupement [Termes descripteurs IGN] ArcGIS [Termes descripteurs IGN] bâtiment [Termes descripteurs IGN] chevauchement [Termes descripteurs IGN] diagramme de Voronoï [Termes descripteurs IGN] Tokyo (Japon) [Termes descripteurs IGN] triangulation de Delaunay [Termes descripteurs IGN] voisinage (topologie) Résumé : (auteur) The aim of this article is to describe a convenient but robust method for defining neighbourhood relations among buildings based on ordinary Delaunay diagrams (ODDs) and area Delaunay diagrams (ADDs). ODDs and ADDs are defined as a set of edges connecting the generators of adjacent ordinary Voronoi cells (points representing centroids of building polygons) and a set of edges connecting two centroids of building polygons, which are the generators of adjacent area Voronoi cells, respectively. Although ADDs are more robust than ODDs, computation time of ODDs is shorter than that of ADDs (the order of their computation time complexity is O(nlogn)). If ODDs can approximate ADDs with a certain degree of accuracy, the former can be used as an alternative. Therefore, we computed the ratio of the number of ADD edges to that of ODD edges overlapping ADDs at building and regional scales. The results indicate that: (1) for approximately 60% of all buildings, ODDs can exactly overlap ADDs with extra ODD edges; (2) at a regional scale, ODDs can overlap approximately 90% of ADDs with 10% extra ODD edges; and (3) focusing on judging errors, although ADDs are more accurate than ODDs, the difference is only approximately 1%. Numéro de notice : A2020-616 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1748191 date de publication en ligne : 15/04/2020 En ligne : https://doi.org/10.1080/13658816.2020.1748191 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95991 [article]

A multi-scale representation model of polyline based on head/tail breaks / Pengcheng Liu in International journal of geographical information science IJGIS, vol 34 n°11 (November 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n°11 (November 2020) . - pp 2275 - 2295 Titre : A multi-scale representation model of polyline based on head/tail breaks Type de document : Article/Communication Auteurs : Pengcheng Liu, Auteur ; Tianyuan Xiao, Auteur ; Jia Xiao, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 2275 - 2295 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de Douglas-Peucker [Termes descripteurs IGN] analyse de groupement [Termes descripteurs IGN] entropie de Shannon [Termes descripteurs IGN] généralisation cartographique automatisée [Termes descripteurs IGN] polyligne [Termes descripteurs IGN] représentation multiple [Termes descripteurs IGN] série de Fourier [Vedettes matières IGN] Généralisation Résumé : (auteur) This paper proposes a model to quantify the multiscale representation of a polyline based on iterative head/tail breaks. A polyline is first transformed into a corresponding Fourier descriptor consisting of normalized Fourier-series-expansion coefficients. Then, the most significant finite components of the Fourier descriptor are selected and ranked to constitute the polyline constrained Fourier descriptor. Using Shannon’s information theory, information content of the constrained Fourier-descriptor components is defined. Next, head/tail breaks are introduced to iteratively divide the constrained Fourier descriptor into head and tail components according to the heavy-tailed distribution of information contents. Thus, simplified polylines are reconstructed using ordered heads generated from head/tail breaks. Finally, the radical law is introduced and applied to model multiscale polyline representation by quantifying the scale of each simplified polyline. Three experiments are designed and conducted to evaluate the proposed model. The results demonstrate that the proposed model is valid and efficient for quantifying multiscale polyline representation. Numéro de notice : A2020-615 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/MATHEMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1753203 date de publication en ligne : 22/04/2020 En ligne : https://doi.org/10.1080/13658816.2020.1753203 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95988 [article]

Coupling fuzzy clustering and cellular automata based on local maxima of development potential to model urban emergence and expansion in economic development zones / Xun Liang in International journal of geographical information science IJGIS, vol 34 n° 10 (October 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n° 10 (October 2020) . - pp 1930 - 1952 Titre : Coupling fuzzy clustering and cellular automata based on local maxima of development potential to model urban emergence and expansion in economic development zones Type de document : Article/Communication Auteurs : Xun Liang, Auteur ; Xiaoping Liu, Auteur ; Guangliang Chen, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 1930 - 1952 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] aide à la décision [Termes descripteurs IGN] analyse de groupement [Termes descripteurs IGN] automate cellulaire [Termes descripteurs IGN] Chine [Termes descripteurs IGN] classification floue [Termes descripteurs IGN] classification non dirigée [Termes descripteurs IGN] croissance urbaine [Termes descripteurs IGN] modèle de simulation [Termes descripteurs IGN] planification urbaine [Termes descripteurs IGN] zone d'activité économique Résumé : (auteur) Modeling urban growth in Economic development zones (EDZs) can help planners determine appropriate land policies for these regions. However, sometimes EDZs are established in remote areas outside of central cities that have no historical urban areas. Existing models are unable to simulate the emergence of urban areas without historical urban land in EDZs. In this study, a cellular automaton (CA) model based on fuzzy clustering is developed to address this issue. This model is implemented by coupling an unsupervised classification method and a modified CA model with an urban emergence mechanism based on local maxima. Through an analysis of the planning policies and existing infrastructure, the proposed model can detect the potential start zones and simulate the trajectory of urban growth independent of the historical urban land use. The method is validated in the urban emergence simulation of the Taiping Bay development zone in Dalian, China from 2013 to 2019. The proposed model is applied to future simulation in 2019–2030. The results demonstrate that the proposed model can be used to predict urban emergence and generate the possible future urban form, which will assist planners in determining the urban layout and controlling urban growth in EDZs. Numéro de notice : A2020-513 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1741591 date de publication en ligne : 23/03/2020 En ligne : https://doi.org/10.1080/13658816.2020.1741591 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95668 [article]

A framework for group converging pattern mining using spatiotemporal trajectories / Bin Zhao in Geoinformatica [en ligne], vol 24 n° 4 (October 2020)  

Public [article]  inGeoinformatica [en ligne] > vol 24 n° 4 (October 2020) . - pp 745 - 776 Titre : A framework for group converging pattern mining using spatiotemporal trajectories Type de document : Article/Communication Auteurs : Bin Zhao, Auteur ; Xintao Liu, Auteur ; Jinping Jia, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 745 - 776 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] analyse de groupement [Termes descripteurs IGN] analyse spatiale [Termes descripteurs IGN] base de données spatiotemporelles [Termes descripteurs IGN] comportement [Termes descripteurs IGN] convergence [Termes descripteurs IGN] jointure spatiale [Termes descripteurs IGN] objet mobile [Termes descripteurs IGN] reconnaissance de formes [Termes descripteurs IGN] trajectoire Résumé : (Auteur) A group event such as human and traffic congestion can be very roughly divided into three stages: converging stage before congestion, gathered stage when congestion happens, and dispersing stage that congestion disappears. It is of great interest in modeling and identifying converging behaviors before gathered events actually happen, which helps to proactively predict and handle potential public incidents such as serious stampedes. However, most of existing literature put too much emphasis on the second stage, only a few of them is dedicated to the first stage. In this paper, we propose a novel group pattern, namely converging, which refers to a group of moving objects converging from different directions during a certain period before gathered. To discover efficiently such converging patterns, we develop a framework for converging pattern mining (CPM) by examining how moving objects form clusters and the process of the “cluster containment”. The framework consists of three phases: snapshot cluster discovery phase, cluster containment join phase, and converging detection phase. As cluster containment mining is the key step, we develop three algorithms to discover cluster containment matches: a containment-join-algorithm, called SSCCJ, by using spatial proximity; a signature tree-based cluster-containment-join-algorithm, called STCCJ, which takes advantage of the cluster containment relations and signature techniques to filter enormous unqualified candidates in an efficient and effective way; and third, to keep the advantages of the above algorithms while avoiding their flaws, we further propose a signature quad-tree based cluster-containment-join algorithm, called SQTCCJ, which can identify efficiently matches by considering cluster spatial proximity as well as containment relations simultaneously. To assess the proposed methods, we redefine two evaluation metrics based on the concept of “Precision and Recall” in the field of information retrieval and the characteristics of converging patterns. We also propose a new indicator for measuring the duration of the converging stage in a group event. Finally, the effectiveness of the CPM and the efficiency of the mining algorithms are evaluated using three types of trajectory datasets, and the results show that the SQTCCJ algorithm demonstrates a superior performance. Numéro de notice : A2020-494 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00404-z date de publication en ligne : 25/04/2020 En ligne : https://doi.org/10.1007/s10707-020-00404-z Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96114 [article]

Network-constrained bivariate clustering method for detecting urban black holes and volcanoes / Qiliang Liu in International journal of geographical information science IJGIS, vol 34 n° 10 (October 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n° 10 (October 2020) . - pp 1903 - 1929 Titre : Network-constrained bivariate clustering method for detecting urban black holes and volcanoes Type de document : Article/Communication Auteurs : Qiliang Liu, Auteur ; Zhihui Wu, Auteur ; Min Deng, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 1903 - 1929 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] analyse bivariée [Termes descripteurs IGN] analyse de groupement [Termes descripteurs IGN] analyse spatio-temporelle [Termes descripteurs IGN] circulation urbaine [Termes descripteurs IGN] contour [Termes descripteurs IGN] détection d'anomalie [Termes descripteurs IGN] méthode de Monte-Carlo [Termes descripteurs IGN] Pékin (Chine) [Termes descripteurs IGN] planification urbaine [Termes descripteurs IGN] réseau de contraintes [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] sécurité publique [Termes descripteurs IGN] trafic routier [Termes descripteurs IGN] trajectoire [Termes descripteurs IGN] trou noir [Termes descripteurs IGN] voisinage (topologie) [Termes descripteurs IGN] volcan [Termes descripteurs IGN] zone urbaine Résumé : (auteur) Urban black holes and volcanoes are typical traffic anomalies that are useful for optimizing urban planning and maintaining public safety. It is still challenging to detect arbitrarily shaped urban black holes and volcanoes considering the network constraints with less prior knowledge. This study models urban black holes and volcanoes as bivariate spatial clusters and develops a network-constrained bivariate clustering method for detecting statistically significant urban black holes and volcanoes with irregular shapes. First, an edge-expansion strategy is proposed to construct the network-constrained neighborhoods without the time-consuming calculation of the network distance between each pair of objects. Then, a network-constrained spatial scan statistic is constructed to detect urban black holes and volcanoes, and a multidirectional optimization method is developed to identify arbitrarily shaped urban black holes and volcanoes. Finally, the statistical significance of multiscale urban black holes and volcanoes is evaluated using Monte Carlo simulation. The proposed method is compared with three state-of-the-art methods using both simulated data and Beijing taxicab spatial trajectory data. The comparison shows that the proposed method can detect urban black holes and volcanoes more accurately and completely and is useful for detecting spatiotemporal variations of traffic anomalies. Numéro de notice : A2020-511 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1720027 date de publication en ligne : 27/02/2020 En ligne : https://doi.org/10.1080/13658816.2020.1720027 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95665 [article]

An overview of clustering methods for geo-referenced time series: from one-way clustering to co- and tri-clustering / Xiaojing Wu in International journal of geographical information science IJGIS, vol 34 n° 9 (September 2020)  

Permalink

Mining regional patterns of land use with adaptive adjacent criteria / Xinmeng Tu in Cartography and Geographic Information Science, Vol 47 n° 5 (September 2020)  

Permalink

Precise extraction of citrus fruit trees from a Digital Surface Model using a unified strategy: detection, delineation, and clustering / Ali Ozgun Ok in Photogrammetric Engineering & Remote Sensing, PERS, vol 86 n° 9 (September 2020)  

Permalink

Exploration of OpenStreetMap missing built-up areas using twitter hierarchical clustering and deep learning in Mozambique / Hao Li in ISPRS Journal of photogrammetry and remote sensing, vol 166 (August 2020)  

Permalink

Reestimating a minimum acceptable geocoding hit rate for conducting a spatial analysis / Alvaro Briz-Redon in International journal of geographical information science IJGIS, vol 34 n° 7 (July 2020)  

Permalink

Unsupervised semantic and instance segmentation of forest point clouds / Di Wang in ISPRS Journal of photogrammetry and remote sensing, vol 165 (July 2020)  

Permalink

Extracting activity patterns from taxi trajectory data: a two-layer framework using spatio-temporal clustering, Bayesian probability and Monte Carlo simulation / Shuhui Gong in International journal of geographical information science IJGIS, vol 34 n° 6 (June 2020)  

Permalink

Hyperspectral classification with noisy label detection via superpixel-to-pixel weighting distance / Bing Tu in IEEE Transactions on geoscience and remote sensing, vol 58 n° 6 (June 2020)  

Permalink

Using GIS for disease mapping and clustering in Jeddah, Saudi Arabia / Abdulkader Murad in ISPRS International journal of geo-information, vol 9 n° 5 (May 2020)  

Permalink

A framework for extracting urban functional regions based on multiprototype word embeddings using points-of-interest data / Sheng Hu in Computers, Environment and Urban Systems, vol 80 (March 2020)  

Permalink