Query: Facial action unit recognition with sparse representation

Relevant passages:
A framework for automated measurement of the intensity of non-posed Facial Action Units <=SEP=> This paper presents a framework to automatically measure the intensity of naturally occurring facial actions. Naturalistic expressions are non-posed spontaneous actions. The facial action coding system (FACS) is the gold standard technique for describing facial expressions, which are parsed as comprehensive, nonoverlapping action units (Aus). AUs have intensities ranging from absent to maximal on a six-point metric (i.e., 0 to 5). Despite the efforts in recognizing the presence of non-posed action units, measuring their intensity has not been studied comprehensively. In this paper, we develop a framework to measure the intensity of AU12 (lip corner puller) and AU6 (cheek raising) in videos captured from infant-mother live face-to-face communications. The AU12 and AU6 are the most challenging case of infant's expressions (e.g., low facial texture in infant's face). One of the problems in facial image analysis is the large dimensionality of the visual data. Our approach for solving this problem is to utilize the spectral regression technique to project high dimensionality facial images into a low dimensionality space. Represented facial images in the low dimensional space are utilized to train support vector machine classifiers to predict the intensity of action units. Analysis of 18 minutes of captured video of non-posed facial expressions of several infants and mothers shows significant agreement between a human FACS coder and our approach, which makes it an efficient approach for automated measurement of the intensity of non-posed facial action units.

Facial Expression Analysis <=SEP=> The face is one of the most powerful channels of nonverbal communication. Facial expression provides cues about emotion, intention, alertness, pain, personality, regulates interpersonal behavior, and communicates psychiatric and biomedical status among other functions. Within the past 15 years, there has been increasing interest in automated facial expression analysis within the computer vision and machine learning communities. This chapter reviews fundamental approaches to facial measurement by behavioral scientists and current efforts in automated facial expression recognition. We consider challenges, review databases available to the research community, approaches to feature detection, tracking, and representation, and both supervised and unsupervised learning. keywords : Facial expression analysis, Action unit recognition, Active Appearance Models, temporal clustering.

A Wavelet Tour of Signal Processing, 2nd Edition <=SEP=> Bargaining with reading habit is no need. Reading is not kind of something sold that you can take or not. It is a thing that will change your life to life better. It is the thing that will give you many things around the world and this universe, in the real world and here after. As what will be given by this a wavelet tour of signal processing 2nd edition, how can you bargain with the thing that has many benefits for you?

A real-time face tracker <=SEP=> We present a real-time face tracker in this paper The system has achieved a rate of 30% frameshecond using an HP-9000 workstation with a framegrabber and a Canon VC-CI camera. It can track a person 'sface while the person moves freely (e.g., walks, jumps, sits down and stands up) in a room. Three types of models have been employed in developing the system. First, we present a stochastic model to characterize skin-color distributions of human faces. The information provided by the model is sufJicient for tracking a human face in various poses and views. This model is adaptable to different people and different lighting conditions in real-time. Second, a motion model e's used to estimate image motion and to predict search window. Third, a camera model is used toprediet and to compensate for camera motion. The system can be applied to tele-conferencing and many HCI applications including lip-reading and gaze tracking. The principle in developing this system can be extended to other tracking problems such as tracking the human hand.

Detecting Faces in Images: A Survey <=SEP=> Images containing faces are essential to intelligent vision-based human computer interaction, and research efforts in face processing include face recognition, face tracking, pose estimation, and expression recognition. However, many reported methods assume that the faces in an image or an image sequence have been identified and localized. To build fully automated systems that analyze the information contained in face images, robust and efficient face detection algorithms are required. Given a single image, the goal of face detection is to identify all image regions which contain a face regardless of its three-dimensional position, orientation, and lighting conditions. Such a problem is challenging because faces are nonrigid and have a high degree of variability in size, shape, color, and texture. Numerous techniques have been developed to detect faces in a single image, and the purpose of this paper is to categorize and evaluate these algorithms. We also discuss relevant issues such as data collection, evaluation metrics, and benchmarking. After analyzing these algorithms and identifying their limitations, we conclude with several promising directions for

Switched Reluctance Motor Drive With External Rotor for Fan in Air Conditioner <=SEP=> This paper describes the developed three-phase 6/8 poles switched reluctance external rotor motor drive for a fan in air conditioner. The external rotor core structure and the internal stator core structure, the three-phase windings arrangement, the slotted claw, and the setting structure of the photoelectric transducers on the rotor position detector are illustrated. The electromagnetic field calculation results are given. The three-phase asymmetric bridge power converter was used in the drive system. The block diagram of the switched reluctance external rotor motor drive with closed-loop rotor speed control is given. The closed-loop rotor speed control is implemented using a fuzzy logic algorithm. The experimental tests of the developed prototype are made for driving the fan from 200 to 950 r/min. The comparison results of the two systems show that the input power and input phase current RMS value are lower in the developed three-phase 6/8 poles external rotor switched reluctance motor drive prototype with the fan than those in the induction motor variable-frequency variable-speed drive with the fan.

Reflective and Refractive Objects for Mixed Reality <=SEP=> In this paper, we present a novel rendering method which integrates reflective or refractive objects into a differential instant radiosity (DIR) framework usable for mixed-reality (MR) applications. This kind of objects are very special from the light interaction point of view, as they reflect and refract incident rays. Therefore they may cause high-frequency lighting effects known as caustics. Using instant-radiosity (IR) methods to approximate these high-frequency lighting effects would require a large amount of virtual point lights (VPLs) and is therefore not desirable due to real-time constraints. Instead, our approach combines differential instant radiosity with three other methods. One method handles more accurate reflections compared to simple cubemaps by using impostors. Another method is able to calculate two refractions in real-time, and the third method uses small quads to create caustic effects. Our proposed method replaces parts in light paths that belong to reflective or refractive objects using these three methods and thus tightly integrates into DIR. In contrast to previous methods which introduce reflective or refractive objects into MR scenarios, our method produces caustics that also emit additional indirect light. The method runs at real-time frame rates, and the results show that reflective and refractive objects with caustics improve the overall impression for MR scenarios.

GENETAG: a tagged corpus for gene/protein named entity recognition <=SEP=> Named entity recognition (NER) is an important first step for text mining the biomedical literature. Evaluating the performance of biomedical NER systems is impossible without a standardized test corpus. The annotation of such a corpus for gene/protein name NER is a difficult process due to the complexity of gene/protein names. We describe the construction and annotation of GENETAG, a corpus of 20K MEDLINE® sentences for gene/protein NER. 15K GENETAG sentences were used for the BioCreAtIvE Task 1A Competition. To ensure heterogeneity of the corpus, MEDLINE sentences were first scored for term similarity to documents with known gene names, and 10K high- and 10K low-scoring sentences were chosen at random. The original 20K sentences were run through a gene/protein name tagger, and the results were modified manually to reflect a wide definition of gene/protein names subject to a specificity constraint, a rule that required the tagged entities to refer to specific entities. Each sentence in GENETAG was annotated with acceptable alternatives to the gene/protein names it contained, allowing for partial matching with semantic constraints. Semantic constraints are rules requiring the tagged entity to contain its true meaning in the sentence context. Application of these constraints results in a more meaningful measure of the performance of an NER system than unrestricted partial matching. The annotation of GENETAG required intricate manual judgments by annotators which hindered tagging consistency. The data were pre-segmented into words, to provide indices supporting comparison of system responses to the "gold standard". However, character-based indices would have been more robust than word-based indices. GENETAG Train, Test and Round1 data and ancillary programs are freely available at ftp://ftp.ncbi.nlm.nih.gov/pub/tanabe/GENETAG.tar.gz . A newer version of GENETAG-05, will be released later this year.

Application of spiking neural networks and the bees algorithm to control chart pattern recognition <=SEP=> Statistical process control (SPC) is a method for improving the quality o f products. Control charting plays a most important role in SPC. SPC control charts arc used for monitoring and detecting unnatural process behaviour. Unnatural patterns in control charts indicate unnatural causes for variations. Control chart pattern recognition is therefore important in SPC. Past research shows that although certain types o f charts, such as the CUSUM chart, might have powerful detection ability, they lack robustness and do not function automatically. In recent years, neural network techniques have been applied to automatic pattern recognition. Spiking Neural Networks (SNNs) belong to the third generation o f artificial neural networks, with spiking neurons as processing elements. In SNNs, time is an important feature for information representation and processing. This thesis proposes the application o f SNN techniques to control chart pattern recognition. It is designed to present an analysis o f the existing learning algorithms o f SNN for pattern recognition and to explain how and why spiking neurons have more computational power in comparison to the previous generation o f neural networks. This thesis focuses on the architecture and the learning procedure o f the network. Four new learning algorithms are presented with their specific architecture: Spiking Learning Vector Quantisation (S-LVQ), Enhanced-Spiking Learning Vector Quantisation (NS-LVQ), S-LVQ with Bees and NS-LVQ with Bees. The latter two algorithms employ a new intelligent swarm-based optimisation called the Bees Algorithm to optimise the LVQ pattern recognition networks. Overall, the aim o f the research is to develop a simple architecture for the proposed network as well as to develop a network that is efficient for application to control chart pattern recognition. Experiments show that the proposed architecture and the learning procedure give high pattern recognition accuracies.

Robust Driving Path Detection in Urban and Highway Scenarios Using a Laser Scanner and Online Occupancy Grids <=SEP=> Many driver assistant and safety systems depend on an accurate environmental model containing the positions of stationary objects, the states of dynamic objects and information about valid driving corridors. Therefore, a robust differentiation between moving and stationary objects is required. This is challenging for laser scanners, because these sensors are not able to measure the velocity of objects directly. Therefore, an advanced occupancy grid approach, the online map, is introduced, which enables the robust separation of moving and stationary objects. The online map is used for the robust detection of the road boundaries for the determination of driving corridors in urban and highway scenarios. An algorithm for the detection of arbitrary moving objects using the online map is proposed.

Aromatherapy positively affects mood, EEG patterns of alertness and math computations. <=SEP=> EEG activity, alertness, and mood were assessed in 40 adults given 3 minutes of aromatherapy using two aromas, lavender (considered a relaxing odor) or rosemary (considered a stimulating odor). Participants were also given simple math computations before and after the therapy. The lavender group showed increased beta power, suggesting increased drowsiness, they had less depressed mood (POMS) and reported feeling more relaxed and performed the math computations faster and more accurately following aromatherapy. The rosemary group, on the other hand, showed decreased frontal alpha and beta power, suggesting increased alertness. They also had lower state anxiety scores, reported feeling more relaxed and alert and they were only faster, not more accurate, at completing the math computations after the aromatherapy session.

On-Line Economic Optimization of Energy Systems Using Weather Forecast Information <=SEP=> We establish an on-line optimization framework to exploit weather forecast information in the operation of energy systems. We argue that anticipating the weather conditions can lead to more proactive and cost-effective operations. The framework is based on the solution of a stochastic dynamic real-time optimization (D-RTO) problem incorporating forecasts generated from a state-of-the-art weather prediction model. The necessary uncertainty information is extracted from the weather model using an ensemble approach. The accuracy of the forecast trends and uncertainty bounds are validated using real meteorological data. We present a numerical simulation study in a building system to demonstrate the developments.

An Ultra-Wide-Band 0.4–10-GHz LNA in 0.18-$\mu$m CMOS <=SEP=> A two-stage ultra-wide-band CMOS low-noise amplifier (LNA) is presented. With the common-gate configuration employed as the input stage, the broad-band input matching is obtained and the noise does not rise rapidly at higher frequency. By combining the common-gate and common-source stages, the broad-band characteristic and small area are achieved by using two inductors. This LNA has been fabricated in a 0.18-mum CMOS process. The measured power gain is 11.2-12.4 dB and noise figure is 4.4-6.5 dB with -3-dB bandwidth of 0.4-10 GHz. The measured IIP3 is -6 dBm at 6 GHz. It consumes 12 mW from a 1.8-V supply voltage and occupies only 0.42 mm2

Analyzing the State of Static Analysis: A Large-Scale Evaluation in Open Source Software <=SEP=> The use of automatic static analysis has been a software engineering best practice for decades. However, we still do not know a lot about its use in real-world software projects: How prevalent is the use of Automated Static Analysis Tools (ASATs) such as FindBugs and JSHint? How do developers use these tools, and how does their use evolve over time? We research these questions in two studies on nine different ASATs for Java, JavaScript, Ruby, and Python with a population of 122 and 168,214 open-source projects. To compare warnings across the ASATs, we introduce the General Defect Classification (GDC) and provide a grounded-theory-derived mapping of 1,825 ASAT-specific warnings to 16 top-level GDC classes. Our results show that ASAT use is widespread, but not ubiquitous, and that projects typically do not enforce a strict policy on ASAT use. Most ASAT configurations deviate slightly from the default, but hardly any introduce new custom analyses. Only a very small set of default ASAT analyses is widely changed. Finally, most ASAT configurations, once introduced, never change. If they do, the changes are small and have a tendency to occur within one day of the configuration's initial introduction.

Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula <=SEP=> Factorizing low-rank matrices has many applications in machine learning and statistics. For probabilistic models in the Bayes optimal setting, a general expression for the mutual information has been proposed using heuristic statistical physics computations, and proven in few specific cases. Here, we show how to rigorously prove the conjectured formula for the symmetric rank-one case. This allows to express the minimal mean-square-error and to characterize the detectability phase transitions in a large set of estimation problems ranging from community detection to sparse PCA. We also show that for a large set of parameters, an iterative algorithm called approximate message-passing is Bayes optimal. There exists, however, a gap between what currently known polynomial algorithms can do and what is expected information theoretically. Additionally, the proof technique has an interest of its own and exploits three essential ingredients: the interpolation method introduced in statistical physics by Guerra, the analysis of the approximate message-passing algorithm and the theory of spatial coupling and threshold saturation in coding. Our approach is generic and applicable to other open problems in statistical estimation where heuristic statistical physics predictions are available. Consider the following probabilistic rank-one matrix estimation problem: one has access to noisy observations w=(wij)i,j=1 of the pair-wise product of the components of a vector s=(s1, . . . , sn)∈R with i.i.d components distributed as Si∼P0, i=1, . . . , n. The entries of w are observed through a noisy element-wise (possibly non-linear) output probabilistic channel Pout(wij |sisj/ √ n). The goal is to estimate the vector s from w assuming that both P0 and Pout are known and independent of n (noise is symmetric so that wij =wji). Many important problems in statistics and machine learning can be expressed in this way, such as sparse PCA [Zou et al. (2006)], the Wigner spike model [Johnstone and Lu (2012); Deshpande and Montanari (2014)], community detection [Deshpande et al. (2015)] or matrix completion [Candès and Recht (2009)]. Proving a result initially derived by a heuristic method from statistical physics, we give an explicit expression for the mutual information and the information theoretic minimal mean-square-error (MMSE) in the asymptotic n→+∞ limit. Our results imply that for 1 ar X iv :1 60 6. 04 14 2v 1 [ cs .I T ] 1 3 Ju n 20 16 a large region of parameters, the posterior marginal expectations of the underlying signal components (often assumed intractable to compute) can be obtained in the leading order in n using a polynomial-time algorithm called approximate message-passing (AMP) [Rangan and Fletcher (2012); Deshpande and Montanari (2014); Deshpande et al. (2015); Lesieur et al. (2015b)]. We also demonstrate the existence of a region where both AMP and spectral methods [Baik et al. (2005)] fail to provide a good answer to the estimation problem, while it is nevertheless information theoretically possible to do so. We illustrate our theorems with examples and also briefly discuss the implications in terms of computational complexity. 1. Setting and main results 1.1 The additive white Gaussian noise setting A standard and natural setting is the case of additive white Gaussian noise (AWGN) of known variance ∆, wij = sisj √ n + zij √ ∆, (1) where z=(zij)i,j=1 is a symmetric matrix with i.i.d entries Zij∼N (0, 1), 1≤ i≤j≤n. Perhaps surprisingly, it turns out that this Gaussian setting is sufficient to completely characterize all the problems discussed in the introduction, even if these have more complicated output channels. This is made possible by a theorem of channel universality [Krzakala et al. (2016)] (already proven for community detection in [Deshpande et al. (2015)] and conjectured in [Lesieur et al. (2015a)]). This theorem states that given an output channel Pout(w|y), such that logPout(w|y = 0) is three times differentiable with bounded second and third derivatives, then the mutual information satisfies I(S;W)=I(S;SST/ √ n+Z √ ∆)+O( √ n), where ∆ is the inverse Fisher information (evaluated at y = 0) of the output channel: ∆−1 := EPout(w|0)[(∂y logPout(W |y)|y=0)]. Informally, this means that we only have to compute the mutual information for an AWGN channel to take care of a wide range of problems, which can be expressed in terms of their Fisher information. In this paper we derive rigorously, for a large class of signal distributions P0, an explicit one-letter formula for the mutual information per variable I(S;W)/n in the asymptotic limit n→+∞.

Passing a Hide-and-Seek Third-Person Turing Test <=SEP=> Hiding and seeking are cognitive abilities frequently demonstrated by humans in both real life and video games. To determine to which extent these abilities can be replicated with AI, we introduce a specialized version of the Turing test for hiding and seeking. We then develop a computer agent that passes the test by appearing indistinguishable from human behavior to a panel of human judges. We analyze the AI techniques that enable the agent to imitate human hide-and-seek behavior and their relative contribution to the agent's performance.

Altered salience network connectivity predicts macronutrient intake after sleep deprivation <=SEP=> Although insufficient sleep is a well-recognized risk factor for overeating and weight gain, the neural mechanisms underlying increased caloric (particularly fat) intake after sleep deprivation remain unclear. Here we used resting-state functional magnetic resonance imaging and examined brain connectivity changes associated with macronutrient intake after one night of total sleep deprivation (TSD). Compared to the day following baseline sleep, healthy adults consumed a greater percentage of calories from fat and a lower percentage of calories from carbohydrates during the day following TSD. Subjects also exhibited increased brain connectivity in the salience network from the dorsal anterior cingulate cortex (dACC) to bilateral putamen and bilateral anterior insula (aINS) after TSD. Moreover, dACC-putamen and dACC-aINS connectivity correlated with increased fat and decreased carbohydrate intake during the day following TSD, but not during the day following baseline sleep. These findings provide a potential neural mechanism by which sleep loss leads to increased fat intake.

3D People Tracking with Gaussian Process Dynamical Models <=SEP=> We advocate the use of Gaussian Process Dynamical Models (GPDMs) for learning human pose and motion priors for 3D people tracking. A GPDM provides a lowdimensional embedding of human motion data, with a density function that gives higher probability to poses and motions close to the training data. With Bayesian model averaging a GPDM can be learned from relatively small amounts of data, and it generalizes gracefully to motions outside the training set. Here we modify the GPDM to permit learning from motions with significant stylistic variation. The resulting priors are effective for tracking a range of human walking styles, despite weak and noisy image measurements and significant occlusions.

Sentence Selection and Weighting for Neural Machine Translation Domain Adaptation <=SEP=> Neural machine translation NMT has been prominent in many machine translation tasks. However, in some domain-specific tasks, only the corpora from similar domains can improve translation performance. If out-of-domain corpora are directly added into the in-domain corpus, the translation performance may even degrade. Therefore, domain adaptation techniques are essential to solve the NMT domain problem. Most existing methods for domain adaptation are designed for the conventional phrase-based machine translation. For NMT domain adaptation, there have been only a few studies on topics such as fine tuning, domain tags, and domain features. In this paper, we have four goals for sentence level NMT domain adaptation. First, the NMT's internal sentence embedding is exploited and the sentence embedding similarity is used to select out-of-domain sentences that are close to the in-domain corpus. Second, we propose three sentence weighting methods, i.e., sentence weighting, domain weighting, and batch weighting, to balance the data distribution during NMT training. Third, in addition, we propose dynamic training methods to adjust the sentence selection and weighting during NMT training. Fourth, to solve the multidomain problem in a real-world NMT scenario where the domain distributions of training and testing data often mismatch, we proposed a multidomain sentence weighting method to balance the domain distributions of training data and match the domain distributions of training and testing data. The proposed methods are evaluated in international workshop on spoken language translation IWSLT English-to-French/German tasks and a multidomain English-to-French task. Empirical results show that the sentence selection and weighting methods can significantly improve the NMT performance, outperforming the existing baselines.

Amortized Efficiency of List Update and Paging Rules <=SEP=> In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes &thgr;(i) time, we show that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, do not share this property. We generalize our results to show that move-to-front is within a constant factor of optimum as long as the access cost is a convex function. We also study paging, a setting in which the access cost is not convex. The paging rule corresponding to move-to-front is the “least recently used” (LRU) replacement rule. We analyze the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule (Belady's MIN algorithm) by a factor that depends on the size of fast memory. No on-line paging algorithm has better amortized performance.

Learning Multi-agent Communication under Limited-bandwidth Restriction for Internet Packet Routing <=SEP=> Communication is an important factor for the big multi-agent world to stay organized and productive. Recently, the AI community has applied the Deep Reinforcement Learning (DRL) to learn the communication strategy and the control policy for multiple agents. However, when implementing the communication for real-world multi-agent applications, there is a more practical limited-bandwidth restriction, which has been largely ignored by the existing DRL-based methods. Specifically, agents trained by most previous methods keep sending messages incessantly in every control cycle; due to emitting too many messages, these methods are unsuitable to be applied to the real-world systems that have a limited bandwidth to transmit the messages. To handle this problem, we propose a gating mechanism to adaptively prune unprofitable messages. Results show that the gating mechanism can prune more than 80% messages with little damage to the performance. Moreover, our method outperforms several state-of-the-art DRL-based and rule-based methods by a large margin in both the real-world packet routing tasks and four benchmark tasks.

Assessing the Potential of Classical Q-learning in General Game Playing <=SEP=> After the recent groundbreaking results of AlphaGo and AlphaZero, we have seen strong interests in deep reinforcement learning and artificial general intelligence (AGI) in game playing. However, deep learning is resource-intensive and the theory is not yet well developed. For small games, simple classical table-based Q-learning might still be the algorithm of choice. General Game Playing (GGP) provides a good testbed for reinforcement learning to research AGI. Q-learning is one of the canonical reinforcement learning methods, and has been used by (Banerjee & Stone, IJCAI 2007) in GGP. In this paper we implement Q-learning in GGP for three small-board games (Tic-Tac-Toe, Connect Four, Hex), to allow comparison to Banerjee et al.. We find that Q-learning converges to a high win rate in GGP. For the -greedy strategy, we propose a first enhancement, the dynamic algorithm. In addition, inspired by (Gelly & Silver, ICML 2007) we combine online search (Monte Carlo Search) to enhance offline learning, and propose QM-learning for GGP. Both enhancements improve the performance of classical Q-learning. In this work, GGP allows us to show, if augmented by appropriate enhancements, that classical table-based Q-learning can perform well in small games.

Developmental deficits in social perception in autism: the role of the amygdala and fusiform face area <=SEP=> Autism is a severe developmental disorder marked by a triad of deficits, including impairments in reciprocal social interaction, delays in early language and communication, and the presence of restrictive, repetitive and stereotyped behaviors. In this review, it is argued that the search for the neurobiological bases of the autism spectrum disorders should focus on the social deficits, as they alone are specific to autism and they are likely to be most informative with respect to modeling the pathophysiology of the disorder. Many recent studies have documented the difficulties persons with an autism spectrum disorder have accurately perceiving facial identity and facial expressions. This behavioral literature on face perception abnormalities in autism is reviewed and integrated with the functional magnetic resonance imaging (fMRI) literature in this area, and a heuristic model of the pathophysiology of autism is presented. This model posits an early developmental failure in autism involving the amygdala, with a cascading influence on the development of cortical areas that mediate social perception in the visual domain, specifically the fusiform "face area" of the ventral temporal lobe. Moreover, there are now some provocative data to suggest that visual perceptual areas of the ventral temporal pathway are also involved in important ways in representations of the semantic attributes of people, social knowledge and social cognition. Social perception and social cognition are postulated as normally linked during development such that growth in social perceptual skills during childhood provides important scaffolding for social skill development. It is argued that the development of face perception and social cognitive skills are supported by the amygdala-fusiform system, and that deficits in this network are instrumental in causing autism.

A new adaptive frequency oscillator for gait assistance <=SEP=> To control exoskeletons for walking gait assistance, it is of primary importance to control them to act synchronously with the gaits of users. To effectively estimate the gait cycle (or the phase within a stride) of users, we propose a new adaptive frequency oscillator (AFO). While previous AFOs successfully estimated the walking frequency from joint angles as inputs, the new AFO, called particularly-shaped adaptive oscillator (PSAO) can estimate gait cycle from the same inputs, which would have required foot contact sensors in previous approaches. To predict the effects of PSAO-based gait assistance on human walking, it has been tested with neuromuscular walking simulation. In the simulation, the gait assistance system reduced the metabolic cost of walking for some assistance patterns. The walk ratio (step length per step rate) also changed as assistance patterns shifted in phase, which is meaningful because metabolic cost of walking in general is minimal at specific walk ratio. For a prototype exoskeleton we developed, the effect of gait assistance was experimented on a human subject walking on level ground and inclining slopes to verify the predictions from the simulation: (1) physiological cost index computed from heart rate significantly decreased indicating reduction in metabolic energy expenditure; (2) walk ratio was in fact controllable to an extent.

Education 4.0 for tall thin engineer in a data driven society <=SEP=> The rise of digital technology creates disruptive innovation, new opportunities in communication, it transforms industrial production and it changes the way we work, learn and live. That leads to the fourth Industrial Revolution, which changes the working world enormously. New skills, future-ready curricula, new learning and training concepts as well as the flexibility in education are necessary. To deliver that, it needs a fourth revolution in the educational system with a strong active presence and most important Artificial Intelligence (AI) driven features for better performance. Education 4.0 needs also a strong partnership between industry and academicals environment in the formation of human resources for Industry 4.0. We present in this paper our answers of education regarding the challenges of fourth revolution in Industry and the seven AI driven didactic methods identified for the University of Future.

Fusion of Keypoint Tracking and Facial Landmark Detection for Real-Time Head Pose Estimation <=SEP=> In this paper, we address the problem of extreme head pose estimation from intensity images, in a monocular setup. We introduce a novel fusion pipeline to integrate into a dedicated Kalman Filter the pose estimated from a tracking scheme in the prediction stage and the pose estimated from a detection scheme in the correction stage. To that end, the measurement covariance of the Kalman Filter is updated in every frame. The tracking scheme is performed using a set of keypoints extracted in the area of the head along with a simple 3D geometric model. The detection scheme, on the other hand, relies on the alignment of facial landmarks in each frame combined with 3D features extracted on a head mesh. The head pose in each scheme is estimated by minimizing the reprojection error from the 3D-2D correspondences. By combining both frameworks, we extend the applicability of head pose estimation from facial landmarks to cases where these features are no longer visible. We compared the proposed method to other related approaches, showing that it can achieve state-of-the-art performance. We also demonstrate that our approach is suitable for cases with extreme head rotations and (self-) occlusions, besides being suitable for real time applications.

Mux-Kmeans: multiplex kmeans for clustering large-scale data set <=SEP=> Kmeans clustering algorithm is widely used in a number of scientific applications due to its simple iterative nature and ease of implementation. The quality of clustering result highly depends on the selection of initial centroids. Different selections of initial centroids result in different clustering results. In practice, people run a series of Kmeans processes with multiple initial centroid groups serially and return the best clustering result among them. However, in the era of big data, a Kmeans process is implemented on MapReduce to scale to large data sets. Even a single Kmeans process on MapReduce requires considerable long runtime. This paper proposes Mux-Kmeans. Rather than executing multiple Kmeans processes serially, Mux-Kmeans launches these Kmeans processes concurrently with multiple centroid groups. In each iteration, Mux-Kmeans (i) evaluates these Kmeans processes, (ii) prunes the low-quality Kmeans processes, and (iii) incubates new Kmeans processes. After a certain number of iterations, it finally obtains the best among these local optimal results. We implement Mux-Kmeans on MapReduce and evaluate it on Amazon EC2. The experimental results show that starting from the same initial centroid groups, the clustering result of Mux-Kmeans is always non-worse than the best of a series of Kmeans processes. Mux-Kmeans also saves elapsed time than serial multiple Kmeans processes.

A Clinical Study of 35 Cases of Pincer Nails <=SEP=> BACKGROUND
Pincer nail is a nail deformity characterized by transverse overcurvature of the nail plate. Pincer nail can affect a patient's quality of life due to its chronic, recurrent course; however, there have been no clinical studies on the pincer nail condition in Korean patients.


OBJECTIVE
The purpose of this study was to characterize the clinical findings and treatment of pincer nail. In addition, possible etiological factors were considered, and treatment efficacy was evaluated.


METHODS
The medical records and clinical photographs of 35 patients (12 males, 23 females) who were diagnosed with pincer nail between August 1, 2005 and July 31, 2009 were studied.


RESULTS
Patient age ranged from 10 to 77 (52.09±17.26) years, and there was a predominance of female (23 out of 35 patients, F:M=2:1). The mean duration of the disorder was 7.45 years (range 0.25~40); 85% had pincer nail for at least 1 year. In addition, 40% had a history of previous treatment and recurrence. There were 82.8% patients with the common type of pincer nails. The most commonly involved nails were both great toenails. Among 35 patients, nail grinding was started in 30 patients, and 25 patients showed clinical improvement with nail grinding. The width index increased and the height index decreased after treatment. The mean follow up period was 8.42 months (range 1~27), and 7 patients showed recurrence after 8.8 months (range 2~20). Among 35 patients, 5 patients were treated with nail extraction with matricectomy, and the symptoms resolved immediately. The mean follow up period was 7.6 months (range 0~19), and recurrence was not observed. Onychomycosis was also present in 37.1% of patients, and itraconazole pulse therapy for 3 months was added.


CONCLUSION
The results of this study demonstrate the clinical features of pincer nail in Korean patients. The findings show that the common type of pincer nail was most common, and nail grinding as a conservative treatment greatly improved pincer nails despite a risk of recurrence. When onychomycosis was also present, oral antifungal therapy added to nail grinding resulted in a more rapid change in nail thickness and clinical improvement.

Applying a tendency to be well retweeted to false information detection <=SEP=> While a lot of useful information can be found in SNS, false information also diffuses through it, thereby confusing many people sometimes. In this paper, we predict a tendency of tweets to be well retweeted and consider applying the tendency to false information detection. The tendency prediction can be implemented with simple features of tweets. We examine the effect of the tendency when it is used in false information detection empirically. Our experimental results indicate that it would be valuable to take the tendency into account for the detection. We also discuss findings when applying them to tweets in Japanese.

COFI RANK - Maximum Margin Matrix Factorization for Collaborative Ranking <=SEP=> In this paper, we consider collaborative filtering as a ranking problem. We present a method which uses Maximum Margin Matrix Factorization and optimizes ranking instead of rating. We employ structured output prediction to optimize directly for ranking scores. Experimental results show that our method gives very good ranking scores and scales well on collaborative filtering tasks.