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]

Reliable image matching via photometric and geometric constraints structured by Delaunay triangulation / San Jiang in ISPRS Journal of photogrammetry and remote sensing, vol 153 (July 2019)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 153 (July 2019) . - pp 1 - 2O Titre : Reliable image matching via photometric and geometric constraints structured by Delaunay triangulation Type de document : Article/Communication Auteurs : San Jiang, Auteur ; Wanshou Jiang, Auteur Année de publication : 2019 Article en page(s) : pp 1 - 2O Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes descripteurs IGN] appariement d'images [Termes descripteurs IGN] cohérence photométrique [Termes descripteurs IGN] contrainte d'objet [Termes descripteurs IGN] contrainte géométrique [Termes descripteurs IGN] processus d'analyse hiérarchisée [Termes descripteurs IGN] triangulation de Delaunay [Termes descripteurs IGN] valeur aberrante Résumé : (Auteur) Image matching is a basic task in the field of photogrammetry and remote sensing. By using the advantages of the Delaunay triangulation, this paper proposes a novel image matching method. First, neighboring structures of randomly distributed feature points are formed with the assistance of the Delaunay triangulation and its corresponding graph, and the image planes are simultaneously divided into patches of near-regular triangles. Second, two constraints, a photometric constraint and a geometric constraint, are implemented based on the constructed neighboring structures, which incorporate the hierarchical elimination and left-right checking strategies to deliver the influences of outliers on the decision of inliers and ensure the high precision of the final matches. The former utilizes a line descriptor as a second-order photometric constraint, and the latter adopts the spatial angular order (SAO) to achieve a geometric constraint for the calculation of dissimilarity scores between correspondences. In addition, with the constraints between triangles of the refined Delaunay triangulation and its corresponding graph, a match expansion is designed to exploit as many inliers as possible. Finally, a reliable image matching algorithm is proposed by sequentially executing the three constraints for outlier elimination and match expansion. Under comprehensive analysis and comparison with five state-of-the-art algorithms, the performance of the proposed method is verified by using both rigid and non-rigid datasets. The experimental results demonstrate that the Delaunay triangulation is sufficient to construct neighboring structures for the implementation of local photometric and geometric constraints, and the proposed method can achieve good performance in terms of the precision, recall and number of inliers, and provide reliable matches for stereo image pairs with both rigid and non-rigid transformations. Numéro de notice : A2019-260 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2019.04.006 date de publication en ligne : 01/05/2019 En ligne : https://doi.org/10.1016/j.isprsjprs.2019.04.006 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93073 [article]

Réservation

Réserver ce document

Exemplaires (3)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2019071	SL	Revue	Centre de documentation	Revues en salle	Disponible
081-2019073	DEP-RECP	Revue	MATIS	Dépôt en unité	Exclu du prêt
081-2019072	DEP-RECF	Revue	Nancy	Dépôt en unité	Exclu du prêt

Tile & merge: Distributed Delaunay triangulations for cloud computing / Laurent Caraffa (2019)  

Public Titre : Tile & merge: Distributed Delaunay triangulations for cloud computing Type de document : Article/Communication Auteurs : Laurent Caraffa , Auteur ; Pooran Memari, Auteur ; Murat Yirci, Auteur ; Mathieu Brédif , Auteur Congrès : Big Data 2019, IEEE International Conference on Big Data (9 - 12 décembre 2019; Los Angeles, Californie - Etats-Unis), Commanditaire Editeur : New-York : IEEE Computer society Année de publication : 2019 Importance : 7 p. Format : 21 x 30 cm Note générale : bibliographie preprint dans HAL https://hal.archives-ouvertes.fr/hal-02535021 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes descripteurs IGN] géomètrie algorithmique [Termes descripteurs IGN] informatique en nuage [Termes descripteurs IGN] jeu de données [Termes descripteurs IGN] mémoire d'ordinateur [Termes descripteurs IGN] reconstruction d'objet [Termes descripteurs IGN] semis de points [Termes descripteurs IGN] Spark [Termes descripteurs IGN] triangulation de Delaunay Résumé : (auteur) Motivated by the needs of a scalable out-of-core surface reconstruction algorithm available on the cloud, this paper addresses the computation of distributed Delaunay triangulations of massive point sets. The proposed algorithm takes as input a point cloud and first partitions it across multiple processing elements into tiles of relatively homogeneous point sizes. The distributed computation and communication between processing elements is orchestrated so that each one discovers the Delaunay neighbors of its input points within the theoretical overall Delaunay triangulation of all points and computes locally a partial view of this triangulation. This approach prevents memory limitations by never materializing the global triangulation. This efficiency is due to our proposed uncentralized model to represent, manage and locally construct the triangulation corresponding to each tile. The point set is first partitioned into non-overlapping tiles, then we construct within each tile the Delaunay triangulation of the local points and a minimal set of replicated foreign points in order to capture the simplices spanning multiple tiles. Inspired by the star splaying approach for Delaunay triangulation computation/repair, communication is limited to exchanging points of potential Delaunay neighbors across tiles. Therefore, our method is guaranteed to reconstruct, within each tile, a triangulation that contains the star of its local points, as though it were computed within the Delaunay triangulation of all points. The proposed algorithm is implemented with Spark for the scheduling and C++ for the geometric computations. This allows both an optimal scheduling on multiple machines and efficient low-level computation. The results show the efficiency of our algorithm in terms of speedup and strong scaling on a classical Spark configuration with both synthetic and real use case datasets. Numéro de notice : C2019-033 Thématique : IMAGERIE/INFORMATIQUE/MATHEMATIQUE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1109/BigData47090.2019.9006534 date de publication en ligne : 24/02/2020 En ligne : https://doi.org/10.1109/BigData47090.2019.9006534 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95318

Road safety evaluation through automatic extraction of road horizontal alignments from Mobile LiDAR System and inductive reasoning based on a decision tree / José Antonio Martin-Jimenez in ISPRS Journal of photogrammetry and remote sensing, vol 146 (December 2018)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 146 (December 2018) . - pp 334 - 346 Titre : Road safety evaluation through automatic extraction of road horizontal alignments from Mobile LiDAR System and inductive reasoning based on a decision tree Type de document : Article/Communication Auteurs : José Antonio Martin-Jimenez, Auteur ; Santiago Zazo, Auteur ; José Juan Arranz Justel, Auteur ; et al., Auteur Année de publication : 2018 Article en page(s) : pp 334 - 346 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes descripteurs IGN] accident de la route [Termes descripteurs IGN] arbre de décision [Termes descripteurs IGN] cohérence géométrique [Termes descripteurs IGN] données GNSS [Termes descripteurs IGN] données lidar [Termes descripteurs IGN] données localisées 3D [Termes descripteurs IGN] Espagne [Termes descripteurs IGN] extraction du réseau routier [Termes descripteurs IGN] indice de risque [Termes descripteurs IGN] lidar mobile [Termes descripteurs IGN] raisonnement [Termes descripteurs IGN] sécurité routière [Termes descripteurs IGN] segmentation [Termes descripteurs IGN] semis de points [Termes descripteurs IGN] triangulation de Delaunay Résumé : (auteur) Safe roads are a necessity for any society because of the high social costs of traffic accidents. This challenge is addressed by a novel methodology that allows us to evaluate road safety from Mobile LiDAR System data, taking advantage of the road alignment due to its influence on the accident rate. Automation is obtained through an inductive reasoning process based on a decision tree that provides a potential risk assessment. To achieve this, a 3D point cloud is classified by an iterative and incremental algorithm based on a 2.5D and 3D Delaunay triangulation, which apply different algorithms sequentially. Next, an automatic extraction process of road horizontal alignment parameters is developed to obtain geometric consistency indexes, based on a joint triple stability criterion. Likewise, this work aims to provide a powerful and effective preventive and/or predictive tool for road safety inspections. The proposed methodology was implemented on three stretches of Spanish roads, each with different traffic conditions that represent the most common road types. The developed methodology was successfully validated through as-built road projects, which were considered as “ground truth.” Numéro de notice : A2018-541 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2018.10.004 date de publication en ligne : 21/10/2018 En ligne : https://doi.org/10.1016/j.isprsjprs.2018.10.004 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91565 [article]

Réservation

Réserver ce document

Exemplaires (3)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2018131	SL	Revue	Centre de documentation	Revues en salle	Disponible
081-2018133	DEP-EXM	Revue	MATIS	Dépôt en unité	Exclu du prêt
081-2018132	DEP-EAF	Revue	Nancy	Dépôt en unité	Exclu du prêt

Voronoi tessellation on the ellipsoidal earth for vector data / Christos Kastrisios in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 32 n° 7-8 (July - August 2018) . - pp 1541 - 1557 Titre : Voronoi tessellation on the ellipsoidal earth for vector data Type de document : Article/Communication Auteurs : Christos Kastrisios, Auteur ; Lysandros Tsoulos, Auteur Année de publication : 2018 Article en page(s) : pp 1541 - 1557 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géodésie [Termes descripteurs IGN] diagramme de Voronoï [Termes descripteurs IGN] données vectorielles [Termes descripteurs IGN] ellipsoïde (géodésie) [Termes descripteurs IGN] entité géographique [Termes descripteurs IGN] frontière maritime [Termes descripteurs IGN] géomètrie algorithmique [Termes descripteurs IGN] Python (langage de programmation) [Termes descripteurs IGN] tessellation [Termes descripteurs IGN] triangulation de Delaunay Résumé : (auteur) Voronoi tessellation, and its dual the Delaunay triangulation, provide a cohesive framework for the study and interpretation of phenomena of geographical space in two and three dimensions. The planar and spherical solutions introduce errors in the positional accuracy of both Voronoi vertices and Voronoi edges due to errors in distance computations and the path connecting two locations with planar lines or great circle arcs instead of geodesics. For most geospatial applications the introduction of the above errors is insignificant or tolerable. However, for applications where the accuracy is of utmost importance, the ellipsoidal model of the Earth must be used. Characteristically, the introduction of any positional error in the delimitation of maritime zones and boundaries results in increased maritime space for one state at the expense of another. This is a situation that may, among others, have a serious impact on the financial activities and the relations of the states concerned. In the context of previous work on maritime delimitation we show that the Voronoi diagram constitutes the ideal solution for the development of an automated methodology addressing the problem in its entirety. Due to lack of a vector methodology for the generation of Voronoi diagram on the ellipsoid, the aforementioned solution was constrained by the accuracy of existing approaches. In order to fill this gap, in this paper we deal with the inherent attributes of the ellipsoidal model of the Earth, e.g. the fact that geodesics are open lines, and we elaborate on a methodology for the generation of the Voronoi diagram on the ellipsoid for a set of points in vector format. The resulting Voronoi diagram consists of vertices with positional accuracy that is only bounded by the user needs and edges that are comprised of geodesics densified with vertices equidistant to their generators. Finally, we present the implementation of the proposed algorithm in the Python programming language and the results of two case studies, one on the formation of closest service areas and one on maritime boundaries delimitation, with the positional accuracy set to 1 cm. Numéro de notice : A2018-282 Thématique : POSITIONNEMENT Nature : Article DOI : 10.1080/13658816.2018.1434890 date de publication en ligne : 15/02/2018 En ligne : https://doi.org/10.1080/13658816.2018.1434890 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90366 [article]

Réservation

Réserver ce document

Exemplaires (1)

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

Optimization of deformation monitoring networks using finite element strain analysis / M. Amin Alizadeh-Khameneh in Journal of applied geodesy, vol 12 n° 2 (April 2018)  

Permalink

A typification method for linear pattern in urban building generalisation / Xianyong Gong in Geocarto international, vol 33 n° 2 (February 2018)  

Permalink

An automated displaced proportional circle map using Delaunay triangulation and an algorithm for node overlap removal / David Lamb in Cartographica, vol 52 n° 4 (Winter 2017)  

Permalink

On visibility and empty-region graphs / Sagi Katz in Computers and graphics, vol 66 (August 2017)  

Permalink

Extracting 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)  

Permalink

The analysis and measurement of building patterns using texton co-occurrence matrices / Wenhao Yu in International journal of geographical information science IJGIS, vol 31 n° 5-6 (May-June 2017)  

Permalink

Efficient edge-aware surface mesh reconstruction for urban scenes / András Bódis-Szomorú in Computer Vision and image understanding, vol 157 (April 2017)  

Permalink

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)  

Permalink

Building displacement based on the topological structure / Yageng Sun in Cartographic journal (the), Vol 53 n° 3 (August 2016)  

Permalink

Arrangements 2D pour la cartographie de l’espace public et des transports / Murat Yirci (2016)  

Permalink