Centre dedocumentation
scientifique

An indoor spatial accessible area generation approach considering distance constraints / Lina Yang in Annals of GIS, Vol 26 n°1 (January 2020)  

Public [article]  inAnnals of GIS > Vol 26 n°1 (January 2020) . - pp 25 - 34 Titre : An indoor spatial accessible area generation approach considering distance constraints Type de document : Article/Communication Auteurs : Lina Yang, Auteur ; Hongru Bi, Auteur ; Xiaojing Yao, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 25 - 34 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes descripteurs IGN] analyse spatiale [Termes descripteurs IGN] contrainte géométrique [Termes descripteurs IGN] distance [Termes descripteurs IGN] espace intérieur [Termes descripteurs IGN] modèle conceptuel de données localisées [Termes descripteurs IGN] modèle géométrique [Termes descripteurs IGN] zone tampon Résumé : (auteur) Indoor objects’ accessible area generation considering distance constraints is of important realistic significance for spatial analysis. To the best of our knowledge, few studies have been conducted on indoor accessible area generation considering distance constraints. And because of different spatial characteristics between indoor and outdoor environment, the commonly used approach in outdoor space is not suitable for indoor space. In this paper, based on the hybrid spatial data model of geometric and symbolic model, an accessible area generation approach considering distance constraints for indoor environment is proposed by improving traditional spatial buffer zone generation technique. The buffer zone generation with a predefined distance around indoor objects within their located subspace is executed first; then, based on the indoor spatial connectivity, buffer generation around exit points is successively executed in its next connected subspaces until the distance decreases to zero. The merge of these generated buffer zones is the result of accessible area generation with a predefined distance constraint. During the process, two kinds of spatial search strategies, depth-first search and breadth-first search, are presented. Two sets of experiments are conducted to validate the correctness and efficiency of the proposed approach. Results show that the approach can be effectively used to solve the problem of indoor objects’ accessible area generation with distance constraints. Moreover, the potential use, as well as the limitation of the proposed approach is discussed in this paper. Numéro de notice : A2020-118 Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/19475683.2019.1680575 date de publication en ligne : 18/10/2019 En ligne : https://doi.org/10.1080/19475683.2019.1680575 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94737 [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

Geometric reasoning with uncertain polygonal faces / Jochen Meidow in Photogrammetric Engineering & Remote Sensing, PERS, vol 84 n° 6 (juin 2018)  

Public [article]  inPhotogrammetric Engineering & Remote Sensing, PERS > vol 84 n° 6 (juin 2018) . - pp 393- 401 Titre : Geometric reasoning with uncertain polygonal faces Type de document : Article/Communication Auteurs : Jochen Meidow, Auteur ; Wolfgang Förstner, Auteur Année de publication : 2018 Article en page(s) : pp 393- 401 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques [Termes descripteurs IGN] contrainte géométrique [Termes descripteurs IGN] incertitude géométrique [Termes descripteurs IGN] polyèdre [Termes descripteurs IGN] polygone [Termes descripteurs IGN] processus stochastique [Termes descripteurs IGN] raisonnement spatial [Termes descripteurs IGN] toit Résumé : (auteur) The reconstruction of urban areas suffers from the dilemma of modeling urban structures in a generic or specific way, thus being too unspecific or too restrictive. One approach to overcome this dilemma is to model and to instantiate buildings as arbitrarily shaped polyhedra and to recognize man-made structures in a subsequent stage by geometric reasoning. Thus, the existence of unconstrained boundary representations for buildings is assumed. To stay generic and to avoid the use of templates for pre-defined building primitives, no assumptions for the buildings' outlines and the planar roof areas are made. Typically, roof areas are derived interactively or in an automatic process based on given point clouds or digital surface models. Due to the measurement process and the assumption of planar boundaries, these planar faces are uncertain. Thus, a stochastic geometric reasoning process with statistical testing is appropriate to detected man-made structures followed by an adjustment to enforce the deduced geometric constraints. Unfortunately, city models usually do not feature information about the uncertainty of geometric entities. We present an approach to specify the uncertainty of the planes corresponding to the planar patches, i.e., polygons bounding a building, analytically. This paves the way to conduct the reasoning process with just a few assumptions. We describe and demonstrate the approach with real data. Numéro de notice : A2018-232 Thématique : IMAGERIE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.14358/PERS.84.6.393 date de publication en ligne : 01/06/2018 En ligne : https://doi.org/10.14358/PERS.84.6.393 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90174 [article]

Réservation

Réserver ce document

Exemplaires (1)

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

SDF-2-SDF registration for real-time 3D reconstruction from RGB-D data / Miroslava Slavcheva in International journal of computer vision, vol 126 n° 6 (June 2018)  

Public [article]  inInternational journal of computer vision > vol 126 n° 6 (June 2018) . - pp 615 - 636 Titre : SDF-2-SDF registration for real-time 3D reconstruction from RGB-D data Type de document : Article/Communication Auteurs : Miroslava Slavcheva, Auteur ; Wadim Kehl, Auteur ; Nassir Navab, Auteur ; Slobodan Ilic, Auteur Année de publication : 2018 Article en page(s) : pp 615 - 636 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes descripteurs IGN] contrainte géométrique [Termes descripteurs IGN] estimation de pose [Termes descripteurs IGN] image RVB [Termes descripteurs IGN] Kinect [Termes descripteurs IGN] méthode de réduction d'énergie [Termes descripteurs IGN] optimisation (mathématiques) [Termes descripteurs IGN] reconstruction d'objet [Termes descripteurs IGN] voxel Mots-clés libres : simultaneous localization and mapping (SLAM) Résumé : (Auteur) We tackle the task of dense 3D reconstruction from RGB-D data. Contrary to the majority of existing methods, we focus not only on trajectory estimation accuracy, but also on reconstruction precision. The key technique is SDF-2-SDF registration, which is a correspondence-free, symmetric, dense energy minimization method, performed via the direct voxel-wise difference between a pair of signed distance fields. It has a wider convergence basin than traditional point cloud registration and cloud-to-volume alignment techniques. Furthermore, its formulation allows for straightforward incorporation of photometric and additional geometric constraints. We employ SDF-2-SDF registration in two applications. First, we perform small-to-medium scale object reconstruction entirely on the CPU. To this end, the camera is tracked frame-to-frame in real time. Then, the initial pose estimates are refined globally in a lightweight optimization framework, which does not involve a pose graph. We combine these procedures into our second, fully real-time application for larger-scale object reconstruction and SLAM. It is implemented as a hybrid system, whereby tracking is done on the GPU, while refinement runs concurrently over batches on the CPU. To bound memory and runtime footprints, registration is done over a fixed number of limited-extent volumes, anchored at geometry-rich locations. Extensive qualitative and quantitative evaluation of both trajectory accuracy and model fidelity on several public RGB-D datasets, acquired with various quality sensors, demonstrates higher precision than related techniques. Numéro de notice : A2018-410 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s11263-017-1057-z date de publication en ligne : 18/12/2017 En ligne : https://doi.org/10.1007/s11263-017-1057-z Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90884 [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

An immune genetic algorithm to buildings displacement in cartographic generalization / Yageng Sun in Transactions in GIS, vol 20 n° 4 (August 2016)  

Permalink

Camera self-calibration with lens distortion from a single image / Dan Liu in Photogrammetric Engineering & Remote Sensing, PERS, vol 82 n° 5 (May 2016)  

Permalink

Midrange geometric interactions for semantic segmentation / Julia Diebold in International journal of computer vision, vol 117 n° 3 (May 2016)  

Permalink

Filtering airborne lidar data by modified white top-hat transform with directional edge constraints / Yong Li in Photogrammetric Engineering & Remote Sensing, PERS, vol 80 n° 2 (February 2014)  

Permalink

A fully constrained linear spectral unmixing algorithm based on distance geometry / Hanye Pu in IEEE Transactions on geoscience and remote sensing, vol 52 n° 2 (February 2014)  

Permalink

Mesure de précision dans un cadre hostile / Michel Ravelet in Géomètre, n° 2110 (janvier 2014)

Permalink

Boundary-constrained multi-scale segmentation method for remote sensing images / Xueliang Zhang in ISPRS Journal of photogrammetry and remote sensing, vol 78 (April 2013)

Permalink

A comparison of dense matching algorithms for scaled surface reconstruction using stereo camera rigs / Ali Hosseininaveh Ahmadabadian in ISPRS Journal of photogrammetry and remote sensing, vol 78 (April 2013)

Permalink

Inner constraints for planar features / Derek D. Lichti in Photogrammetric record, vol 28 n° 141 (March - May 2013)  

Permalink

Assessing data completeness of VGI through an automated matching procedure for linear data / T. Koukoletsos in Transactions in GIS, vol 16 n° 4 (August 2012)  

Permalink