Vignette d'image

Straubhaar, Julien

Nom
Straubhaar, Julien
Affiliation principale
Site web
Email
julien.straubhaar@unine.ch
Identifiants
https://libra.unine.ch/handle/123456789/151
_
0000-0003-2718-4332

Résultat de la recherche

Filtres

2
2
Réinitialiser les filtres

Paramètres

Voici les éléments 1 - 2 sur 2
  • Publication
    Accès libre
    A parsimonious parametrization of the Direct Sampling algorithm for multiple-point statistical simulations
    (2022)
    Juda, Przemyslaw 
    ;
    Renard, Philippe 
    ;
    Straubhaar, Julien 
    Multiple-point statistics algorithms allow modeling spatial variability from training images. Among these techniques, the Direct Sampling (DS) algorithm has advanced capabilities, such as multivariate simulations, treatment of non-stationarity, multi-resolution capabilities, conditioning by inequality or connectivity data. However, finding the right trade-off between computing time and simulation quality requires tuning three main parameters, which can be complicated since simulation time and quality are affected by these parameters in a complex manner. To facilitate the parameter selection, we propose the Direct Sampling Best Candidate (DSBC) parametrization approach. It consists in setting the distance threshold to 0. The two other parameters are kept (the number of neighbors and the scan fraction) as well as all the advantages of DS. We present three test cases that prove that the DSBC approach allows to identify efficiently parameters leading to comparable or better quality and computational time than the standard DS parametrization. We conclude that the DSBC approach could be used as a default mode when using DS, and that the standard parametrization should only be used when the DSBC approach is not sufficient.
  • Publication
    Accès libre
    Multiple-point statistics using multi-resolution images
    (2020-2-4)
    Straubhaar, Julien 
    ;
    Renard, Philippe 
    ;
    Chugunova, Tatiana
    Multiple-point statistics (MPS) is a simulation technique allowing to generate images that reproduce the spatial features present in a training image (TI). MPS algorithms consist in sequentially filling a simulation grid such that patterns around the simulated values come from the TI. Following this principle, joint simulations of multiple variables can be handled and complex heterogeneous fields can be generated. However, inconsistent patterns are often found in the results and some spatial features can be difficult to reproduce. In this paper, a new MPS algorithm based on a multi-resolution representation of the TI is proposed to enhance the quality of the realizations. The method consists in first building a pyramid of images from the TI by successive convolution using Gaussian-like kernels. Secondly, a MPS simulation is done at the lowest resolution level. Then, the result is expanded to the next level of resolution (one rank higher) and used as a conditioning variable for a joint MPS simulation at that level. This last step is repeated up to the initial resolution, where the final simulation is retrieved. The method is implemented in the DeeSse code based on the direct sampling algorithm. Most of the features provided by the direct sampling (conditioning to hard data, uni- or multi-variate simulation of categorical and continuous variables, scaling and rotation of the training structures) are compatible with the proposed method and the usability is maintained. Finally, various examples show that in most of the situations, combining Gaussian pyramids with MPS allows to get results of better quality and in less time compared to direct MPS simulations.