• Journal of KIISE:Software and Applications
• /
• v.35 no.7
• /
• pp.417-423
• /
• 2008

In this paper we present a probabilistic method for source separation in the case here each source has a certain temporal structure. We tackle the problem of source separation by maximum pseudo-likelihood estimation, representing the latent function which characterizes the temporal structure of each source by a random process with a Gaussian prior. The resulting pseudo-likelihood of the data is Gaussian, determined by a mixing matrix as well as by the predictive mean and covariance matrix that can easily be computed by Gaussian process (GP) regression. Gradient-based optimization is applied to estimate the demixing matrix through maximizing the log-pseudo-likelihood of the data. umerical experiments confirm the useful behavior of our method, compared to existing source separation methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.1-1
• /
• 2001

본 논문에서는 웨이블릿 변환을 멀티스케일 매치 필터의 관점에서 해석하고, 이를 위하여 마르코프 랜덤 필드에 묻혀있는 가우시안 형태의 작은 물체를 검출하는 이론적 근거를 제시하며, 이의 응용으로 맘모그램에 존재하는 마이크로캘시피케이션을 검출하는 알고리즘을 제안한다. 검출하고자 하는 물체가 가우시안 형태이고 그 스케일이 웨이블릿 변환에 의해 계산된 것과 일치하며, 그 주변의 잡영이 마르코프 프로세스이면, LoG(Laplacian of Gaussian) 웨이블릿은 멀티스케일 매치 필터로 작용하며, 적절한 디테일 이미지를 단순히 이진화함으로써 최적의 검출기를 구현할 수 있다. 그런데, 마이크로캘시피케이션은 정확한 가우시안 형태를 갖지 않고, 게다가 맘모그램의 배경이미지도 마르코프 프로세스라는 가정에서 벗어난다. 이러한 불일치를 해결하기 위하여, 본 논문에서는 멀티스케일 웨이블릿 계수에서 추출한 특징벡터를 Hotelling observer에 입력하여 처리함으로써 이를 보상하고자 하였다.

• The Korean Journal of Applied Statistics
• /
• v.28 no.2
• /
• pp.251-267
• /
• 2015

The Indian Buffet Process is a stochastic process on equivalence classes of binary matrices having finite rows and infinite columns. The Indian Buffet Process can be imposed as the prior distribution on the binary matrix in an infinite feature model. We describe the derivation of the Indian buffet process from a finite feature model, and briefly explain the relation between the Indian buffet process and the beta process. Using a Gaussian linear model, we describe three algorithms: Gibbs sampling algorithm, Stick-breaking algorithm and variational method, with application for finding features in image data. We also illustrate the use of the Indian Buffet Process in various type of analysis such as dyadic data analysis, network data analysis and independent component analysis.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.325-334
• /
• 2001

It is shown that the multiscale prewhitening matched filter for detecting Gaussian objects in Markov noise can be implemented by the undecimated wavelet transform with a biorthogonal spline wavelet. If the object to be detected is Gaussian shaped and its scale coincides with one of those computed by the wavelet transform, and if the background noise is truly Markov, then optimum detection is realized by thresholding the appropriate details image. Our detection algorithm is applied to the digitized mammograms for detecting microcalcifications. However, microcalcifications are not exactly Gaussian shaped and its background noise may not be Markov. In order to campensate for these discrepancy, Hotelling observer is employed, which is applied to feature vectors comprised of 3-octave wavelet coefficients.

• KIPS Transactions on Computer and Communication Systems
• /
• v.13 no.1
• /
• pp.1-9
• /
• 2024

In the development and mass production of polymers, there are many uncontrollable variables. Even small changes in chemical composition, structure, and processing conditions can lead to large variations in properties. Therefore, Traditional linear modeling techniques that assume a general environment often produce significant errors when applied to field data. In this study, we propose a new modeling method (GPR-SEM) that combines Structural Equation Modeling (SEM) and Gaussian Process Regression (GPR) to study the Friction-Coefficient and Flexural-Strength properties of Polyacetal resin, an engineering plastic, in order to meet the recent trend of using plastics in industrial drive components. And we also consider the possibility of using it for materials modeling with nonlinearity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.303-306
• /
• 2011

GPS 수신이 어려운 실내 환경에서 이동 단말기 사용자나 로봇의 위치를 추정하기 위해 WiFi 신호 강도를 이용하는 연구가 최근 들어 활발히 전개되고 있다. 본 논문에서는 WiFi 신호의 불안정성과 불확실성에 효과적인 가우시안 프로세서를 적용하여, 실내에서 이동 중인 스마트폰 사용자의 실시간 위치를 추정하는 방법을 제안한다. 실험을 통해 제안한 방법의 성능을 분석해보고, 성능 개선을 위한 확장 방안을 제시한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.82-83
• /
• 2007

• Journal of Korea Multimedia Society
• /
• v.12 no.8
• /
• pp.1155-1163
• /
• 2009

This paper proposes an automatic facial expression generation system of vector graphic character using gaussian process model. Proposed method extracts the main feature vectors from twenty-six facial data of character redefined based on Russell's internal emotion state. Also by using new gaussian process model, SGPLVM, we find low-dimensional feature data from extracted high-dimensional feature vectors, and learn probability distribution function (PDF). All parameters of PDF are estimated by maximization the likelihood of learned expression data, and these are used to select wanted facial expressions on two-dimensional space in real time. As a result of simulation, we confirm that proposed facial expression generation tool is working in the small facial expression datasets and can generate various facial expressions without prior knowledge about relation between facial expression and emotion.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.297-305
• /
• 2008

Recently, kernel methods have attracted great interests in the areas of pattern classification, function approximation, and anomaly detection. The role of the kernel is particularly important in the methods such as SVM(support vector machine) and KPCA(kernel principal component analysis), for it can generalize the conventional linear machines to be capable of efficiently handling nonlinearities. This paper considers the problem of combining radar and rain gauge observations utilizing the regression approach based on the kernel-based gaussian process and support vector learning. The data-assimilation results of the considered methods are reported for the radar and rain gauge observations collected over the region covering parts of Gangwon, Kyungbuk, and Chungbuk provinces of Korea, along with performance comparison.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.338-344
• /
• 1994

Price`s theorem is generalized for general zero memory nonlinear function when input are drawn from a sum, called the constrained non-Gaussian, of two or more mutually independent processes of which the first is the Gaussian. An example is given to illustrate the applicability of the generalization.