A coupled HMM approach to video-realistic speech animation

We propose a coupled hidden Markov model (CHMM) approach to video-realistic speech animation, which realizes realistic facial animations driven by speaker independent continuous speech. Different from hidden Markov model (HMM)-based animation approaches that use a single-state chain, we use CHMMs to explicitly model the subtle characteristics of audio-visual speech, e.g., the asynchrony, temporal dependency (synchrony), and different speech classes between the two modalities. We derive an expectation maximization (EM)-based A/V conversion algorithm for the CHMMs, which converts acoustic speech into decent facial animation parameters. We also present a video-realistic speech animation system. The system transforms the facial animation parameters to a mouth animation sequence, refines the animation with a performance refinement process, and finally stitches the animated mouth with a background facial sequence seamlessly. We have compared the animation performance of the CHMM with the HMMs, the multi-stream HMMs and the factorial HMMs both objectively and subjectively. Results show that the CHMMs achieve superior animation performance. The ph-vi-CHMM system, which adopts different state variables (phoneme states and viseme states) in the audio and visual modalities, performs the best. The proposed approach indicates that explicitly modelling audio-visual speech is promising for speech animation.     

Designing spectral sensitivity curves for use with Artificial Color

Artificial Color uses data from two or more spectrally overlapping sensitivity curves to assign class membership to pixels and ultimately to images. The usefulness of Artificial Color for various scene segmentation tasks has been shown in several recent papers, but those demonstrations all used sensitivity curves not optimized for the particular task, i.e. the R, G, B filters of commercial color cameras. This paper explores means to evolve suitable spectral sensitivity curves suited to any specialized task and illustrates that method with synthetic data chosen to be very hard to discriminate spectrally. Two special cases are illustrated. In one, a single Gaussian curve is used for a dichroic beamsplitter, so that the curve and its complement are used for discrimination. In the other case, two essentially orthogonal curves are utilized for the same task. The single Gaussian curve leads to poorer discrimination but better light efficiency relative to the two curves. Both do quite well on the difficult target problem.     

The BYY annealing learning algorithm for Gaussian mixture with automated model selection

Bayesian Ying-Yang (BYY) learning has provided a new mechanism that makes parameter learning with automated model selection via maximizing a harmony function on a backward architecture of the BYY system for the Gaussian mixture. However, since there are a large number of local maxima for the harmony function, any local searching algorithm, such as the hard-cut EM algorithm, does not work well. In order to overcome this difficulty, we propose a simulated annealing learning algorithm to search the global maximum of the harmony function, being expressed as a kind of deterministic annealing EM procedure. It is demonstrated by the simulation experiments that this BYY annealing learning algorithm can efficiently and automatically determine the number of clusters or Gaussians during the learning process. Moreover, the BYY annealing learning algorithm is successfully applied to two real-life data sets, including Iris data classification and unsupervised color image segmentation.     

A kernel trick for sequences applied to text-independent speaker verification systems

This paper presents a principled SVM based speaker verification system. We propose a new framework and a new sequence kernel that can make use of any Mercer kernel at the frame level. An extension of the sequence kernel based on the Max operator is also proposed. The new system is compared to state-of-the-art GMM and other SVM based systems found in the literature on the Banca and Polyvar databases. The new system outperforms, most of the time, the other systems, statistically significantly. Finally, the new proposed framework clarifies previous SVM based systems and suggests interesting future research directions.     

Semi-automatic computer aided lesion detection in dental X-rays using variational level set

A semi-automatic lesion detection framework is proposed to detect areas of lesions from periapical dental X-rays using level set method. In this framework, first, a new proposed competitive coupled level set method is used to segment the image into three pathologically meaningful regions using two coupled level set functions. Tailored for the dental clinical setting, a two-stage clinical segmentation acceleration scheme is used. The method uses a trained support vector machine (SVM) classifier to provide an initial contour for two coupled level sets. Then, based on the segmentation results, an analysis scheme is applied. Firstly, the scheme builds an uncertainty map from which those areas with radiolucent will be automatically emphasized by a proposed color emphasis scheme. Those radiolucent in the teeth or jaw usually suggested possible lesions. Secondly, the scheme employs a method based on the average intensity profile to isolate the teeth and locate two types of lesions: periapical lesion (PL) and bifurcation lesion (BL). Experimental results show that our proposed segmentation method is able to segment the image into pathological meaningful regions for further analysis; our proposed framework is able to automatically provide direct visual cues for the lesion detection; and when given the orientation of the teeth, it is able to automatically locate the PL and BL with a seriousness level marked for further dental diagnosis. When used in the clinical setting, the framework enables dentist to improve interpretation and to focus their attention on critical areas.     

Design and formal proof of a new optimal image segmentation program with hypermaps

This article presents the design of a new functional 2D image segmentation algorithm by cell merging in a subdivision, its proof of total correctness, and the derivation of an optimal imperative program. The planar subdivisions are modeled by hypermaps. The formal specifications of hypermaps and segmentation are developed in the Calculus of Inductive Constructions. The proofs are assisted by the Coq system. The final program is written in C.     

A discriminant analysis using composite features for classification problems

In this paper, we propose a new discriminant analysis using composite features for pattern classification. A composite feature consists of a number of primitive features, each of which corresponds to an input variable. The covariance of composite features is obtained from the inner product of composite features and can be considered as a generalized form of the covariance of primitive features. It contains information on statistical dependency among multiple primitive features. A discriminant analysis (C-LDA) using the covariance of composite features is a generalization of the linear discriminant analysis (LDA). Unlike LDA, the number of extracted features can be larger than the number of classes in C-LDA, which is a desirable property especially for binary classification problems. Experimental results on several data sets indicate that C-LDA provides better classification results than other methods based on primitive features.     

Unethical computer using behavior scale: A study of reliability and validity on Turkish university students

This study was carried out in a Turkish university with 216 undergraduate students of computer technology as respondents. The study aimed to develop a scale (UECUBS) to determine the unethical computer use behavior. A factor analysis of the related items revealed that the factors were can be divided under five headings; intellectual property, social impact, safety and quality, net integrity and information integrity.     

Unrealistic optimism in internet events

This study assessed the tendency for individuals to be unrealistically optimistic about internet related activities. Ninety-seven participants estimated their chances of experiencing 31 positive and negative internet events compared to the average student at their school. The data indicated that students believed positive internet events were more likely to happen to them and negative events were less likely to happen to them compared to the average student. Heavy internet users reported more optimistic responses than did light users. Perceptions of event characteristics (controllability, desirability, and personal experience) were also significantly correlated with optimistic bias.     

Errors-in-variables methods in system identification

The paper gives a survey of errors-in-variables methods in system identification. Background and motivation are given, and examples illustrate why the identification problem can be difficult. Under general weak assumptions, the systems are not identifiable, but can be parameterized using one degree-of-freedom. Examples where identifiability is achieved under additional assumptions are also provided. A number of approaches for parameter estimation of errors-in-variables models are presented. The underlying assumptions and principles for each approach are highlighted.