Centre de documentation
scientifique

A Bayesian displacement field approach to accurate registration of SAR images / Mingtao Ding in Geocarto international, vol 36 n° 9 ([15/05/2021])  

Public [article]  inGeocarto international > vol 36 n° 9 [15/05/2021] . - pp 1007 - 1026 Titre : A Bayesian displacement field approach to accurate registration of SAR images Type de document : Article/Communication Auteurs : Mingtao Ding, Auteur ; Hongyan Wang, Auteur ; Lichun Sui, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 1007 - 1026 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image radar et applications [Termes IGN] arc [Termes IGN] enregistrement de données [Termes IGN] estimation bayesienne [Termes IGN] image radar moirée [Termes IGN] implémentation (informatique) [Termes IGN] inférence [Termes IGN] méthode de Monte-Carlo par chaînes de Markov [Termes IGN] méthode du maximum de vraisemblance (estimation) [Termes IGN] processeur graphique [Termes IGN] superposition d'images [Termes IGN] transformation Résumé : (auteur) Precise registration of synthetic aperture radar (SAR) images is a nontrivial task since a change in radar-acquisition geometry generates image shifts. In existing system, either the transformation functions are oversimplified, or external measures such as digital elevation model and flight track are required to be precise. In this paper, we proposed a generative Bayesian approach to modelling the displacement vectors that map the position of each pixel in the image, thus avoiding degradation of the transformation function. Rather than providing a point estimate for the transformation function, the proposed method yields a full posterior density function of the transformation function. Especially, the Bayesian model learns all the parameters adaptively, and the procedure is fully automatic. The proposed model is comparable in accuracy to state-of-the-art optical flow methods on the challenging Sintel benchmarks, and outperforms currently published SAR image registration methods on some real SAR data with critical scenes. Numéro de notice : A2021-343 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/10106049.2019.1633418 Date de publication en ligne : 07/07/2019 En ligne : https://doi.org/10.1080/10106049.2019.1633418 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97584 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
059-2021091	RAB	Revue	Centre de documentation	En réserve L003	Disponible

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]

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	Exclu du prêt

Finding the most navigable path in road networks / Ramneek Kaur in Geoinformatica, vol 25 n° 1 (January 2021)  

Public [article]  inGeoinformatica > vol 25 n° 1 (January 2021) . - pp 207 - 240 Titre : Finding the most navigable path in road networks Type de document : Article/Communication Auteurs : Ramneek Kaur, Auteur ; Vikram Goyal, Auteur ; Venkata M. V. Gunturi, Auteur Année de publication : 2021 Article en page(s) : pp 207 - 240 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] arc [Termes IGN] calcul d'itinéraire [Termes IGN] durée de trajet [Termes IGN] programmation dynamique [Termes IGN] réseau routier Résumé : (Auteur) Input to the Most Navigable Path (MNP) problem consists of the following: (a) a road network represented as a directed graph, where each edge is associated with numeric attributes of cost and “navigability score” values; (b) a source and a destination and; (c) a budget value which denotes the maximum permissible cost of the solution. Given the input, MNP aims to determine a path between the source and the destination which maximizes the navigability score while constraining its cost to be within the given budget value. The problem can be modeled as the arc orienteering problem which is known to be NP-hard. The current state-of-the-art for this problem may generate paths having loops, and its adaptation for MNP that yields simple paths, was found to be inefficient. In this paper, we propose five novel algorithms for the MNP problem. Our algorithms first compute a seed path from the source to the destination, and then modify the seed path to improve its navigability. We explore two approaches to compute the seed path. For modification of the seed path, we explore different Dynamic Programming based approaches. We also propose an indexing structure for the MNP problem which helps in reducing the running time of some of our algorithms. Our experimental results indicate that the proposed solutions yield comparable or better solutions while being orders of magnitude faster than the current state-of-the-art for large real road networks. Numéro de notice : A2021-095 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00428-5 Date de publication en ligne : 03/01/2021 En ligne : https://doi.org/10.1007/s10707-020-00428-5 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96935 [article]

Progressive registration of image features and 3D vector lines for orientation modelling / Wen-Chi Chang in Photogrammetric record, vol 33 n° 161 (March 2018)  

Public [article]  inPhotogrammetric record > vol 33 n° 161 (March 2018) . - pp 66 - 85 Titre : Progressive registration of image features and 3D vector lines for orientation modelling Type de document : Article/Communication Auteurs : Wen-Chi Chang, Auteur ; Ching-Hui Hung, Auteur ; Liang-Chien Chen, Auteur Année de publication : 2018 Article en page(s) : pp 66 - 85 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Photogrammétrie numérique [Termes IGN] arc [Termes IGN] élément d'orientation externe [Termes IGN] ligne (géométrie) [Termes IGN] superposition d'images Résumé : (Auteur) This paper proposes a progressive method to register image features and three‐dimensional (3D) vector lines for image orientation modelling. Directed at images acquired with an approximate direct‐georeferencing capability, this study employed 3D vector lines extracted from a geographical information system (GIS) database as ground control. The major work comprises three steps: (1) straight lines were parameterised and applied as control in the collinearity condition equations to determine exterior orientation parameters (EOPs); (2) coarse registration employed quadrangle features formed from straight lines to modify the initial EOPs; and (3) a two‐step fine registration, initially involving all line‐feature candidates, followed by the selection of the most probable one from neighbouring lines. Experimental results indicate that the proposed methods can achieve an accuracy of about 2 pixels (close to the accuracy of the employed GIS database) from initial EOPs with more than 800 pixel errors. Accuracy improvements in each step of the proposed coarse‐to‐fine registration are also demonstrated. Numéro de notice : A2018-220 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/phor.12227 Date de publication en ligne : 12/02/2018 En ligne : https://doi.org/10.1111/phor.12227 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90040 [article]

Linear Algebra / Arak M. Mathai (2017)  

Public Titre : Linear Algebra : A Course for Physicists and Engineers Type de document : Monographie Auteurs : Arak M. Mathai, Auteur ; Hans J. Haubold, Auteur Editeur : Berlin, New York : Walter de Gruyter Année de publication : 2017 Importance : 450 p. Format : 17 x 24 cm ISBN/ISSN/EAN : 978-3-11-056235-4 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Algèbre [Termes IGN] algèbre linéaire [Termes IGN] arc [Termes IGN] équation différentielle [Termes IGN] espace vectoriel [Termes IGN] matrice [Termes IGN] optimisation (mathématiques) [Termes IGN] statistique mathématique Résumé : (éditeur) In order not to intimidate students by a too abstract approach, this textbook on linear algebra is written to be easy to digest by non-mathematicians. It introduces the concepts of vector spaces and mappings between them without dwelling on statements such as theorems and proofs too much. It is also designed to be self-contained, so no other material is required for an understanding of the topics covered. As the basis for courses on space and atmospheric science, remote sensing, geographic information systems, meteorology, climate and satellite communications at UN-affiliated regional centers, various applications of the formal theory are discussed as well. These include differential equations, statistics, optimization and some engineering-motivated problems in physics. Note de contenu : 1- Vectors 2- Matrices 3- Determinants 4- Eigenvalues and eigenvectors 5- Somme applications of matrices and determinants 6- Matrix series and additional properties of matrices Numéro de notice : 25804 Affiliation des auteurs : non IGN Thématique : MATHEMATIQUE Nature : Monographie DOI : 10.1515/9783110562507 En ligne : https://doi.org/10.1515/9783110562507 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96609

mR-V: Line simplification through mnemonic rasterization / Emmanuel Stefanakis in Geomatica, vol 70 n° 4 (December 2016)  

Permalink

Des Systèmes d’Information Géographiques à une Information Spatiale Sémantisée. Focus sur la topologie des vecteurs / Nathalie Abadie (2016)

Permalink

Introduction au calcul des probabilités et à la statistique / Jean-François Delmas (2013)

Permalink

A new 3-D solar radiation model for 3-D city models / Jaroslav Hofierka in Transactions in GIS, vol 16 n° 5 (October 2012)  

Permalink

Improving web mapping with generalization / Julien Gaffuri in Cartographica, vol 46 n° 2 (June 2011)  

Permalink

Visualisation of origins, destinations and flows with OD maps / J. Wood in Cartographic journal (the), vol 47 n° 2 (May 2010)  

Permalink

Delineation and geometric modeling of road networks / C. Poullis in ISPRS Journal of photogrammetry and remote sensing, vol 65 n° 2 (March - April 2010)  

Permalink

SIG et cartographie pour MacIntosh / Anonyme in Géomatique expert, n° 71 (octobre - novembre 2009)

Permalink

Variable-resolution compression of vector data / B. Yang in Geoinformatica, vol 12 n° 3 (September - November 2008)  

Permalink

Exact cell decomposition on base map features for optimal path finding / L.S. Pun-Cheng in International journal of geographical information science IJGIS, vol 21 n° 1-2 (january 2007)  

Permalink