• 대한전기학회논문지
• /
• 제40권4호
• /
• pp.351-359
• /
• 1991

This paper describes performances of speaker adaptation using a probabilistic spectral mapping matrix in hidden-Markov model(HMM) -based Korean isolated word recognition. Speaker adaptation based on probabilistic spectral mapping uses a well-trained prototype HMM's and is carried out by Viterbi, dynamic time warping, and forward-backward algorithms. Among these algorithms, the best performance is obtained by using the Viterbi approach together with codebook adaptation whose improvement for isolated word recognition accuracy is 42.6-68.8 %. Also, the selection of the initial values of the matrix and the normalization in computing the matrix affects the recognition accuracy.

• Journal of Multimedia Information System
• /
• 제4권4호
• /
• pp.317-320
• /
• 2017

This paper examines approaches to the development of algorithms of parametric identification of models of complex systems from discrete observations. A modification of a known algorithm Kaczmarz which is designed for closed systems with perturbations, based on the methods of random search and investigates their statistical properties.

• 전력전자학회논문지
• /
• 제4권1호
• /
• pp.43-49
• /
• 1999

본 연구에서는 비선형 시스템을 선형 시스템으로 변환시키는 미분기하이론에 기초를 둔 비선형 궤환 선형화 기법을 유도전동기와 같은 비선형 시스템의 제어에 응용함으로써 완전한 비간섭 시스템을 얻을수 있음을 보였다. 또한, 엘리베이터와 같은 부하의 정속도 운전시 효율제어를 위해 회전자 자속을 변화시킬 때 이의 영향을 받아 값이 바뀌는 인덕턴스와 온도에 따라 가장 변화가 심한 회전자저항을 위한 추정알고리즘을 제안하고 이의 성능을 평가해 보기 위하여 시뮬레이션과 실험을 수행하였다.

• 한국음향학회지
• /
• 제21권2호
• /
• pp.190-198
• /
• 2002

화자확인에서 사용되는 디코딩 방법에는 음성인식에서 주로 사용되는 비터비 알고리듬을 사용하여 왔다. 그러나 화자확인에서는 화자의 특성을 최대한 발휘하여 같은 음소라도 화자마다 다르게 인식해야 하는 어려움이 있다. 본 논문에서는 기존 화자확인 디코딩에서 사용하는 비터비 알고리듬을 대신하는 새로운 알고리듬을 제안하였다. 제안된 알고리듬은 음성인식에서 사용되고 있는화자 적응 알고리듬을 화자의 특성에 따라 모델 파라미터로 변환하는 것을 응용한 방법이다. 본 논문에서는 여러 적응 알고리듬중 MLLR(Maximum Likelihood Linear Regression)과 MAP (Maximum A-Posterior) 적응 알고리듬을 사용하였고 제안된 알고리듬이 기존의 비터비 알고리듬을 사용하였을 때보다 평균 30%의 EER (Equal Error Rate) 향상을 이루었다.

• Journal of Ship and Ocean Technology
• /
• 제5권3호
• /
• pp.27-35
• /
• 2001

In this research, hybrid method with case-based reasoning and rule-based reasoning is applied. Using case-based reasoning, design experts'experience and know-how are effectively represented in order to obtain a proper configuration of midship section in the initial ship design stage. Since there is not sufficient domain knowledge available to us, traditional case-adaptation algorithms cannot be applied to our problem, i.e., creating the configuration of midship section. Thus, new case-adaptation algorithms not requiring any domain knowledge are developed antral applied to our problem. Using the knowledge representation of DnV rules, rule-based reasoning can perform deductive inference in order to obtain the scantling of midship section efficiently. The results from the case-based reasoning and the rule-based reasoning are examined by comparing the results with various conventional methods. And the reasonability of our results is verified by comparing the results wish actual values from parent ship.

• 한국통신학회논문지
• /
• 제36권10A호
• /
• pp.839-846
• /
• 2011

링크 적응 기법은 변하는 채널 조건에 맞는 최적의 MCS 레벨을 선택한다. 무선 LAN 시스템을 위한 다양한 링크 적응 알고리즘이 제안되었으나 802.11n과 같은 최근의 시스템에서 최적의 성능을 보장하지는 않는다. 본 논문에서는 수신 SNR과 전송 결과에 따라 얻어지는 오프셋 값을 이용한 새로운 링크 적응 알고리즘을 제안한다. 802.11n 시스템에서 모의실험을 하여 제안된 알고리즘과 잘 알려져 있는 ARF 및 일반적인 SNR기반 알고리즘과 그 성능을 비교해본다. 제안된 알고리즘은 PER에 제한이 있는 경우 시변채널에서 더 좋은 성능을 보인다.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2004년도 춘계학술발표대회논문집
• /
• pp.326-329
• /
• 2004

Content adaptation is an effective solution to support the quality of service over multimedia services over heterogeneous environments. This paper deals with the accuracy and the real-time requirement, two important issues in making decision on content adaptation. From our previous problem formulation, we propose an optimal algorithm and a fast approximation based on the Viterbi algorithm of dynamic programming. Through extensive experiments, we show that the proposed algorithms can enable accurate adaptation decisions, and especially they can support the real-time processing.

• 한국군사과학기술학회지
• /
• 제24권4호
• /
• pp.382-391
• /
• 2021

Unsupervised domain adaptation often gives impressive solutions to handle domain shift of data. Most of current approaches assume that unlabeled target data to train is abundant. This assumption is not always true in practices. To tackle this issue, we propose a general solution to solve the domain gap minimization problem without any target data. Our method consists of two regularization steps. The first step is a pixel regularization by arbitrary style transfer. Recently, some methods bring style transfer algorithms to domain adaptation and domain generalization process. They use style transfer algorithms to remove texture bias in source domain data. We also use style transfer algorithms for removing texture bias, but our method depends on neither domain adaptation nor domain generalization paradigm. The second regularization step is a feature regularization by feature alignment. Adding a feature alignment loss term to the model loss, the model learns domain invariant representation more efficiently. We evaluate our regularization methods from several experiments both on small dataset and large dataset. From the experiments, we show that our model can learn domain invariant representation as much as unsupervised domain adaptation methods.

• Journal of electromagnetic engineering and science
• /
• 제4권2호
• /
• pp.93-96
• /
• 2004

In this paper we introduce a new escalator(ESC) structure-based adaptation algorithm. The proposed algorithm is independent of eigenvalues spread ratio(ESR) of channel and has faster convergence speed than that of the conventional ESC algorithms. This algorithm combines the fast adaptation ability of least square methods and the orthogonalization property of the ESC structure. From the simulation results the proposed algorithm shows superior convergence speed and no slowing down of convergence speed when we increase the ESR of the channel.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3856-3872
• /
• 2018

HTTP-based adaptive streaming (HAS) has recently been widely deployed on the Internet. In the HAS system, a video content is encoded at multiple bitrates and the encoded video content is segmented into small parts of fixed durations. The HAS client requests a video segment and stores it in the playout buffer. The rate adaptation algorithm employed in HAS clients dynamically determines the video bitrate depending on the time-varying bandwidth. Many studies have shown that an efficient rate adaptation algorithm is critical to ensuring quality-of-experience in HAS systems. However, existing algorithms have problems estimating the network bandwidth because bandwidth estimation is performed on the client-side application stack. Without the help of transport layer protocols, it is difficult to achieve accurate bandwidth estimation due to the inherent segment-based transmission of the HAS. In this paper, we propose an alternative approach that utilizes the playout buffer occupancy rather than using bandwidth estimates obtained from the application layer. We start with a queueing analysis of the playout buffer. Then, we present a buffer-aware rate adaptation algorithm that is solely based on the mean buffer occupancy. Our simulation results show that compared to conventional algorithms, the proposed algorithm achieves very smooth video quality while delivering a similar average video bitrate.