Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 11

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  ukryty model Markowa
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
The evaluation of system performance plays an increasingly important role in the reliability analysis of cyber-physical systems. Factors of external instability affect the evaluation results in complex systems. Taking the running gear in high-speed trains as an example, its complex operating environment is the most critical factor affecting the performance evaluation design. In order to optimize the evaluation while improving accuracy, this paper develops a performance evaluation method based on slow feature analysis and a hidden Markov model (SFA-HMM). The utilization of SFA can screen out the slowest features as HMM inputs, based on which a new HMM is established for performance evaluation of running gear systems. In addition to directly classical performance evaluation for running gear systems of high-speed trains, the slow feature statistic is proposed to detect the difference in the system state through test data, and then eliminate the error evaluation of the HMM in the stable state. In addition, indicator planning and status classification of the data are performed through historical information and expert knowledge. Finally, a case study of the running gear system in high-speed trains is discussed. After comparison, the result shows that the proposed method can enhance evaluation performance.
EN
n recent years, the integration of human-robot interaction with speech recognition has gained a lot of pace in the manufacturing industries. Conventional methods to control the robots include semi-autonomous, fully-autonomous, and wired methods. Operating through a teaching pendant or a joystick is easy to implement but is not effective when the robot is deployed to perform complex repetitive tasks. Speech and touch are natural ways of communicating for humans and speech recognition, being the best option, is a heavily researched technology. In this study, we aim at developing a stable and robust speech recognition system to allow humans to communicate with machines (robotic-arm) in a seamless manner. This paper investigates the potential of the linear predictive coding technique to develop a stable and robust HMM-based phoneme speech recognition system for applications in robotics. Our system is divided into three segments: a microphone array, a voice module, and a robotic arm with three degrees of freedom (DOF). To validate our approach, we performed experiments with simple and complex sentences for various robotic activities such as manipulating a cube and pick and place tasks. Moreover, we also analyzed the test results to rectify problems including accuracy and recognition score.
EN
The paper describes a new method of embedding human communication in acoustic sequences mimicking animal communication. This is done to ensure a low probability of detection (LPD) transfer of covert messages. The proposed scheme mimics not only individual sounds, but also the imitated species’ communication structure. This paper presents a step forward in animal communication mimicry - from pure vocal imitation without regard for the plausibility of communication’s structure, through Zipf’s law-preserving scheme, to the mimicry of a known communication structure. Unlike previous methods, the updated scheme does not rely on third parties’ ignorance of the imitated species’ communication structure beyond Zipf’s law - instead, the new method enables one to encode information in a known zeroth-order Markov model. The paper describes a method of encoding an arbitrary message in a syntactically plausible, species-specific sequence of animal sounds through evolutionary means. A comparison with the previous iteration of the method is also presented.
EN
In this article, the author theoretically substantiated the possibility of integration of hidden Markov models (IHMM) in the structure of the automated speaker recognition system for critical use (ASRSCU) for analysis of speech information from a plurality of independent input channels, which allowed within the statistical conception of pattern recognition to combine the accuracy of the approximation of input signals inherent the apparatus of GMM models. The authors proposed a mathematical apparatus for the integration of hidden Markov models, which allows us to adequately describe the set of interacting processes in the Markov paradigm with the preservation of temporal, asymmetric conditional probabilities between the chains.
PL
W tym artykule autorzy teoretycznie uzasadnili możliwość integracji ukrytych modeli Markowa (IHMM) w strukturze zautomatyzowanego systemu rozpoznawania głosu osoby mówiącej do zastosowań krytycznych (ASRSCU) do analizy informacji o mowie z wielu niezależnych kanałów wejściowych, które dopuszczają wewnątrz statystyczna koncepcję rozpoznawania wzorców w celu połączenia dokładności aproksymacji sygnałów wejściowych z aparatem modeli GMM. Autorzy zaproponowali aparat matematyczny do integracji ukrytych modeli Markowa, który pozwala odpowiednio opisać zestaw oddziałujących procesów w paradygmacie Markowa z zachowaniem czasowych, asymetrycznych warunkowych prawdopodobieństw między łańcuchami.
EN
In the light of regularized dynamic time warping kernels, this paper re-considers the concept of a time elastic centroid for a set of time series. We derive a new algorithm based on a probabilistic interpretation of kernel alignment matrices. This algorithm expresses the averaging process in terms of stochastic alignment automata. It uses an iterative agglomerative heuristic method for averaging the aligned samples, while also averaging the times of their occurrence. By comparing classification accuracies for 45 heterogeneous time series data sets obtained by first nearest centroid/medoid classifiers, we show that (i) centroid-based approaches significantly outperform medoid-based ones, (ii) for the data sets considered, our algorithm, which combines averaging in the sample space and along the time axes, emerges as the most significantly robust model for time-elastic averaging with a promising noise reduction capability. We also demonstrate its benefit in an isolated gesture recognition experiment and its ability to significantly reduce the size of training instance sets. Finally, we highlight its denoising capability using demonstrative synthetic data. Specifically, we show that it is possible to retrieve, from few noisy instances, a signal whose components are scattered in a wide spectral band.
EN
Diabetes mellitus is a clinical syndrome caused by the interaction of genetic and environmental factors. The change of plantar pressure in diabetic patients is one of the important reasons for the occurrence of diabetic foot. The abnormal increase of plantar pressure is a predictor of the common occurrence of foot ulcers. The feature extraction of plantar pressure distribution will be beneficial to the design and manufacture of diabetic shoes that will be beneficial for early protection of diabetes mellitus patients. In this research, texture-based features of the angular second moment (ASM), moment of inertia (MI), inverse difference monument (IDM), and entropy (E) have been selected and fused by using the updown algorithm. The fused features are normalized to predict comfort plantar pressure imaging dataset using an improved fuzzy hidden Markov model (FHMM). In FHMM, type-I fuzzy set is proposed and fuzzy Baum–Welch algorithm is also applied to estimate the next features. The results are discussed, and by comparing with other back–forward algorithms and different fusion operations in FHMM. Improved HMMs with up–down fusion using type-I fuzzy definition performs high effectiveness in prediction comfort plantar pressure distribution in an image dataset with an accuracy of 82.2% and the research will be applied to the shoe-last personalized customization in the industry.
7
Content available remote Chemotherapy-induced fatigue estimation using hidden Markov model
EN
Chemotherapy-induced fatigue undermines the physical performance and alter gait behaviour of patients. In clinics, there is not a well-established method to objectively assess the effects of chemotherapy-induced fatigue on gait characteristics. Clinical trials commonly use 6 Minute Walking Tests (6MWT) to assess patients' gait. However, these studies only measure the distance that patients can walk. The distance does not provide comprehensive information about variations in ambulatory motion characteristics and body postural behaviour which can more appropriately describe the fatigue effects on general physical performance. Gait characteristics provide a manifestation of relationships between muscular and cardiovascular fitness status and physical motions. Hence, an assessment of gait characteristics provides more appropriate information about the effects of chemotherapy-induced fatigue on gait behaviour. A novel approach is proposed to objectively assess the impacts of chemotherapy-induced fatigue on cancer gait by analysing the gait characteristics during 6MWT. The joint angles of the lower body segments are measured by inertial sensors and modelled through a Hidden Markov Model (HMM) with Gaussian emissions. A Gaussian clustering method classifies the joint angles of first gait cycle to determine the six gait phases of a normal gait as initial training values. A comparison of gait characteristics before and after chemotherapy-induced fatigue determines the gait abnormalities. The method is applied to four cancer patients and outcomes are benchmarked against the gait of a healthy subject before and after running program-induced fatigue. The results indicate a more accurate quantitative-based tool to measure the effects of chemotherapy-induce fatigue on gait and physical performance.
EN
The paper presents a new solution for the face recognition based on two-dimensional hidden Markov models. The traditional HMM uses one-dimensional data vectors, which is a drawback in the case of 2D and 3D image processing, because part of the information is lost during the conversion to one-dimensional features vector. The paper presents a concept of the full ergodic 2DHMM, which can be used in 2D and 3D face recognition. The experimental results demonstrate that the system based on two dimensional hidden Markov models is able to achieve a good recognition rate for 2D, 3D and multimodal (2D+3D) face images recognition, and is faster than ICP method.
EN
In the paper, selected informations on Hidden Markov Models (also called Hidden Markov Chains) are reminded. Basic riotions are defined and algorithms related to these models are shortly presented. The research part of the papers shows results of three conducted experiments entitled: "pork cutlet", "form sheet" and ''poetaster". The most important experiment "form sheet" gives a good starting point to a practical application of HMMs to the. handwriting recognition. The "poetaster" experiment shows possible application of HMMs in so called "artifial creation".
EN
The Hidden Markov Model (HMM) is a stochastic approach to recognition of patterns appearing in an input signal. In the work author's implementation of the HMM were used to recognize speech disorders - prolonged fricative phonemes. To achieve the best recognition effectiveness and simultaneously preserve reasonable time required for calculations two problems need to be addressed: the choice of the HMM and the proper preparation of an input data. Tests results for recognition of the considered type of speech disorders are presented for HMM models with different number of states and for different sizes of codebooks.
11
Content available remote On Naive Bayes in Speech Recognition
EN
The currently dominant speech recognition technology, hidden Markov modeling, has long been criticized for its simplistic assumptions about speech, and especially for the naive Bayes combination rule inherent in it. Many sophisticated alternative models have been suggested over the last decade. These, however, have demonstrated only modest improvements and brought no paradigm shift in technology. The goal of this paper is to examine why HMM performs so well in spite of its incorrect bias due to the naive Bayes assumption. To do this we create an algorithmic framework that allows us to experiment with alternative combination schemes and helps us understand the factors that influence recognition performance. From the findings we argue that the bias peculiar to the naive Bayes rule is not really detrimental to phoneme classification performance. Furthermore, it ensures consistent behavior in outlier modeling, allowing efficient management of insertion and deletion errors.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.