• Earthquakes and Structures
• /
• v.22 no.2
• /
• pp.157-168
• /
• 2022

A moment-independent importance measure analysis approach was introduced to quantify the effects of structural uncertainty parameters on probabilistic seismic demands of simply supported girder bridges. Based on the probability distributions of main uncertainty parameters in bridges, conditional and unconditional bridge samples were constructed with Monte-Carlo sampling and analyzed in the OpenSees platform with a series of real seismic ground motion records. Conditional and unconditional probability density functions were developed using kernel density estimation with the results of nonlinear time history analysis of the bridge samples. Moment-independent importance measures of these uncertainty parameters were derived by numerical integrations with the conditional and unconditional probability density functions, and the uncertainty parameters were ranked in descending order of their importance. Different from Tornado diagram approach, the impacts of uncertainty parameters on the whole probability distributions of bridge seismic demands and the interactions of uncertainty parameters were considered simultaneously in the importance measure analysis approach. Results show that the interaction of uncertainty parameters had significant impacts on the seismic demand of components, and in some cases, it changed the most significant parameters for piers, bearings and abutments.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.1
• /
• pp.75-86
• /
• 1999

An air-data estimator for generic air-breathing hypersonic vehicles (AHSVs) is developed and demonstrated with an example vehicle configuration. The AHSV air-data estimation strategy emphasized improvement of the angle of attack estimate accuracy to a degree necessitated by the stringent operational requirements of the air-breathing propulsion. the resulting estimation problem involves highly nonlinear diffusion process (propagation); consequently, significant distortion of a posteriori conditional density is suspected. A simulation based statistical analysis tool is developed to characterize the nonlinear diffusion process. The statistical analysis results indicate that the diffusion process preserves the symmetry and unimodality of initial probability density shape state variables, and provide the basis for applicability of an Extended Kalman Filter (EKF). An EKF is designed for the AHSV air-data system and the air data estimation capabilities are demonstrated.

• Journal of the Korean Data and Information Science Society
• /
• v.7 no.1
• /
• pp.21-35
• /
• 1996

In this paper, estimation and prediction procedures are discussed for grneral situation in which the failure time follows the independent density $f_{i}({\varepsilon}_{i})$ for the accelerated life testing under Type II censoring. In the context of accelerated life test experiment, procedures are given for estimating the parameters in the Eyring model, and for estimating mean life at a given future stress level. The procedures given are conditional confidence interval procedures, obtained by conditioning on ancillary statistics. A comparison is made of these procedures and procedures based on asymptotic properties of the maximum, likelihood estimates.

• Structural Engineering and Mechanics
• /
• v.5 no.6
• /
• pp.839-851
• /
• 1997

Closed-form solutions are analytically derived for stochastic properties of earthquake ground motion fields, which are conditioned by an observed time series at certain observation sites and are characterized by spectra with uncertainties. The theoretical framework presented here can estimate not only the expectations of such simulated earthquake ground motions, but also the prediction errors which offer important information for the field of engineering. Before these derivations are made, the theory of conditional random fields is summarized for convenience in this study. Furthermore, a method for stochastic interpolation of power spectra is explained.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.520-524
• /
• 2009

In compressed color images, colors are usually represented by luminance and chrominance (YCbCr) components. Considering characteristics of human vision system, chrominance (CbCr) components are generally represented more coarsely than luminance component. Aiming at possible recovery of chrominance components, we propose a model-based chrominance estimation algorithm where color images are modeled by a Markov random field (MRF). A simple MRF model is here used whose local conditional probability density function (pdf) for a color vector of a pixel is a Gaussian pdf depending on color vectors of its neighboring pixels. Chrominance components of a pixel are estimated by maximizing the conditional pdf given its luminance component and its neighboring color vectors. Experimental results show that the proposed chrominance estimation algorithm is effective for quality improvement of compressed color images such as JPEG and JPEG2000.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.3
• /
• pp.186-199
• /
• 2013

We pose pattern classification as a density estimation problem where we consider mixtures of generative models under partially labeled data setups. Unlike traditional approaches that estimate density everywhere in data space, we focus on the density along the decision boundary that can yield more discriminative models with superior classification performance. We extend our earlier work on the recursive estimation method for discriminative mixture models to semi-supervised learning setups where some of the data points lack class labels. Our model exploits the mixture structure in the functional gradient framework: it searches for the base mixture component model in a greedy fashion, maximizing the conditional class likelihoods for the labeled data and at the same time minimizing the uncertainty of class label prediction for unlabeled data points. The objective can be effectively imposed as individual mixture component learning on weighted data, hence our mixture learning typically becomes highly efficient for popular base generative models like Gaussians or hidden Markov models. Moreover, apart from the expectation-maximization algorithm, the proposed recursive estimation has several advantages including the lack of need for a pre-determined mixture order and robustness to the choice of initial parameters. We demonstrate the benefits of the proposed approach on a comprehensive set of evaluations consisting of diverse time-series classification problems in semi-supervised scenarios.

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2009.06a
• /
• pp.186-186
• /
• 2009

The characterization strategy of fracture networks are classified into a deterministic or statistical characterization according to the type of required information. A deterministic characterization is most efficient for a sparsely fractured system, while the statistics are sufficient for densely fractured rock. In this study, the ensemble mean and variability of the effective connectivity is systematically analyzed with various density values for different network structures of a power law size distribution. The results of high resolution Monte Carlo analyses show that statistical characteristics can be a necessary information to determine the transport properties of a fracture system when fracture density is greater than a percolation threshold. When the percolation probability (II) approaches unity with increasing fracture density, the effective connectivity of the network can be safely estimated using statistics only (sufficient condition). It is inferred from conditional simulations that deterministic information for main pathways can reduce the uncertainty in estimation of system properties when the network becomes denser. Overall results imply that most pathways need to be identified when II < 0.5 statistics are sufficient when II $\rightarrow$ 1 and statistics are necessary and the identification of main pathways can significantly reduce the uncertainty in estimation of transport properties when 0.5$\ll$1. It is suggested that the proper estimation of the percolation probability of a fracture network is a prerequisite for an appropriate conceptualization and further characterization.

• The Korean Journal of Applied Statistics
• /
• v.24 no.6
• /
• pp.987-994
• /
• 2011

From the point view of credit evaluation whose population is divided into the default and non-default state, two methods are considered to estimate conditional distribution functions: one is to estimate under the assumption that the data is followed the mixture normal distribution and the other is to use the kernel density estimation. The parameters of normal mixture are estimated using the EM algorithm. For the kernel density estimation, five kinds of well known kernel functions and four kinds of the bandwidths are explored. In addition, the corresponding ROC functions are obtained based on the estimated distribution functions. The goodness-of-fit of the estimated distribution functions are discussed and the performance of the ROC functions are compared. In this work, it is found that the kernel distribution functions shows better fit, and the ROC function obtained under the assumption of normal mixture shows better performance.

• Communications for Statistical Applications and Methods
• /
• v.16 no.3
• /
• pp.479-485
• /
• 2009

When a part of data is unobserved the marginal likelihood of parameters given the observed data often involves analytically intractable high dimensional integral and hence it is hard to find the maximum likelihood estimate of the parameters. Simulated maximum likelihood(SML) method which estimates the marginal likelihood via Monte Carlo importance sampling and optimize the estimated marginal likelihood has been used in many applications. A key issue in SML is to find a good proposal density from which Monte Carlo samples are generated. The optimal proposal density is the conditional density of the unobserved data given the parameters and the observed data, and attempts have been given to find a good approximation to the optimal proposal density. Algorithms which adaptively improve the proposal density have been widely used due to its simplicity and efficiency. In this paper, we describe a fully adaptive algorithm which has been used by some practitioners but has not been well recognized in statistical literature, and evaluate its estimation performance and robustness via a simulation study. The simulation study shows a great improvement in the order of magnitudes in the mean squared error, compared to non-adaptive or partially adaptive SML methods. Also, it is shown that the fully adaptive SML is robust in a sense that it is insensitive to the starting points in the optimization routine.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2032-2038
• /
• 2006

The recognition of human gestures in image sequences is an important and challenging problem that enables a host of human-computer interaction applications. This paper describes a gesture recognition algorithm based on the particle filters, namely CONDENSATION. The particle filter is more efficient than any other tracking algorithm because the tracking mechanism follows Bayesian estimation rule of conditional probability propagation. We used two models for the evaluation of particle Inter and apply the MATLAB for the preprocessing of the image sequence. But we implement the particle filter using the C++ to get the high speed processing. In the experimental results, it is demonstrated that the proposed algorithm prove to be robust in the cluttered environment.