• Journal of Biomedical Engineering Research
• /
• v.21 no.4
• /
• pp.333-338
• /
• 2000

In this paper, an automated segmentation algorithm is proposed for MR brain images using T1-weighted, T2-weighted, and PD images complementarily. The proposed segmentation algorithm is composed of 3 step. In the first step, cerebrum images are extracted by putting a cerebrum mask upon the three input images. In the second step, outstanding clusters that represent inner tissues of the cerebrum are chosen among 3-dimensional(3D) clusters. 3D clusters are determined by intersecting densely distributed parts of 2D histogram in the 3D space formed with three optimal scale images. Optimal scale image is made up of applying scale space filtering to each 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram. In the final step, cerebrum images are segmented using FCM algorithm with its initial centroid value as the outstanding clusters centroid value. The proposed cluster's centroid accurately. And also can get better segmentation results from the proposed segmentation algorithm with multi spectral analysis than the method of single spectral analysis.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.813-814
• /
• 2008

In this paper, we propose a new tracking algorithm which uses weighted sum of color bin's centroids to find the main centroid of the target. The weights are determined by the proportion of colors of the target and by the colors of background. That is, A color which has high occupation in forming the target is highly weighted and a color which has low occupation is lowly weighted. Moreover, the proposed algorithm prevent track failure by lowering the weight of the colors which forms the background. Therefore, the proposed algorithm performs stable tracking inspite of occlusion and existence of confusing backgrounds.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.447-448
• /
• 2006

In this paper, we propose tracking algorithm using multi resolution in wavelet transform domain. This algorithm consists of two steps. The first step is feature extraction that is select feature-points using 1-level wavelet transform in ROI (Region of Interest). The other step is feature tracking. Based on multi resolution of wavelet transform, we estimate a displacement between current frame and next frame on the basis of selected feature-points. Experimental results show that the proposed algorithm confirmed a better performance than a centroid tracking and correlation tracking.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.373-376
• /
• 2002

K-Means 알고리즘은 재배치 기법의 일종으로 K 개의 초기 클러스터중심(centroid)를 중심으로 K 개의 클러스터가 될 때까지 클러스터링을 반복하는 것이다. K-Means 알고리즘은 특성상 초기 클러스터 중심과 새롭게 생성된 클러스터 중심에 따라 클러스터링 결과가 달라진다. 본 논문에서는 K-Means Algorithm 의 초기 클러스터중심 선택 방법과 새로운 클러스터 중심 결정 방법을 개선한 변형 K-Means Algorithm을 제안한다. SMART 시스템에서 제안한 16가지 가중치 계산 방식에 의하여 두 알고리즘의 성능을 평가한 결과 제안한 변형 알고리즘이 재현률과 F-Measure 에서 20%이상 향상된 결과를 얻을 수 있었으며 특정 주제 아래 문서가 할당되는 클러스터링 성능이 우수하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.271-278
• /
• 2004

In this paper, we propose a content-based audio genre classification algorithm that automatically classifies the query audio into five genres such as Classic, Hiphop, Jazz, Rock, Speech using digital sign processing approach. From the 20 seconds query audio file, the audio signal is segmented into 23ms frame with non-overlapped hamming window and 54 dimensional feature vectors, including Spectral Centroid, Rolloff, Flux, LPC, MFCC, is extracted from each query audio. For the classification algorithm, k-NN, Gaussian, GMM classifier is used. In order to choose optimum features from the 54 dimension feature vectors, SFS(Sequential Forward Selection) method is applied to draw 10 dimension optimum features and these are used for the genre classification algorithm. From the experimental result, we can verify the superior performance of the proposed method that provides near 90% success rate for the genre classification which means 10%∼20% improvements over the previous methods. For the case of actual user system environment, feature vector is extracted from the random interval of the query audio and it shows overall 80% success rate except extreme cases of beginning and ending portion of the query audio file.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.691-696
• /
• 2008

A new vocoder of Code Excited Linear Predictive (CELP) based on Adaptive Multi Rate (AMR) 7.4kbit/s mode is proposed in this paper. The proposed vocoder achieves a better compression rate in an environment of Speaker Dependent Coding System (SDSC) and is efficiently used for systems, such as OGM(Outgoing message) and TTS(Text To Speech), which needs only one person's speech. In order to enhance the compression rate of a coder, a new Line Spectral Pairs(LSP) code-book is employed by using Centroid Neural Network (CNN) algorithm. In comparison with original(traditional) AMR 7.4 Kbit/s coder, the new coder shows 27% higher compression rate while preserving synthesized speech quality in terms of Mean Opinion Score(MOS).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.581-587
• /
• 2005

This paper presents a hybrid face recognition method of both the first moment of image and the independent component analysis(ICA) of fixed point(FP) algorithm based on Newton method. First moment is a method for finding centroid of image, which is applied to exclude the needless backgrounds in the face recognitions by shifting to the centroid of face image. FP-ICA is also applied to find a set of independent basis images for the faces, which is a set of statistically independent facial features. The proposed method has been applied to the problem for recognizing the 48 face images(12 persons o 4 scenes) of 64*64 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate) than conventional FP-ICA without preprocessing. The city-block has been relatively achieved more an accurate similarity than Euclidean or negative angle.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.05a
• /
• pp.67-71
• /
• 2002

본 논문에서는 many-to-many IP 멀티캐스팅을 위한 효율적인 BCT(Backbone Core Tree)생성 알고리즘의 시뮬레이션 방법에 대하여 제안한다. BCT는 기법은 CBT(Core Based Tree)에 기반을 두고 있다. CBT는 공유 트리를 이용하여 멀티캐스트 자료를 전달하기 때문에 Source based Tree에 비하여 각 라우터가 유지해야 하는 상태 정보의 양에 적고, 적용하기 간단하지만, Core 라우터 선택의 어려움과 트래픽이 Core로 집중되는 문제점을 가지고 있다. 이에 대한 보완책으로 BCT기법이 제안되었는데, 본 논문에서는 주어진 네트워크 위상 그래프에서 최소신장 트리를 만들고, 센트로이드(Centroid)를 이용하여 효율적인 BCT를 생성하는 알고리즘을 제안하고 시뮬레이션 방법을 제시한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.642-645
• /
• 1991

This paper presents the results of research on hardware and software of the landmark tracking system to the positions of moving robot in real time. The landmark tracking system is composed of CCD camera, landmark, strobo system and image processing board. The algorithm calculates the position and direction by using the coordinate transformation fomula after calculating the centroid and rotation angle of landmark at fixed position using the image data. The experiment is performed with landmark tracking system is loaded on xyz-table. XYZ-table is used for identifying the true position in our experiment. The results shows that this system has high performance with maxima error of .+-.1 pixels.

• Proceedings of the Korean Printing Society Conference
• /
• 2002.05a
• /
• pp.10-18
• /
• 2002

On the process of cross-media color reproduction, a key feature is the use of gamut mapping techniques to adjust the different color gamuts between displays and printers. Even though a number of GMAs have been published, but there are no method satisfactory enough for more exect color reproduction. In this paper, the gamut mapping methods of nearest point clipping(NPC), centroid clipping (SLIN), straight clipping and cusp clipping(CUSP) were tested and analyzed with color difference, and a new gamut mapping algorithm based on variable anchor point method was proposed.