• Title/Summary/Keyword: Baysian Algorithm

Search Result 7, Processing Time 0.031 seconds

Prediction Model for Breast Cancer Diagnosis using Baysian Algorithm (베이지안 알고리즘을 이용한 유방암 진단 예측모델)

  • Jung, Yong-Gyu;Lee, Yeon-Joo;Won, Jae-Kang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.2
    • /
    • pp.175-180
    • /
    • 2012
  • Currently datamining sector is interested and applied in many areas. In other words, datamining is predicting the future to discover hidden correlations and make decisions. To interpret data on various aspects can be converted to real expectation. Analyzing the results even a simple can be found big difference. The properties associated with breast cancer by about applying bayesian theory is used to predict the probability. In the past patient data, doctors may be obtaining by applying evidence-based care for patients with the results of examination and By using the the past patient data.

Communication Channel Equalization Using Adaptive Neural Net (적응 신경망을 이용한 통신 채널 등화)

  • 김정수;권용광;김민수;이대학;이상윤;김재공
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.1037-1040
    • /
    • 1999
  • This paper investigates a RBF(Radial Basis Function) equalizer for channel equalization. RBF network has an identical structure to the optimal Bayesian symbol-decision equalizer solution. Therefore RBF can be employed to implement the Bayesian equalizer. Proposed algorithm of this paper makes channel states estimation to be unncessary, also makes center number which is needed indivisual channel to be minimum. Bayesian Equalizer has the theorical optimum performance. Proposed Equalizer performance is compared with this Baysian equalizer performance.

  • PDF

Probabilistic Map Building Using Ultrasonic Sensor for Autonomous Mobile Robot (초음파 센서를 이용한 자율이동로봇의 확률지도 작성)

  • Lee, Sang-Soo;Oh, Joon-Seop;Choi, Yoon-Ho;Park, Jin-Bae
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2840-2842
    • /
    • 2000
  • This paper describes sensor-based occupancy grid map construction method through complete coverage navigation algorithm in unknown environment. In this paper, we use the updated Baysian model for probabilistic grid map. For map construction, complete coverage navigation method in which mobile robot can navigate complete field through as short path as possible in unknown environment, is used. The computer simulations result show that map construction method using complete coverage algorithm is efficient.

  • PDF

A Study of Post-processing Methods of Clustering Algorithm and Classification of the Segmented Regions (클러스터링 알고리즘의 후처리 방안과 분할된 영역들의 분류에 대한 연구)

  • Oh, Jun-Taek;Kim, Bo-Ram;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.16B no.1
    • /
    • pp.7-16
    • /
    • 2009
  • Some clustering algorithms have a problem that an image is over-segmented since both the spatial information between the segmented regions is not considered and the number of the clusters is defined in advance. Therefore, they are difficult to be applied to the applicable fields. This paper proposes the new post-processing methods, a reclassification of the inhomogeneous clusters and a region merging using Baysian algorithm, that improve the segmentation results of the clustering algorithms. The inhomogeneous cluster is firstly selected based on variance and between-class distance and it is then reclassified into the other clusters in the reclassification step. This reclassification is repeated until the optimal number determined by the minimum average within-class distance. And the similar regions are merged using Baysian algorithm based on Kullbeck-Leibler distance between the adjacent regions. So we can effectively solve the over-segmentation problem and the result can be applied to the applicable fields. Finally, we design a classification system for the segmented regions to validate the proposed method. The segmented regions are classified by SVM(Support Vector Machine) using the principal colors and the texture information of the segmented regions. In experiment, the proposed method showed the validity for various real-images and was effectively applied to the designed classification system.

A Study on the Facal motion and for Detection of area Using Kalman Fillter algorithm (Facal motion 예측 및 영역 검출을 위한 칼만 필터 알고리즘)

  • Seok, Gyeong-Hyu;Park, Bu-Yeon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.6
    • /
    • pp.973-980
    • /
    • 2011
  • In this paper, we gaze upon the movement faces the problem points are difficult to identify a user based on points and that corrective action is needed to solve the identification system is proposed a new eye. Kalman filter, the current head of the location information was used to estimate the future position in order to determine the authenticity of the face facial features and structural elements, the information and the processing time is relatively fast horizontal and vertical elements of the face using the histogram analysis to detect. And an infrared illuminator obtained by constructing a bright pupil effect in real-time detection of the pupil, the pupil was tracked - geulrinteu vectors are extracted.

On-Line Departure time based link travel time estimation using Spatial Detection System (구간검지체계를 이용한 On-Line 출발시각기준 링크 통행시간 추정 (연속류를 중심으로))

  • Kim, Jae-Jin;No, Jeong-Hyeon;Park, Dong-Ju
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.2 s.88
    • /
    • pp.157-168
    • /
    • 2006
  • Spatial detection system such as AVI, GPS, and Beacon etc. can provide spatial travel time only after a vehicle Passes through a road section. In this context, majority of the existing studies on the link travel time estimation area has focused on the arrival time-based link travel time estimation. rather than departure time-based link travel time estimation. Even if some of the researches on this area have developed departure time-based link travel time estimation algorithms, they are limited in that they are not applicable in a real-time mode. The objective of this study is to develop an departure time-based link travel time estimation algorithm which is applicable in a real-tine mode. Firstly, this study discussed the tradeoff between accuracy and timeliness of the departure time-based on-line link travel time estimates. Secondly, this study developed an departure time-based on-line link travel time estimation algorithm which utilizes the Baysian inference logic. It was found that the proposed approach could estimate departure time-based link travel times in a real-time context with an acceptable accuracy and timeliness.

Region-based Multi-level Thresholding for Color Image Segmentation (영역 기반의 Multi-level Thresholding에 의한 컬러 영상 분할)

  • Oh, Jun-Taek;Kim, Wook-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.6 s.312
    • /
    • pp.20-27
    • /
    • 2006
  • Multi-level thresholding is a method that is widely used in image segmentation. However most of the existing methods are not suited to be directly used in applicable fields and moreover expanded until a step of image segmentation. This paper proposes region-based multi-level thresholding as an image segmentation method. At first we classify pixels of each color channel to two clusters by using EWFCM(Entropy-based Weighted Fuzzy C-Means) algorithm that is an improved FCM algorithm with spatial information between pixels. To obtain better segmentation results, a reduction of clusters is then performed by a region-based reclassification step based on a similarity between regions existing in a cluster and the other clusters. The clusters are created using the classification information of pixels according to color channel. We finally perform a region merging by Bayesian algorithm based on Kullback-Leibler distance between a region and the neighboring regions as a post-processing method as many regions still exist in image. Experiments show that region-based multi-level thresholding is superior to cluster-, pixel-based multi-level thresholding, and the existing mettled. And much better segmentation results are obtained by the post-processing method.