• Title/Summary/Keyword: gaussian probability distribution

Search Result 214, Processing Time 0.027 seconds

Probabilistic analysis of gust factors and turbulence intensities of measured tropical cyclones

  • Tianyou Tao;Zao Jin;Hao Wang
    • Wind and Structures
    • /
    • v.38 no.4
    • /
    • pp.309-323
    • /
    • 2024
  • The gust factor and turbulence intensity are two crucial parameters that characterize the properties of turbulence. In tropical cyclones (TCs), these parameters exhibit significant variability, yet there is a lack of established formulas to account for their probabilistic characteristics with consideration of their inherent connection. On this condition, a probabilistic analysis of gust factors and turbulence intensities of TCs is conducted based on fourteen sets of wind data collected at the Sutong Cable-stayed Bridge site. Initially, the turbulence intensities and gust factors of recorded data are computed, followed by an analysis of their probability densities across different ranges categorized by mean wind speed. The Gaussian, lognormal, and generalized extreme value (GEV) distributions are employed to fit the measured probability densities, with subsequent evaluation of their effectiveness. The Gumbel distribution, which is a specific instance of the GEV distribution, has been identified as an optimal choice for probabilistic characterizations of turbulence intensity and gust factor in TCs. The corresponding empirical models are then established through curve fitting. By utilizing the Gumbel distribution as a template, the nexus between the probability density functions of turbulence intensity and gust factor is built, leading to the development of a generalized probabilistic model that statistically describe turbulence intensity and gust factor in TCs. Finally, these empirical models are validated using measured data and compared with suggestions recommended by specifications.

SER Analysis of QAM with Space Diversity in Rayleigh Fading Channels

  • Kim, Chang-Joo;Kim, Young-Su;Jeong, Goo-Young;Mun, Jae-Kyung;Lee, Hyuck-Jae
    • ETRI Journal
    • /
    • v.17 no.4
    • /
    • pp.25-35
    • /
    • 1996
  • This paper derives the symbol error probability for quadrature amplitude modulation(QAM) with L-fold space diversity in Rayleigh fading channels. Two combining techniques, maximal ratio combining(MRC) and selection combining(SC), are considered. The formula for MRC space diversity is obtained by averaging the symbol error probability of M-ary QAM in an additive white Gaussian noise(AWGN) channel over a chi-square distribution with 2L degrees of freedom. The obtained formula overcomes the limitations of the earlier work, which has been limited only to deriving the symbol error rate(SER) of QAM with two branch MRC space diversity. The formula for SC space diversity is obtained by averaging the symbol error probability of M-ary QAM in an AWGN channel over the distribution of the maximum signal-to noise ratio among all of the diversity channels for SC space diversity has been reported yet. Analytical results show that the probability of error decreases with the order of diversity gain per additional branch decreases as the number of branches becomes larger. On the other hand, the performance of 16 QAM with MRC becomes much better than that of SC as the number of branches becomes larger. By giving the order of diversity, L, and the number of signal points, M, we have been able to obtain the SER performance of QAM with general space diversity. These results can be used to determine the order of diversity to achieve the desired SER in land mobile communication system employing QAM modulation.

  • PDF

On the Distribution of Phase Error in the Rician Fading Channel (라이시안 감쇄 채널에서의 위상오류 분포)

  • 김민종;한영열
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.13 no.8
    • /
    • pp.797-803
    • /
    • 2002
  • In this paper we derive the probability density function of the phase error of the received signal over Rician fading channel and verify its propriety as the probability density function using the zeroth moment. In general, for the error probability over fading channel we compute the error probability in the first place when it is only AWGN, and then we get the final result by averaging the first result and the probability density function of the corresponding fading channel. In this paper, however, we compute the error probability by double integration after the probability density function over fading channel is computed.

Centroid Neural Network with Bhattacharyya Kernel (Bhattacharyya 커널을 적용한 Centroid Neural Network)

  • Lee, Song-Jae;Park, Dong-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.861-866
    • /
    • 2007
  • A clustering algorithm for Gaussian Probability Distribution Function (GPDF) data called Centroid Neural Network with a Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive Centroid Neural Network (CNN) and employs a kernel method for data projection. The kernel method adopted in the proposed BK-CNN is used to project data from the low dimensional input feature space into higher dimensional feature space so as the nonlinear problems associated with input space can be solved linearly in the feature space. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. With the incorporation of the kernel method, the proposed BK-CNN is capable of dealing with nonlinear separation boundaries and can successfully allocate more code vector in the region that GPDF data are densely distributed. When applied to GPDF data in an image classification probleml, the experiment results show that the proposed BK-CNN algorithm gives 1.7%-4.3% improvements in average classification accuracy over other conventional algorithm such as k-means, Self-Organizing Map (SOM) and CNN algorithms with a Bhattacharyya distance, classed as Bk-Means, B-SOM, B-CNN algorithms.

Contrast Enhancement based on Gaussian Region Segmentation (가우시안 영역 분리 기반 명암 대비 향상)

  • Shim, Woosung
    • Journal of Broadcast Engineering
    • /
    • v.22 no.5
    • /
    • pp.608-617
    • /
    • 2017
  • Methods of contrast enhancement have problem such as side effect of over-enhancement with non-gaussian histogram distribution, tradeoff enhancement efficiency against brightness preserving. In order to enhance contrast at various histogram distribution, segmentation to region with gaussian distribution and then enhance contrast each region. First, we segment an image into several regions using GMM(Gaussian Mixture Model)fitting by that k-mean clustering and EM(Expectation-Maximization) in $L^*a^*b^*$ color space. As a result region segmentation, we get the region map and probability map. Then we apply local contrast enhancement algorithm that mean shift to minimum overlapping of each region and preserve brightness histogram equalization. Experiment result show that proposed region based contrast enhancement method compare to the conventional method as AMBE(AbsoluteMean Brightness Error) and AE(Average Entropy), brightness is maintained and represented detail information.

Error Rate for the Limiting Poisson-power Function Distribution

  • Joo-Hwan Kim
    • Communications for Statistical Applications and Methods
    • /
    • v.3 no.1
    • /
    • pp.243-255
    • /
    • 1996
  • The number of neutron signals from a neutral particle beam(NPB) at the detector, without any errors, obeys Poisson distribution, Under two assumptions that NPB scattering distribution and aiming errors have a circular Gaussian distribution respectively, an exact probability distribution of signals becomes a Poisson-power function distribution. In this paper, we show that the error rate in simple hypothesis testing for the limiting Poisson-power function distribution is not zero. That is, the limit of ${\alpha}+{\beta}$ is zero when Poisson parameter$\kappa\rightarro\infty$, but this limit is not zero (i.e., $\rho\ell$>0)for the Poisson-power function distribution. We also give optimal decision algorithms for a specified error rate.

  • PDF

Probability Distribution of Nonlinear Random Wave Heights Using Maximum Entropy Method (최대 엔트로피 방법을 이용한 비선형 불규칙 파고의 확률분포함수)

  • 안경모
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.10 no.4
    • /
    • pp.204-210
    • /
    • 1998
  • This paper presents the development of the probability density function applicable for wave heights (peak-to-trough excursions) in finite water depth including shallow water depth. The probability distribution applicable to wave heights of a non-Gaussian random process is derived based on the concept of the maximum entropy method. When wave heights are limited by breaking wave heights (or water depth) and only first and second moments of wave heights are given, the probability density function developed is closed form and expressed in terms of wave parameters such as $H_m$(mean wave height), $H_{rms}$(root-mean-square wave height), $H_b$(breaking wave height). When higher than third moment of wave heights are given, it is necessary to solve the system of nonlinear integral equations numerically using Newton-Raphson method to obtain the parameters of probability density function which is maximizing the entropy function. The probability density function thusly derived agrees very well with the histogram of wave heights in finite water depth obtained during storm. The probability density function of wave heights developed using maximum entropy method appears to be useful in estimating extreme values and statistical properties of wave heights for the design of coastal structures.

  • PDF

The ex-Gaussian analysis of reaction time distributions for cognitive experiments (ex-Gaussian 모형을 활용한 인지적 과제의 반응시간 분포 분석)

  • Park, Hyung-Bum;Hyun, Joo-Seok
    • Science of Emotion and Sensibility
    • /
    • v.17 no.2
    • /
    • pp.63-76
    • /
    • 2014
  • Although most behavioral reaction times (RTs) for cognitive tasks exhibit positively skewed distributions, the majority of studies primarily rely on a measure of central tendency (e.g. mean) which can cause misinterpretations of data's underlying property. The purpose of current study is to introduce procedures for describing characteristics of RT distributions, thereby effectively examine the influence of experimental manipulations. On the basis of assumption that RT distribution can be represented as a convolution of Gaussian and exponential variables, we fitted the ex-Gaussian function under a maximum-likelihood method. The ex-Gaussian function provides quantitative parameters of distributional properties and the probability density functions. Here we exemplified distributional analysis by using empirical RT data from two conventional visual search tasks, and attempted theoretical interpretation for setsize effect leading proportional mean RT delays. We believe that distributional RT analysis with a mathematical function beyond the central tendency estimates could provide insights into various theoretical and individual difference studies.

Recursive Unscented Kalman Filtering based SLAM using a Large Number of Noisy Observations

  • Lee, Seong-Soo;Lee, Suk-Han;Kim, Dong-Sung
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.6
    • /
    • pp.736-747
    • /
    • 2006
  • Simultaneous Localization and Map Building(SLAM) is one of the fundamental problems in robot navigation. The Extended Kalman Filter(EKF), which is widely adopted in SLAM approaches, requires extensive computation. The conventional particle filter also needs intense computation to cover a high dimensional state space with particles. This paper proposes an efficient SLAM method based on the recursive unscented Kalman filtering in an environment including a large number of landmarks. The posterior probability distributions of the robot pose and the landmark locations are represented by their marginal Gaussian probability distributions. In particular, the posterior probability distribution of the robot pose is calculated recursively. Each landmark location is updated with the recursively updated robot pose. The proposed method reduces filtering dimensions and computational complexity significantly, and has produced very encouraging results for navigation experiments with noisy multiple simultaneous observations.

False Alarm Probability of the Spectrum Sensing Scheme Using the Maximum of Power Spectrum (전력 스펙트럼의 최대값을 사용한 스펙트럼 감지 방식의 오경보 확률)

  • Lim, Chang Heon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.1
    • /
    • pp.37-41
    • /
    • 2014
  • Recently, a lot of research efforts has been directed toward spectrum sensing techniques exploiting the some characteristics of power spectrum. Among them, a sensing technique employing the maximum of power spectrum as a test statistic has appeared in the literature and its false alarm probability was also derived under the assumption that the test statistic follows the Gaussian distribution. This paper provides an exact form of the false alarm probability without using the assumption and compares it with the previous work.