• 품질경영학회지
• /
• 제30권2호
• /
• pp.99-117
• /
• 2002

Variable sampling interval(VSI) and variable sample size(VSS) control charts vary the sampling rate for the next sample depending on the current chart statistic. This paper develops EWMA charts with the VSI and VSS features, and investigates the effectiveness of these charts in context of an economic model. The economic properties of these charts are evaluated by using Markov chain methods. The model contains cost parameters which allow the specification of the costs associated with sampling, false alarms, and operating off target. This economic model can be used to quantify the cost saving that can be obtained by using control charts with the VSI and VSS features instead of with the fixed sampling rate(FSR) feature, and can also be used to gain insight into the way that control charts with the VSI and VSS features should be designed to achieve optimal economic performance. The economic performance of X charts with the VSI and VSS features is also considered.

• Journal of Electrical Engineering and Technology
• /
• 제12권3호
• /
• pp.1053-1063
• /
• 2017

Power prediction is critical to improve power efficiency in Smart Grids. Markov chain provides a useful tool for power prediction. With careful investigation of practical power datasets, we find an interesting phenomenon that the stochastic property of practical power datasets does not follow the Markov features. This mismatch affects the prediction accuracy if directly using Markov prediction methods. In this paper, we innovatively propose a spatial transform based data processing to alleviate this inconsistency. Furthermore, we propose an enhanced power prediction method, named by Spatial Mapping Markov-Difference (SMMD), to guarantee the prediction accuracy. In particular, SMMD adopts a second prediction adjustment based on the differential data to reduce the stochastic error. Experimental results validate that the proposed SMMD achieves an improvement in terms of the prediction accuracy with respect to state-of-the-art solutions.

• 한국정보통신학회논문지
• /
• 제20권4호
• /
• pp.833-839
• /
• 2016

본 논문에서는 효율적인 접합 영상 검출을 위한 마르코프 천이 및 동시발생 확률에 대한 선택적 특징 추출 방법을 제안한다. 제안하는 방법에서는 이산 코사인 변환 영역에서 블록간 계수의 차이를 이용하여 특징들을 구성하고, 특징들의 각 위치에서 원 영상과 접합영상의 특징 분포의 상이성을 확인하기 위해 Kullback-Leibler 수렴값을 구한다. 이를 바탕으로, 마르코프 확률 특징과 동시발생 확률 특징 가운데 해당 위치에서 가장 큰 차이값을 갖는 특징을 선택하여 최종 특징으로 선택하고, SVM 분류기를 이용하여 학습 및 테스트한 후 그 유효성을 판별한다. 실험 결과를 바탕으로 제안하는 방법이 기존의 방법보다 제한된 특징수로 높은 영상접합 조작 결과를 보임을 확인하였다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 봄 학술발표논문집 Vol.30 No.1 (B)
• /
• pp.178-180
• /
• 2003

EEG-based brain computer interface(BCI) provides a new communication channel between human brain and computer. EEG data is a multivariate time series so that hidden Markov model (HMM) might be a good choice for classification. However EEG is very noisy data and contains artifacts, so useful features mr expected to improve the performance of HMM. In this paper we addresses the usefulness of principal component features with Hidden Markov model (HHM). We show that some selected principal component features can suppress small noises and artifacts, hence improves classification performance. Experimental study for the classification of EEG data during imagination of a left, right up or down hand movement confirms the validity of our proposed method.

• Journal of Information Processing Systems
• /
• 제8권2호
• /
• pp.301-314
• /
• 2012

In this paper, two new approaches to align English-Arabic sentences in bilingual parallel corpora based on the Multi-Class Support Vector Machine (MSVM) and the Hidden Markov Model (HMM) classifiers are presented. A feature vector is extracted from the text pair that is under consideration. This vector contains text features such as length, punctuation score, and cognate score values. A set of manually prepared training data was assigned to train the Multi-Class Support Vector Machine and Hidden Markov Model. Another set of data was used for testing. The results of the MSVM and HMM outperform the results of the length based approach. Moreover these new approaches are valid for any language pairs and are quite flexible since the feature vector may contain less, more, or different features, such as a lexical matching feature and Hanzi characters in Japanese-Chinese texts, than the ones used in the current research.

• ETRI Journal
• /
• 제29권4호
• /
• pp.527-529
• /
• 2007

In this paper, a decision-tree-based Markov model for phrase break prediction is proposed. The model takes advantage of the non-homogeneous-features-based classification ability of decision tree and temporal break sequence modeling based on the Markov process. For this experiment, a text corpus tagged with parts-of-speech and three break strength levels is prepared and evaluated. The complex feature set, textual conditions, and prior knowledge are utilized; and chunking rules are applied to the search results. The proposed model shows an error reduction rate of about 11.6% compared to the conventional classification model.

• 한국음향학회지
• /
• 제10권1호
• /
• pp.52-60
• /
• 1991

본 연구는 스펙트럼의 동적 특징을 한 파라메타로 하는 DHMM(Dynamic Hidden Markov Model)을 이용한 단독어인식에 관한 것으로 정적 스펙트럼 특징뿐 아니라 동적 스펙트럼 특징을 평가할 수 있는 DHMM에 근거한 음성 인식 실험을 논의 한다. 정적특징으로는 LPC cepstrum 계수를 이용하였고, 동적특징으로는 LPC cepstrum 의 회귀계수를 사용하였다. 이들 두 개의 특징 벡터들을 각각 집단화하여 만든 두 VQ codebook과 입력으로 받아들인 정적 벡터및 동적벡터로 단어들을 DHMM(Dynamic Hidden Markov Model)으로 모델링 하였다. 전체적인 실험에서 기존의 HMM을 이용한 인식실험에서는 88.8%의 인식율을 얻었는데 반해, DHMM을 이용한 인식실험에서는 92.7%의 인식율을 보였다.

• ETRI Journal
• /
• 제33권4호
• /
• pp.569-579
• /
• 2011

This paper presents a novel approach for human activity recognition (HAR) using the joint angles from a 3D model of a human body. Unlike conventional approaches in which the joint angles are computed from inverse kinematic analysis of the optical marker positions captured with multiple cameras, our approach utilizes the body joint angles estimated directly from time-series activity images acquired with a single stereo camera by co-registering a 3D body model to the stereo information. The estimated joint-angle features are then mapped into codewords to generate discrete symbols for a hidden Markov model (HMM) of each activity. With these symbols, each activity is trained through the HMM, and later, all the trained HMMs are used for activity recognition. The performance of our joint-angle-based HAR has been compared to that of a conventional binary and depth silhouette-based HAR, producing significantly better results in the recognition rate, especially for the activities that are not discernible with the conventional approaches.

• 전자공학회논문지
• /
• 제52권8호
• /
• pp.97-105
• /
• 2015

내용 적응적 스테가노그래피는 복잡한 텍스쳐 또는 잡음 영역과 같이 통계적 모델로는 기술하기 어려운 영역에 비밀 메시지를 은닉한다. 이러한 메시지를 검출하기 위해서는 인접 화소간의 국부적인 의존성을 정교하게 모델링해야 하기 때문에 종종 고차원의 특징벡터 추출이 필요하다. 이러한 스테그분석 방법은 계산량이 많을 뿐만 아니라 비밀 메시지의 검출 정확도가 은닉 영역과 사용된 왜곡 척도에 의존한다는 문제점을 가진다. 본 논문에서는 적은 수의 특징 벡터를 이용하여 비밀 메시지의 검출율을 높일 수 있는 개선된 내용 적응적 스테가노그래피의 스테그분석 방법을 제안하고자 한다. 먼저 이산 코사인 변환 계수의 차이를 이용한 특징이 내용 적응적 스테가노그래피의 분석에 유용함을 보이고, 이에 대한 1차 마코프 확률을 특징으로 사용하는 방법을 제시한다. 추출된 특징 벡터는 앙상블 분류기로 입력되어 커버 영상과 스테고 영상을 분류하기 위해 학습된다. 실험 결과 내용 기반 적응적 스테고 영상들에 대해 적은 수의 특징 벡터를 사용함에도 불구하고 기존의 방법에 비해 검출율과 정확도가 우수함을 확인할 수 있었다.

• Industrial Engineering and Management Systems
• /
• 제14권2호
• /
• pp.210-219
• /
• 2015

A classification task requires an exponentially growing amount of computation time and number of observations as the variable dimensionality increases. Thus, reducing the dimensionality of the data is essential when the number of observations is limited. Often, dimensionality reduction or feature selection leads to better classification performance than using the whole number of features. In this paper, we study the possibility of utilizing the Markov blanket discovery algorithm as a new feature selection method. The Markov blanket of a target variable is the minimal variable set for explaining the target variable on the basis of conditional independence of all the variables to be connected in a Bayesian network. We apply several Markov blanket discovery algorithms to some high-dimensional categorical and continuous data sets, and compare their classification performance with other feature selection methods using well-known classifiers.