• Proceedings of the Acoustical Society of Korea Conference
• /
• 1987.11a
• /
• pp.66-69
• /
• 1987

본 논문은 불특정화자의 한국어 단독음인식에 관한 연구로써 새로운 집단화 방법인 Modified-ISODATA 집단화방법을 제안한다.본 알고리즘의 목적은 종래의 ISODATA 알고리즘에서 외부 고립점 처리 및 분리과정을 단순화 하고, Lumping 과정을 제거하여 정확하고도 자동화된 집단의 중심점을 찾는 것이다. 본 알고리즘을 적용한 결과, 10명의 남성 화자와 4명의 여성 화자가 발음한 11개의 ltnt자음에 대하여, 최근에 발표된 Modified K-means 방법보다 좋은 인식율을 나타내어, 보다 정확한 집단의 중심점을 찾아 내었음을 입증해보였다.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.2
• /
• pp.148-155
• /
• 1995

When we analize many amount of patterns, it is necessary for these patterns are to be clustering into several groups according to a certain evaluation function. This process, in case that there are lots of input patterns, needs a considerable amount of computations and is reqired parallel algorithm for these. To solve this problem, this paper propose parallel clustering algorithm which parallelized k-means algorithm and implemented it under the MIMD parallel computer based message passing. The result is through the experiment and performance analysis, that this parallel algorithm is appropriate in case these are many input patterns.

• The Journal of the Acoustical Society of Korea
• /
• v.6 no.4
• /
• pp.44-54
• /
• 1987

In this paper, the problem of LP-model and it's solution by liftering in cepstrum domain are investigated in speaker independent isolated-word recognition. And, clustering technique is discussed for obtaining the reference template. KMA (K-means iteration with average) method, which is transformed from UWA method and K-iteration method, has been suggested and compared with each other for clustering, the result of recognition experiments shows max. $95\%$ recognition rate when rasied-sign lifter and KMA clustering method is applied.

• The Journal of the Acoustical Society of Korea
• /
• v.6 no.4
• /
• pp.31-43
• /
• 1987

As a study on Speaker-Independent Isolated Word Recognition, a Modified ISODATA clustering method is proposed. This method simplifies the outlier processing and the splitting procedure in conventional ISODATA algorithm, and eliminates the lumping procedure. Through this method, we could find cluster centers precisely and automatically. When this method applied to 11 digits by 10 males and 4 females, its recognition rates of $84.42\%$ for K=4 were better than those of the latest Modified K-means, $82.5\%$. Judging from these results, we proved this method the best method in finding cluster centers precisely.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.4
• /
• pp.478-484
• /
• 2009

Automatic speech recognition(ASR) is attractive technique in trend these day that seek convenient life. Although many approaches have been proposed for ASR but the performance is still not good in noisy environment. Now-a-days in the state of art in speech recognition, ASR uses not only the audio information but also the visual information. In this paper, We present a novel lip detection method for visual speech recognition in mobile environment. In order to apply visual information to speech recognition, we need to extract exact lip regions. Because eye-detection is more easy than lip-detection, we firstly detect positions of left and right eyes, then locate lip region roughly. After that we apply K-means clustering technique to devide that region into groups, than two lip corners and lip center are detected by choosing biggest one among clustered groups. Finally, we have shown the effectiveness of the proposed method through the experiments based on samsung AVSR database.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.3
• /
• pp.35-42
• /
• 1999

In this paper, a modified clustering algorithm is proposed to improve the discrimination of discrete HMM(Hidden Markov Model), so that it has increased recognition rate of 2.16% in comparison with the original HMM using the K-means or LBG algorithm. And, for preventing the decrease of recognition rate because of insufficient training data at the training scheme of HMM, a modified probabilistic smoothing method is proposed, which has increased recognition rate of 3.07% for the speaker-independent case. In the experiment applied the two proposed algorithms, the average rate of recognition has increased 4.66% for the speaker-independent case in comparison with that of original VQ/HMM.

• Journal of Broadcast Engineering
• /
• v.11 no.1 s.30
• /
• pp.3-14
• /
• 2006

Music summarization means a technique which automatically generates the most importantand representative a part or parts ill music content. The techniques of music summarization have been studied with two categories according to summary characteristics. The first one is that the repeated part is provided as music summary and the second provides the combined segments which consist of segments with different characteristics as music summary in music content In this paper, we propose and evaluate two kinds of music summarization techniques. The algorithm using multi-level vector quantization which provides a repeated part as music summary gives fixed-length music summary is evaluated by overlapping ration between hand-made repeated parts and automatically generated summary. As results, the overlapping ratios of conventional methods are 42.2% and 47.4%, but that of proposed method with fixed-length summary is 67.1%. Optimal length music summary is evaluated by the portion of overlapping between summary and repeated part which is different length according to music content and the result shows that automatically-generated summary expresses more effective part than fixed-length summary with optimal length. The cluster-based algorithm using 2-D similarity matrix and k-means algorithm provides the combined segments as music summary. In order to evaluate this algorithm, we use MOS test consisting of two questions(How many similar segments are in summarized music? How many segments are included in same structure?) and the results show good performance.

• Journal of Korean Society of Archives and Records Management
• /
• v.4 no.2
• /
• pp.23-39
• /
• 2004

The Bolshevik Revolution of 1917 resulted not only in the establishment of the Socialist regime, but also in the critical changes in the Russian archival system. The Soviet government issued "Decree On the Reorganization and Centralization of Archival Affairs in the Russian Socialist Federated Soviet Republic", which prepared the ground for the archival administration in USSR. After having been revised and supplemented in the 1920's, the decree, signed by V. I. Lenin, was changed into "The Decree on the Archival Administration of Russian Soviet Federated Socialist Republic", by which the Bolshevik government was able not only to develop the conception of the State Archival Fond with the Single Archival Fond, but also to enlarge the archival collection. Besides, it was remarkable that the archival decree of 1929 provided the justification for actual developments of the archival institution. And from the practical point of view, the decree improved the archival affairs by means of the defining of the conservation period. It was at the beginning of the Stalin's period that the decree of 1929 was issued. Therefore, it may be said that the decree was one of the proofs as well as the agricultural collectivization and the industrialization that Stalin gained the overall control of the Soviet government. It was confirmed when the Second Conference of Soviet Archivists was held from 25 May to 1 June in 1929. After this meeting, M. N. Pokrovskii, who was the director of the Archival Administration in the course of the 1920's, lost the influence over the Soviet archival organizations, which meant that the autonomy of the Soviet archivists was reduced in a great degree. The Central Archival Administration of the Bolshevik regime experienced the analogous changes. It was changed into the Central Archival Agent in 1929 when the Stalinist system became strengthened. At the same time, it was significant that the Central Archival Administration of USSR was established. However, the Soviet archival affairs became under the direct control of the N. K. V. D. in the period of the Great Purge.