• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2127-2136
• /
• 1998

비평가인자 함수 언어는 비평가인자 어의로 인하여 기존의 von Neumann 형 병렬기에서 효율적인 수행을 어렵게 하는 미세수준의 동적 스케줄링 단위로 병합하는 과정이 중요하다. 이러한 과정을 스레드 분할이라 한다. 본 논문에서는 비평가인자 함수 프로그램을 스레드로 분할하는 자료형 분리집합 분할이라는 스레드 분할 알고리즘을 제안한다. 자료형 분리 집합 분할 알고리즘은 자료형을 비교할 수 없는 입력명과 출력명 사이에는 잠재 종속이 존재할 수 없다는 사실을 이용하여 스레드 분할을 수행한다. 이 방법을 사용하면 기존의 스레드 분할 방법에서 실패하는 스레드의 병합이 가능하며, 기존의 분할 알고리즘보다 더 큰 스레드를 생성할 수 있다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.807-812
• /
• 2020

This paper proposes a blind speech source separation algorithm using a microphone to separate only the target speech source signal in an environment in which various speech source signals are mixed. The proposed algorithm is a model of frequency domain representation based on independent component analysis method. Accordingly, for the purpose of verifying the validity of independent component analysis in the frequency domain for two speech sources, the proposed algorithm is executed by changing the type of speech sources to perform speech sources separation to verify the improvement effect. It was clarified from the experimental results by the waveform of this experiment that the two-channel speech source signals can be clearly separated compared to the original waveform. In addition, in this experiments, the proposed algorithm improves the speech source separation performance compared to the existing algorithms, from the experimental results using the target signal to interference energy ratio.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.139-142
• /
• 2001

코드북을 설계하는 알고리즘 중에서 가장 대표적인 방법은 K-means 알고리즘이다. 이 알고리즘은 그 성능 이 초기 코드북에 크게 의존한다는 문제점을 가지고 있다. 따라서 본 논문에서는 Splitting 방법을 이용한 새로운 초기 코드북 생성 알고리즘을 제안하고자 한다. 제안된 방법에서는 기존의 초기 코드북 생성 알고리즘인 Splittng 방법을 적용하여 코드벡터를 생성하되, 미소분리 과정 시 학습벡터의 수렴 빈도가 가장 낮은 코드벡터를 제거하고 수렴 빈도가 가장 높은 코드벡터론 미소분리 하여 수렴 빈도가 가장 낮은 코드벡터와 대체해가며 초기 코드북을 설계한다. 제안된 방법으로 생성된 초기 코드북을 사용하여 K-means 알고리즘을 수행한 결과 기존의 Splitting 방법으로 생성된 초기 코드북을 사용한 경우보다 코드북의 성능이 향상됨을 확인할 수 있었다.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.2
• /
• pp.177-183
• /
• 2019

In this paper, we proposed an application method of ICA (Independent Component Analysis) to passive line array sonar to separate interferences from target signals in low frequency band and compared performance of three conventional ICA algorithms. Since the low frequency signals are received through larger bearing angles than other frequency bands, neighboring beam signals can be used to perform ICA as measurement signals of the ICA. We use three ICA algorithms such as Fast ICA, NNMF (Non-negative Matrix Factorization) and JADE (Joint Approximation Diagonalization of Eigen-matrices). Through experiments on real data obtained from passive line array sonar, it is verified that the interference can be separable from target signals by the suggested method and the JADE algorithm shows the best separation performance among the three algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.909-912
• /
• 2012

An automated cell tracking system is automatically to analyze and track changes of cell behaviors in time-lapse cell images acquired from microscope in the cell culture. In this paper, we proposed and developed an ellipse fitting based algorithm for separating very small size overlapping cells in a cell image consisted of thousands or ten thousands cells. We were extracted contours of clusters and divided them into line segments and then produced their fitted ellipses for each line segment. By experimentations, our algorithm was separated clusters with average 91% precision for two overlapping cells and average 84% precision for three overlapping cells respectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.4
• /
• pp.444-450
• /
• 1999

This paper deals with several methods: the clustering method that uses k-means algorithm to abstract the area of characters on the image document and the distance function that suits for the HIS coordinate system to cluster the image. For the prepossessing step to recognize this, or the method of characters segmentate, the algorithm to abstract a discrete character is also proposed, using the linking picture element. This algorithm provides the feature that separates any character such as the touching or overlapped character. The methods of projecting and tracking the edge have so far been used to segment them. However, with the new method proposed here, the picture element extracts a discrete character with only one-time projection after abstracting the character string. it is possible to pull out it. dividing the area into the character and the rest (non-character). This has great significance in terms of processing color documents, not the simple binary image, and already received verification that it is more advanced than the previous document processing system.

• The Journal of the Acoustical Society of Korea
• /
• v.8 no.4
• /
• pp.65-73
• /
• 1989

In this paper, we propose a text-independent speaker identification algorithm based on VQ(vector quantization) and vowel classification, and its performance is studied and compared with that of a conventional speaker identification algorithm using VQ. The proposed speaker identification algorithm is composed of three processes: vowel segmentation, vowel recognition and average distortion calculation. The vowel segmentation is performed automatlcally using RMS energy, BTR(Back-to-Total cavity volume Ratio)and SFBR(Signed Front-to-Back maximum area Ratio) extracted from input speech signal. If the Input speech signal Is noisy, particularity when the SNR is around 20dB, the proposed speaker identification algorithm performs better than the reference speaker identification algorithm when the correct vowel segmentation is done. The same result is obtained when we use the noisy telephone speech signal as an input, too.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.197-198
• /
• 2012

본 논문에서는 입력되는 스테레오 영상에서 3차원 깊이 정보를 이용하여 객체를 보다 정확하게 분리하는 알고리즘을 제안한다. 제안된 알고리즘은 먼저 촬영된 장면의 왼쪽과 오른쪽 영상으로부터 스테레오 정합 기법을 이용하여 영상의 각 화소에 대한 3차원의 깊이 정보를 추출한다. 그런 다음, 추출된 깊이 정보를 강인하게 이진화하여 배경 영역을 제외하고 전경에 해당하는 객체만을 분리한다. 성능평가를 위한 실험에서는 본 논문에서 제안된 방법을 여러 가지 영상에 적용하여 테스트를 해 보았으며, 제안된 방법이 기존의 2차원 기반의 객체 분리 방법에 비해 보다 강건하고 정확하게 객체를 분리함을 확인하였다.

• Proceedings of the KIPE Conference
• /
• 2018.07a
• /
• pp.147-149
• /
• 2018

비대칭 부하 전류를 평형 상태로 만들기 위한 보상장치는 3상변수를 대칭좌표로 분리해야한다. 통상 전대역필터를 이용한 정상분, 역상분 분리 방식이 사용되는데 제어기 최하위단에서 동작하는 전대역필터의 대역폭이 전체 제어시스템의 대역폭을 제한한다. 따라서 보상장치의 제어성능을 향상시키기 위해서는 정역분리에 사용하는 필터의 대역폭을 넓혀야 한다. 본 논문에서는 대역폭이 조절가능한 고속화된 대칭좌표 분리 알고리즘을 제안한다. 이를 MATLAB/SIMULINK를 이용하여 시뮬레이션을 진행하였으며, TMS320F28335를 이용하여 실험을 진행하였다.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.395-408
• /
• 2004

A conjunctive Boolean text query refers to a query that searches for tort documents containing all of the specified keywords, and is the most frequently used query form in information retrieval systems. Typically, the query specifies a long list of keywords for better precision, and in this case, the order of keyword processing has a significant impact on the query speed. Currently known approaches to this ordering are based on heuristics and, therefore, cannot guarantee an optimal ordering. We can use a systematic approach by leveraging a database query processing algorithm like the dynamic programming, but it is not suitable for a text query with a typically long list of keywords because of the algorithm's exponential run-time (Ο(n2$^{n-1}$)) for n keywords. Considering these problems, we propose a new approach based on a property called the join sequence separability. This property states that the optimal join sequence is separable into two subsequences of different join methods under a certain condition on the joined relations, and this property enables us to find a globally optimal join sequence in Ο(n2$^{n-1}$). In this paper we describe the property formally, present an optimization algorithm based on the property, prove that the algorithm finds an optimal join sequence, and validate our approach through simulation using an analytic cost model. Comparison with the heuristic text query optimization approaches shows a maximum of 100 times faster query processing, and comparison with the dynamic programming approach shows exponentially faster query optimization (e.g., 600 times for a 10-keyword query).