Query: Expressive Visual Text-to-Speech Using Active Appearance Models

Relevant passages:
A Morphable Model for the Synthesis of 3D Faces <=SEP=> In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly through an intuitive user interface. Users are assisted in two key problems of computer aided face modeling. First, new face images or new 3D face models can be registered automatically by computing dense one-to-one correspondence to an internal face model. Second, the approach regulates the naturalness of modeled faces avoiding faces with an “unlikely” appearance. Starting from an example set of 3D face models, we derive a morphable face model by transforming the shape and texture of the examples into a vector space representation. New faces and expressions can be modeled by forming linear combinations of the prototypes. Shape and texture constraints derived from the statistics of our example faces are used to guide manual modeling or automated matching algorithms. We show 3D face reconstructions from single images and their applications for photo-realistic image manipulations. We also demonstrate face manipulations according to complex parameters such as gender, fullness of a face or its distinctiveness.

Dynamic Units of Visual Speech <=SEP=> We present a new method for generating a dynamic, concatenative, unit of visual speech that can generate realistic visual speech animation. We redefine visemes as temporal units that describe distinctive speech movements of the visual speech articulators. Traditionally visemes have been surmized as the set of static mouth shapes representing clusters of contrastive phonemes (e.g. /p, b, m/, and /f, v/). In this work, the motion of the visual speech articulators are used to generate discrete, dynamic visual speech gestures. These gestures are clustered, providing a finite set of movements that describe visual speech, the visemes. Dynamic visemes are applied to speech animation by simply concatenating viseme units. We compare to static visemes using subjective evaluation. We find that dynamic visemes are able to produce more accurate and visually pleasing speech animation given phonetically annotated audio, reducing the amount of time that an animator needs to spend manually refining the animation.

Statistical Parametric Speech Synthesis <=SEP=> 

Photo-Realistic Talking-Heads from Image Samples <=SEP=> This paper describes a system for creating a photo-realistic model of the human head that can be animated and lip-synched from phonetic transcripts of text. Combined with a state-of-the-art text-to-speech synthesizer (TTS), it generates video animations of talking heads that closely resemble real people. To obtain a naturally looking head, we choose a “data-driven” approach. We record a talking person and apply image recognition to extract automatically bitmaps of facial parts. These bitmaps are normalized and parameterized before being entered into a database. For synthesis, the TTS provides the audio track, as well as the phonetic transcript from which trajectories in the space of parameterized bitmaps are computed for all facial parts. Sampling these trajectories and retrieving the corresponding bitmaps from the database produces animated facial parts. These facial parts are then projected and blended onto an image of the whole head using its pose information. This talking head model can produce new, never recorded speech of the person who was originally recorded. Talking-head animations of this type are useful as a front-end for agents and avatars in multimedia applications such as virtual operators, virtual announcers, help desks, educational, and expert systems.

Expressive speech-driven facial animation <=SEP=> Speech-driven facial motion synthesis is a well explored research topic. However, little has been done to model expressive visual behavior during speech. We address this issue using a machine learning approach that relies on a database of speech-related high-fidelity facial motions. From this training set, we derive a generative model of expressive facial motion that incorporates emotion control, while maintaining accurate lip-synching. The emotional content of the input speech can be manually specified by the user or automatically extracted from the audio signal using a Support Vector Machine classifier.

The Design and Implementation of the Clouds Distributed Operating System <=SEP=> Clouds is a native operating system for a distributed environment. The Clouds operating system is built on top of a kernel called Ra. Ra ís a second generation kernel derived from our experience with the first version of the Clouds operating system. Rø is a minimal, flexible kernel that provides a framework for implementing a variety of distributed operating systems. This paper presents the Clouds paradigm and a brief overview of its first implementation. We then present the details of the Rø kernel, the rationale for its design, and the system services that constitute the Clouds operating system. This work was funded by NSF grant CCR-8619886. @ Computing Systems, Vol. 3 . No. I . Winter 1990 11

Comparison of main control strategies for DC/DC stage of bidirectional vehicle charger <=SEP=> This paper presents comparison of two control algorithms for DC/DC converters in vehicle chargers. It presents operation in phase-shifting algorithm and resonant LLC algorithm, their implementation, and test results.

Feature Reduction for Document Clustering and Classification <=SEP=> Often users receive search results which contain a wide range of documents, only some of which are relevant to their information needs. To address this problem, ever more systems not only locate information for users, but also organise that information on their behalf. We look at two main automatic approaches to information organisation: interactive clustering of search results and pre-categorising documents to provide hierarchical browsing structures. To be feasible in real world applications, both of these approaches require accurate yet efficient algorithms. Yet, both suffer from the curse of dimensionality — documents are typically represented by hundreds or thousands of words (features) which must be analysed and processed during clustering or classification. In this paper, we discuss feature reduction techniques and their application to document clustering and classification, showing that feature reduction improves efficiency as well as accuracy. We validate these algorithms using human relevance assignments and categorisation.

The "wake-sleep" algorithm for unsupervised neural networks. <=SEP=> An unsupervised learning algorithm for a multilayer network of stochastic neurons is described. Bottom-up "recognition" connections convert the input into representations in successive hidden layers, and top-down "generative" connections reconstruct the representation in one layer from the representation in the layer above. In the "wake" phase, neurons are driven by recognition connections, and generative connections are adapted to increase the probability that they would reconstruct the correct activity vector in the layer below. In the "sleep" phase, neurons are driven by generative connections, and recognition connections are adapted to increase the probability that they would produce the correct activity vector in the layer above.

A Novel Wideband Microstrip Line to Ridge Gap Waveguide Transition Using Defected Ground Slot <=SEP=> In this letter design of a novel, wideband and low loss microstrip line transition to ridge gap waveguide is described. The transition is made up of two sections. The first section is a microstrip line that feeds a slot on the ground plane. The microstrip line is placed inside a metal box. The second part is the slot to ridge gap waveguide matching section. The proposed design has a broadband coupling to ridge gap waveguide and covers the whole stop-band of the periodic gap structure. The design optimization is performed for the microstrip line, slot size and ridge gap waveguide matching ridges. A prototype in Ku-band is manufactured and measured that shows a return loss less than 14 dB and a back-to-back insertion loss smaller than 0.5 dB for the given bandwidth. The microstrip transition enables integration of monolithic microwave integrated circuits (MMICs) in ridge gap waveguide technology.

Technological Developments in Batteries: A Survey of Principal Roles, Types, and Management Needs <=SEP=> Battery energy storage effectively staBIlizes the electric grid and aids renewable integration by balancing supply and demand in real time. The importance of such storage is especially crucial in densely populated urban areas, where traditional storage techniques such as pumped hydroelectric energy storage and compressed-air energy storage are often not feasible.

Automatic 3D face reconstruction from single images or video <=SEP=> This paper presents a fully automated algorithm for reconstructing a textured 3D model of a face from a single photograph or a raw video stream. The algorithm is based on a combination of Support Vector Machines (SVMs) and a Morphable Model of 3D faces. After SVM face detection, individual facial features are detected using a novel regression- and classification-based approach, and probabilistically plausible configurations of features are selected to produce a list of candidates for several facial feature positions. In the next step, the configurations of feature points are evaluated using a novel criterion that is based on a Morphable Model and a combination of linear projections. To make the algorithm robust with respect to head orientation, this process is iterated while the estimate of pose is refined. Finally, the feature points initialize a model-fitting procedure of the Morphable Model. The result is a high resolution 3D surface model.

TRUSTED CODE EXECUTION ON UNTRUSTED PLATFORMS USING INTEL SGX <=SEP=> Today, isolated trusted computation and code execution is of paramount importance to protect sensitive information and workfl ows from other malicious privileged or unprivileged software. Intel Software Guard Extensions (SGX) is a set of security architecture extensions fi rst introduced in the Skylake microarchitecture that enables a Trusted Execution Environment (TEE). It provides an ‘inverse sandbox’, for sensitive programs, and guarantees the integrity and confi dentiality of secure computations, even from the most privileged malicious software (e.g. OS, hypervisor). SGX-capable CPUs only became available in production systems in Q3 2015, and they are not yet fully supported and adopted in systems. Besides the capability in the CPU, the BIOS also needs to provide support for the enclaves, and not many vendors have released the required updates for the system support. This has led to many wrong assumptions being made about the capabilities, features, and ultimately dangers of secure enclaves. By having access to resources and publications such as white papers, patents and the actual SGX-capable hardware and software development environment, we are in a privileged position to be able to investigate and demystify SGX. In this paper, we fi rst review the previous trusted execution technologies, such as ARM Trust Zone and Intel TXT, to better understand and appreciate the new innovations of SGX. Then, we look at the details of SGX technology, cryptographic primitives and the underlying concepts that power it, namely the sealing, attestation, and the Memory Encryption Engine (MEE). We also consider use cases such as trusted and secure code execution on an untrusted cloud platform, and digital rights management (DRM). This is followed by an overview of the software development environment and the available libraries.

Getting stress out of stressed-out stress granules. <=SEP=> Amyotrophic lateral sclerosis (ALS) pathology is linked to the aberrant aggregation of specific proteins, including TDP-43, FUS, and SOD1, but it is not clear why these aggregation events cause ALS. In this issue of The EMBO Journal, Mateju et al (2017) report a direct link between misfolded proteins accumulating in stress granules and the phase transition of these stress granules from liquid to solid. This discovery provides a model connecting protein aggregation to stress granule dysfunction.

Targeting the right students using data mining <=SEP=> The education domain offers a fertile ground for many interesting and challenging data mining applications. These applications can help both educators and students, and improve the quality of education. In this paper, we present a real-life application for the Gifted Education Programme (GEP) of the Ministry of Education (MOE) in Singapore. The application involves many data mining tasks. This paper focuses only on one task, namely, selecting students for remedial classes. Traditionally, a cut-off mark for each subject is used to select the weak students. That is, those students whose scores in a subject fall below the cut-off mark for the subject are advised to take further classes in the subject. In this paper, we show that this traditional method requires too many students to take part in the remedial classes. This not only increases the teaching load of the teachers, but also gives unnecessary burdens to students, which is particularly undesirable in our case because the GEP students are generally taking more subjects than non-GEP students, and the GEP students are encouraged to have more time to explore advanced topics. With the help of data mining, we are able to select the targeted students much more precisely.

Cultural diversity among nursing students: reanalysis of the cultural awareness scale. <=SEP=> Nurses are educated to provide culturally competent care. Cultural competence begins with cultural awareness, a concept previously measured with the Cultural Awareness Scale (CAS). The purpose of this study was to reanalyze the CAS to determine construct validity and differences in cultural awareness among students of varying educational levels and experiences. The sample consisted of 150 nursing students (92% female, 33.6% racial minorities). Confirmatory factor analysis yielded three factors (CFI = 0.868, TLI = 0.854, RMSEA = 0.065, and SRMR = 0.086). Cronbach's alpha ranged from 0.70 to 0.89. There were significant differences among educational levels, with lower division BSN students generally scoring higher than upper division and master's of science in nursing students. Students who had taken courses on cultural diversity or global health generally outscored those who had not taken such courses. Findings support the validity of the CAS and its applicability to research studies of cultural awareness in nursing.

A Hybrid Data Mining Approach for Intrusion Detection on Imbalanced NSL-KDD Dataset <=SEP=> Intrusion detection systems aim to detect malicious viruses from computer and network traffic, which is not possible using common firewall. Most intrusion detection systems are developed based on machine learning techniques. Since datasets which used in intrusion detection are imbalanced, in the previous methods, the accuracy of detecting two attack classes, R2L and U2R, is lower than that of the normal and other attack classes. In order to overcome this issue, this study employs a hybrid approach. This hybrid approach is a combination of synthetic minority oversampling technique (SMOTE) and cluster center and nearest neighbor (CANN). Important features are selected using leave one out method (LOO). Moreover, this study employs NSL KDD dataset. Results indicate that the proposed method improves the accuracy of detecting U2R and R2L attacks in comparison to the baseline paper by 94% and 50%, respectively. Keywords—intrusion detection system; feature selection; imbalanced dataset; SMOTE; NSL KDD

Fog Computing architecture to enable consumer centric Internet of Things services <=SEP=> Fog Computing is a recent computing paradigm that is extending cloud computing towards the edge of network. Due to its proximity to end-users, dense geographical distribution, open platform and support for high mobility, Fog Computing platforms can provide services with reduced latency and improved QoS. Thus it is becoming an important enabler for consumer centric Internet of Things based applications and services that require real time operations e.g. connected vehicles, smart road intersection management and smart grid. The paper discusses one such architecture for connected vehicles with Road Side Units (RSUs) and M2M gateways including the Fog Computing Platform. M2M data processing with semantics, discovery and management of connected vehicles are briefly discussed as consumer centric IoT services enabled by the distinct characteristics of Fog Computing.

Karma: A System for Mapping Structured Sources into the Semantic Web <=SEP=> The Linked Data cloud contains large amounts of RDF data generated from databases. Much of this RDF data, generated using tools such as D2R, is expressed in terms of vocabularies automatically derived from the schema of the original database. The generated RDF would be significantly more useful if it were expressed in terms of commonly used vocabularies. Using today’s tools, it is labor-intensive to do this. For example, one can first use D2R to automatically generate RDF from a database and then use R2R to translate the automatically generated RDF into RDF expressed in a new vocabulary. The problem is that defining the R2R mappings is difficult and labor intensive because one needs to write the mapping rules in terms of SPARQL graph patterns. In this work, we present a semi-automatic approach for building mappings that translate data in structured sources to RDF expressed in terms of a vocabulary of the user’s choice. Our system, Karma, automatically derives these mappings, and provides an easy to use interface that enables users to control the automated process to guide the system to produce the desired mappings. In our evaluation, users need to interact with the system less than once per column (on average) in order to construct the desired mapping rules. The system then uses these mapping rules to generate semantically rich RDF for the data sources. We demonstrate Karma using a bioinformatics example and contrast it with other approaches used in that community. Bio2RDF [7] and Semantic MediaWiki Linked Data Extension (SMW-LDE) [2] are examples of efforts that integrate bioinformatics datasets by mapping them to a common vocabulary. We applied our approach to a scenario used in the SMW-LDE that integrate ABA, Uniprot, KEGG Pathway, PharmGKB and Linking Open Drug Data datasets using a

Path-tracking for autonomous vehicles at the limit of friction <=SEP=> The ability to use all of the available tire force is essential to road vehicles for emergency maneuvers and racing. As the front tires of an understeering vehicle saturate while cornering at the limit of tire-road friction, steering is lost as a control input for path-tracking. Experimental data from an autonomous vehicle show that for path-tracking at the limit of friction through steering the value of friction needs to be known to within approximately 2%. This requirement exceeds the capabilities of existing real-time friction estimation algorithms. Data collected with a professional race car driver inspire a novel control framework, with a slip angle-based control strategy of maintaining the front tires at the slip angle for which maximum tire force is attained, and longitudinal speed control for path-tracking. This approach has significantly less demanding requirements on the accuracy of friction estimation. A controller is presented to explore this concept, and experimental results demonstrate successful tracking of a circular path at the friction limit without a priori friction information.

BEYOND STUDENT PERCEPTIONS: ISSUES OF INTERACTION, PRESENCE, AND PERFORMANCE IN AN ONLINE COURSE <=SEP=> The research literature on Web-based learning supports the assumption that interaction is important for a successful course, yet questions exist regarding the nature and extent of the interaction and its effects on student performance. Much of the research is based on student perceptions of the quality and quantity of their interactions and how much they have learned in an online course. The purpose of this study is to examine performance in an online course in relationship to student interaction and sense of presence in the course. Data on multiple independent (measures of interaction and presence) and dependent (measures of performance) variables were collected and subjected to analysis. An attempt was made to go beyond typical institutional performance measures such as grades and withdrawal rates and to examine measures specifically related to course objectives.

Grey Wolf Optimizer <=SEP=> This work proposes a new meta-heuristic called Grey Wolf Optimizer (GWO) inspired by grey wolves (Canis lupus). The GWO algorithm mimics the leadership hierarchy and hunting mechanism of grey wolves in nature. Four types of grey wolves such as alpha, beta, delta, and omega are employed for simulating the leadership hierarchy. In addition, the three main steps of hunting, searching for prey, encircling prey, and attacking prey, are implemented. The algorithm is then benchmarked on 29 well-known test functions, and the results are verified by a comparative study with Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Differential Evolution (DE), Evolutionary Programming (EP), and Evolution Strategy (ES). The results show that the GWO algorithm is able to provide very competitive results compared to these wellknown meta-heuristics. The paper also considers solving three classical engineering design problems (tension/compression spring, welded beam, and pressure vessel designs) and presents a real application of the proposed method in the field of optical engineering. The results of the classical engineering design problems and real application prove that the proposed algorithm is applicable to challenging problems with unknown search spaces.

Object detection in VHR optical remote sensing images via learning rotation-invariant HOG feature <=SEP=> Object detection in very high resolution (VHR) optical remote sensing images is one of the most fundamental but challenging problems in the field of remote sensing image analysis. As object detection is usually carried out in feature space, effective feature representation is very important to construct a high-performance object detection system. During the last decades, a great deal of effort has been made to develop various feature representations for the detection of different types of objects. Among various features developed for visual object detection, the histogram of oriented gradients (HOG) feature is maybe one of the most popular features that has been successfully applied to computer vision community. However, although the HOG feature has achieved great success in nature scene images, it is problematic to directly use it for object detection in optical remote sensing images because it is difficult to effectively handle the problem of object rotation variations. To explore a possible solution to the problem, this paper proposes a novel method to learn rotation-invariant HOG (RIHOG) features for object detection in optical remote sensing images. This is achieved by learning a rotation-invariant transformation model via optimizing a new objective function, which constrains the training samples before and after rotation to share the similar features to achieve rotation-invariance. In the experiments, we evaluate the proposed method on a publicly available 10-class VHR geospatial object detection dataset and comprehensive comparisons with state-of-the-arts demonstrate the effectiveness the proposed method.

An intelligent decision support system for skin cancer detection from dermoscopic images <=SEP=> It is challenging to develop an intelligent agent-based or robotic system to conduct long-term automatic health monitoring and robust efficient disease diagnosis as autonomous e-Carers in real-world applications. In this research, we aim to deal with such challenges by presenting an intelligent decision support system for skin lesion recognition as the initial step, which could be embedded into an intelligent service robot for health monitoring in home environments to promote early diagnosis. The system is developed to identify benign and malignant skin lesions using multiple steps, including pre-processing such as noise removal, segmentation, feature extraction from lesion regions, feature selection and classification. After extracting thousands of raw shape, colour and texture features from the lesion areas, a Genetic Algorithm (GA) is used to identify the most discriminating significant feature subsets for healthy and cancerous cases. A Support Vector Machine classifier has been employed to perform benign and malignant lesion recognition. Evaluated with 1300 images from the Dermofit dermoscopy image database, the empirical results indicate that our approach achieves superior performance in comparison to other related research reported in the literature.

Missing Modalities Imputation via Cascaded Residual Autoencoder <=SEP=> Affordable sensors lead to an increasing interest in acquiring and modeling data with multiple modalities. Learning from multiple modalities has shown to significantly improve performance in object recognition. However, in practice it is common that the sensing equipment experiences unforeseeable malfunction or configuration issues, leading to corrupted data with missing modalities. Most existing multi-modal learning algorithms could not handle missing modalities, and would discard either all modalities with missing values or all corrupted data. To leverage the valuable information in the corrupted data, we propose to impute the missing data by leveraging the relatedness among different modalities. Specifically, we propose a novel Cascaded Residual Autoencoder (CRA) to impute missing modalities. By stacking residual autoencoders, CRA grows iteratively to model the residual between the current prediction and original data. Extensive experiments demonstrate the superior performance of CRA on both the data imputation and the object recognition task on imputed data.

Multivalued logics: a uniform approach to reasoning in artificial intelligence <=SEP=> This paper describes a uniform formalization of much of the current work in artificial intelligence on inference systems. We show that many of these systems, including first-order theorem provers, assumption-based truth maintenance systems (ATMSS), and unimplemented formal systems such as default logic or circumscription, can be subsumed under a single general framework. We begin by defining this framework, which is based on a mathematical structure known as a bilattice. We present a formal definition of inference using this structure and show that this definition generalizes work involving ATMSS and some simple nonmonotonic logics. Following the theoretical description, we describe a constructive approach to inference in this setting; the resulting generalization of both conventional inference and ATMSS is achieved without incurring any substantial computational overhead. We show that our approach can also be used to implement a default reasoner, and discuss a combination of default and ATMS methods that enables us to formally describe an “incremental” default reasoning system. This incremental system does not need to perform consistency checks before drawing tentative conclusions, but can instead adjust its beliefs when a default premise or conclusion is overturned in the face of convincing contradictory evidence. The system is therefore much more computationally viable than earlier approaches. Finally, we discuss the implementation of our ideas. We begin by considering general issues that need to be addressed when implementing a multivalued approach such as that we are proposing, and then turn to specific examples showing the results of an existing implementation. This single implementation is used to solve a digital simulation task using first-order logic, a diagnostic task using ATMSS as suggested by de Kleer and Williams, a problem in default reasoning as in Reiter’s default logic or McCarthy’s circumscription, and to solve the same problem more efficiently by combining default methods with justification information. All of these applications use the same general-purpose bilattice theorem prover and differ only in the choice of bilattice being considered.

Convergence of Stochastic Gradient Descent for PCA <=SEP=> We consider the problem of principal component analysis (PC A) in a streaming stochastic setting, where our goal is to find a direction of approximate maximal va riance, based on a stream of i.i.d. data points inR. A simple and computationally cheap algorithm for this is st ochastic gradient descent (SGD), which incrementally updates its estimate based on ea ch new data point. However, due to the non-convex nature of the problem, analyzing its performanc e has been a challenge. In particular, existing guarantees rely on a non-trivial eigengap assumption on the covariance matrix, which is intuitively unnecessary. In this paper, we provide (to the best of our kno wledge) the first eigengap-free convergence guarantees for SGD in the context of PCA. This also part ially resolves an open problem posed in [10]. Moreover, under an eigengap assumption, we show tha t the same techniques lead to new SGD convergence guarantees with better dependence on the eigen gap.

Feeling cybervictims' pain-The effect of empathy training on cyberbullying. <=SEP=> As the world's population increasingly relies on the use of modern technology, cyberbullying becomes an omnipresent risk for children and adolescents and demands counteraction to prevent negative (online) experiences. The classroom-based German preventive intervention "Medienhelden" (engl.: "Media Heroes") builds on previous knowledge about links between cognitive empathy, affective empathy, and cyberbullying, among others. For an evaluation study, longitudinal data were available from 722 high school students aged 11-17 years (M = 13.36, SD = 1.00, 51.8% female) before and six months after the implementation of the program. A 10-week version and a 1-day version were conducted and compared with a control group (controlled pre-long-term-follow-up study). Schools were asked to randomly assign their participating classes to the intervention conditions. Multi-group structural equation modeling (SEM) showed a significant effect of the short intervention on cognitive empathy and significant effects of the long intervention on affective empathy and cyberbullying reduction. The results suggest the long-term intervention to be more effective in reducing cyberbullying and promoting affective empathy. Without any intervention, cyberbullying increased and affective empathy decreased across the study period. Empathy change was not generally directly linked to change in cyberbullying behavior. "Media Heroes" provides effective teaching materials and empowers schools to address the important topic of cyberbullying in classroom settings without costly support from the outside.

Item recommending by item co-purchasing network and user preference <=SEP=> A novel recommendation approach based on multiple-objectives optimization is introduced. It utilizes histories of item co-purchases as represented by directed graphs and histories of user preferences for items as represented by user-item rating matrices to create models of user behavior. Herein, multiple objectives for item recommendations are considering to maximize the ratings and rankings of each item as derived from user preferences and co-purchasing networks of items, respectively. Finally, optimal items, called Pareto optimal solutions, will be recommended.

Text Classification using the Concept of Association Rule of Data Mining <=SEP=> As the amount of online text increases, the demand for text classification to aid the analysis and management of text is increasing. Text is cheap, but information, in the form of knowing what classes a text belongs to, is expensive. Automatic classification of text can provide this information at low cost, but the classifiers themselves must be built with expensive human effort, or trained from texts which have themselves been manually classified. In this paper we will discuss a procedure of classifying text using the concept of association rule of data mining. Association rule mining technique has been used to derive feature set from pre-classified text documents. Naïve Bayes classifier is then used on derived features for final classification.