Centre dedocumentation
scientifique

Layout graph model for semantic façade reconstruction using laser point clouds / Hongchao Fan in Geo-spatial Information Science, vol 24 n° 3 (October 2021)  

Public [article]  inGeo-spatial Information Science > vol 24 n° 3 (October 2021) . - pp 403 - 421 Titre : Layout graph model for semantic façade reconstruction using laser point clouds Type de document : Article/Communication Auteurs : Hongchao Fan, Auteur ; Yuefeng Wang, Auteur ; Jianya Gong, Auteur Année de publication : 2021 Article en page(s) : pp 403 - 421 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes IGN] algorithme du recuit simulé [Termes IGN] appariement de graphes [Termes IGN] données lidar [Termes IGN] données localisées 3D [Termes IGN] enrichissement sémantique [Termes IGN] façade [Termes IGN] processus stochastique [Termes IGN] reconstruction 3D du bâti Résumé : (auteur) Building façades can feature different patterns depending on the architectural style, functionality, and size of the buildings; therefore, reconstructing these façades can be complicated. In particular, when semantic façades are reconstructed from point cloud data, uneven point density and noise make it difficult to accurately determine the façade structure. When investigating façade layouts, Gestalt principles can be applied to cluster visually similar floors and façade elements, allowing for a more intuitive interpretation of façade structures. We propose a novel model for describing façade structures, namely the layout graph model, which involves a compound graph with two structure levels. In the proposed model, similar façade elements such as windows are first grouped into clusters. A down-layout graph is then formed using this cluster as a node and by combining intra- and inter-cluster spacings as the edges. Second, a top-layout graph is formed by clustering similar floors. By extracting relevant parameters from this model, we transform semantic façade reconstruction to an optimization strategy using simulated annealing coupled with Gibbs sampling. Multiple façade point cloud data with different features were selected from three datasets to verify the effectiveness of this method. The experimental results show that the proposed method achieves an average accuracy of 86.35%. Owing to its flexibility, the proposed layout graph model can deal with different types of façades and qualities of point cloud data, enabling a more robust and accurate reconstruction of façade models. Numéro de notice : A2021-724 Affiliation des auteurs : non IGN Thématique : IMAGERIE/INFORMATIQUE Nature : Article DOI : 10.1080/10095020.2021.1922316 Date de publication en ligne : 14/05/2021 En ligne : https://doi.org/10.1080/10095020.2021.1922316 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=98644 [article]

An anchor-based graph method for detecting and classifying indoor objects from cluttered 3D point clouds / Fei Su in ISPRS Journal of photogrammetry and remote sensing, vol 172 (February 2021)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 172 (February 2021) . - pp 114 - 131 Titre : An anchor-based graph method for detecting and classifying indoor objects from cluttered 3D point clouds Type de document : Article/Communication Auteurs : Fei Su, Auteur ; Haihong Zhu, Auteur ; Taoyi Chen, Auteur Année de publication : 2021 Article en page(s) : pp 114 - 131 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes IGN] adjacence [Termes IGN] appariement de graphes [Termes IGN] arc [Termes IGN] bloc d'ancrage [Termes IGN] classification orientée objet [Termes IGN] données lidar [Termes IGN] données localisées 3D [Termes IGN] jeu de données localisées [Termes IGN] méthode du maximum de vraisemblance (estimation) [Termes IGN] noeud [Termes IGN] objet 3D [Termes IGN] orientation [Termes IGN] positionnement en intérieur [Termes IGN] semis de points Résumé : (auteur) Most of the existing 3D indoor object classification methods have shown impressive achievements on the assumption that all objects are oriented in the upward direction with respect to the ground. To release this assumption, great effort has been made to handle arbitrarily oriented objects in terrestrial laser scanning (TLS) point clouds. As one of the most promising solutions, anchor-based graphs can be used to classify freely oriented objects. However, this approach suffers from missing anchor detection since valid detection relies heavily on the completeness of an anchor’s point clouds and is sensitive to missing data. This paper presents an anchor-based graph method to detect and classify arbitrarily oriented indoor objects. The anchors of each object are extracted by the structurally adjacent relationship among parts instead of the parts’ geometric metrics. In the case of adjacency, an anchor can be correctly extracted even with missing parts since the adjacency between an anchor and other parts is retained irrespective of the area extent of the considered parts. The best graph matching is achieved by finding the optimal corresponding node-pairs in a super-graph with fully connecting nodes based on maximum likelihood. The performances of the proposed method are evaluated with three indicators (object precision, object recall and object F1-score) in seven datasets. The experimental tests demonstrate the effectiveness of dealing with TLS point clouds, RGBD point clouds and Panorama RGBD point clouds, resulting in performance scores of approximately 0.8 for object precision and recall and over 0.9 for chair precision and table recall. Numéro de notice : A2021-087 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2020.12.007 Date de publication en ligne : 29/12/2020 En ligne : https://doi.org/10.1016/j.isprsjprs.2020.12.007 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96852 [article]

Réservation

Réserver ce document

Exemplaires (2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2021021	SL	Revue	Centre de documentation	Revues en salle	Disponible
081-2021022	DEP-RECF	Revue	Nancy	Bibliothèque Nancy IFN	Disponible

Image matching from handcrafted to deep features: A survey / Jiayi Ma in International journal of computer vision, vol 29 n° 1 (January 2021)  

Public [article]  inInternational journal of computer vision > vol 29 n° 1 (January 2021) . - pp 23 - 79 Titre : Image matching from handcrafted to deep features: A survey Type de document : Article/Communication Auteurs : Jiayi Ma, Auteur ; Xingyu Jiang, Auteur ; Aoxiang Fan, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 23 - 79 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes IGN] appariement d'images [Termes IGN] appariement de graphes [Termes IGN] apprentissage profond [Termes IGN] classification par réseau neuronal convolutif [Termes IGN] extraction de traits caractéristiques [Termes IGN] lissage de courbe [Termes IGN] recalage d'image Résumé : (auteur) As a fundamental and critical task in various visual applications, image matching can identify then correspond the same or similar structure/content from two or more images. Over the past decades, growing amount and diversity of methods have been proposed for image matching, particularly with the development of deep learning techniques over the recent years. However, it may leave several open questions about which method would be a suitable choice for specific applications with respect to different scenarios and task requirements and how to design better image matching methods with superior performance in accuracy, robustness and efficiency. This encourages us to conduct a comprehensive and systematic review and analysis for those classical and latest techniques. Following the feature-based image matching pipeline, we first introduce feature detection, description, and matching techniques from handcrafted methods to trainable ones and provide an analysis of the development of these methods in theory and practice. Secondly, we briefly introduce several typical image matching-based applications for a comprehensive understanding of the significance of image matching. In addition, we also provide a comprehensive and objective comparison of these classical and latest techniques through extensive experiments on representative datasets. Finally, we conclude with the current status of image matching technologies and deliver insightful discussions and prospects for future works. This survey can serve as a reference for (but not limited to) researchers and engineers in image matching and related fields. Numéro de notice : A2021-131 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s11263-020-01359-2 Date de publication en ligne : 04/08/2020 En ligne : https://doi.org/https://doi.org/10.1007/s11263-020-01359-2 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96967 [article]

Road network simplification for location-based services / Abdeltawab M. Hendawi in Geoinformatica [en ligne], vol 24 n° 4 (October 2020)  

Public [article]  inGeoinformatica [en ligne] > vol 24 n° 4 (October 2020) . - pp 801 - 826 Titre : Road network simplification for location-based services Type de document : Article/Communication Auteurs : Abdeltawab M. Hendawi, Auteur ; John A. Stankovic, Auteur ; Ayman Taha, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 801 - 826 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme de Douglas-Peucker [Termes IGN] appariement de cartes [Termes IGN] appariement de données localisées [Termes IGN] appariement de graphes [Termes IGN] carte routière [Termes IGN] compression de données [Termes IGN] modèle de Markov caché [Termes IGN] réseau routier [Termes IGN] service fondé sur la position [Termes IGN] simplification de contour [Termes IGN] stockage de données [Vedettes matières IGN] Généralisation Résumé : (Auteur) Road-network data compression or simplification reduces the size of the network to occupy less storage with the aim to fit small form-factor routing devices, mobile devices, or embedded systems. Simplification (a) reduces the storage cost of memory and disks, and (b) reduces the I/O and communication overhead. There are several road network compression techniques proposed in the literature. These techniques are evaluated by their compression ratios. However, none of these techniques takes into consideration the possibility that the generated compressed data can be used directly in Map-matching operation which is an essential component for all location-aware services. Map-matching matches a measured latitude and longitude of an object to an edge in the road network graph. In this paper, we propose a novel simplification technique, named COMA, that (1) significantly reduces the size of a given road network graph, (2) achieves high map-matching quality on the simplified graph, and (3) enables the generated compressed road network graph to be used directly in map-matching and location-based applications without a need to decompress it beforehand. COMA smartly deletes those nodes and edges that will not affect the graph connectivity nor causing much of ambiguity in the map-matching of objects’ location. COMA employs a controllable parameter; termed a conflict factor C, whereby location aware services can trade the compression gain with map-matching accuracy at varying granularity. We show that the time complexity of our COMA algorithm is O(|N|log|N|). Intensive experimental evaluation based on a real implementation and data demonstrates that COMA can achieve about a 75% compression-ratio while preserving high map-matching quality. Road Network, Simplification, Compression, Spatial, Location, Performance, Accuracy, Efficiency, Scalability. Numéro de notice : A2020-495 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00406-x Date de publication en ligne : 01/05/2020 En ligne : https://doi.org/10.1007/s10707-020-00406-x Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96115 [article]

Image processing applications in object detection and graph matching: from Matlab development to GPU framework / Beibei Cui (2020)  

Public Titre : Image processing applications in object detection and graph matching: from Matlab development to GPU framework Type de document : Thèse/HDR Auteurs : Beibei Cui, Auteur ; Jean-Charles Créput, Directeur de thèse Editeur : Dijon : Université Bourgogne Franche-Comté UBFC Année de publication : 2020 Importance : 137 p. Format : 21 x 30 cm Note générale : bibliographie Thèse de Doctorat de l'Université Bourgogne Franche-Comté préparée à l'Université de Technologie de Belfort-Montbéliard, Informatique Langues : Français (fre) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes IGN] appariement de graphes [Termes IGN] détection d'objet [Termes IGN] entropie [Termes IGN] extraction de traits caractéristiques [Termes IGN] graphe planaire [Termes IGN] Matlab [Termes IGN] ondelette [Termes IGN] processeur graphique [Termes IGN] Ransac (algorithme) [Termes IGN] reconnaissance de formes Index. décimale : THESE Thèses et HDR Résumé : (auteur) Automatically finding correspondences between object features in images is of main interest for several applications, as object detection and tracking, flow velocity estimation, identification, registration, and many derived tasks. In this thesis, we address feature correspondence within the general framework of graph matching optimization and with the principal aim to contribute, at a final step, to the design of new and parallel algorithms and their implementation on GPU (Graphics Processing Unit) systems. Graph matching problems can have many declinations, depending on the assumptions of the application at hand. We observed a gap between applications based on local cost objective functions, and those applications with higher-order cost functions, that evaluate similarity between edges of the graphs, or hyperedges when considering hypergraphs. The former class provides convolution-based algorithms already having parallel GPU implementations. Whereas, the latter class puts the emphasis on geometric inter-feature relationships, transforming the correspondence problem to a purely geometric problem stated in a high dimensional space, generally modeled as an integer quadratic programming, for which we did not find GPU implementations available yet.Two complementary approaches were adopted in order to contribute to addressing higher-order geometric graph matching on GPU. Firstly, we study different declinations of feature correspondence problems by the use of the Matlab platform, in order to reuse and provide state-of-the-art solution methods, as well as experimental protocols and input data necessary for a GPU platform with evaluation and comparison tools against existing sequential algorithms, most of the time developed in Matlab framework. Then, the first part of this work concerns three contributions, respectively, to background and frame difference application, to feature extraction problem from images for local correspondences, and to the general graph matching problem, all based on the combination of methods derived from Matlab environment. Secondly, and based on the results of Matlab developments, we propose a new GPU framework written in CUDA C++ specifically dedicated to geometric graph matching but providing new parallel algorithms, with lower computational complexity, as the self-organizing map in the plane, derived parallel clustering algorithms, and distributed local search method. These parallel algorithms are then evaluated and compared to the state-of-the-art methods available for graph matching and following the same experimental protocol. This GPU platform constitutes our final and main proposal to contribute to bridging the gap between GPU development and higher-order graph matching. Note de contenu : 1- Introduction 2- Background 3- Background subtraction and frame difference for multi-object detection 4- Using Marr-wavelets and entropy/response to automatic feature detection 5- Affinity-preserving fixed point APRIP in Matlab framework for graph matching 6- Planar graph matching in GPU 7- Conclusion and future work Numéro de notice : 28328 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Thèse française Note de thèse : Thèse de Doctorat : Informatique : UBFC : 2020 Organisme de stage : CIAD Dijon DOI : sans En ligne : https://tel.archives-ouvertes.fr/tel-02902973/document Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=98402

L’opérateur de collage : Gestion de plusieurs points de vue dans un contexte spatial / Géraldine Del Mondo in Revue internationale de géomatique, vol 28 n° 3 (juillet - septembre 2018)  

Permalink

A new framework for solving the spatial network problems based on line graphs / Javad Saberian in Transactions in GIS, vol 18 n° 5 (October 2014)  

Permalink

Global seamline networks for orthomosaic generation via local search / S. Mills in ISPRS Journal of photogrammetry and remote sensing, vol 75 (January 2013)

Permalink

Une méthode de construction de données spatio-temporelles pour l'étude de l'espace urbain ancien / Bertrand Duménieu (2013)    

Permalink

A simple and robust feature point matching algorithm based on restricted spatial order constraints for aerial image registration / Z. Liu in IEEE Transactions on geoscience and remote sensing, vol 50 n° 2 (February 2012)  

Permalink

Urban area and building detection using SIFT: Keypoints and Graph Theory / B. Simarcek in IEEE Transactions on geoscience and remote sensing, vol 47 n° 4 (April 2009)

Permalink

Qualitative spatial reasoning for high-resolution remote sensing image analysis / Jordi Inglada in IEEE Transactions on geoscience and remote sensing, vol 47 n° 2 (February 2009)

Permalink

Matching networks with different levels of detail / Sébastien Mustière in Geoinformatica, vol 12 n° 4 (December 2008)  

Permalink

Measuring land development in urban regions using graph theoretical and conditional statistical features / C. Unsalan in IEEE Transactions on geoscience and remote sensing, vol 45 n° 12 Tome 1 (December 2007)

Permalink

Découverte de services basée sur leurs protocoles de conversation / J.C. Corrales in Ingénierie des systèmes d'information, ISI : Revue des sciences et technologies de l'information, RSTI, vol 12 n° 1 (janvier - février 2007)

Permalink