Centre dedocumentation
scientifique

Automatic reconstruction of fully volumetric 3D building models from oriented point clouds / Sebastian Ochmann in ISPRS Journal of photogrammetry and remote sensing, vol 151 (May 2019)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 151 (May 2019) . - pp 251 - 262 Titre : Automatic reconstruction of fully volumetric 3D building models from oriented point clouds Type de document : Article/Communication Auteurs : Sebastian Ochmann, Auteur ; Richard Vock, Auteur ; Reinhard Klein, Auteur Année de publication : 2019 Article en page(s) : pp 251 - 262 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes descripteurs IGN] Industry foudation classes IFC [Termes descripteurs IGN] modélisation 3D du bâti BIM [Termes descripteurs IGN] positionnement en intérieur [Termes descripteurs IGN] programmation linéaire [Termes descripteurs IGN] reconstruction 3D du bâti [Termes descripteurs IGN] semis de points Résumé : (Auteur) We present a novel method for reconstructing parametric, volumetric, multi-story building models from unstructured, unfiltered indoor point clouds with oriented normals by means of solving an integer linear optimization problem. Our approach overcomes limitations of previous methods in several ways: First, we drop assumptions about the input data such as the availability of separate scans as an initial room segmentation. Instead, a fully automatic room segmentation and outlier removal is performed on the unstructured point clouds. Second, restricting the solution space of our optimization approach to arrangements of volumetric wall entities representing the structure of a building enforces a consistent model of volumetric, interconnected walls fitted to the observed data instead of unconnected, paper-thin surfaces. Third, we formulate the optimization as an integer linear programming problem which allows for an exact solution instead of the approximations achieved with most previous techniques. Lastly, our optimization approach is designed to incorporate hard constraints which were difficult or even impossible to integrate before. We evaluate and demonstrate the capabilities of our proposed approach on a variety of complex real-world point clouds. Numéro de notice : A2019-210 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2019.03.017 date de publication en ligne : 30/03/2019 En ligne : https://doi.org/10.1016/j.isprsjprs.2019.03.017 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92676 [article]

Réservation

Réserver ce document

Exemplaires (3)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2019051	SL	Revue	Centre de documentation	Revues en salle	Disponible
081-2019053	DEP-RECP	Revue	MATIS	Dépôt en unité	Exclu du prêt
081-2019052	DEP-RECF	Revue	Nancy	Dépôt en unité	Exclu du prêt

Un algorithme pour battre le record du SwissTrainChallenge : poser le pied dans chacun des 26 cantons le plus rapidement possible en utilisant uniquement des transports publics / Emmanuel Cledat in XYZ, n° 157 (décembre 2018 - février 2019)

Public [article]  inXYZ > n° 157 (décembre 2018 - février 2019) . - pp 30 - 36 Titre : Un algorithme pour battre le record du SwissTrainChallenge : poser le pied dans chacun des 26 cantons le plus rapidement possible en utilisant uniquement des transports publics Type de document : Article/Communication Auteurs : Emmanuel Cledat, Auteur ; Dirk Lauinger, Auteur Année de publication : 2018 Article en page(s) : pp 30 - 36 Note générale : bibliographie Langues : Français (fre) Descripteur : [Vedettes matières IGN] Applications SIG [Termes descripteurs IGN] calcul d'itinéraire [Termes descripteurs IGN] chemin le plus rapide (algorithme) [Termes descripteurs IGN] connexité (graphes) [Termes descripteurs IGN] multilatération [Termes descripteurs IGN] programmation linéaire [Termes descripteurs IGN] réseau ferroviaire [Termes descripteurs IGN] Suisse [Termes descripteurs IGN] temps de trajet [Termes descripteurs IGN] train [Termes descripteurs IGN] transport public [Termes descripteurs IGN] vitesse Résumé : (auteur) The Swiss Train Challenge is to set foot in all 26 cantons of Switzerland in as little time as possible, using only public transportation. Relying on human intuition informed by a geographical information system to select the relevant train stations, and on computational power to solve the resulting mixed-integer linear optimization problem, we find a solution that beats the current record of 17 hours and 19 minutes, by 25 minutes. When testing our itinerary in practice, we made all connections but one for which the arriving train was 20 minutes delayed - a rare event in switzerland. This is the first time that an algorithm has been used to calculate the Swiss Train Challenge itinerary. Numéro de notice : A2018-532 Thématique : GEOMATIQUE Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91577 [article]

Réservation

Réserver ce document

Exemplaires (2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
112-2018041	SL	Revue	Centre de documentation	Revues en salle	Disponible
112-2018042	SL	Revue	Centre de documentation	Revues en salle	Disponible

Object-based superresolution land-cover mapping from remotely sensed imagery / Yuehong Chen in IEEE Transactions on geoscience and remote sensing, vol 56 n° 1 (January 2018)  

Public [article]  inIEEE Transactions on geoscience and remote sensing > vol 56 n° 1 (January 2018) . - pp 328 - 340 Titre : Object-based superresolution land-cover mapping from remotely sensed imagery Type de document : Article/Communication Auteurs : Yuehong Chen, Auteur ; Yong Ge, Auteur ; Gerard B.M. Heuvelink, Auteur ; Ru An, Auteur ; Yu Chen, Auteur Année de publication : 2018 Article en page(s) : pp 328 - 340 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes descripteurs IGN] classification orientée objet [Termes descripteurs IGN] classification pixellaire [Termes descripteurs IGN] déconvolution [Termes descripteurs IGN] krigeage [Termes descripteurs IGN] occupation du sol [Termes descripteurs IGN] programmation linéaire [Termes descripteurs IGN] variogramme Résumé : (Auteur) Superresolution mapping (SRM) is a widely used technique to address the mixed pixel problem in pixel-based classification. Advanced object-based classification will face a similar mixed phenomenon-a mixed object that contains different land-cover classes. Currently, most SRM approaches focus on estimating the spatial location of classes within mixed pixels in pixel-based classification. Little if any consideration has been given to predicting where classes spatially distribute within mixed objects. This paper, therefore, proposes a new object-based SRM strategy (OSRM) to deal with mixed objects in object-based classification. First, it uses the deconvolution technique to estimate the semivariograms at target subpixel scale from the class proportions of irregular objects. Then, an area-to-point kriging method is applied to predict the soft class values of subpixels within each object according to the estimated semivariograms and the class proportions of objects. Finally, a linear optimization model at object level is built to determine the optimal class labels of subpixels within each object. Two synthetic images and a real remote sensing image were used to evaluate the performance of OSRM. The experimental results demonstrated that OSRM generated more land-cover details within mixed objects than did the traditional object-based hard classification and performed better than an existing pixel-based SRM method. Hence, OSRM provides a valuable solution to mixed objects in object-based classification. Numéro de notice : A2018-186 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2017.2747624 date de publication en ligne : 20/09/2017 En ligne : https://doi.org/10.1109/TGRS.2017.2747624 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89843 [article]

Robust minimum volume simplex analysis for hyperspectral unmixing / Shaoquan Zhang in IEEE Transactions on geoscience and remote sensing, vol 55 n° 11 (November 2017)  

Public [article]  inIEEE Transactions on geoscience and remote sensing > vol 55 n° 11 (November 2017) . - pp 6431 - 6439 Titre : Robust minimum volume simplex analysis for hyperspectral unmixing Type de document : Article/Communication Auteurs : Shaoquan Zhang, Auteur ; Alexander Agathos, Auteur ; Jun Li, Auteur Année de publication : 2017 Article en page(s) : pp 6431 - 6439 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes descripteurs IGN] algorithme du simplexe [Termes descripteurs IGN] analyse des mélanges spectraux [Termes descripteurs IGN] factorisation [Termes descripteurs IGN] image hyperspectrale [Termes descripteurs IGN] méthode robuste Résumé : (Auteur) Most blind hyperspectral unmixing methods exploit convex geometry properties of hyperspectral data. The minimum volume simplex analysis (MVSA) is one of such methods, which, as many others, estimates the minimum volume (MV) simplex where the measured vectors live. MVSA was conceived to circumvent the matrix factorization step often implemented by MV-based algorithms and also to cope with outliers, which compromise the results produced by MV algorithms. Inspired by the recently proposed robust MV enclosing simplex (RMVES) algorithm, we herein introduce the robust MVSA (RMVSA), which is a version of MVSA robust to noise. As in RMVES, the robustness is achieved by employing chance constraints, which control the volume of the resulting simplex. RMVSA differs, however, substantially from RMVES in the way optimization is carried out. In this paper, we develop a linearization relaxation of the nonlinear chance constraints, which can greatly lighten the computational complex of chance constraint problems. The effectiveness of RMVSA is illustrated by comparing its performance with the state of the art. Numéro de notice : A2017-749 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2017.2728104 En ligne : https://doi.org/10.1109/TGRS.2017.2728104 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=88784 [article]

Linking ecosystem services with state-and-transition models to evaluate rangeland management decisions / Sapana Lohani in Global ecology and conservation, vol 8 (October 2016)  

Public [article]  inGlobal ecology and conservation > vol 8 (October 2016) . - pp 58 - 70 Titre : Linking ecosystem services with state-and-transition models to evaluate rangeland management decisions Type de document : Article/Communication Auteurs : Sapana Lohani, Auteur ; Philip Heilman, Auteur ; J. Edward de Steiguer, Auteur ; D. Phillip Guertin, Auteur Année de publication : 2016 Article en page(s) : pp 58 - 70 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Ecologie [Termes descripteurs IGN] Etats-Unis [Termes descripteurs IGN] modèle numérique [Termes descripteurs IGN] programmation linéaire [Termes descripteurs IGN] service écosystémique Résumé : (auteur) We simplified the existing state-and-transition models for rangelands using remote sensing technologies over larger landscapes. We developed an optimization model to include ecosystem services and disservices in the state-and-transition models. Linear programming optimization model was run for private and public ranchers. Net benefit was maximum for the public rancher when ecosystem disservices were excluded. Rangeland managers can use the optimization model to compare different management alternatives. Numéro de notice : A2016-714 Thématique : FORET Nature : Article En ligne : http://dx.doi.org/10.1016/j.gecco.2016.08.003 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=82107 [article]

Recursive orthogonal projection-based simplex growing algorithm / Hsiao-Chi Li in IEEE Transactions on geoscience and remote sensing, vol 54 n° 7 (July 2016)  

Permalink

Gestion de collecte des déchets post-inondation / Oumayma Kaabi (2016)

Permalink

Probabilistic multi-person localisation and tracking / Tobias Klinger (2016) 

Permalink

Minimum volume simplex analysis: A fast algorithm for linear hyperspectral unmixing / Jun Li in IEEE Transactions on geoscience and remote sensing, vol 53 n° 9 (September 2015)

Permalink

A comparative analysis of traveling salesman solutions from geographic information systems / Kevin M. Curtin in Transactions in GIS, vol 18 n° 2 (April 2014)

Permalink

Attraction-repulsion model-based subpixel mapping of multi-/hyperspectral imagery / Xiaohua Tong in IEEE Transactions on geoscience and remote sensing, vol 51 n° 5 Tome 1 (May 2013)

Permalink

Sampling piecewise convex unmixing and endmember extraction / Alina Zare in IEEE Transactions on geoscience and remote sensing, vol 51 n° 3 Tome 2 (March 2013)

Permalink

Triangular factorization-based simplex algorithms for hyperspectral unmixing / W. Xia in IEEE Transactions on geoscience and remote sensing, vol 50 n° 11 Tome 1 (November 2012)

Permalink

Geometric unmixing of large hyperspectral images: A barycentric coordinate approach / P. Honeine in IEEE Transactions on geoscience and remote sensing, vol 50 n° 6 (June 2012)

Permalink

Network adjustment in surveying engineering: linear goal programming versus least squares / S. Alp in SaLIS Surveying and land information science, vol 70 n° 1 (Spring 2010)

Permalink