Fader Networks: Manipulating Images by Sliding Attributes

This paper introduces a new encoder-decoder architecture that is trained to reconstruct images by disentangling the salient information of the image and the values of attributes directly in the latent space. As a result, after training, our model can generate different realistic versions of an input image by varying the attribute values. By using continuous attribute values, we can choose how much a specific attribute is perceivable in the generated image. This property could allow for applications where users can modify an image using sliding knobs, like faders on a mixing console, to change the facial expression of a portrait, or to update the color of some objects. Compared to the state-of-the-art which mostly relies on training adversarial networks in pixel space by altering attribute values at train time, our approach results in much simpler training schemes and nicely scales to multiple attributes. We present evidence that our model can significantly change the perceived value of the attributes while preserving the naturalness of images.Comment: NIPS 201

Micro-doppler-based in-home aided and unaided walking recognition with multiple radar and sonar systems

Published in IET Radar, Sonar and Navigation. Online first 21/06/2016.The potential for using micro-Doppler signatures as a basis for distinguishing between aided and unaided gaits is considered in this study for the purpose of characterising normal elderly gait and assessment of patient recovery. In particular, five different classes of mobility are considered: normal unaided walking, walking with a limp, walking using a cane or tripod, walking with a walker, and using a wheelchair. This presents a challenging classification problem as the differences in micro-Doppler for these activities can be quite slight. Within this context, the performance of four different radar and sonar systems – a 40 kHz sonar, a 5.8 GHz wireless pulsed Doppler radar mote, a 10 GHz X-band continuous wave (CW) radar, and a 24 GHz CW radar – is evaluated using a broad range of features. Performance improvements using feature selection is addressed as well as the impact on performance of sensor placement and potential occlusion due to household objects. Results show that nearly 80% correct classification can be achieved with 10 s observations from the 24 GHz CW radar, whereas 86% performance can be achieved with 5 s observations of sonar

Unsupervised Domain Adaptation by Backpropagation

Top-performing deep architectures are trained on massive amounts of labeled data. In the absence of labeled data for a certain task, domain adaptation often provides an attractive option given that labeled data of similar nature but from a different domain (e.g. synthetic images) are available. Here, we propose a new approach to domain adaptation in deep architectures that can be trained on large amount of labeled data from the source domain and large amount of unlabeled data from the target domain (no labeled target-domain data is necessary). As the training progresses, the approach promotes the emergence of "deep" features that are (i) discriminative for the main learning task on the source domain and (ii) invariant with respect to the shift between the domains. We show that this adaptation behaviour can be achieved in almost any feed-forward model by augmenting it with few standard layers and a simple new gradient reversal layer. The resulting augmented architecture can be trained using standard backpropagation. Overall, the approach can be implemented with little effort using any of the deep-learning packages. The method performs very well in a series of image classification experiments, achieving adaptation effect in the presence of big domain shifts and outperforming previous state-of-the-art on Office datasets

Feature Selection via Coalitional Game Theory

We present and study the contribution-selection algorithm (CSA), a novel algorithm for feature selection. The algorithm is based on the multiperturbation shapley analysis (MSA), a framework that relies on game theory to estimate usefulness. The algorithm iteratively estimates the usefulness of features and selects them accordingly, using either forward selection or backward elimination. It can optimize various performance measures over unseen data such as accuracy, balanced error rate, and area under receiver-operator-characteristic curve. Empirical comparison with several other existing feature selection methods shows that the backward elimination variant of CSA leads to the most accurate classification results on an array of data sets