• ETRI Journal
• /
• 제38권3호
• /
• pp.579-588
• /
• 2016

To improve the ability to determine a vehicle's movement information even in a challenging environment, a hybrid approach called non-Gaussian square rootunscented particle filtering (nGSR-UPF) is presented. This approach combines a square root-unscented Kalman filter (SR-UKF) and a particle filter (PF) to determinate the vehicle state where measurement noises are taken as a finite Gaussian kernel mixture and are approximated using a sparse Gaussian kernel density estimation method. During an outage-free GPS period, the updated mean and covariance, computed using SR-UKF, are estimated based on a GPS observation update. During a complete GPS outage, nGSR-UPF operates in prediction mode. Indeed, because the inertial sensors used suffer from a large drift in this case, SR-UKF-based importance density is then responsible for shifting the weighted particles toward the high-likelihood regions to improve the accuracy of the vehicle state. The proposed method is compared with some existing estimation methods and the experiment results prove that nGSR-UPF is the most accurate during both outage-free and complete-outage GPS periods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2928-2947
• /
• 2015

Adaptive Gaussian filter (AGF) is a recently developed switching filter to remove salt and pepper noise. AGF first directly identifies pixels of gray levels 0 and 255 as noise pixels, and then only restored noise pixels using a Gaussian filter with adaptive variance based on the estimated noise density. AGF usually achieves better denoising effect in comparison with other filters. However, AGF still fails to obtain good denoising effect on images with noise-free pixels of gray levels 0 and 255, due to its severe false alarm in its noise detection stage. To alleviate this issue, a modified version of AGF is proposed in this paper. Specifically, the proposed filter first performs noise detection via an image block based noise density estimation and sequential noise density guided rectification on the noise detection result of AGF. Then, a modified Gaussian filter with adaptive variance and window size is used to restore the detected noise pixels. The proposed filter has been extensively evaluated on two representative grayscale images and the Berkeley image dataset BSDS300 with 300 images. Experimental results showed that the proposed filter achieved better denoising effect over the state-of-the-art filters, especially on images with noise-free pixels of gray levels 0 and 255.

• Wind and Structures
• /
• 제18권6호
• /
• pp.693-715
• /
• 2014

Stochastic processes are used to represent phenomena in many diverse fields. Numerical simulation method is widely applied for the solution to stochastic problems of complex structures when alternative analytical methods are not applicable. In some practical applications the stochastic processes show non-Gaussian properties. When the stochastic processes deviate significantly from Gaussian, techniques for their accurate simulation must be available. The various existing simulation methods of non-Gaussian stochastic processes generally can only simulate super-Gaussian stochastic processes with the high-peak characteristics. And these methodologies are usually complicated and time consuming, not sufficiently intuitive. By revealing the inherent coupling effect of the phase and amplitude part of discrete Fourier representation of random time series on the non-Gaussian features (such as skewness and kurtosis) through theoretical analysis and simulation experiments, this paper presents a novel approach for the simulation of non-Gaussian stochastic processes with the prescribed amplitude probability density function (PDF) and power spectral density (PSD) by amplitude modulation and phase reconstruction. As compared to previous spectral representation method using phase modulation to obtain a non-Gaussian amplitude distribution, this non-Gaussian phase reconstruction strategy is more straightforward and efficient, capable of simulating both super-Gaussian and sub-Gaussian stochastic processes. Another attractive feature of the method is that the whole process can be implemented efficiently using the Fast Fourier Transform. Cases studies demonstrate the efficiency and accuracy of the proposed algorithm.

• 대한전자공학회논문지
• /
• 제24권4호
• /
• pp.713-718
• /
• 1987

In this paper, an iterative restoration algorithm from power spectral density with 1 bit sign information of real part of two dimensional Fourier transform of image corrupted by additive white Gaussian noise is proposed. This method is a modified version of image reconstruction algorithm from power spectral density. From the results of computer simulation with original 32 gray level imgae of 64x64 pixels, we can find that restorated image after each iteration converge to original image very fast, and SNR gain be at least 8[dB] after 10th iteration for corrupted image with additive white Gaussian noise.

• Journal of the Korean Statistical Society
• /
• 제25권2호
• /
• pp.265-276
• /
• 1996

The nonparametric deconvolution problems are studied to recover an unknown density when the data are contaminated with Gaussian error. We propose the estimator which is a linear combination of kernel type estimates of derivertives of the observed density function. We show that this estimator is consistent and also consider the properties of estimator at small sample by simulation.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2011년도 춘계학술대회
• /
• pp.808-810
• /
• 2011

입력영상에 대하여 전처리과정으로 배경을 분리하는 것이 영상처리 및 인식 성능에 중요한 영향을 준다. 본 논문에서는 화재검출을 위한 영상인식 전처리로 활용하는 다양한 배경추정 알고리즘에 대하여 계산량과 배경추정 성능 분석하였다. 비교하는 배경추정알고리즘은 Gaussian Running Average 추정기법, Mixture of Gaussian 모델, 그리고 KDE (kernel density estimate) 알고리즘에 대한 성능을 평가하였다. 입력영상에 대하여 배경영상차로부터 연기를 검출하는데 있어 KDE 알고리즘이 배경추정 성능은 우수한 것을 확인하였다.

• Communications for Statistical Applications and Methods
• /
• 제9권3호
• /
• pp.715-723
• /
• 2002

This paper is to show a clustering application of a density estimation method that utilizes the Gaussian mixture model. We define "closeness measure" as a clustering criterion to see how close given two Gaussian components are. Closeness measure is defined as the ratio of log likelihood between two Gaussian components. According to simulations using artificial data, the clustering algorithm turned out to be very powerful in that it can correctly determine clusters in complex situations, and very flexible in that it can produce different sizes of clusters based on different threshold valuesold values

• Structural Engineering and Mechanics
• /
• 제75권6호
• /
• pp.771-784
• /
• 2020

Reliability analysis techniques combining with various surrogate models have attracted increasing attention because of their accuracy and great efficiency. However, they primarily focus on the structures with continuous response, while very rare researches on the reliability analysis for structures with discontinuous response are carried out. Furthermore, existing adaptive reliability analysis methods based on importance sampling (IS) still have some intractable defects when dealing with small failure probability, and there is no related research on reliability analysis for structures involving discontinuous response and small failure probability. Therefore, this paper proposes a novel reliability analysis method called AGPC-IS for such structures, which combines adaptive Gaussian process classification (GPC) and adaptive-kernel-density-estimation-based IS. In AGPC-IS, an efficient adaptive strategy for design of experiments (DoE), taking into consideration the classification uncertainty, the sampling uniformity and the regional classification accuracy improvement, is developed with the purpose of improving the accuracy of Gaussian process classifier. The adaptive kernel density estimation is introduced for constructing the quasi-optimal density function of IS. In addition, a novel and more precise stopping criterion is also developed from the perspective of the stability of failure probability estimation. The efficiency, superiority and practicability of AGPC-IS are verified by three examples.

• Communications for Statistical Applications and Methods
• /
• 제23권1호
• /
• pp.71-83
• /
• 2016

In this paper we discuss a deconvolution density estimator obtained using the support vector machines (SVM) and Tikhonov's regularization method solving ill-posed problems in reproducing kernel Hilbert space (RKHS). A remarkable property of SVM is that the SVM leads to sparse solutions, but the support vector deconvolution density estimator does not preserve sparsity as well as we expected. Thus, in section 3, we propose another support vector deconvolution estimator (method II) which leads to a very sparse solution. The performance of the deconvolution density estimators based on the support vector method is compared with the classical kernel deconvolution density estimator for important cases of Gaussian and Laplacian measurement error by means of a simulation study. In the case of Gaussian error, the proposed support vector deconvolution estimator shows the same performance as the classical kernel deconvolution density estimator.

• 한국군사과학기술학회지
• /
• 제12권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.