• The Korean Journal of Applied Statistics
• /
• v.34 no.1
• /
• pp.9-23
• /
• 2021

In the following paper we introduce a variational Bayes method that approximates posterior distributions with mean-field method. In particular, we introduce automatic differentiation variation inference (ADVI), which approximates joint posterior distributions using the product of Gaussian distributions after transforming parameters into real coordinate space, and then apply it to pharmacokinetic models that are models for the study of the time course of drug absorption, distribution, metabolism and excretion. We analyze real data sets using ADVI and compare the results with those based on Markov chain Monte Carlo. We implement the algorithms using Stan.

• Annual Conference on Human and Language Technology
• /
• 2019.10a
• /
• pp.93-96
• /
• 2019

최근 딥러닝 모델을 다양한 도메인에 적용하여 뛰어난 성능을 보여주고 있다. 하지만 딥러닝 모델은 정답으로 제시된 결과가 정상적으로 예측된 결과인지, 단순히 오버피팅에 의해 예측된 결과인지를 구분하기 어렵다. 이러한 불확실성(Uncertainty)을 측정 할 수 없다는 문제점을 해결하기 위해서 본 논문에서는 베이지안 딥러닝 방법 중 하나인 변분추론(Variational Inference)과 몬테카를로 Dropout을 오픈도메인(Open-Domain) 태스크에 적용하고, 예측 결과에 대한 불확실성을 측정하여 예측결과에 영향을 주는 모델의 성능을 측정해 효과성을 보인다.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.32 no.7
• /
• pp.15-20
• /
• 2014

• The Korean Journal of Applied Statistics
• /
• v.35 no.3
• /
• pp.445-455
• /
• 2022

In this paper, we introduce existing Bayesian methods for high-dimensional sparse regression models and compare their performance in various simulation scenarios. Especially, we focus on the variational Bayes approach proposed by Ray and Szabó (2021), which enables scalable and accurate Bayesian inference. Based on simulated data sets from sparse high-dimensional linear regression models, we compare the variational Bayes approach with other Bayesian and frequentist methods. To check the practical performance of the variational Bayes in logistic regression models, a real data analysis is conducted using leukemia data set.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.9
• /
• pp.1060-1069
• /
• 2019

Pedestrian-based camera self-calibration methods are suitable for video surveillance systems since they do not require complex calibration devices or procedures. However, using arbitrary pedestrians as calibration targets may result in poor calibration accuracy due to the unknown height of each pedestrian. To solve this problem in the real surveillance environments, this paper proposes a novel Bayesian approach. By assuming known statistics on the height of pedestrians, we construct a probabilistic model that takes into account uncertainties in both the foot/head locations and the pedestrian heights, using foot-head homology. Since solving the model directly is infeasible, we use variational Bayesian inference, an approximate inference algorithm. Accordingly, this makes it possible to estimate the height of pedestrians and to obtain accurate camera parameters simultaneously. Experimental results show that the proposed algorithm is robust to noise and provides accurate confidence in the calibration.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.619-621
• /
• 2005

은닉 마코프 모델은 이산 동역학을 표현할 수 있는 확률 모형이다. 우도 함수 최적화를 수행하는 전통적인 Baum-Welch 학습 알고리즘은 국소해로 수령하기 쉬우며, 우도함수의 특성상 복잡한 모델을 선호하는 바이어스가 존재한다. 베이지안 프레임워크에서는 파라미터를 랜덤 변수로 보고 이에 대한 사후 확률 분포를 추정하여 이 문제를 해결할 수 있다. 본 논문에서는 베이지안 추정을 위한 결정론적 근사화 기법인 변분 베이지안 방법을 이용, 출력 노드에 가우시안 혼합 노드를 지니는 일반화된 HMM의 추론 방법을 유도한다. 인공 데이터에 대한 실험을 통해, 본 방법이 효과적인 HMM 학습을 수행할 수 있음을 보인다.

• 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.

• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.12
• /
• pp.519-524
• /
• 2023

In hashing-based image retrieval, the hash code of a manipulated image is different from the original image, making it difficult to search for the same image. This paper proposes and evaluates a self-supervised deephashing model that generates perceptual hash codes from feature information such as texture, shape, and color of images. The comparison models are autoencoder-based variational inference models, but the encoder is designed with a fully connected layer, convolutional neural network, and transformer modules. The proposed model is a variational inference model that includes a SimAM module of extracting geometric patterns and positional relationships within images. The SimAM module can learn latent vectors highlighting objects or local regions through an energy function using the activation values of neurons and surrounding neurons. The proposed method is a representation learning model that can generate low-dimensional latent vectors from high-dimensional input images, and the latent vectors are binarized into distinguishable hash code. From the experimental results on public datasets such as CIFAR-10, ImageNet, and NUS-WIDE, the proposed model is superior to the comparative model and analyzed to have equivalent performance to the supervised learning-based deephashing model. The proposed model can be used in application systems that require low-dimensional representation of images, such as image search or copyright image determination.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.795-800
• /
• 2016

In image classification, recent CNNs compete with human performance. However, there are limitations in more general recognition. Herein we deal with indoor images that contain too much information to be directly processed and require information reduction before recognition. To reduce the amount of data processing, typically variational inference or variational Bayesian methods are suggested for object detection. However, these methods suffer from the difficulty of marginalizing over the given space. In this study, we propose an image-text integrated recognition system using active vision based on Spatial Transformer Networks. The system attempts to efficiently sample a partial region of a given image for a given language information. Our experimental results demonstrate a significant improvement over traditional approaches. We also discuss the results of qualitative analysis of sampled images, model characteristics, and its limitations.