A video affective content representation and recognition framework based on Video Affective Tree (VAT) and Hidden Markov Models (HMMs) is presented. Video affective content units in different granularities are firstly located by excitement intensity curves, and then the selected affective content units are used to construct VAT. According to the excitement intensity curve the affective intensit...

Many signal processing systems use event driven mechanisms typically based on nite state machines (FSMs) to control the operation of computationally intensive (data ow) parts. The state machines in turn are often fueled by external inputs as well as by feedback from the signal processing portions of the system. Packet-based transmission systems are a good example for such a close interaction be...

In this paper we present a novel approach for automatically tracking the reading progress using a combination of eye-gaze tracking and speech recognition. The two are fused by first generating word probabilities based on eye-gaze information and then using these probabilities to augment the language model probabilities during speech recognition. Experimental results on a small dataset show that...

One approach to the problem of formulating domain models for planning is to learn the models from example action sequences. The LOCM system demonstrated the feasibility of learning domain models from example action sequences only, with no observation of states before, during or after the plans. LOCM uses an object-centred representation, in which each object is represented by a single parameter...

A hand-printed Chinese character recognizer based on Contextual Vector Quantization (CVQ) has been built previously. In this paper, several properties of the recognizer will be discussed and the recognizer of 4516 Chinese characters has a successful rate of 91.0%. Then the output of the recognizer is passed to a language model which when applied to recognize a passage of about 1200 characters r...

We consider three natural classes of infinite-state HMSCs: globally-cooperative, locally-cooperative and local-choice HMSCs. We show first that model-checking for globally-cooperative and locally-cooperative HMSCs is of the same complexity as for the class of finite state HMSCs. Surprisingly, model-checking local-choice HMSCs turns out to be exponentially more efficient in space than for locall...

This paper presents a technique for designing self–checking finite state machines that uses a 2-hot code for state encoding. The registers and output logic in resulting state machines are testable online. A new method for designing the output logic is also proposed in this paper Key-Words: Fault Detection, State Machines, Online Testing, Transient Faults, Permanent Faults

This paper concerns rapid adaptation of hidden Markov model (HMM) based speech recognizers to a new speaker, when only few speech samples (one minute or less) are available from the new speaker. A widely used family of adaptation algorithms defines adaptation as a linearly constrained reestimation of the HMM Gaussians. With few speech data, tight constraints must be introduced, by reducing the ...