• Title/Summary/Keyword: Non-Gaussian data

Search Result 158, Processing Time 0.034 seconds

Fusion of Decisions in Wireless Sensor Networks under Non-Gaussian Noise Channels at Large SNR (비 정규 분포 잡음 채널에서 높은 신호 대 잡음비를 갖는 무선 센서 네트워크의 정보 융합)

  • Park, Jin-Tae;Kim, Gi-Sung;Kim, Ki-Seon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.12 no.5
    • /
    • pp.577-584
    • /
    • 2009
  • Fusion of decisions in wireless sensor networks having flexibility on energy efficiency is studied in this paper. Two representative distributions, the generalized Gaussian and $\alpha$-stable probability density functions, are used to model non-Gaussian noise channels. By incorporating noise channels into the parallel fusion model, the optimal fusion rules are represented and suboptimal fusion rules are derived by using a large signal-to-noise ratio(SNR) approximation. For both distributions, the obtained suboptimal fusion rules are same and have equivalent form to the Chair-Varshney fusion rule(CVR). Thus, the CVR does not depend on the behavior of noise distributions that belong to the generalized Gaussian and $\alpha$-stable probability density functions. The simulation results show the suboptimality of the CVR at large SNRs.

Computation and Smoothing Parameter Selection In Penalized Likelihood Regression

  • Kim Young-Ju
    • Communications for Statistical Applications and Methods
    • /
    • v.12 no.3
    • /
    • pp.743-758
    • /
    • 2005
  • This paper consider penalized likelihood regression with data from exponential family. The fast computation method applied to Gaussian data(Kim and Gu, 2004) is extended to non Gaussian data through asymptotically efficient low dimensional approximations and corresponding algorithm is proposed. Also smoothing parameter selection is explored for various exponential families, which extends the existing cross validation method of Xiang and Wahba evaluated only with Bernoulli data.

Gaussian models for bond strength evaluation of ribbed steel bars in concrete

  • Prabhat R., Prem;Branko, Savija
    • Structural Engineering and Mechanics
    • /
    • v.84 no.5
    • /
    • pp.651-664
    • /
    • 2022
  • A precise prediction of the ultimate bond strength between rebar and surrounding concrete plays a major role in structural design, as it effects the load-carrying capacity and serviceability of a member significantly. In the present study, Gaussian models are employed for modelling bond strength of ribbed steel bars embedded in concrete. Gaussian models offer a non-parametric method based on Bayesian framework which is powerful, versatile, robust and accurate. Five different Gaussian models are explored in this paper-Gaussian Process (GP), Variational Heteroscedastic Gaussian Process (VHGP), Warped Gaussian Process (WGP), Sparse Spectrum Gaussian Process (SSGP), and Twin Gaussian Process (TGP). The effectiveness of the models is also evaluated in comparison to the numerous design formulae provided by the codes. The predictions from the Gaussian models are found to be closer to the experiments than those predicted using the design equations provided in various codes. The sensitivity of the models to various parameters, input feature space and sampling is also presented. It is found that GP, VHGP and SSGP are effective in prediction of the bond strength. For large data set, GP, VHGP, WGP and TGP can be computationally expensive. In such cases, SSGP can be utilized.

Target segmentation in non-homogeneous infrared images using a PCA plane and an adaptive Gaussian kernel

  • Kim, Yong Min;Park, Ki Tae;Moon, Young Shik
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.2302-2316
    • /
    • 2015
  • We propose an efficient method of extracting targets within a region of interest in non-homogeneous infrared images by using a principal component analysis (PCA) plane and adaptive Gaussian kernel. Existing approaches for extracting targets have been limited to using only the intensity values of the pixels in a target region. However, it is difficult to extract the target regions effectively because the intensity values of the target region are mixed with the background intensity values. To overcome this problem, we propose a novel PCA based approach consisting of three steps. In the first step, we apply a PCA technique minimizing the total least-square errors of an IR image. In the second step, we generate a binary image that consists of pixels with higher values than the plane, and then calculate the second derivative of the sum of the square errors (SDSSE). In the final step, an iteration is performed until the convergence criteria is met, including the SDSSE, angle and labeling value. Therefore, a Gaussian kernel is weighted in addition to the PCA plane with the non-removed data from the previous step. Experimental results show that the proposed method achieves better segmentation performance than the existing method.

Observed Data Oriented Bispectral Estimation of Stationary Non-Gaussian Random Signals - Automatic Determination of Smoothing Bandwidth of Bispectral Windows

  • Sasaki, K.;Shirakata, T.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.502-507
    • /
    • 2003
  • Toward the development of practical methods for observed data oriented bispectral estimation, an automatic means for determining the smoothing bandwidth of bispectral windows is proposed, that can also provide an associated optimum bispectral estimate of stationary non-Gaussian signals, systematically only from an observed time series datum of finite length. For the conventional non-parametric bispectral estimation, the MSE (mean squared error) of the normalized estimate is reviewed under a certain mixing condition and sufficient data length, mainly from the viewpoint of the inverse relation between its bias and variance with respect to the smoothing bandwidth. Based on the fundamental relation, a systematic method not only for determining the bandwidth, but also for obtaining the optimum bispectral estimate is presented by newly introducing a MSE evaluation index of the estimate only from an observed time series datum of finite length. The effectiveness and fundamental features of the proposed method are illustrated by the basic results of numerical experiments.

  • PDF

A Non-linear Variant of Improved Robust Fuzzy PCA (잡음 민감성이 향상된 주성분 분석 기법의 비선형 변형)

  • Heo, Gyeong-Yong;Seo, Jin-Seok;Lee, Im-Geun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.4
    • /
    • pp.15-22
    • /
    • 2011
  • Principal component analysis (PCA) is a well-known method for dimensionality reduction and feature extraction while maintaining most of the variation in data. Although PCA has been applied in many areas successfully, it is sensitive to outliers and only valid for Gaussian distributions. Several variants of PCA have been proposed to resolve noise sensitivity and, among the variants, improved robust fuzzy PCA (RF-PCA2) demonstrated promising results. RF-PCA, however, is still a linear algorithm that cannot accommodate non-Gaussian distributions. In this paper, a non-linear algorithm that combines RF-PCA2 and kernel PCA (K-PCA), called improved robust kernel fuzzy PCA (RKF-PCA2), is introduced. The kernel methods make it to accommodate non-Gaussian distributions. RKF-PCA2 inherits noise robustness from RF-PCA2 and non-linearity from K-PCA. RKF-PCA2 outperforms previous methods in handling non-Gaussian distributions in a noise robust way. Experimental results also support this.

An Anomaly Detection Framework Based on ICA and Bayesian Classification for IaaS Platforms

  • Wang, GuiPing;Yang, JianXi;Li, Ren
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3865-3883
    • /
    • 2016
  • Infrastructure as a Service (IaaS) encapsulates computer hardware into a large amount of virtual and manageable instances mainly in the form of virtual machine (VM), and provides rental service for users. Currently, VM anomaly incidents occasionally occur, which leads to performance issues and even downtime. This paper aims at detecting anomalous VMs based on performance metrics data of VMs. Due to the dynamic nature and increasing scale of IaaS, detecting anomalous VMs from voluminous correlated and non-Gaussian monitored performance data is a challenging task. This paper designs an anomaly detection framework to solve this challenge. First, it collects 53 performance metrics to reflect the running state of each VM. The collected performance metrics are testified not to follow the Gaussian distribution. Then, it employs independent components analysis (ICA) instead of principal component analysis (PCA) to extract independent components from collected non-Gaussian performance metric data. For anomaly detection, it employs multi-class Bayesian classification to determine the current state of each VM. To evaluate the performance of the designed detection framework, four types of anomalies are separately or jointly injected into randomly selected VMs in a campus-wide testbed. The experimental results show that ICA-based detection mechanism outperforms PCA-based and LDA-based detection mechanisms in terms of sensitivity and specificity.

Data-Driven Batch Processing for Parameter Calibration of a Sensor System (센서 시스템의 매개변수 교정을 위한 데이터 기반 일괄 처리 방법)

  • Kyuman Lee
    • Journal of Sensor Science and Technology
    • /
    • v.32 no.6
    • /
    • pp.475-480
    • /
    • 2023
  • When modeling a sensor system mathematically, we assume that the sensor noise is Gaussian and white to simplify the model. If this assumption fails, the performance of the sensor model-based controller or estimator degrades due to incorrect modeling. In practice, non-Gaussian or non-white noise sources often arise in many digital sensor systems. Additionally, the noise parameters of the sensor model are not known in advance without additional noise statistical information. Moreover, disturbances or high nonlinearities often cause unknown sensor modeling errors. To estimate the uncertain noise and model parameters of a sensor system, this paper proposes an iterative batch calibration method using data-driven machine learning. Our simulation results validate the calibration performance of the proposed approach.

A RSS-Based Localization Method Utilizing Robust Statistics for Wireless Sensor Networks under Non-Gaussian Noise (비 가우시안 잡음이 존재하는 무선 센서 네트워크에서 Robust Statistics를 활용하는 수신신호세기기반의 위치 추정 기법)

  • Ahn, Tae-Joon;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.23-30
    • /
    • 2011
  • In the wireless sensor network(WSN), the detection of precise location of sensor nodes is essential for efficiently utilizing the sensing data acquired from sensor nodes. Among various location methods, the received signal strength (RSS) based localization scheme is mostly preferable in many applications since it can be easily implemented without any additional hardware cost. Since the RSS localization method is mainly effected by radio channel between two nodes, outlier data can be included in the received signal strength measurement specially when some obstacles move around the link between nodes. The outlier data can have bad effect on estimating the distance between two nodes such that it can cause location errors. In this paper, we propose a RSS-based localization method using Robust Statistic and Gaussian filter algorithm for enhancing the accuracy of RSS-based localization. In the proposed algorithm, the outlier data can be eliminated from samples by using the Robust Statistics as well as the Gaussian filter such that the accuracy of localization can be achieved. Through simulation, it is shown that the proposed algorithm can increase the accuracy of localization and is more robust to non gaussian noise channels.

Model selection algorithm in Gaussian process regression for computer experiments

  • Lee, Youngsaeng;Park, Jeong-Soo
    • Communications for Statistical Applications and Methods
    • /
    • v.24 no.4
    • /
    • pp.383-396
    • /
    • 2017
  • The model in our approach assumes that computer responses are a realization of a Gaussian processes superimposed on a regression model called a Gaussian process regression model (GPRM). Selecting a subset of variables or building a good reduced model in classical regression is an important process to identify variables influential to responses and for further analysis such as prediction or classification. One reason to select some variables in the prediction aspect is to prevent the over-fitting or under-fitting to data. The same reasoning and approach can be applicable to GPRM. However, only a few works on the variable selection in GPRM were done. In this paper, we propose a new algorithm to build a good prediction model among some GPRMs. It is a post-work of the algorithm that includes the Welch method suggested by previous researchers. The proposed algorithms select some non-zero regression coefficients (${\beta}^{\prime}s$) using forward and backward methods along with the Lasso guided approach. During this process, the fixed were covariance parameters (${\theta}^{\prime}s$) that were pre-selected by the Welch algorithm. We illustrated the superiority of our proposed models over the Welch method and non-selection models using four test functions and one real data example. Future extensions are also discussed.