• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.35 no.2
• /
• pp.327-340
• /
• 2015

General Circulation Models (GCMs) are the basic tool used for modelling climate. However, the spatio-temporal discrepancy between GCM and observed value, therefore, the models deliver output that are generally required calibration for applied studies. Which is generally done by Multi-Model Ensemble (MME) approach. Stochastic downscaling methods have been used extensively to generate long-term weather sequences from finite observed records. A primary objective of this study is to develop a forecasting scheme which is able to make use of a MME of different GCMs. This study employed a Nonstationary Hidden Markov Chain Model (NHMM) as a main tool for downscaling seasonal ensemble forecasts over 3 month period, providing daily forecasts. Our results showed that the proposed downscaling scheme can provide the skillful forecasts as inputs for hydrologic modeling, which in turn may improve water resources management. An application to the Nakdong watershed in South Korea illustrates how the proposed approach can lead to potentially reliable information for water resources management.

• Journal of Korea Water Resources Association
• /
• v.35 no.5
• /
• pp.619-629
• /
• 2002

Water in the atmosphere is circulated by reciprocal action of various factors in the climate system. Otherwise, any climate phenomenon could not occur of itself. Thus, we have tried to understand the climate change by analysis of the factors. In this study, the fuzzy theory which is useful to express inaccurate and approximate nature in the real world is used for forecasting precipitation influenced by the factors. Forecasting models used in this study are neuro-fuzzy system and a Markov chain and those are applied to precipitation forecasting of illinois. Various atmosphere circulation factors(like soil moisture and temperature) influencing the climate change are considered to forecast precipitation. As a forecasting result, it can be found that the considerations of the factors are helpful to increase the forecastibility of the models and the neuro-fuzzy system gives us relatively more accurate forecasts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1060-1068
• /
• 2016

The range-free localization using connectivity information has problems of mobile tracking. This paper proposes two Bayesian filter-based mobile tracking algorithms considering a propagation scenario. Kalman and Markov Chain Monte Carlo (MCMC) particle filters are applied according to linearity of two measurement models. Measurement models of the Kalman and MCMC particle filter-based algorithms respectively are defined as connectivity between mobiles, information fusion of connectivity information and received signal strength (RSS) from neighbors within one-hop. To perform the accurate simulation, we consider a real indoor map of shopping mall and degree of radio irregularity (DOI) model. According to obstacles between mobiles, we assume two types of DOIs. We show the superiority of the proposed algorithm over existing range-free algorithms through MATLAB simulations.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.3
• /
• pp.21-26
• /
• 2002

This paper presents the new approach of identifying human emotional states such as anger, happiness, normal, sadness, or surprise. This is accomplished by using discrete duration continuous hidden Markov models(DDCHMM). For this, the emotional feature parameters are first defined from input speech signals. In this study, we used prosodic parameters such as pitch signals, energy, and their each derivative, which were then trained by HMM for recognition. Speaker adapted emotional models based on maximum a posteriori(MAP) estimation were also considered for speaker adaptation. As results, the simulation performance showed that the recognition rates of vocal emotion gradually increased with an increase of adaptation sample number.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3328-3349
• /
• 2020

With rapid development of ubiquitous computing and location-based services (LBSs), human trajectory data and associated activities are increasingly easily recorded. Inappropriately publishing trajectory data may leak users' privacy. Therefore, we study publishing trajectory data while preserving privacy, denoted privacy-preserving activity trajectories publishing (PPATP). We propose S-PPATP to solve this problem. S-PPATP comprises three steps: modeling, algorithm design and algorithm adjustment. During modeling, two user models describe users' behaviors: one based on a Markov chain and the other based on the hidden Markov model. We assume a potential adversary who intends to infer users' privacy, defined as a set of sensitive information. An adversary model is then proposed to define the adversary's background knowledge and inference method. Additionally, privacy requirements and a data quality metric are defined for assessment. During algorithm design, we propose two publishing algorithms corresponding to the user models and prove that both algorithms satisfy the privacy requirement. Then, we perform a comparative analysis on utility, efficiency and speedup techniques. Finally, we evaluate our algorithms through experiments on several datasets. The experiment results verify that our proposed algorithms preserve users' privay. We also test utility and discuss the privacy-utility tradeoff that real-world data publishers may face.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1390-1403
• /
• 2016

Facial expression recognition (FER) plays a very significant role in computer vision, pattern recognition, and image processing applications such as human computer interaction as it provides sufficient information about emotions of people. For video-based facial expression recognition, depth cameras can be better candidates over RGB cameras as a person's face cannot be easily recognized from distance-based depth videos hence depth cameras also resolve some privacy issues that can arise using RGB faces. A good FER system is very much reliant on the extraction of robust features as well as recognition engine. In this work, an efficient novel approach is proposed to recognize some facial expressions from time-sequential depth videos. First of all, efficient Local Binary Pattern (LBP) features are obtained from the time-sequential depth faces that are further classified by Generalized Discriminant Analysis (GDA) to make the features more robust and finally, the LBP-GDA features are fed into Hidden Markov Models (HMMs) to train and recognize different facial expressions successfully. The depth information-based proposed facial expression recognition approach is compared to the conventional approaches such as Principal Component Analysis (PCA), Independent Component Analysis (ICA), and Linear Discriminant Analysis (LDA) where the proposed one outperforms others by obtaining better recognition rates.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.11-19
• /
• 1994

The matching probability P(ο/$\lambda$), of the signal sequence(ο) observed for a finite time interval with a HMM (Hidden Markov Model $\lambda$) indicates the probability that signal comes from the given model. By utilizing the fact that the probability represents matching score of the observed signal with the model we can recognize an unknown signal pattern by comparing the magnitudes of the matching probabilities with respect to the known models. Because the algorithm however uses floating point variables during the computing process hardware implementation of the algorithm requires floating point units. This paper proposes an integer algorithm which uses positive integer numbers rather than float point ones to compute the matching probability so that we can economically realize the algorithm into hardware. The algorithm makes the model parameters integer numbers by multiplying positive constants and prevents from divergence of data through the normalization of variables at each step. The final equation of matching probability is composed of constant terms and a variable term which contains logarithm operations. A scheme to make the log conversion table smaller is also presented. To analyze the qualitive characteristics of the proposed algorithm we attatch simulation result performed on two groups of 10 hypothetic models respectively and inspect the statistical properties with repect to the model order the magnitude of scaling constants and the effect of the observation length.

• The KIPS Transactions:PartB
• /
• v.15B no.1
• /
• pp.53-60
• /
• 2008

This paper proposes a new multiobjective optimization method for discriminative training of hidden Markov models (HMMs) used as the recognizer for automatic lipreading. While the conventional Baum-Welch algorithm for training HMMs aims at maximizing the probability of the data of a class from the corresponding HMM, we define a new training criterion composed of two minimization objectives and develop a global optimization method of the criterion based on simulated annealing. The result of a speaker-dependent recognition experiment shows that the proposed method improves performance by the relative error reduction rate of about 8% in comparison to the Baum-Welch algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2674-2697
• /
• 2019

Identity authentication is a crucial line of defense for network security, and passwords are still the mainstream of identity authentication. So far trawling password attacking has been extensively studied, but the research related with personal information is always sporadic. Probabilistic context-free grammar (PCFG) and Markov chain-based models perform greatly well in trawling guessing. In this paper we propose a systematic targeted attacking model based on structure partition and string reorganization by migrating the above two models to targeted attacking, denoted as TG-SPSR. In structure partition phase, besides dividing passwords to basic structure similar to PCFG, we additionally define a trajectory-based keyboard pattern in the basic grammar and introduce index bits to accurately characterize the position of special characters. Moreover, we also construct a BiLSTM recurrent neural network classifier to characterize the behavior of password reuse and modification after defining nine kinds of modification rules. Extensive experimental results indicate that in online attacking, TG-SPSR outperforms traditional trawling attacking algorithms by average about 275%, and respectively outperforms its foremost counterparts, Personal-PCFG, TarGuess-I, by about 70% and 19%; In offline attacking, TG-SPSR outperforms traditional trawling attacking algorithms by average about 90%, outperforms Personal-PCFG and TarGuess-I by 85% and 30%, respectively.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1958-1962
• /
• 2005

A driver's emotion is a very important factor of safe driving. This paper classified a driver's emotion into 3 major emotions, can be occur when driving a car: Surprise, Joy, Tired. And It evaluated the classifier using Hidden Markov Models, which have observation sequence as bio-signals. It used the 2-D emotional plane to classfiy a human's general emotion state. The 2-D emotional plane has 2 axes of pleasure-displeasure and arsual-relaxztion. The used bio-signals are Galvanic Skin Response(GSR) and Heart Rate Variability(HRV), which are easy to acquire and reliable. We classified several moving pictures into 3 major emotions to evaluate our HMM system. As a result of driving simulations for each emotional situations, we can get recognition rates of 67% for surprise, 58% for joy and 52% for tired.