Centre dedocumentation
scientifique

A review of techniques for 3D reconstruction of indoor environments / Zhizhong Kang in ISPRS International journal of geo-information, vol 9 n° 5 (May 2020)  

Public [article]  inISPRS International journal of geo-information > vol 9 n° 5 (May 2020) . - 31 p. Titre : A review of techniques for 3D reconstruction of indoor environments Type de document : Article/Communication Auteurs : Zhizhong Kang, Auteur ; Juntao Yang, Auteur ; Zhou Yang, Auteur ; Sai Cheng, Auteur Année de publication : 2020 Article en page(s) : 31 p. Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques [Termes descripteurs IGN] apprentissage profond [Termes descripteurs IGN] classification par réseau neuronal convolutif [Termes descripteurs IGN] espace intérieur [Termes descripteurs IGN] image RVB [Termes descripteurs IGN] indoorGML [Termes descripteurs IGN] jeu de données localisées [Termes descripteurs IGN] modèle géométrique [Termes descripteurs IGN] modèle sémantique de données [Termes descripteurs IGN] modèle topologique de données [Termes descripteurs IGN] reconstruction 3D [Termes descripteurs IGN] Simultaneous Localisation And Mapping Résumé : (auteur) Indoor environment model reconstruction has emerged as a significant and challenging task in terms of the provision of a semantically rich and geometrically accurate indoor model. Recently, there has been an increasing amount of research related to indoor environment reconstruction. Therefore, this paper reviews the state-of-the-art techniques for the three-dimensional (3D) reconstruction of indoor environments. First, some of the available benchmark datasets for 3D reconstruction of indoor environments are described and discussed. Then, data collection of 3D indoor spaces is briefly summarized. Furthermore, an overview of the geometric, semantic, and topological reconstruction of the indoor environment is presented, where the existing methodologies, advantages, and disadvantages of these three reconstruction types are analyzed and summarized. Finally, future research directions, including technique challenges and trends, are discussed for the purpose of promoting future research interest. It can be concluded that most of the existing indoor environment reconstruction methods are based on the strong Manhattan assumption, which may not be true in a real indoor environment, hence limiting the effectiveness and robustness of existing indoor environment reconstruction methods. Moreover, based on the hierarchical pyramid structures and the learnable parameters of deep-learning architectures, multi-task collaborative schemes to share parameters and to jointly optimize each other using redundant and complementary information from different perspectives show their potential for the 3D reconstruction of indoor environments. Furthermore, indoor–outdoor space seamless integration to achieve a full representation of both interior and exterior buildings is also heavily in demand. Numéro de notice : A2020-299 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/ijgi9050330 date de publication en ligne : 19/05/2020 En ligne : https://doi.org/10.3390/ijgi9050330 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95139 [article]

A space-time varying graph for modelling places and events in a network / Ikechukwu Maduako in International journal of geographical information science IJGIS, vol 33 n° 10 (October 2019)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 33 n° 10 (October 2019) . - pp 1915 - 1935 Titre : A space-time varying graph for modelling places and events in a network Type de document : Article/Communication Auteurs : Ikechukwu Maduako, Auteur ; Monica Wachowicz, Auteur Année de publication : 2019 Article en page(s) : pp 1915 - 1935 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] accident de la route [Termes descripteurs IGN] analyse des risques [Termes descripteurs IGN] analyse spatio-temporelle [Termes descripteurs IGN] connexité (graphes) [Termes descripteurs IGN] graphe [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] représentation spatiale [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] système d'information géographique [Termes descripteurs IGN] voisinage (topologie) Résumé : (auteur) Modelling topological relationships between places and events is challenging especially because these relationships are dynamic, and their evolutionary analysis relies on the explanatory power of representing their interactions across different temporal resolutions. In this paper, we introduce the Space-Time Varying Graph (STVG) based on the whole graph approach that combines directed and bipartite subgraphs with a time-tree for representing the complex interaction between places and events across time. We demonstrate how the proposed STVG can be exploited to identify and extract evolutionary patterns of traffic accidents using graph metrics, ad-hoc graph queries and clustering algorithms. The results reveal evolutionary patterns that uncover the places with high incidence of accidents over different time resolutions, reveal the main reasons why the traffic accidents have occurred, and disclose evolving communities of densely connected traffic accidents over time. Numéro de notice : A2019-393 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2019.1603386 date de publication en ligne : 17/04/2019 En ligne : https://doi.org/10.1080/13658816.2019.1603386 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93497 [article]

Computing and querying strict, approximate, and metrically refined topological relations in linked geographic data / Blake Regalia in Transactions in GIS, vol 23 n° 3 (June 2019)  

Public [article]  inTransactions in GIS > vol 23 n° 3 (June 2019) . - pp 601 - 619 Titre : Computing and querying strict, approximate, and metrically refined topological relations in linked geographic data Type de document : Article/Communication Auteurs : Blake Regalia, Auteur ; Krzysztof Janowicz, Auteur ; Grant McKenzie, Auteur Année de publication : 2019 Article en page(s) : pp 601 - 619 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes descripteurs IGN] DBpedia [Termes descripteurs IGN] données localisées [Termes descripteurs IGN] entité géographique [Termes descripteurs IGN] graphe [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] Web des données Résumé : (Auteur) Geographic entities and the information associated with them play a major role in Web‐scale knowledge graphs such as Linked Data. Interestingly, almost all major datasets represent places and even entire regions as point coordinates. There are two key reasons for this. First, complex geometries are difficult to store and query using the current Linked Data technology stack to a degree where many queries take minutes to return or will simply time out. Second, the absence of complex geometries confirms a common suspicion among GIScientists, namely that for many everyday queries place‐based relational knowledge is more relevant than raw geometries alone. To give an illustrative example, the statement that the White House is in Washington, DC is more important for gaining an understating of the city than the exact geometries of both entities. This does not imply that complex geometries are unimportant but that (topological) relations should also be extracted from them. As Egenhofer and Mark (1995b) put it in their landmark paper on naive geography, topology matters, metric refines. In this work we demonstrate how to compute and utilize strict, approximate, and metrically refined topological relations between several geographic feature types in DBpedia and compare our results to approaches that compute result sets for topological queries on the fly. Numéro de notice : A2019-256 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12548 date de publication en ligne : 26/06/2019 En ligne : https://doi.org/10.1111/tgis.12548 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93014 [article]

A hidden Markov model for matching spatial networks / Benoit Costes in Journal of Spatial Information Science (JoSIS), n° 18 (2019)  

Public [article]  inJournal of Spatial Information Science (JoSIS) > n° 18 (2019) . - pp 57 - 89 Titre : A hidden Markov model for matching spatial networks Type de document : Article/Communication Auteurs : Benoit Costes , Auteur ; Julien Perret , Auteur Année de publication : 2019 Projets : SODUCO / Perret, Julien Article en page(s) : pp 57 - 89 Note générale : bibliographie We thank the entire GeoHistoricalData team for their combined efforts in co-constructing open geohistorical data, Romain Reuillon, Mathieu Leclaire and the entire OpenMOLE team for their assistance in the exploration and calibration of the models used in the article. We also thank the anonymous reviewers for their feedback and gratefully acknowledge the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-18-CE38-0013 (SoDUCo project). Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] analyse de sensibilité [Termes descripteurs IGN] appariement de réseaux [Termes descripteurs IGN] Hidden Markov Model (HMM) [Termes descripteurs IGN] modèle topologique réseau [Termes descripteurs IGN] réseau ferroviaire [Termes descripteurs IGN] réseau fluvial [Termes descripteurs IGN] réseau routier Résumé : (auteur) Datasets of the same geographic space at different scales and temporalities are increasingly abundant, paving the way for new scientific research. These datasets require data integration, which implies linking homologous entities in a process called data matching that remains a challenging task, despite a quite substantial literature, because of data imperfections and heterogeneities. In this paper, we present an approach for matching spatial networks based on a hidden Markov model (HMM) that takes full benefit of the underlying topology of networks. The approach is assessed using four heterogeneous datasets (streets, roads, railway, and hydrographic networks), showing that the HMM algorithm is robust in regards to data heterogeneities and imperfections (geometric discrepancies and differences in level of details) and adaptable to match any type of spatial networks. It also has the advantage of requiring no mandatory parameters, as proven by a sensitivity exploration, except a distance threshold that filters potential matching candidates in order to speed-up the process. Finally, a comparison with a commonly cited approach highlights good matching accuracy and completeness. Numéro de notice : A2019-274 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.5311/JOSIS.2019.18.489 date de publication en ligne : 01/07/2019 En ligne : https://doi.org/10.5311/JOSIS.2019.18.489 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95337 [article]

Query rewriting for semantic query optimization in spatial databases / Eduardo Mella in Geoinformatica [en ligne], vol 23 n° 1 (January 2019)  

Public [article]  inGeoinformatica [en ligne] > vol 23 n° 1 (January 2019) . - pp 79 - 104 Titre : Query rewriting for semantic query optimization in spatial databases Type de document : Article/Communication Auteurs : Eduardo Mella, Auteur ; M. Andrea Rodríguez, Auteur ; Loreto Bravo, Auteur ; Diego Gatica, Auteur Année de publication : 2019 Article en page(s) : pp 79 - 104 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes descripteurs IGN] contrainte d'intégrité [Termes descripteurs IGN] jointure spatiale [Termes descripteurs IGN] optimisation (mathématiques) [Termes descripteurs IGN] programmation par contraintes [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] requête (informatique) [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] système de gestion de bases de données orientées objet Résumé : (auteur) Query processing is an important challenge for spatial databases due to the use of complex data types that represent spatial attributes. In particular, due to the cost of spatial joins, several optimization algorithms based on indexing structures exist. The work in this paper proposes a strategy for semantic query optimization of spatial join queries. The strategy detects queries with empty results and rewrites queries to eliminate unnecessary spatial joins or to replace spatial by thematic joins. This is done automatically by analyzing the semantics imposed by the database schema through topological dependencies and topological referential integrity constraints. In this way, the strategy comes to complement current state-of-art algorithms for processing spatial join queries. The experimental evaluation with real data sets shows that the optimization strategy can achieve a decrease in the time cost of a join query using indexing structures in a spatial database management system (SDBMS). Numéro de notice : A2019-224 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-018-00335-w date de publication en ligne : 04/01/2019 En ligne : http://dx.doi.org/10.1007/s10707-018-00335-w Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92623 [article]

Simultaneous chain-forming and generalization of road networks / Susanne Wenzel in Photogrammetric Engineering & Remote Sensing, PERS, vol 85 n° 1 (January 2019)  

Permalink

An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model / Rosen Ivanov in International journal of geographical information science IJGIS, vol 32 n° 11-12 (November - December 2018)  

Permalink

A topology-preserving polygon rasterization algorithm / Chen Zhou in Cartography and Geographic Information Science, Vol 45 n° 6 (November 2018)  

Permalink

Compactly representing massive terrain models as TINs in CityGML / Kavisha Kumar in Transactions in GIS, vol 22 n° 5 (October 2018)  

Permalink

Weighted simplicial complex reconstruction from mobile laser scanning using sensor topology / Stéphane Guinard in Revue Française de Photogrammétrie et de Télédétection, n° 217-218 (juin - septembre 2018)

Permalink

Classification of topological relations between spatial objects in two‐dimensional space within the dimensionally extended 9‐intersection model / Jingwei Shen in Transactions in GIS, vol 22 n° 2 (April 2018)  

Permalink

A spatio-temporal scenario model for emergency decision / Cheng Liu in Geoinformatica [en ligne], vol 22 n° 2 (April 2018)  

Permalink

Interpreting the fuzzy semantics of natural-language spatial relation terms with the fuzzy random forest algorithm / Xiaonan Wang in ISPRS International journal of geo-information, vol 7 n° 2 (February 2018)  

Permalink

Development of a Protocol to Convert and Manage Underground Infrastructure Maps into Geographic Information Systems (GIS) Format / Guillemette Fonteix (2018) 

Permalink

Object-based classification of terrestrial laser scanning point clouds for landslide monitoring / Andreas Mayr in Photogrammetric record, vol 32 n° 160 (December 2017)  

Permalink