Reviewerly/exHarmony huggingface dataset:
Geometric Disentangled Collaborative Filtering

Learning informative representations of users and items from the historical interactions is crucial to collaborative filtering (CF). Existing CF approaches usually model interactions solely within the Euclidean space. However, the sophisticated user-item interactions inherently present highly non-Euclidean anatomy with various types of geometric patterns (i.e., tree-likeness and cyclic structures). The Euclidean-based models may be inadequate to fully uncover the intent factors beneath such hybrid-geometry interactions. To remedy this deficiency, in this paper, we study the novel problem of Geometric Disentangled Collaborative Filtering (GDCF), which aims to reveal and disentangle the latent intent factors across multiple geometric spaces. A novel generative GDCF model is proposed to learn geometric disentangled representations by inferring the high-level concepts associated with user intentions and various geometries. Empirically, our proposal is extensively evaluated over five real-world datasets, and the experimental results demonstrate the superiority of GDCF.
Novel chaotic colour image cryptosystem with deep learning

A chaotic colour image cryptosystem frame with deep learning is proposed in this paper. First, we choose a chaotic system, after which a long short-term memory network is used to train 4D hyper-chaotic Lorenz signals and forecast four new signals, which passed the randomness test. Finally, we applied them to the colour cryptosystem. Given that new chaotic signals generated by deep learning are different from the original chaotic signals and the complex structure of deep learning, it is difficult to be attacked. Simulation results indicate that the proposed method has a high level of security compared to the representative image encryption algorithms.
Toward practical quantum embedding simulation of realistic chemical systems on near-term quantum computers

Quantum computing has recently exhibited great potential in predicting chemical properties for various applications in drug discovery, material design, and catalyst optimization. Progress has been made in simulating small molecules, such as LiH and hydrogen chains of up to 12 qubits, by using quantum algorithms such as variational quantum eigensolver (VQE). Yet, originating from the limitations of the size and the fidelity of near-term quantum hardware, the accurate simulation of large realistic molecules remains a challenge. Here, integrating an adaptive energy sorting strategy and a classical computational method-the density matrix embedding theory, which respectively reduces the circuit depth and the problem size, we present a means to circumvent the limitations and demonstrate the potential of near-term quantum computers toward solving real chemical problems. We numerically test the method for the hydrogenation reaction of C6H8 and the equilibrium geometry of the C18 molecule, using basis sets up to cc-pVDZ (at most 144 qubits). The simulation results show accuracies comparable to those of advanced quantum chemistry methods such as coupled-cluster or even full configuration interaction, while the number of qubits required is reduced by an order of magnitude (from 144 qubits to 16 qubits for the C18 molecule) compared to conventional VQE. Our work implies the possibility of solving industrial chemical problems on near-term quantum devices.
C$^{2}$DFNet: Criss-Cross Dynamic Filter Network for RGB-D Salient Object Detection

The ability to deal with intra and inter-modality features has been critical to the development of RGB-D salient object detection. While many works have advanced in leaps and bounds in this field, most existing methods have not taken their way down into the inherent differences between the RGB and depth data due to widely adopted conventional convolution in which fixed parameter kernels are applied during inference. To promote intra and inter-modality interaction conditioned on various scenarios, as RGB and depth data are processed independently and later fused interactively, we develop a new insight and a better model. In this paper, we introduce a criss-cross dynamic filter network by decoupling dynamic convolution. First, we propose a Model-specific Dynamic Enhanced Module (MDEM) that dynamically enhances the intra-modality features with global context guidance. Second, we propose a Scene-aware Dynamic Fusion Module (SDFM) to realize dynamic feature selection between two modalities. As a result, our model achieves accurate predictions of salient objects. Extensive experiments demonstrate that our method achieves competitive performance over 28 state-of-the-art RGB-D methods on 7 public datasets.
Secure Data Storage and Sharing Techniques for Data Protection in Cloud Environments: A Systematic Review, Analysis, and Future Directions

A large number of researchers, academia, government sectors, and business enterprises are adopting the cloud environment due to the least upfront capital investment, maximum scalability, and several other features of it. Despite the multiple features supported by the cloud environment, it also suffers several challenges. Data protection is the primary concern in the area of information security and cloud computing. Numerous solutions have been developed to address this challenge. However, there is a lack of comprehensive analysis among the existing solutions and a necessity emerges to explore, classify, and analyze the significant existing work for investigating the applicability of these solutions to meet the requirements. This article presents a comparative and systematic study, and in-depth analysis of leading techniques for secure sharing and protecting the data in the cloud environment. The discussion about each dedicated technique includes: functioning for protecting the data, potential and revolutionary solutions in the domain, the core and adequate information including workflow, achievements, scope, gaps, future directions, etc. about each solution. Furthermore, a comprehensive and comparative analysis of the discussed techniques is presented and the research gaps and future directions are reported in the field. The authors believe that this article&#x2019;s contribution will operate as a catalyst for the potential researchers to carry out the research work in the area
WSCC: A Weight-Similarity-Based Client Clustering Approach for Non-IID Federated Learning

The fast development of the Internet of Things (IoT) and deep learning enables learning useful patterns from the massive amount of collected data with sporadic nodes in IoT systems. Federated learning has received increasing attention in distributed machine learning where only intermediate parameters are exchanged with training samples that resided at local nodes. Nonetheless, most of the existing federated learning schemes assume a homogeneous distribution of data. The assumption, however, does not apply to IoT systems because of the heterogeneity of the IoT architecture. The nonindependent and identical distribution (non-IID) property in data volume and statistical distribution of IoT nodes can impact the performance of an aggregated global model that fits all nodes. Existing federated learning solutions for non-IID data sets either have to train additional models or require extra data exchange to check the node distribution. However, due to resource constraints in IoT systems, these approaches will increase the burden on limited computation capacity and cause network overhead. To address the issue, in this article, a novel weight-similarity-based client clustering (WSCC) approach is proposed, in which clients are split into different groups based on their data set distributions. An affinity-propagation-based method with the cosine distance of the client’s weight parameters is designed to iteratively and automatically determine dynamic clusters. The proposed approach is ideal for IoT systems since there are no auxiliary models and extra data transmissions are needed. Through the theoretical convergence analysis and empirical results, we show that our proposed WSCC scheme outperforms the representative federated learning schemes under different non-IID settings, achieving up to 20% improvements in accuracy.
Self-Distillation Feature Learning Network for Optical and SAR Image Registration

Optical and SAR image registration is important for multi-modal remote sensing image information fusion. Recently, deep matching networks have shown better performances than traditional methods on image matching. However, due to significant differences between optical and SAR images, the performances of existing deep learning methods still need to be further improved. This paper proposes a self-distillation feature learning network (SDNet) for optical and SAR image registration, improving performance from network structure and network optimization. Firstly, we explore the impact of different weight-sharing strategies on optical and SAR image matching. Then, we design a partially unshared feature learning network for multi-modal image feature learning. It has fewer parameters than the fully unshared network and has more flexibility than the fully shared network. Additionally, the limited binary supervised information (matching or non-matching) is insufficient to train the deep matching networks for optical-SAR image registration. Thus, we propose a self-distillation feature learning method to exploit more similarity information for deep network optimization enhancing, such as the similarity ordering between a series of non-matching patch-pairs. The exploited rich similarity information will significantly enhance network training and improve matching accuracy. Finally, considering that existing deep learning methods brute-force constrain the features of the matching optical and SAR image patches are similar, which will be lost many discriminative information, degenerating matching performances. Thus, we build an auxiliary task reconstruction learning to optimize the feature learning network to keep more discriminative information. Extensive experiments demonstrate the effectiveness of our proposed method on multi-modal image registration.
Pseudo-Pair Based Self-Similarity Learning for Unsupervised Person Re-Identification

Person re-identification (re-ID) is of great importance to video surveillance systems by estimating the similarity between a pair of cross-camera person shorts. Current methods for estimating such similarity require a large number of labeled samples for supervised training. In this paper, we present a pseudo-pair based self-similarity learning approach for unsupervised person re-ID without human annotations. Unlike conventional unsupervised re-ID methods that use pseudo labels based on global clustering, we construct patch surrogate classes as initial supervision, and propose to assign pseudo labels to images through the pairwise gradient-guided similarity separation. This can cluster images in pseudo pairs, and the pseudos can be updated during training. Based on pseudo pairs, we propose to improve the generalization of similarity function via a novel self-similarity learning:it learns local discriminative features from individual images via intra-similarity, and discovers the patch correspondence across images via inter-similarity. The intra-similarity learning is based on channel attention to detect diverse local features from an image. The inter-similarity learning employs a deformable convolution with a non-local block to align patches for cross-image similarity. Experimental results on several re-ID benchmark datasets demonstrate the superiority of the proposed method over the state-of-the-arts.
Multimodal Sentiment Analysis With Two-Phase Multi-Task Learning

Multimodal Sentiment Analysis (MSA) is a challenging research area that studies sentiment expressed from multiple heterogeneous modalities. Given those pre-trained language models such as BERT have shown state-of-the-art (SOTA) performance in multiple NLP disciplines, existing models tend to integrate these modalities into BERT and treat the MSA as a single prediction task. However, we find that simply fusing the multimodal features into BERT cannot well establish the power of a strong pre-trained model. Besides, the classification ability of each modality is also suppressed by single-task learning. In this paper, we propose a multimodal framework named Two-Phase Multi-task Sentiment Analysis (TPMSA), which applies a two-phase training strategy to make the most of the pre-trained model and a novel multi-task learning strategy to investigate the classification ability of each representation. We conduct experiments on two multimodal benchmark datasets CMU-MOSI and CMU-MOSEI, the results show that our TPMSA model significantly outperforms the current SOTA method on both datasets across all the metrics, which clearly show the effectiveness of our proposed method. Our code is available at \url{https://github.com/TPMSA/TPMSA}.
Competition-Driven Multimodal Multiobjective Optimization and Its Application to Feature Selection for Credit Card Fraud Detection

Feature selection has been considered as an effective method to solve imbalanced classification problems. It can be formulated as a multiobjective optimization problem (MOP) aiming to find a small feature subset while achieving a high classification accuracy. With traditional MOP, the focus is on deriving an optimal solution (i.e., a feature subset), while ignoring the diversity in solution space (e.g., there could exist multiple feature subsets achieving the same accuracy). Providing more options for feature selection would be beneficial since some features can be more difficult to obtain than others. In this work, we treat feature selection as a multimodal MOP (MMOP) whose goals are to find an excellent Pareto front in objective space and as many equivalent Pareto optimal solutions (feature subsets) as possible in feature space. Note that though several multimodal multiobjective evolutionary algorithms (MMEAs) have been proposed, their use of a convergence-first selection criterion could cause the loss of solution diversity in an objective and feature space. To address the issue, a novel competition-driven mechanism is designed to assist the existing multimodal MMEAs in locating more equivalent feature subsets and a desired Pareto front. The effectiveness of the proposed mechanism is first verified on all 22 MMOPs from CEC2019. Then, the proposed method is applied to feature selection in imbalanced classification problems and a real-world application, i.e., credit card fraud detection. Experimental results show that the proposed mechanism can not only provide more equivalent feature subsets but also improve classification accuracy.
Uncertainty-Aware Model-Based Reinforcement Learning: Methodology and Application in Autonomous Driving

To further improve learning efficiency and performance of reinforcement learning (RL), a novel uncertainty-aware model-based RL method is proposed and validated in autonomous driving scenarios in this paper. First, an action-conditioned ensemble model with the capability of uncertainty assessment is established as the environment model. Then, a novel uncertainty-aware model-based RL method is developed based on the adaptive truncation approach, providing virtual interactions between the agent and environment model, and improving RL’s learning efficiency and performance. The proposed method is then implemented in end-to-end autonomous vehicle control tasks, validated and compared with state-of-the-art methods under various driving scenarios. Validation results suggest that the proposed method outperforms the model-free RL approach with respect to learning efficiency, and model-based approach with respect to both efficiency and performance, demonstrating its feasibility and effectiveness.
Parameter estimation of static solar photovoltaic models using Laplacian Nelder-Mead hunger games search

Photovoltaic (PV) technology can convert solar energy to electric power, which is an essential tool for future years. Subsequently, several static solar PV models have been designed to simulate the current in a PV cell. However, the modeling process of PV systems requires extracting the unknown parameters of these cells, which can be modeled as an optimization problem. However, this is a very challenging task as it is multimodal and nonlinear. In this case, a Laplacian Nelder-Mead hunger games search (HGS) method, denoted as LNMHGS, is proposed for parameter extraction of static solar PV models. It realizes the equilibrium between exploitation and exploration by introducing the Laplacian strategy and Nelder-Mead simplex mechanism to hunger name search. LNMHGS compares against many recent methods and stands out by efficiently estimating static PV models' parameters. The simulation outcomes show that the root mean square error (RMSE) values and standard deviation offered by LNMHGS are smaller than other algorithms. Meanwhile, LNMHGS obtains the best performance both in different light conditions and at different temperature conditions. Therefore, LNMHGS is a promising, reliable, and feasible alternative for optimizing the parameters for PV systems.
A class-aware supervised contrastive learning framework for imbalanced fault diagnosis

Deep learning-based fault diagnosis models constructed from imbalanced datasets would meet severe performance degradation when the number of samples for fault classes is much smaller than the normal category. Recent feature-learning-based methods have shown that learning the discriminative feature representation helps construct the well-performing fault classifier in imbalanced fault diagnosis. However, these methods have limited discriminative feature extraction abilities when applying them to a more practical but not well-studied class-imbalance scenario, where only the normal condition has a large amount of data while sample sizes of all fault classes are small. To address this issue, a novel feature-learning-based method called Class-aware Supervised Contrastive Learning (CA-SupCon) is proposed. Supervised contrastive learning (SupCon) is adopted for the first time in imbalanced fault diagnosis to optimize the feature difference between any two classes by leveraging category information. Additionally, a class-aware sampler (CA) is designed to rebalance data distribution within each mini-batch during training, which improves the ability of SupCon to enlarge the feature distance between any two minority fault conditions. By effectively integrating SupCon and CA, the proposed CA-SupCon framework can obtain a more discriminative feature space with better intra-class compactness and inter-class separability, and achieves good performance under the above class-imbalance scenario. Extensive experiments on two open-source datasets demonstrate the effectiveness of the proposed method. Code is available at https://github.com/JiyangZhang-UESTC/CA-SupCon .
Augmenting Performance: A Systematic Review of Optical See-Through Head-Mounted Displays in Surgery

We conducted a systematic review of recent literature to understand the current challenges in the use of optical see-through head-mounted displays (OST-HMDs) for augmented reality (AR) assisted surgery. Using Google Scholar, 57 relevant articles from 1 January 2021 through 18 March 2022 were identified. Selected articles were then categorized based on a taxonomy that described the required components of an effective AR-based navigation system: data, processing, overlay, view, and validation. Our findings indicated a focus on orthopedic (n=20) and maxillofacial surgeries (n=8). For preoperative input data, computed tomography (CT) (n=34), and surface rendered models (n=39) were most commonly used to represent image information. Virtual content was commonly directly superimposed with the target site (n=47); this was achieved by surface tracking of fiducials (n=30), external tracking (n=16), or manual placement (n=11). Microsoft HoloLens devices (n=24 in 2021, n=7 in 2022) were the most frequently used OST-HMDs; gestures and/or voice (n=32) served as the preferred interaction paradigm. Though promising system accuracy in the order of 2-5 mm has been demonstrated in phantom models, several human factors and technical challenges-perception, ease of use, context, interaction, and occlusion-remain to be addressed prior to widespread adoption of OST-HMD led surgical navigation.
Detect and Locate: Exposing Face Manipulation by Semantic- and Noise-Level Telltales

The technological advancements of deep learning have enabled sophisticated face manipulation schemes, raising severe trust issues and security concerns in modern society. Generally speaking, detecting manipulated faces and locating the potentially altered regions are challenging tasks. Herein, we propose a conceptually simple but effective method to efficiently detect forged faces in an image while simultaneously locating the manipulated regions. The proposed scheme relies on a segmentation map that delivers meaningful high-level semantic information clues about the image. Furthermore, a noise map is estimated, playing a complementary role in capturing low-level clues and subsequently empowering decision-making. Finally, the features from these two modules are combined to distinguish fake faces. Extensive experiments show that the proposed model achieves state-of-the-art detection accuracy and remarkable localization performance.
Classification of breast cancer from histopathology images using an ensemble of deep multiscale networks

Manual delineation of tumours in breast histopathology images is generally time-consuming and laborious. Computer-aided detection systems can assist pathologists by detecting abnormalities faster and more efficiently. Convolutional Neural Networks (CNN) and transfer learning have shown good results in breast cancer classification. Most of the existing research works employed State-of-the-art pre-trained architectures for classification. But the performance of these methods needs to be improved in the context of effective feature learning and refinement. In this work, we propose an ensemble of two CNN architectures integrated with Channel and Spatial attention. Features from the histopathology images are extracted parallelly by two powerful custom deep architectures namely, CSAResnet and DAMCNN. Finally, ensemble learning is employed for further performance improvement. The proposed framework was able to achieve a classification accuracy of 99.55% on the BreakHis dataset.
A novel self-supervised deep LSTM network for industrial temperature prediction in aluminum processes application

This article studies the influence of pot temperature or electrolyte temperature in the aluminum reduction production. Specifically, these indexes reflect the distribution of the physical and energy field of the reduction cell, the current efficiency, and the lifespan of the aluminum reduction cell. Therefore, the pot temperature detection and identification are two critical and significant issues in the whole production process of aluminum electrolysis. However, due to the low measurement accuracy and high maintenance costs with the thermocouple sensor in the practical production process, the real-time measurement of pot temperature index is still a major challenge, which motivate us to develop a self-supervised soft sensor method based on deep long-short term memory (LSTM). Under the constraint of the limited samples, the proposed method achieves a competitive performance. First, the input variables are selected according to the expert experience. Then, a deep self-supervised model is built. Finally, the proposed self-supervised LSTM model is applied to real-time detection in an industrial electrolysis production case. The performance in the experiment outperforms other existing methods in terms of both accuracy and robustness aspects.