Search

Deep learning has demonstrated its great potential in channel state information (CSI)-based human activity recognition (HAR), and hence has attracted increasing attention in both the industry and academic communities. While promising, most existing high-accuracy methodologies require to retrain their models when applying the previous-trained ones to a new/unseen environment. This issue has limited their practical usabilities. In order to overcome this challenge, this article proposes an innovative scheme, which combines an activity-related feature extraction and enhancement (AFEE) method and matching network (AFEE-MatNet). The proposed scheme is 'one-fits-all,' meaning that the trained model can be directly applied in new/unseen environments without any retraining. We introduce the AFEE method to enhance CSI quality by eliminating noise. Specifically, the approach mitigates environmental noises unrelated to activity while better compressing and preserving the behavior-related information. Moreover, the size of feature signals generated by AFEE are reduced, which in turn significantly shortens the training time. For effective feature extraction, we propose to use the MatNet architecture to learn transferable features shared among source environments. To further improve the recognition performance, we introduce a prediction checking and correction scheme to rectify some classification errors that do not abide by the state transition of human behaviors. Extensive experimental results demonstrate that our proposed AFEE-MatNet significantly outperforms existing state-of-the-art HAR methods, in terms of both recognition accuracy and training time.

Low rank matrix factorisation is often used in recommender systems as a way of extracting latent features. When dealing with large and sparse datasets, traditional recommendation algorithms face the problem of acquiring large, unrestrained, fluctuating values over predictions especially for users/items with very few corresponding observations. Although the problem has been somewhat solved by imposing bounding constraints over its objectives, and/or over all entries to be within a fixed range, in terms of gaining better recommendations, these approaches have two major shortcomings that we aim to mitigate in this work: one is they can only deal with one pair of fixed bounds for all entries, and the other one is they are very time-consuming when applied on large scale recommender systems. In this paper, we propose a novel algorithm named Magnitude Bounded Matrix Factorisation (MBMF), which allows different bounds for individual users/items and performs very fast on large scale datasets. The key idea of our algorithm is to construct a model by constraining the magnitudes of each individual user/item feature vector. We achieve this by converting from the Cartesian to Spherical coordinate system with radii set as the corresponding magnitudes, which allows the above constrained optimisation problem to become an unconstrained one. The Stochastic Gradient Descent (SGD) method is then applied to solve the unconstrained task efficiently. Experiments on synthetic and real datasets demonstrate that in most cases the proposed MBMF is superior over all existing algorithms in terms of accuracy and time complexity., 11 pages, 6 figures, TNNLS

Clothing changes and lack of data labels are both crucial challenges in person ReID. For the former challenge, people may occur multiple times at different locations wearing different clothing. However, most of the current person ReID research works focus on the benchmarks in which a person's clothing is kept the same all the time. For the last challenge, some researchers try to make model learn information from a labeled dataset as a source to an unlabeled dataset. Whereas purely unsupervised training is less used. In this paper, we aim to solve both problems at the same time. We design a novel unsupervised model, Sync-Person-Cloud ReID, to solve the unsupervised clothing change person ReID problem. We developer a purely unsupervised clothing change person ReID pipeline with person sync augmentation operation and same person feature restriction. The person sync augmentation is to supply additional same person resources. These same person's resources can be used as part supervised input by same person feature restriction. The extensive experiments on clothing change ReID datasets show the out-performance of our methods., Comment: 9 pages

RGB-Infrared (RGB-IR) person re-identification (ReID) is a technology where the system can automatically identify the same person appearing at different parts of a video when light is unavailable. The critical challenge of this task is the cross-modality gap of features under different modalities. To solve this challenge, we proposed a Teacher-Student GAN model (TS-GAN) to adopt different domains and guide the ReID backbone to learn better ReID information. (1) In order to get corresponding RGB-IR image pairs, the RGB-IR Generative Adversarial Network (GAN) was used to generate IR images. (2) To kick-start the training of identities, a ReID Teacher module was trained under IR modality person images, which is then used to guide its Student counterpart in training. (3) Likewise, to better adapt different domain features and enhance model ReID performance, three Teacher-Student loss functions were used. Unlike other GAN based models, the proposed model only needs the backbone module at the test stage, making it more efficient and resource-saving. To showcase our model's capability, we did extensive experiments on the newly-released SYSU-MM01 RGB-IR Re-ID benchmark and achieved superior performance to the state-of-the-art with 49.8% Rank-1 and 47.4% mAP., Comment: 8 pages including 1 page reference

The vast majority of Internet traffic is now end-to-end encrypted, and while encryption provides user privacy and security, it has made network surveillance an impossible task. Various parties are using this limitation to distribute problematic content such as fake news, copy-righted material, and propaganda videos. Recent advances in machine learning techniques have shown great promise in extracting content fingerprints from encrypted traffic captured at the various points in IP core networks. Nonetheless, content fingerprinting from listening to encrypted wireless traffic remains a challenging task due to the difficulty in distinguishing re-transmissions and multiple flows on the same link. In this paper, we show the potential of fingerprinting internet traffic by passively sniffing WiFi frames in air, without connecting to the WiFi network by leveraging deep learning methods. First, we show the possibility of building a generic traffic classifier using a hierarchical approach that is able to identity most common traffic types in the Internet and reveal fine-granular details such as identifying the exact content of the traffic. Second, we demonstrate the possibility of using Multi-Layer Perceptron (MLP) and Recurrent Neural Networks (RNNs) to identify streaming traffic, such as video and music, from a closed set, by sniffing WiFi traffic that is encrypted at both Media Access Control (MAC) and Transport layers. Overall, our results demonstrate that we can achieve over 95% accuracy in identifying traffic types such as web, video streaming, and audio streaming as well as identifying the exact content consumed by the user.

Existing deep learning approaches have achieved high performance in encrypted network traffic analysis tasks. However, practical requirements such as open-set recognition on dynamically changing tasks (e.g., changes in the target website list), challenge existing methods. While few-shot learning and open-set recognition methods have been proposed for domains such as computer vision, few-shot open-set recognition for encrypted network traffic remains an unexplored area. This paper proposes a task adaptive siamese neural network for open-set recognition of encrypted network traffic with bidirectional dropout data augmentation. Our contributions are three-fold: First, we introduce generated positive and negative pairs into the siamese neural network training process to shape a more precise similarity boundary through bidirectional dropout data augmentation. Second, we utilize Dirichlet Process Gaussian Mixture Model (DPGMM) distribution to fit the similarity scores of the negative pairs constructed by the support set of each query task, and create a new open-set recognition metric. Third, by leveraging the extracted features at coarse and fine granular levels, we construct a hierarchical cross entropy loss to improve the confidence of the similarity score. Extensive experiments on a network traffic dataset and the Omniglot dataset demonstrate the superiority and generalizability of our proposed approach.

The state-of-the-art stereo matching models trained on synthetic datasets have difficulty in generalizing to real-world datasets. One major reason is that illumination and texture in the real world are hard to be simulated, resulting in big differences between synthetic and real-world data. In this study, instead of narrowing the image-level appearance difference, we focus on aligning both data domains in feature space in an unsupervised manner and propose an end-to-end domain alignment stereo network (DAStereo). A domain alignment module (DAM) is introduced by learning a point-wise linear transformation. We demonstrate that DAM can maintain sufficient alignment capacity with fewer parameters than the globally nonlinear mapping. To explicitly promote the point-wise domain alignment, adversarial learning is further introduced using a cost volume discriminator in a hybrid training manner. Experimental results show that DAStereo outperforms the state-of-the-art unsupervised and adaptive methods and even achieves comparable performance to some supervised methods.

Hedyotis puberulifolia from eastern Guangdong province, China, is described and photographed here. It is clearly different from all other congeneric species by its puberulous stem, leaves, stipules, and thyrsoid inflorescence with monochaisal sub-axes. Phylogenetic analysis revealed that H. puberulifolia is closely related to the sympatric H. tenuipes. It is evaluated as Least Concern according to IUCN Red List Categories and Criteria.