• Journal of Korea Multimedia Society
• /
• v.5 no.5
• /
• pp.523-529
• /
• 2002

The present study describes neural networks for stereoscopic vision, which are applied to identifying human speech. In speech recognition based on stereoscopic vision neural networks (SVNN), the similarities are first obtained by comparing input vocal signals with standard models. They are then given to a dynamic process in which both competitive and cooperative processes are conducted among neighboring similarities. Through the dynamic processes, only one winner neuron is finally detected. In a comparative study, the two-layered SVNN was 7.7% higher in recognition accuracies than the hidden Markov model (HMM). From the evaluation results, it was noticed that SVNN outperformed the existing HMM recognizer.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.1
• /
• pp.11-15
• /
• 2000

Speaker adaptive continuous speech recognition for the RM speech corpus is described in this paper. Learning of hidden markov models for the reference speaker is performed for the training data of RM corpus. For the evaluation, evaluation data of RM corpus are used. Parts of another training data of RM corpus are used for the speaker adaptation. After dynamic time warping of another speaker's data for the reference data is accomplished, error back propagation neural network is used to transform the spectrum between speakers to be recognized and reference speaker. Experimental results to get the best adaptation by tuning the neural network are described. The recognition ratio after adaptation is substantially increased 2.1 times for the word recognition and 4.7 times for the word accuracy for the best.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.1E
• /
• pp.89-95
• /
• 1994

This paper describes development of a real-time voice dialing system which can recognize around one hundred word vocabularies in speaker independent mode. The voice recognition algorithm in this system is implemented on a DSP board with a telephone interface plugged in an IBM PC AT/486. In the DSP board, procedures for feature extraction, vector quantization(VQ), and end-point detection are performed simultaneously in every 10 msec frame interval to satisfy real-time constraints after detecting the word starting point. In addition, we optimize the VQ codebook size and the end-point detection procedure to reduce recognition time and memory requirement. The demonstration system has been displayed in MOBILAB of the Korean Mobile Telecom at the Taejon EXPO'93.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.135-151
• /
• 1998

The demand of large capacity in coming cellular systems makes inevitable the deployment of small cells, rendering more frequent handoff occurrences of calls than in the conventional system. The key issue is then how effectively to reduce the chance of unsuccessful handoffs, since the handoff failure is less desirable than that of a new call attempt. In this study, we consider the control policies which give priority to handoff calls by limiting channel assignment for the originating new calls, and allow queueing the new calls which are rejected at their first attempts. On this system. we propose the problem of finding an optimal call control strategy which optimizes the objective function value, while satisfying the requirements on the handoff/new call blocking probabilities and the new call delay. The objective function takes the most general form to include such well-known performance measures as the weighted average carried traffic and the handoff call blocking probability. The problem is formulated into two different linear programming (LP) models. One is based on the direct employment of steady state equations, and the other uses the theory of semi-Markov decision process. Two LP formulations are competitive each other, having its own strength in the numbers of variables and constraints. Extensive experiments are also conducted to show which call control strategy is optimal under various system environments having different objective functions and traffic patterns.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.92-96
• /
• 2004

The researches of the emotions are currently great interest in speech processing as well as in human-machine interaction domain. In the recent years, more and more of researches relating to emotion synthesis or emotion recognition are developed for the different purposes. Each approach uses its methods and its various parameters measured on the speech signal. In this paper, we proposed using a short-time parameter: MFCC coefficients (Mel­Frequency Cepstrum Coefficients) and a simple but efficient classifying method: Vector Quantification (VQ) for speaker-dependent emotion recognition. Many other features: energy, pitch, zero crossing, phonetic rate, LPC... and their derivatives are also tested and combined with MFCC coefficients in order to find the best combination. The other models: GMM and HMM (Discrete and Continuous Hidden Markov Model) are studied as well in the hope that the usage of continuous distribution and the temporal behaviour of this set of features will improve the quality of emotion recognition. The maximum accuracy recognizing five different emotions exceeds $88\%$ by using only MFCC coefficients with VQ model. This is a simple but efficient approach, the result is even much better than those obtained with the same database in human evaluation by listening and judging without returning permission nor comparison between sentences [8]; And this result is positively comparable with the other approaches.

• Journal of Korea Multimedia Society
• /
• v.14 no.4
• /
• pp.504-516
• /
• 2011

In this paper, we will present a method to detect human hand and recognize hand gesture. For detecting the hand region, we use the feature of human skin color and hand feature (with boundary complexity) to detect the hand region from the input image; and use algorithm of optical flow to track the hand movement. Hand gesture recognition is composed of two parts: 1. Posture recognition and 2. Motion recognition, for describing the hand posture feature, we employ the Fourier descriptor method because it's rotation invariant. And we employ PCA method to extract the feature among gesture frames sequences. The HMM method will finally be used to recognize these feature to make a final decision of a hand gesture. Through the experiment, we can see that our proposed method can achieve 99% recognition rate at environment with simple background and no face region together, and reduce to 89.5% at the environment with complex background and with face region. These results can illustrate that the proposed algorithm can be applied as a production.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06a
• /
• pp.1027-1032
• /
• 1994

This paper introduces a interword modeling and a Viterbi search method for continuous speech recognition. We also describe a development of a real-time voice dialing system which can recognize around one hundred words and continuous digits in speaker independent mode. For continuous digit recognition, between-word units have been proposed to provide a more precise representation of word junctures. The best path in HMM is found by the Viterbi search algorithm, from which digit sequences are recognized. The simulation results show that a interword modeling using the context-dependent between-word units provide better recognition rates than a pause modeling using the context-independent pause unit. The voice dialing system is implemented on a DSP board with a telephone interface plugged in an IBM PC AT/486.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2016.05a
• /
• pp.298-298
• /
• 2016

최근 기후변화의 영향으로 시간에 따라 자료 및 통계적 특성이 변하는 비정상성이 다양한 수문자료에서 관측됨에 따라 비정상성 빈도해석에 대한 연구가 활발히 진행되고 있다. 비정상성 빈도해석에 사용되는 비정상성 확률 모형은 기존의 매개변수를 시간에 따라 변하는 공변량이 포함된 함수의 형태로 나타내기 때문에, 정상성 확률 모형에 비해 매개변수의 개수가 많으며 복잡한 형태를 가지게 된다. 따라서 본 연구에서는 비정상성 고려 시 모형이 복잡해짐에 따라 매개변수 및 확률 수문량의 불확실성이 어떻게 변하는지 알아보고자 하였다. 베이지안 방법은 매개변수 추정 및 확률 수문량의 산정 뿐 아니라 이에 대한 불확실성을 정량화할 수 있는 방법 중 하나이다. 따라서 베이지안 방법에서 매개변수 추정에 주로 쓰이는 Monte Carlo Markov Chain (MCMC) 방법 중 하나인 Metropolis-Hastings 알고리즘을 이용하여 정상성 및 비정상성 GEV모형에 대한 매개변수 및 확률수문량의 사후분포를 산정하였다. 산정된 사후분포의 사후구간을 통해 각 모형의 불확실성을 정량화하였으며, 계산된 불확실성의 비교를 통해 모형의 복잡성이 불확실성에 미치는 영향을 평가하였다.

• Structural Engineering and Mechanics
• /
• v.69 no.3
• /
• pp.317-326
• /
• 2019

This research aims to assess the tight seismic risk curve of the intake tower at Geumgwang reservoir by considering the recorded historical earthquake data in the Korean Peninsula. The seismic fragility, a significant part of risk assessment, is updated by using Bayesian inference to consider the uncertainties and computational efficiency. The reservoir is one of the largest reservoirs in Korea for the supply of agricultural water. The intake tower controls the release of water from the reservoir. The seismic risk assessment of the intake tower plays an important role in the risk management of the reservoir. Site-specific seismic hazard is computed based on the four different seismic source maps of Korea. Probabilistic Seismic Hazard Analysis (PSHA) method is used to estimate the annual exceedance rate of hazard for corresponding Peak Ground Acceleration (PGA). Hazard deaggregation is shown at two customary hazard levels. Multiple dynamic analyses and a nonlinear static pushover analysis are performed for deriving fragility parameters. Thereafter, Bayesian inference with Markov Chain Monte Carlo (MCMC) is used to update the fragility parameters by integrating the results of the analyses. This study proves to reduce the uncertainties associated with fragility and risk curve, and to increase significant statistical and computational efficiency. The range of seismic risk curve of the intake tower is extracted for the reservoir site by considering four different source models and updated fragility function, which can be effectively used for the risk management and mitigation of reservoir.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.51-56
• /
• 2022

In space based constellation network, users are allowed to enter or leave the network arbitrarily. Hence, the number, identities and transmitted data of active users vary with time and have considerable impacts on the receiver's performance. The so-called problem of multiuser detection means identifying the identity of each active user and detecting the data transmitted by each active user. Traditional methods assume that the number of active users is equal to the maximum number of users that the network can hold. The model of traditional methods are simple and the performance are suboptimal. In this paper a Maximum A Posteriori Probability (MAP) based multiuser detection method is proposed. The proposed method models the activity state of users as Markov chain and transforms multiuser detection into searching optimal path in grid map with BCJR algorithm. Simulation results indicate that the proposed method obtains 2.6dB and 1dB E_b/N₀ gains respectively when activity detection error rate and symbol error rate reach 10^-3, comparing with reference methods.