In this demo, we present a technique for synthesizing the mouth movement from acoustic speech information. The algorithm maps the audio parameter set to the visual parameter set using the Gaussian Mixture Model and the Hidden Markov Model. With this technique, we can create smooth and realistic lip movements.

Computer is omnipresent. With massive growth in the field of computers, advancement in digital technology, development in software’s gives improvement to computer field on one side. Hacking the systems and cracking the login Passwords makes the field in endure on the other hand. Authentication to access an application in networks is mostly based on alphanumeric Password. A novel method of Alpha...

One of the tenets of the radio pulsar observational picture is that the integrated pulse profiles are constant with time. This assumption underpins much of the fantastic science made possible via pulsar timing. Over the past few years, however, this assumption has come under question with a number of pulsars showing pulse shape changes on a range of timescales. Here, we show the dramatic appear...

Nowadays it is a standard technique to produce a BoseEinstein condensate in the laboratory [?,?]. In order to build a coherent source of atoms, an atom laser, a major achievement was the coherent extraction of atoms from an atomic trap. At first a pulsed atom laser was built [?,?], recently also continuous wave atom lasers have been realized [?,?]. A short survey over the experimental situation...

A Bayesian multiscale technique for detection of statistically significant features in noisy images is proposed. The prior is defined as a stationary intrinsic Gaussian Markov random field on a toroidal graph, which enables efficient computation of the relevant posterior marginals. Hence the method is applicable to large images produced by modern digital cameras. The technique is demonstrated i...

An approximate version of the Standard uniformization technique is introduced for application to continuous-time Markov chains with unbounded jump rates. This technique is shown to be asymptotically exact and an error bound for the order of its accuracy is provided. An illustrative queueing application is included.

This paper presents an iterative technique for the transient analysis of large structurally unrestricted semi-Markov processes (SMPs), which builds on our previous work on iterative passage time calculation. The method is based on the calculation and subsequent numerical inversion of Laplace transforms. We demonstrate our technique on a Markovian process algebra model of a web-server with 69 44...

The splitting a non-binary input image into a number of lower, but not neccessarily binary, resolution subgroups is explored as a technique to improve lossless compression. The idea is to accelerate the learning in the Markov models used as part of arithmetic coders. Our technique typically improves on the \standard" JBIG method of using single (Gray coded) bit planes by approximately 4%.

The Markov analysis is a technique for modeling system state transitions and calculating the probability of reaching various system states. While it is a proper tool for modeling complex system designs involving timing, sequencing, repair, redundancy, and fault tolerance, as the complexity or size of the system increases, so does the number of states of interest, leading to difficulty in constr...

The Markov property is a fundamental property in time series analysis and is often assumed in economic and …nancial modelling. We develop a test for the Markov property using the conditional characteristic function embedded in a frequency domain approach, which checks the implication of the Markov property in every conditional moment (if exist) and over many lags. The proposed test is applicabl...