Centre dedocumentation
scientifique

A point cloud feature regularization method by fusing judge criterion of field force / Xijiang Chen in IEEE Transactions on geoscience and remote sensing, vol 58 n° 5 (May 2020)  

Public [article]  inIEEE Transactions on geoscience and remote sensing > vol 58 n° 5 (May 2020) . - pp 2994 - 3006 Titre : A point cloud feature regularization method by fusing judge criterion of field force Type de document : Article/Communication Auteurs : Xijiang Chen, Auteur ; Qing Liu, Auteur ; Keguen Yu, Auteur Année de publication : 2020 Article en page(s) : pp 2994 - 3006 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes descripteurs IGN] analyse vectorielle [Termes descripteurs IGN] détection de contours [Termes descripteurs IGN] échantillonnage [Termes descripteurs IGN] extraction de traits caractéristiques [Termes descripteurs IGN] matrice de covariance [Termes descripteurs IGN] modèle numérique de surface [Termes descripteurs IGN] modélisation du bâti [Termes descripteurs IGN] niveau de gris (image) [Termes descripteurs IGN] partitionnement binaire [Termes descripteurs IGN] plus proche voisin (algorithme) [Termes descripteurs IGN] reconstruction d'objet [Termes descripteurs IGN] semis de points [Termes descripteurs IGN] spline cubique [Termes descripteurs IGN] traitement d'image [Termes descripteurs IGN] transformation de Hough [Termes descripteurs IGN] Wuhan (Chine) Résumé : (auteur) Point cloud boundary is an important part of the surface model. The traditional feature extraction method has slow speed and low efficiency and only achieves the boundary feature points. Hence, the point cloud feature regularization is proposed to obtain the boundary lines based on the fast extraction of feature points in this article. First, an improved $k$ - $d$ tree method is used to search the $k$ neighbors of sampling point. Then, the sampling point and its $k$ neighbors are used as the reference points set to fit a microcut plane and project to the plane. The local coordinate system is established on the microcut plane to convert 3-D into 2-D. The boundary feature points are identified by judging criterion of field force and then are sorted and connected according to the vector deflected angle and distance. Finally, the boundary lines are smoothed by the improved cubic B-spline fitting method. Experiments show that the proposed method can extract the boundary feature points quickly and efficiently, and the mean error of boundary lines is 0.0674 mm and the standard deviation is 0.0346 mm, which has high precision. This proposed method was also successfully applied to feature extraction and boundary fitting of Xinyi teaching building of the Wuhan University of Technology. Numéro de notice : A2020-230 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2019.2946326 date de publication en ligne : 16/12/2020 En ligne : https://doi.org/10.1109/TGRS.2019.2946326 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94968 [article]

The "Incense Road" from Petra to Gaza: an analysis using GIS and Cost functions / Motti Zohar in International journal of geographical information science IJGIS, vol 34 n° 2 (February 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n° 2 (February 2020) . - pp 292 - 310 Titre : The "Incense Road" from Petra to Gaza: an analysis using GIS and Cost functions Type de document : Article/Communication Auteurs : Motti Zohar, Auteur ; Tali Erickson-Gini, Auteur Année de publication : 2020 Article en page(s) : pp 292 - 310 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes descripteurs IGN] Arabie [Termes descripteurs IGN] bassin méditerranéen [Termes descripteurs IGN] carte archéologique [Termes descripteurs IGN] carte numérique [Termes descripteurs IGN] chemin le moins coûteux (algorithme) [Termes descripteurs IGN] empreinte [Termes descripteurs IGN] histoire [Termes descripteurs IGN] image ALOS-PALSAR [Termes descripteurs IGN] modèle numérique de surface [Termes descripteurs IGN] Petra [Termes descripteurs IGN] reconstruction de route [Termes descripteurs IGN] ressources en eau [Termes descripteurs IGN] système d'information géographique Résumé : (auteur) As early as the fourth century BCE, the Nabateans established the Incense Road to facilitate the transport of aromatic substances (frankincense and myrrh) from the Arabian Peninsula to the Mediterranean basin. An important part of this road was the segment between Petra and Gaza. Although studied before, the accurate route of parts of this segment is still vague since evidence of Roman milestones are scarce and significant portions of the landscape have changed dramatically in modern times, essentially wiping out the tracks of ancient roads. In this study, we use Geographic Information Systems (GIS) and Least Cost Path (LCP) analyses for reconstructing the original path of the Incense Road as well as verifying the factors influencing its establishment. The implemented analyses support the archeological evidence of two travel phases between Petra and Oboda (Avdat): During the first phase the Nabateans used the Darb es-Sultan route; during the second phase, from the first century BCE onwards, they passed through the Ramon Crater. This is the first time such reconstruction is made in the southern Levant. It was found that slope degree and the distance to water resources are dominant factors in reconstructing the accurate path of the Incense Road. Numéro de notice : A2020-029 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : https://doi.org/10.1080/13658816.2019.1669795 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94482 [article]

Complete 3D scene parsing from an RGBD image / Chuhang Zou in International journal of computer vision, vol 127 n° 2 (February 2019)  

Public [article]  inInternational journal of computer vision > vol 127 n° 2 (February 2019) . - pp 143 - 162 Titre : Complete 3D scene parsing from an RGBD image Type de document : Article/Communication Auteurs : Chuhang Zou, Auteur ; Ruiqi Guo, Auteur ; Zhizhong Li, Auteur ; Derek Hoiem, Auteur Année de publication : 2019 Article en page(s) : pp 143 - 162 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes descripteurs IGN] classification par réseau neuronal convolutif [Termes descripteurs IGN] cohérence géométrique [Termes descripteurs IGN] compréhension de l'image [Termes descripteurs IGN] image isolée [Termes descripteurs IGN] image RVB [Termes descripteurs IGN] reconstruction d'objet [Termes descripteurs IGN] scène 3D Résumé : (Auteur) One major goal of vision is to infer physical models of objects, surfaces, and their layout from sensors. In this paper, we aim to interpret indoor scenes from one RGBD image. Our representation encodes the layout of orthogonal walls and the extent of objects, modeled with CAD-like 3D shapes. We parse both the visible and occluded portions of the scene and all observable objects, producing a complete 3D parse. Such a scene interpretation is useful for robotics and visual reasoning, but difficult to produce due to the well-known challenge of segmentation, the high degree of occlusion, and the diversity of objects in indoor scenes. We take a data-driven approach, generating sets of potential object regions, matching to regions in training images, and transferring and aligning associated 3D models while encouraging fit to observations and spatial consistency. We use support inference to aid interpretation and propose a retrieval scheme that uses convolutional neural networks to classify regions and retrieve objects with similar shapes. We demonstrate the performance of our method on our newly annotated NYUd v2 dataset (Silberman et al., in: Computer vision-ECCV, 2012, pp 746–760, 2012) with detailed 3D shapes. Numéro de notice : A2018-598 Thématique : IMAGERIE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s11263-018-1133-z date de publication en ligne : 21/11/2018 En ligne : https://doi.org/10.1007/s11263-018-1133-z Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92525 [article]

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

Visibility estimation in point clouds with variable density / Pierre Biasutti (2019)    

Public Titre : Visibility estimation in point clouds with variable density Type de document : Article/Communication Auteurs : Pierre Biasutti, Auteur ; Aurélie Bugeau, Auteur ; Jean-François Aujol, Auteur ; Mathieu Brédif , Auteur Congrès : VISAPP 2019, 14th International Conference on Computer Vision Theory and Applications (25 février 2019; Prague, République tchèque) , Commanditaire Editeur : Scitepress Année de publication : 2019 Projets : GOTMI / Papadakis, Nicolas Importance : pp 27 - 35 Format : 21 x 30 cm Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes descripteurs IGN] densité des points [Termes descripteurs IGN] données lidar [Termes descripteurs IGN] données localisées 3D [Termes descripteurs IGN] reconstruction d'objet [Termes descripteurs IGN] semis de points [Termes descripteurs IGN] visibilité [Termes descripteurs IGN] voisinage (topologie) Résumé : (auteur) Estimating visibility in point clouds has many applications such as visualization, surface reconstruction and scene analysis through fusion of LiDAR point clouds and images. However, most current works rely on methods that require strong assumptions on the point cloud density, which are not valid for LiDAR point clouds acquired from mobile mapping systems, leading to low quality of point visibility estimations. This work presents a novel approach for the estimation of the visibility of a point cloud from a viewpoint. The method is designed to be fully automatic and it makes no assumption on the point cloud density. The visibility of each point is estimated by considering its screen-space neighborhood from the given viewpoint. Our results show that our approach succeeds better in estimating the visibility on real-world data acquired using LiDAR scanners. We evaluate our approach by comparing its results to a new manually annotated dataset, which we make available online. Numéro de notice : C2019-007 Thématique : IMAGERIE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.5220/0007308600270035 En ligne : http://dx.doi.org/10.5220/0007308600270035 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92633

Documents numériques

en open access Visibility estimation in point clouds with variable density - version HAL URL

Surface reconstruction of incomplete datasets: A novel Poisson surface approach based on CSRBF / Jules Morel in Computers and graphics, vol 74 (August 2018)  

Permalink

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)  

Permalink

Large scale textured mesh reconstruction from mobile mapping images and LIDAR scans / Mohamed Boussaha in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, IV-2 ([28/05/2018])  

Permalink

On the production of semantic and textured 3D meshes of large scale urban environments from mobile mapping images and LIDAR scans / Mohamed Boussaha (2018)    

Permalink

Algebraic method to speed up robust algorithms: example of laser-scanned point clouds / B. Palancz in Survey review, vol 49 n° 357 (December 2017)  

Permalink

Global, dense multiscale reconstruction for a billion points / Benjamin Ummenhofer in International journal of computer vision, vol 125 n° 1-3 (December 2017)  

Permalink

Bayesian graph-cut optimization for wall surfaces reconstruction in indoor environments / Georgios-Tsampikos Michailidis in The Visual Computer, vol 33 n° 10 (October 2017)  

Permalink

Multi-view performance capture of surface details / Nadia Robertini in International journal of computer vision, vol 124 n° 1 (August 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

Generalizing the prediction sum of squares statistic and formula, application to linear fractional image warp and surface fitting / Adrien Bartoli in International journal of computer vision, vol 122 n° 1 (March 2017)  

Permalink