Centre dedocumentation
scientifique

Recognizing linear building patterns in topographic data by using two new indices based on Delaunay triangulation / Xianjin He in ISPRS International journal of geo-information, vol 9 n° 4 (April 2020)  

Public [article]  inISPRS International journal of geo-information > vol 9 n° 4 (April 2020) . - 14 p. Titre : Recognizing linear building patterns in topographic data by using two new indices based on Delaunay triangulation Type de document : Article/Communication Auteurs : Xianjin He, Auteur ; Min Deng, Auteur Année de publication : 2020 Article en page(s) : 14 p. Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] adjacence [Termes descripteurs IGN] direction [Termes descripteurs IGN] discontinuité [Termes descripteurs IGN] données topographiques [Termes descripteurs IGN] modèle linéaire [Termes descripteurs IGN] modèle numérique du bâti [Termes descripteurs IGN] reconnaissance de formes [Termes descripteurs IGN] segmentation [Termes descripteurs IGN] triangulation de Delaunay [Termes descripteurs IGN] voisinage (topologie) Résumé : (auteur) Building pattern recognition is fundamental to a wide range of downstream applications, such as urban landscape evaluation, social analyses, and map generalization. Although many studies have been conducted, there is still a lack of satisfactory results, due to the imprecision of the relative direction model of any two adjacent buildings and the ineffective extraction methods. This study aims to provide an alternative for quantifying the direction and the spatial continuity of any two buildings on the basis of the Delaunay triangulation for the recognition of linear building patterns. First, constrained Delaunay triangulations (CDTs) are created for all buildings within each block and every two adjacent buildings. Then, the spatial continuity index (SCI), the direction index (DI), and other spatial relations (e.g., distance) of every two adjacent buildings are derived using the CDT. Finally, the building block is modelled as a graph based on derived matrices, and a graph segmentation approach is proposed to extract linear building patterns. In the segmentation process, the edges of the graph are removed first, according to the global thresholds of the SCI and distance, and are subsequently subdivided into subgraphs on direction rules. The proposed method is tested using three datasets. The experimental results suggest that the proposed method can recognize both collinear and curvilinear building patterns, given that the correctness values are all above 92% for the three study areas. The results also demonstrate that the novel SCI can effectively filter many insignificant neighbor relationships in the graph segmentation process. It is noteworthy that the proposed DI is capable of measuring building relative directions accurately and works efficiently in linear building pattern extraction. Numéro de notice : A2020-267 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/ijgi9040231 date de publication en ligne : 09/04/2020 En ligne : https://doi.org/10.3390/ijgi9040231 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95031 [article]

Recognizing building groups for generalization : a comparative study / Min Deng in Cartography and Geographic Information Science, Vol 45 n° 3 (May 2018)  

Public [article]  inCartography and Geographic Information Science > Vol 45 n° 3 (May 2018) . - pp 187 - 204 Titre : Recognizing building groups for generalization : a comparative study Type de document : Article/Communication Auteurs : Min Deng, Auteur ; Jianbo Tang, Auteur ; Qiliang Liu, Auteur ; Fang Wu, Auteur Année de publication : 2018 Article en page(s) : pp 187 - 204 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de généralisation [Termes descripteurs IGN] analyse comparative [Termes descripteurs IGN] Chine [Termes descripteurs IGN] contrainte géométrique [Termes descripteurs IGN] généralisation cartographique automatisée [Termes descripteurs IGN] généralisation du bâti [Vedettes matières IGN] Généralisation Résumé : (Auteur) Recognition of building groups is a critical step in building generalization. To find building groups, various approaches have been developed based on the principles of grouping (or the Gestalt laws of grouping), and the effectiveness of these approaches needs to be evaluated. This study presents a comparative analysis of nine typical such approaches, including three approaches that only consider proximity principle and six approaches that consider multiple grouping principles. Real-life dataset at 1:5000, 1:10,000, and 1:50,000 scales provided by National Geomatics Center of China is used to evaluate the performance of these approaches. Buildings at smaller scales are used to construct the benchmarks to test the grouping results at larger scales, and the adjusted Rand index is adopted to indicate the accuracy of the detected groups. Significant tests (Friedman test and Wilcoxon signed-rank test) are also performed to provide both the overall and pairwise comparisons of these approaches. The results show that (1) the average accuracy of most existing approaches is between 0.3 and 0.5, and the performances of these approaches are significantly different; (2) when only proximity is considered, the buffer analysis approach performs significantly better than other approaches; (3) when multiple grouping principles are considered, the local constraint-based approach usually performs better than other approaches; (4) existing approaches that consider similarity and/or continuity seldom improve the performance of building grouping. Numéro de notice : A2018-129 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/15230406.2017.1302821 date de publication en ligne : 24/03/2017 En ligne : https://doi.org/10.1080/15230406.2017.1302821 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89657 [article]

Réservation

Réserver ce document

Exemplaires (1)

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

A spatial anomaly points and regions detection method using multi-constrained graphs and local density / Yan Shi in Transactions in GIS, vol 21 n° 2 (April 2017)  

Public [article]  inTransactions in GIS > vol 21 n° 2 (April 2017) . - pp 376 – 405 Titre : A spatial anomaly points and regions detection method using multi-constrained graphs and local density Type de document : Article/Communication Auteurs : Yan Shi, Auteur ; Min Deng, Auteur ; Xuexi Yang, Auteur ; Qiliang Liu, Auteur Année de publication : 2017 Article en page(s) : pp 376 – 405 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] algorithme SAPRD [Termes descripteurs IGN] analyse de données [Termes descripteurs IGN] analyse spatiale [Termes descripteurs IGN] attribut sémantique [Termes descripteurs IGN] cartographie statistique [Termes descripteurs IGN] détection d'anomalie [Termes descripteurs IGN] graphe [Termes descripteurs IGN] interpolation spatiale [Termes descripteurs IGN] triangulation de Delaunay Résumé : (auteur) Spatial anomalies may be single points or small regions whose non-spatial attribute values are significantly inconsistent with those of their spatial neighborhoods. In this article, a Spatial Anomaly Points and Regions Detection method using multi-constrained graphs and local density (SAPRD for short) is proposed. The SAPRD algorithm first models spatial proximity relationships between spatial entities by constructing a Delaunay triangulation, the edges of which provide certain statistical characteristics. By considering the difference in non-spatial attributes of adjacent spatial entities, two levels of non-spatial attribute distance constraints are imposed to improve the proximity graph. This produces a series of sub-graphs, and those with very few entities are identified as candidate spatial anomalies. Moreover, the spatial anomaly degree of each entity is calculated based on the local density. A spatial interpolation surface of the spatial anomaly degree is generated using the inverse distance weight, and this is utilized to reveal potential spatial anomalies and reflect their whole areal distribution. Experiments on both simulated and real-life spatial databases demonstrate the effectiveness and practicability of the SAPRD algorithm. Numéro de notice : A2017-167 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : http://dx.doi.org/10.1111/tgis.12208 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=84701 [article]

Modeling spatiotemporal topological relationships between moving object trajectories along road networks based on region connection calculus / Linbing Ma in Cartography and Geographic Information Science, Vol 43 n° 4 (September 2016)  

Public [article]  inCartography and Geographic Information Science > Vol 43 n° 4 (September 2016) . - pp 346 - 360 Titre : Modeling spatiotemporal topological relationships between moving object trajectories along road networks based on region connection calculus Type de document : Article/Communication Auteurs : Linbing Ma, Auteur ; Min Deng, Auteur ; Jing Wu, Auteur ; Qiliang Liu, Auteur Année de publication : 2016 Article en page(s) : pp 346 - 360 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes descripteurs IGN] Canton (Kouangtoung) [Termes descripteurs IGN] itinéraire [Termes descripteurs IGN] modèle conceptuel de données spatio-temporelles [Termes descripteurs IGN] objet mobile [Termes descripteurs IGN] relation binaire [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] segment de droite [Termes descripteurs IGN] véhicule automobile Mots-clés libres : region connection calculus Résumé : (Auteur) Considering the attempts to model spatiotemporal topological relationships between moving object trajectories, the conceptual and computational framework for moving objects along a road network has not received much attention. This paper aims to draw an improved model based on Region Connection Calculus (RCC) theory to represent the spatiotemporal topological relationships between moving object trajectories along road networks. This paper first uses a dimension reduction method based on a linear-reference transformation to model the moving object trajectories segments, and then defines new time–connection and space–connection relations between two trajectory segments. On this basis, the paper proposes an extension to the RCC-based spatiotemporal binary relationship set so that the combined semantics of the spatiotemporal predicates can be described completely. A case study was carried out using Floating Car Data in Guangzhou city. The computational results show that in a real application, the occurrence frequencies of the RCC-based binary relationships are distributed nonuniformly and the semantics of some binary relationships with the highest occurrence are coarse. Therefore, the partition of the spatiotemporal connection relations and the finer aspects of the spatiotemporal relationship model may require further research work. Numéro de notice : A2016-419 Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/15230406.2015.1088798 En ligne : https://doi.org/10.1080/15230406.2015.1088798 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81317 [article]

Réservation

Réserver ce document

Exemplaires (1)

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

Morphing linear features based on their entire structures / Min Deng in Transactions in GIS, vol 19 n° 5 (October 2015)  

Public [article]  inTransactions in GIS > vol 19 n° 5 (October 2015) . - pp 653 – 677 Titre : Morphing linear features based on their entire structures Type de document : Article/Communication Auteurs : Min Deng, Auteur ; Dongliang Peng, Auteur Année de publication : 2015 Article en page(s) : pp 653 – 677 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] algorithme de Douglas-Peucker [Termes descripteurs IGN] arbre-B [Termes descripteurs IGN] généralisation cartographique [Termes descripteurs IGN] interpolation linéaire [Termes descripteurs IGN] morphologie mathématique [Termes descripteurs IGN] polyligne [Termes descripteurs IGN] représentation cartographique [Termes descripteurs IGN] triangulation de Delaunay Résumé : (auteur) In this article, a new morphing method is proposed for two linear features at different scales, based on their entire structures (MLBES in abbreviation). First, the bend structures of the linear features are identified by using a constrained Delaunay triangulation (CDT in abbreviation) model and represented by binary bend-structure trees. By matching the independent bends represented by the bend-structure trees, corresponding independent bends are obtained. These corresponding independent bends are further used to match their child bends based on hierarchical bend structures so that corresponding bends are obtained. On this basis, the two linear features are split into pairs of corresponding subpolylines by the start and end points of the corresponding bends. Second, structures of the corresponding subpolylines are identified by the Douglas-Peucker algorithm and represented by binary line generalization trees (BLG-trees in abbreviation). The corresponding subpolylines are split into smaller corresponding subpolylines by matching the nodes of the BLG-trees. Third, the corresponding points are identified by using the linear interpolation algorithm for every pair of corresponding subpolylines. Finally, straight-line trajectories are employed to generate a family of intermediate-scale linear features. By comparison with other methods, it is found that MLBES is accurate and efficient. Numéro de notice : A2015-682 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : http://dx.doi.org/10.1111/tgis.12111 Format de la ressource électronique : Url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=78313 [article]

Multi-level topological relations between spatial regions based upon topological invariants / Min Deng in Geoinformatica, vol 11 n° 2 (June - August 2007)

Permalink