• 말소리와 음성과학
• /
• 제7권4호
• /
• pp.35-40
• /
• 2015

We propose a speech waveform forgery detection algorithm based on the flatness of frequency distribution. We devise a new measure of flatness which emphasizes the local change of the frequency distribution. Our measure calculates the sum of the differences between the energies of neighboring frequency bands. We compare the proposed measure with conventional flatness measures using a set of a large amount of test sounds. We also compare- the proposed method with conventional detection algorithms based on spectral distances. The results show that the proposed method gives lower equal error rate for the test set compared to the conventional methods.

• 한국컴퓨터정보학회논문지
• /
• 제11권5호
• /
• pp.321-327
• /
• 2006

최근 들어 상업적이거나 과학적인 데이터들의 폭발적인 증가를 볼 수 있다. 이런 데이터들은 항목들 간의 순서적인 면을 가지고 있는 시퀀스 데이터들이다. 그러나 항목들 간의 순서적인 면을 고려한 클러스터링 연구는 많지 않다. 본 논문에서는 이들 시퀀스 데이터들 간의 유사도를 계산하는 방법과 클러스터링 방법을 연구한다. 특히 다양한 조건을 고려한 확장된 유사도 계산 방법을 제안한다. splice 데이터 셋을 이용하여 본 논문에서 제안하는 클러스터링 방법이 기존 방법 보다 우수하다는 것을 보여준다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제26권1호
• /
• pp.130-130
• /
• 1999

In this paper, we propose a novel design method for improving performance of existing FCM-type clustering algorithms. First, we define the performance measure which focuses on bothcompactness and separation of clusters. Next, we optimize this measure using evolution program.Especially the proposed method has following merits: ① using evolution program, it solves suchproblems as initialization, number of clusters, and convergence to local optimum ② it reduces searchspace and improves convergence speed of algorithm since it represents chromosome with possiblepotential centers which are selected possible candidates of centers by density measure ③ it improvesperformance of clustering algorithm with the performance index which embedded both compactnessand separation Properties ④ it is robust to noise data since it minimizes its effect on center search.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2004년도 추계학술대회
• /
• pp.221-229
• /
• 2004

Recently, there has been enormous growth in the amount of commercial and scientific data, such as protein sequences, retail transactions, and web-logs. Such datasets consist of sequence data that have an inherent sequential nature. However, only a few of the existing clustering algorithms consider sequentiality. This study presents a method for clustering such sequence datasets. The similarity between sequences must be decided before clustering the sequences. This study proposes a new similarity measure to compute the similarity between two sequences using a sequence element. Two clustering algorithms using the proposed similarity measure are proposed: a hierarchical clustering algorithm and a scalable clustering algorithm that uses sampling and a k-nearest neighbor method. Using a splice dataset and synthetic datasets, we show that the quality of clusters generated by our proposed clustering algorithms is better than that of clusters produced by traditional clustering algorithms.

• 한국통신학회논문지
• /
• 제37A권12호
• /
• pp.1038-1042
• /
• 2012

이 논문에서는 편이된 확률밀도함수 간 거리 측정이라는 새로운 거리 측정 기준을 제안하고 이에 관련된 등화 알고리듬을 도출하여 충격성 잡음과 시변 직류 잡음이 있는 다경로 채널에 적용하였다. 이러한 비 가우시안 잡음 환경에서 시행한 시뮬레이션의 결과로부터, 제안한 알고리듬이 충격성 잡음에 강인성을 보일 뿐 아니라 시변 직류 잡음도 제거하는 탁월한 능력을 가짐을 입증하였다.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2002년도 학술발표회 논문집(II)
• /
• pp.829-836
• /
• 2002

The paper presents a multi-objective genetic algorithm approach to the design of a water distribution network. The objectives considered are minimization of network cost and maximization of a reliability measure. In this study, a new reliability measure, called network resilience, is introduced. This measure mimics a designer's desire of providing excess power at nodes and designing reliable loops with practicable pipe diameters. The proposed method produces a set of Pareto-optimal solutions in the search space of cost and network resilience. Genetic algorithms are observed to be poor in handling constraints. To handle constraints in a better way, a constraint handling technique that does not require a penalty coefficient and applicable to water distribution systems is presented. The present model is applied to two example problems, which were widely reported. Pipe failure analysis carried out on some of the solutions obtained revealed that the network resilience based approach gave better results in terms of network reliability.

• ETRI Journal
• /
• 제44권5호
• /
• pp.769-779
• /
• 2022

Spectral clustering has become a typical and efficient clustering method used in a variety of applications. The critical step of spectral clustering is the similarity measurement, which largely determines the performance of the spectral clustering method. In this paper, we propose a novel spectral clustering algorithm based on the local similarity measure of shared neighbors. This similarity measurement exploits the local density information between data points based on the weight of the shared neighbors in a directed k-nearest neighbor graph with only one parameter k, that is, the number of nearest neighbors. Numerical experiments on synthetic and real-world datasets demonstrate that our proposed algorithm outperforms other existing spectral clustering algorithms in terms of the clustering performance measured via the normalized mutual information, clustering accuracy, and F-measure. As an example, the proposed method can provide an improvement of 15.82% in the clustering performance for the Soybean dataset.

• 한국정밀공학회지
• /
• 제13권3호
• /
• pp.42-48
• /
• 1996

In this paper, a position correction system of industrial robot for door-chassis assembly tast is developed in connection with the position correction algorithm shown in Part I. Tow notches and a hole of auto chassis are selected as the reference measure points and a vision based error detection algorithm is devised to measure in accuracy of less than 0.07mm. And also, the transformation between base and tool coordinates of the robot is shown to send the suitable correction quantities caaording to robot's option. The obtained algorithms were satisfactorily implemented for a real door-chassis model such that the system could accomplish visually acceptable door-chassis assembly task.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.224-227
• /
• 1993

In this paper, a new LMS algorithm with a variable step size (VVS LMS) is presented. The change of step size .mu. at each iteration, which increases or decreases according to the misadaptation degree, is computed by a proportional fuzzy logic controller. As a result the algorithm has very good convergence speed and low steady-state misadjustment. The norm of the cross correlation between the estimation error and input signal is used. As a measure of the misadaptation degree. Simulation results are presented to compare the performance of the VSS LMS algorithm with the normalized LMS algorithm.

• 산업기술연구
• /
• 제13권
• /
• pp.33-41
• /
• 1993

In this paper, a new LMS algorithm with a fuzzy variable step size (FVS LMS) is presented. The change of step size ${\mu}$, at each iteration which is increases or decreases according to the misadaptation degree, is computed by a proportional fuzzy logic controller. As a result the algorithm has very good convergence speed and low steady-state misadjustment. As a measure of the misadaptation degree, the norm of the cross correlation between the estimation error and input signal is used. Simulation results are presented to compare the performance of the FVSS LMS algorithm with the normalized LMS algorithm.