• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 춘계 학술대회 학술발표 논문집
• /
• pp.182-185
• /
• 2003

This paper presents a new design algorithm for the combination with the fuzzy classifier and the Bayesian classifier. Only few attempts have so far been made at providing an effective design algorithm combining the advantages and removing the disadvantages of two classifiers. Specifically, the suggested algorithms are composed of three steps: the combining, the fuzzy-set-based pruning, and the fuzzy set tuning. In the combining, the multi-inputs and multi-outputs (MIMO) fuzzy model is used to combine two classifiers. In the fuzzy-set-based pruning, to effectively decrease the complexity of the fuzzy-Bayesian classifier and the risk of the overfitting, the analysis method of the fuzzy set and the recursive pruning method are proposesd. In the fuzzy set tuning for the misclassified feature vectors, the premise parameters are adjusted by using the gradient decent algorithm. Finally, to show the feasibility and the validity of the proposed algorithm, a computer simulation is provided.

• 한국통신학회논문지
• /
• 제36권3B호
• /
• pp.248-253
• /
• 2011

선박의 충돌회피 알고리즘은 인적 요인에 의한 해난사고를 방지하고, 보다 효과적이고 안전한 운항을 위해 개발되어 왔다. 본 논문에서는 충돌사고의 위험성을 줄이고, 안전운항을 지원하기 위하여, 베이지안 추정 이론을 이용하여 충돌 위험도를 추정하는 알고리즘을 고안한다. 기존의 선박 충돌 회피를 시스템보다 안전한 충돌 회피를 위해서 베이지안 추정 이론을 이용하여 충돌 위험도를 계산하고 일정 시간 이후에 타선들의 위치 및 속도정보와 자선의 위치 및 속도정보를 이용하여 충돌 위험도를 예측함으로써 보다 안전하고 효율적인 충돌 위험도를 결정한다. 본 논문에서 타선박의 항해정보는 AIS 정보를 가정하였고, 기존의 DCPA와 TCPA를 이용한 퍼지 추론 방법보다 효율적으로 충돌 위험도를 추정할 수 있다.

• 한국소프트웨어감정평가학회 논문지
• /
• 제16권2호
• /
• pp.63-68
• /
• 2020

본 논문에서는 딥러닝 프레임워크 기반의 얼굴인증 시스템에 대하여 제안한다. 제안 시스템은 딥러닝 알고리즘을 활용하여 얼굴영역 검출과 얼굴 특징 추출을 수행하고, 결합베이시안 학습 모델을 이용하여 얼굴인증을 수행한다. 제안 얼굴인증 알고리즘에 대한 성능 평가는 다양한 얼굴 사진들로 구성된 데이터베이스를 이용하여 수행하였으며, 한 명에 대한 얼굴 영상은 2장으로 구성하였다. 또한 얼굴인증 실험은 딥 뉴럴 네트워크를 통한 2048차원의 특징과 그 유사성을 측정하기 위해 결합베이시안 알고리즘을 적용하였으며, 얼굴인증에 실패한 동일오율을 계산함으로써 성능평가를 수행하였다. 실험 결과, 딥러닝 특징과 결합베이시안 알고리즘을 사용한 제안 방법은 1.2%의 동일오율을 보였다.

• 전자공학회논문지CI
• /
• 제45권6호
• /
• pp.179-186
• /
• 2008

본 논문에서는 베이지안 알고리즘이 불균형 데이터의 학습 시 나타나는 현상을 분석하고 성능 평가 방법을 비교하였다. 사전 데이터 분포를 가정하고 불균형 데이터 비율과 분류 복잡도에 따라 발생된 분류 문제에 대해 베이지안 학습을 수행하였다. 실험 결과는 ROC(Receiver Operator Characteristic)와 PR(Precision-Recall) 평가 방법의 AUC(Area Under the Curve)를 계사하여 불균형 데이터 비율과 분류 복잡도에 따라 분석되었다. 비교 분석에서 불균형 비율은 기 수행된 연구 결과와 같이 베이지안 학습에 영향을 주었으며, 높은 분류 복잡도로부터 나타나는 데이터 중복은 학습 성능을 방해하는 요인으로 확인되었다. PR 평가의 AUC는 높은 분류 복잡도와 높은 불균형 데이터 비율에서 ROC 평가의 AUC보다 학습 성능의 차이가 크게 나타났다. 그러나 낮은 분류 복잡도와 낮은 불균형 데이터 비율의 문제에서 두 측정 방법의 학습 성능의 차이는 미비하거나 비슷하였다. 이러한 결과로부터 PR 평가의 AUC는 클래스 불균형 문제의 학습 모델의 설계와 오분류 비용을 고려한 최적의 학습기를 결정하는데 도움을 줄 수 있다.

• 천문학회보
• /
• 제41권2호
• /
• pp.62.2-62.2
• /
• 2016

We present a newly developed algorithm based on a Bayesian method for 2D tilted-ring analysis of disk galaxies which operates on velocity fields. Compared to the conventional ones based on a chi-squared minimisation procedure, this new Bayesian-based algorithm less suffers from local minima of the model parameters even with high multi-modality of their posterior distributions. Moreover, the Bayesian analysis implemented via Markov Chain Monte Carlo (MCMC) sampling only requires broad ranges of posterior distributions of the parameters, which makes the fitting procedure fully automated. This feature is essential for performing kinematic analysis of an unprecedented number of resolved galaxies from the upcoming Square Kilometre Array (SKA) pathfinders' galaxy surveys. A standalone code, the so-called '2D Bayesian Automated Tilted-ring fitter' (2DBAT) that implements the Bayesian fits of 2D tilted-ring models is developed for deriving rotation curves of galaxies that are at least marginally resolved (> 3 beams across the semi-major axis) and moderately inclined (20 < i < 70 degree). The main layout of 2DBAT and its performance test are discussed using sample galaxies from Australia Telescope Compact Array (ATCA) observations as well as artificial data cubes built based on representative rotation curves of intermediate-mass and massive spiral galaxies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5507-5528
• /
• 2016

In computer vision, salient object is important to extract the useful information of foreground. With active contour analysis acting as the core in this paper, we propose a bottom-up saliency detection algorithm combining with the Bayesian model and the global color distribution. Under the supports of active contour model, a more accurate foreground can be obtained as a foundation for the Bayesian model and the global color distribution. Furthermore, we establish a contour-based selection mechanism to optimize the global-color distribution, which is an effective revising approach for the Bayesian model as well. To obtain an excellent object contour, we firstly intensify the object region in the source gray-scale image by a seed-based method. The final saliency map can be detected after weighting the color distribution to the Bayesian saliency map, after both of the two components are available. The contribution of this paper is that, comparing the Harris-based convex hull algorithm, the active contour can extract a more accurate and non-convex foreground. Moreover, the global color distribution can solve the saliency-scattered drawback of Bayesian model, by the mutual complementation. According to the detected results, the final saliency maps generated with considering the global color distribution and active contour are much-improved.

• Communications for Statistical Applications and Methods
• /
• 제19권4호
• /
• pp.619-628
• /
• 2012

Noise reduction is an important issue in the field of image processing because image noise lowers the quality of the original pure image. The basic difficulty is that the noise and the signal are not easily distinguished. Simple smoothing is the most basic and important procedure to effectively remove the noise; however, the weakness is that the feature area is simultaneously blurred. In this research, we use ways to measure the degree of noise with respect to the degree of image features and propose a Bayesian noise reduction method based on MAP (maximum a posteriori). Simulation results show that the proposed adaptive noise reduction algorithm using Bayesian MAP provides good performance regardless of the level of noise variance.

• International Journal of Control, Automation, and Systems
• /
• 제1권2호
• /
• pp.163-170
• /
• 2003

The optimal Bayesian filter for a single target is known to provide the best tracking performance in a cluttered environment. However, its main drawback is the increase in memory size and computation quantity over time. In this paper, the inevitable predicament of the optimal Bayesian filter is resolved in a suboptimal fashion through the use of a receding horizon strategy. As a result, the problems of memory and computational requirements are diminished. As a priori information, the horizon initial state is estimated from the validated measurements on the receding horizon. Consequently, the suboptimal algorithm proposed allows for real time implementation.

• Communications for Statistical Applications and Methods
• /
• 제9권1호
• /
• pp.155-166
• /
• 2002

Neural networks have been studied as a popular tool for classification and they are very flexible. Also, they are used for many applications of pattern classification and pattern recognition. This paper focuses on Bayesian approach to feed-forward neural networks with single hidden layer of units with logistic activation. In this model, we are interested in deciding the number of nodes of neural network model with p input units, one hidden layer with m hidden nodes and one output unit in Bayesian setup for fixed m. Here, we use the latent variable into the prior of the coefficient regression, and we introduce the 'sequential step' which is based on the idea of the data augmentation by Tanner and Wong(1787). The MCMC method(Gibbs sampler and Metropolish algorithm) can be used to overcome the complicated Bayesian computation. Finally, a proposed method is applied to a simulated data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4684-4705
• /
• 2019

Collaborative filtering recommender systems are vulnerable to shilling attacks in which malicious users may inject biased profiles to promote or demote a particular item being recommended. To tackle this problem, many robust collaborative recommendation methods have been presented. Unfortunately, the robustness of most methods is improved at the expense of prediction accuracy. In this paper, we construct a robust Bayesian probabilistic matrix factorization model for collaborative filtering recommender systems by incorporating the detection of user anomaly rating behaviors. We first detect the anomaly rating behaviors of users by the modified K-means algorithm and target item identification method to generate an indicator matrix of attack users. Then we incorporate the indicator matrix of attack users to construct a robust Bayesian probabilistic matrix factorization model and based on which a robust collaborative recommendation algorithm is devised. The experimental results on the MovieLens and Netflix datasets show that our model can significantly improve the robustness and recommendation accuracy compared with three baseline methods.