Facial expression cognition technology continues to face challenges from certain perspectives despite the fact that there have been significant recent learning advances in computer vision in the areas involving posture, orientation, and viewing mode of photos or videos that affects the device performance. In particular, the current distributed machine learning schemes do not consider the privacy issue in face monitoring data. Hence, this paper proposes a new federated learning framework for unsupervised multidomain face recognition of postexercise. It is a graph AE design base to ensure multiple edge devices can cooperate with each other to ensure the optimization of the common objective function of the model to enhance the efficiency and speed of the global model. In addition, a multidomain learning loss function is proposed to share the common feature representation with other related tasks to improve domain adaptability. Adversarial learning is used to improve the recognition effect of the federated framework in each domain. The proposed scheme is validated on different multidomains expression datasets and the experimental results indicate a 19% higher F1 score than the benchmark scheme in multidomain face recognition tasks.

The localization problem of target nodes remains unresolved, especially in large-scale and complex environments. In this paper, we propose a particle centroid drift (PCD) algorithm to reduce the distance errors between nodes and obtain the particle aggregation region by using the drift vector. First, we use the particle quality prediction function to obtain the particles in a high-likelihood region. The high-quality particles have high probability in the calculation, which can increase the number of effective particles and enable avoiding particle degradation. Then, the centroid drift vector is used to make the particle distribution similar to the actual reference distribution. Experiments are conducted on state-space models: the local movement where 55% nodes are moving and the globe movement where 100% nodes are moving. The results show that the proposed algorithm has low estimation errors, a good tracking effect and an acceptable time complexity.

In order to maintain the safe operation of various types of equipment, the health status of main components should be monitored in real-time, and the demand for intelligent fault diagnosis algorithm has increased sharply. However, the traditional intelligent diagnosis algorithm is based on the manual method for signal feature extraction, which has high requirements for expert experience and poor generality. A convolutional neural network, with big data as its engine, is the most effective pattern classification algorithm at present. In this paper, the convolutional neural network is applied to time-domain vibration signal fault diagnosis, taking the bearing as an example, and an intelligent diagnosis method of bearing based on convolution neural network is proposed. The proposed method does not need manual feature extraction, and can automatically complete feature extraction and automatic fault recognition. The convolutional neural network has three convolutional layers. We use data enhancement techniques for the input raw signal and convert the one-dimensional original time-domain vibration signal into a two-dimensional signal. The model shows good results on CWRU dataset and the recognition accuracy of the algorithm in the CWRU bearing database is more than 96%.

With the proliferation of multi-modal data generated by various sensors, unsupervised multi-modal hashing retrieval has been extensively studied due to its advantages in storage, retrieval efficiency, and label independence. However, there are still two obstacles to existing unsupervised methods: (1) As existing methods cannot fully capture the complementary and co-occurrence information of multi-modal data, existing methods suffer from inaccurate similarity measures. (2) Existing methods suffer from unbalanced multi-modal learning and data semantic structure being corrupted in the process of hash codes binarization. To address these obstacles, we devise an effective CLIP-based Adaptive Graph Attention Network (CAGAN) for large-scale unsupervised multi-modal hashing retrieval. Firstly, we use the multi-modal model CLIP to extract fine-grained semantic features, mine similar information from different perspectives of multi-modal data and perform similarity fusion and enhancement. In addition, this paper proposes an adaptive graph attention network to assist the learning of hash codes, which uses an attention mechanism to learn adaptive graph similarity across modalities. It further aggregates the intrinsic neighborhood information of neighboring data nodes through a graph convolutional network to generate more discriminative hash codes. Finally, this paper employs an iterative approximate optimization strategy to mitigate the information loss in the binarization process. Extensive experiments on three benchmark datasets demonstrate that the proposed method significantly outperforms several representative hashing methods in unsupervised multi-modal retrieval tasks.

Cross-modal hashing (CMH) maps heterogeneous multiple modality data into compact binary code to achieve fast and flexible retrieval across different modalities, especially in large-scale retrieval. As the data don't need a lot of manual annotation, unsupervised cross-modal hashing has a wider application prospect than supervised method. However, the existing unsupervised methods are difficult to achieve satisfactory performance due to the lack of credible supervisory information. To solve this problem, inspired by knowledge distillation, we propose a novel unsupervised Knowledge Distillation Cross-Modal Hashing method (KDCMH), which can use similarity information distilled from unsupervised method to guide supervised method. Specifically, firstly, the teacher model adopted an unsupervised distribution-based similarity hashing method, which can construct a modal fusion similarity matrix.Secondly, under the supervision of teacher model distillation information, student model can generate more discriminative hash codes. In two public datasets NUS-WIDE and MIRFLICKR-25K, extensive experiments have proved the significant improvement of KDCMH on several representative unsupervised cross-modal hashing methods.