• Title/Summary/Keyword: synthetic realizations

Search Result 4, Processing Time 0.027 seconds

Parametric study based on synthetic realizations of EARPG(1)/UPS for simulation of extreme value statistics

  • Seong, Seung H.
    • Wind and Structures
    • /
    • v.2 no.2
    • /
    • pp.85-94
    • /
    • 1999
  • The EARPG(1)/UPS was first developed by Seong (1993) and has been tested for wind pressure time series simulations (Seong and Peterka 1993, 1997, 1998) to prove its excellent performance for generating non-Gaussian time series, in particular, with large amplitude sharp peaks. This paper presents a parametric study focused on simulation of extreme value statistics based on the synthetic realizations of the EARPG(1)/UPS. The method is shown to have a great capability to simulate a wide range of non-Gaussian statistic values and extreme value statistics with exact target sample power spectrum. The variation of skewed long tail in PDF and extreme value distribution are illustrated as function of relevant parameters.

Gaussian noise addition approaches for ensemble optimal interpolation implementation in a distributed hydrological model

  • Manoj Khaniya;Yasuto Tachikawa;Kodai Yamamoto;Takahiro Sayama;Sunmin Kim
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.25-25
    • /
    • 2023
  • The ensemble optimal interpolation (EnOI) scheme is a sub-optimal alternative to the ensemble Kalman filter (EnKF) with a reduced computational demand making it potentially more suitable for operational applications. Since only one model is integrated forward instead of an ensemble of model realizations, online estimation of the background error covariance matrix is not possible in the EnOI scheme. In this study, we investigate two Gaussian noise based ensemble generation strategies to produce dynamic covariance matrices for assimilation of water level observations into a distributed hydrological model. In the first approach, spatially correlated noise, sampled from a normal distribution with a fixed fractional error parameter (which controls its standard deviation), is added to the model forecast state vector to prepare the ensembles. In the second method, we use an adaptive error estimation technique based on the innovation diagnostics to estimate this error parameter within the assimilation framework. The results from a real and a set of synthetic experiments indicate that the EnOI scheme can provide better results when an optimal EnKF is not identified, but performs worse than the ensemble filter when the true error characteristics are known. Furthermore, while the adaptive approach is able to reduce the sensitivity to the fractional error parameter affecting the first (non-adaptive) approach, results are usually worse at ungauged locations with the former.

  • PDF

Unsuperised Image Segmentation Algorithm Using Markov Random Fields (마르코프 랜덤필드를 이용한 무관리형 화상분할 알고리즘)

  • Park, Jae-Hyeon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2555-2564
    • /
    • 2000
  • In this paper, a new unsupervised image segmentation algorithm is proposed. To model the contextual information presented in images, the characteristics of the Markov random fields (MRF) are utilized. Textured images are modeled as realizations of the stationary Gaussian MRF on a two-dimensional square lattice using the conditional autoregressive (CAR) equations with a second-order noncausal neighborhood. To detect boundaries, hypothesis tests over two masked areas are performed. Under the hypothesis, masked areas are assumed to belong to the same class of textures and CAR equation parameters are estimated in a minimum-mean-square-error (MMSE) sense. If the hypothesis is rejected, a measure of dissimilarity between two areas is accumulated on the rejected area. This approach produces potential edge maps. Using these maps, boundary detection can be performed, which resulting no micro edges. The performance of the proposed algorithm is evaluated by some experiments using real images as weB as synthetic ones. The experiments demonstrate that the proposed algorithm can produce satisfactorY segmentation without any a priori information.

  • PDF