Benchmark Datasets Research Articles

Investigating the Precise Identification of Citrullination Sites with High-Performance Score Metrics using a Powerful Computation Predicting Tool.

To elucidate the detailed mechanisms of citrullination at the molecular level and design drugs applicable to major human diseases, predicting protein citrullination sites (PCSs) is essential. Using experimental approaches to predict PCSs is time-consuming and costly. However, there is a limited scope of the current PCS predictors. In particular, most predictors are commonly used for PCS prediction and have limited performance scores. This work aims to provide an improved sophisticated predictor of citrullination sites using a benchmark dataset in a machine learning platform. This study presents a reliable citrullination site predictor based on a benchmark dataset containing a 1:1 ratio of positive and negative samples. We classified citrullination sites using the Composition of the K-Spaced Amino Acid Pairs (CKSAAP) and Support Vector Machine (SVM). We developed PCS predictors using integrated machine-learning methods that produced the highest average scores. Using 10-fold cross-validation on test datasets, the True Positive Rate (TPR) was 98.34%, the True Negative Rate (TNR) was 99.44%, the accuracy was 98.89%, the Mathew Correlation Coefficient (MCC) was 98.21%, the Area Under the ROC Curve (AUC) was 0.999, and the partial Area Under the ROC Curve (pAUC) was 0.1968. According to overall performance, our developed predictor has a significantly higher implementation in comparison with the current tools on the same benchmark dataset. Moreover, it showed better performance metrics on both test and training datasets. Our developed predictor is promising and can be implemented as a complementary technique for identifying fast and precise citrullination sites.

Structured query language query join optimization by using rademacher averages and mapreduce algorithms

Query optimization involves identifying and implementing the most effective and efficient methods and strategies to enhance the performance of queries. This is achieved by intelligently utilizing system resources and considering various performance metrics. Table joining optimization involves optimizing the process of combining two or more tables within a database. Structured query language (SQL) optimization is the progress of utilizing SQL queries in the possible way to achieve fast and accurate database results. SQL optimization is critical to decreasing the no of queries in research description framework (RDF) and the time for processing a huge number of relatable data. In this paper, four new algorithms are proposed such as hash-join, sort-merge, rademacher averages and mapreduce for the progress of SQL query join optimization. The proposed model is evaluated and tested using waterloo sparql diversity test suite (WatDiv) and lehigh university benchmark (LUBM) benchmark datasets in terms of time execution. The results represented that the proposed method achieved an enhanced performance of less execution time for various queries such as Q3 of 5362, Q8 of 5921, Q9 of 5854 and Q10 of 5691 milliseconds. The proposed gives better performance than other existing methods like hybrid database-map reduction system (AQUA+) and join query processing (JQPro).

NaturalSpeech: End-to-End Text-to-Speech Synthesis With Human-Level Quality.

Text-to-speech (TTS) has made rapid progress in both academia and industry in recent years. Some questions naturally arise that whether a TTS system can achieve human-level quality, how to define/judge that quality, and how to achieve it. In this paper, we answer these questions by first defining the human-level quality based on the statistical significance of subjective measure and introducing appropriate guidelines to judge it, and then developing a TTS system called NaturalSpeech that achieves human-level quality on benchmark datasets. Specifically, we leverage a variational auto-encoder (VAE) for end-to-end text-to-waveform generation, with several key modules to enhance the capacity of the prior from text and reduce the complexity of the posterior from speech, including phoneme pre-training, differentiable duration modeling, bidirectional prior/posterior modeling, and a memory mechanism in VAE. Experimental evaluations on the popular LJSpeech dataset show that our proposed NaturalSpeech achieves -0.01 CMOS (comparative mean opinion score) to human recordings at the sentence level, with Wilcoxon signed rank test at p-level p >> 0.05, which demonstrates no statistically significant difference from human recordings for the first time.

A New Sufficient & Necessary Condition for Testing Linear Separability Between Two Sets.

As a fundamental mathematical problem in the field of machine learning, the linear separability test still lacks a theoretically complete and computationally efficient method. This paper proposes and proves a sufficient and necessary condition for linear separability test based on a sphere model. The advantage of this test method is two-fold: (1) it provides not only a qualitative test of linear separability but also a quantitative analysis of the separability of linear separable instances; (2) it has low time cost and is more efficient than existing test methods. The proposed method is validated through a large number of experiments on benchmark datasets and artificial datasets, demonstrating both its correctness and efficiency.

Selective Random Walk for Transfer Learning in Heterogeneous Label Spaces.

Transfer learning has been widely used in different scenarios, especially in those lacking enough labeled data. However, most of the existing transfer learning methods are based on the assumption that the source and target domains should share the label space entirely or partially, which greatly limits their application scopes. In this article, a Selective Random Walk (SRW) method for transfer learning in heterogeneous label spaces is proposed to make full use of unlabeled auxiliary data, which acts as a bridge for knowledge transfer from the source domain to the target domain. The proposed SRW method can explicitly identify transfer sequences between source and target instances via auxiliary instances based on random walk techniques. Since not all of the transfer sequences generated by random walk are credible for the target task, the SRW method can learn to weight transfer sequences adaptively. Based on the weights of the transfer sequences, the SRW method leverages knowledge by forcing adjacent data points in the transfer sequence to be similar and making the target data point in the sequence represented by other data points in the same sequence. Experiments show that the SRW method outperforms state-of-the-art models in plenty of transfer learning tasks with heterogeneous label spaces constructed within and across several benchmark datasets.

A robust neural network for privacy-preserving heart rate estimation in remote healthcare systems

In this study, we propose a computationally-light and robust neural network for estimating heart rate in remote healthcare systems. We develop a model that can be trained on consumer-grade graphics processing units (GPUs), and can be deployed on edge devices for swift inference. We propose a hybrid model based on convolutional neural network (CNN) and bidirectional long short-term memory (BiLSTM) architectures for estimating heart rate from Electrocardiogram (ECG) and Photoplethysmography (PPG) signals. Considering the sensitive nature of the ECG signals, we ensure a formal privacy guarantee, differential privacy, for the model training. We perform a tight accounting of the overall privacy budget of our training algorithm using the Rényi Differential Privacy technique. We demonstrate that our model outperforms state-of-the-art networks on a benchmark dataset for both ECG and PPG signals despite having a much smaller number of trainable parameters and, consequently, much smaller training and inference times. Our CNN-BiLSTM architecture can also provide excellent heart rate estimation performance even under strict privacy constraints. We develop a prototype Arduino-based data collection system that is low-cost, efficient, and useful for providing access to modern healthcare services to people living in remote areas.

A Convolution Neural Network-based Approach for Metal Surface Roughness Evaluation

Background: Metal surface roughness detection is an essential step of quality control in the metal processing industry. Due to the high manual involvement and poor efficiency of traditional roughness testing, rapid automated vision detection has received increasing attention in product quality control. Many methods have focused on extracting features related to roughness from images by means of mathematical statistics. However, these methods often rely on extensive experiments and complex calculations, while being sensitive to external environmental disturbances. Methods: In this paper, a convolution neural network-based approach for metal surface roughness evaluation has been proposed. The convolutional neural network was initialized using a transfer learning strategy, and the data augmentation technique was applied to the benchmark dataset for sample expansion. Results: To evaluate this approach, samples of 4 types of roughness classes were prepared. The samples were divided into a training set, validation set, and test set in the ratio of 7:2:1. The accuracy of the neural network on the test set was found to be above 86%. Conclusion: The effectiveness of the proposed approach and its superiority over manual detection have been demonstrated in the experiments.

MISP-Fuse: A progressive fusion network guided by Multi-Information supervision

The fusion of infrared and visible images aims to synthesize an image that combines the advantageous characteristics of both image sources. Nevertheless, existing image fusion algorithms often struggle to extract relevant feature information from the source images and find it challenging to balance the significance of different modality information within the source images. This leads to suboptimal fusion results and inadequately serve advanced downstream visual tasks. In order to confront this challenge, a novel image fusion algorithm, denoted as Multiple Information Supervised Progressive Fusion Network (MISP-Fuse), has been proposed. Specifically, MISP-Fuse employs an innovative and robust multi-stage encoder-decoder network called Full Scale Feature Residual network (FSFR) to extract spatial context and detailed feature information corresponding to infrared and visible images. Within this encoder-decoder network, source image feature information is progressively extracted at different stages, which are recombined at multiple scales and distilled for crucial information. Finally, the fusion image is generated through a spatial localization module named as Spatial Localization Network (SLNet). MISP-Fuse incorporates a multi-information supervision mechanism to establish a linkage between different modality information in the infrared and visible source images. It ensures that the resulting fused image not only aligns with human visual perception but also effectively serves advanced downstream visual tasks. The comparative experiments utilizing diverse image fusion benchmark datasets has been conducted. In comparison to other algorithms, MISP-Fuse demonstrated significant enhancements in comprehensive image fusion metrics, including Average Gradient (AG), Sum of Correlated Differences (SCD), and Correlation Coefficient (CC).

Advancements and Applications of Generative Adversarial Networks: A Comprehensive Review

Abstracts: Our paper offers a comprehensive exploration of Generative Adversarial Networks (GANs), tracing their evolution from Ian Goodfellow's seminal work to their current state-of-the-art status. Delving into the intricacies of GAN architecture and training dynamics, we illuminate their pivotal role in diverse applications such as image synthesis, style transfer, and text-toimage conversion. Through an exhaustive literature review, we dissect the progression of GAN architectures, from Vanilla GANs [1] to advanced variants like Progressive GANs [7] and StyleGANs [8], highlighting their techniques, contributions, and performance across benchmark datasets. Moreover, we confront challenges such as training instability and mode collapse, while also presenting a meticulously curated repository of contemporary generative model advancements. This repository encapsulates the cutting edge of GAN research, showcasing innovative approaches across domains ranging from financial forecasting to image restoration. Despite hurdles and ethical considerations, GANs persist as the vanguard of generative modeling, propelling forward the frontiers of artificial intelligence and creative synthesis.

Traffic Sign Recognition using HIICNN Stack Ensemble Method

Abstract: This project introduces a novel deep convolutional neural network (CNN) model aimed at enhancing traffic sign recognition for autonomous vehicle technology and road safety. Employing a stacking ensemble approach, we combine multiple CNNs with diverse improvement techniques, including preprocessing for adverse weather conditions and shooting errors, and data augmentation to handle class imbalance. Through adjustments in learning rates during model training, we mitigate overfitting. Our ensemble model achieves an exceptional 99.4 percent test accuracy on the German Traffic Sign Recognition Benchmark (GTSRB) dataset, surpassing prior studies. We utilize gradient-weighted Class Activation Mapping (Grad-CAM) for model explain- ability and an evidential deep learning approach to quantify classification uncertainty. Our framework underscores the efficacy of combining preprocessing, ensemble learning, and transfer learning for superior perfor- mance and reliability in traffic sign recognition systems, contributing significantly to autonomous driving and road safety.

Effect of emphysema on AI software and human reader performance in lung nodule detection from low-dose chest CT.

Emphysema influences the appearance of lung tissue in computed tomography (CT). We evaluated whether this affects lung nodule detection by artificial intelligence (AI) and human readers (HR). Individuals were selected from the "Lifelines" cohort who had undergone low-dose chest CT. Nodules in individuals without emphysema were matched to similar-sized nodules in individuals with at least moderate emphysema. AI results for nodular findings of 30-100 mm3 and 101-300 mm3 were compared to those of HR; two expert radiologists blindly reviewed discrepancies. Sensitivity and false positives (FPs)/scan were compared for emphysema and non-emphysema groups. Thirty-nine participants with and 82 without emphysema were included (n = 121, aged 61 ± 8years (mean ± standard deviation), 58/121 males (47.9%)). AI and HR detected 196 and 206 nodular findings, respectively, yielding 109 concordant nodules and 184 discrepancies, including 118 true nodules. For AI, sensitivity was 0.68 (95% confidence interval 0.57-0.77) in emphysema versus 0.71 (0.62-0.78) in non-emphysema, with FPs/scan 0.51 and 0.22, respectively (p = 0.028). For HR, sensitivity was 0.76 (0.65-0.84) and 0.80 (0.72-0.86), with FPs/scan of 0.15 and 0.27 (p = 0.230). Overall sensitivity was slightly higher for HR than for AI, but this difference disappeared after the exclusion of benign lymph nodes. FPs/scan were higher for AI in emphysema than in non-emphysema (p = 0.028), while FPs/scan for HR were higher than AI for 30-100 mm3 nodules in non-emphysema (p = 0.009). AI resulted in more FPs/scan in emphysema compared to non-emphysema, a difference not observed for HR. In the creation of a benchmark dataset to validate AI software for lung nodule detection, the inclusion of emphysema cases is important due to the additional number of FPs. • The sensitivity of nodule detection by AI was similar in emphysema and non-emphysema. • AI had more FPs/scan in emphysema compared to non-emphysema. • Sensitivity and FPs/scan by the human reader were comparable for emphysema and non-emphysema. • Emphysema and non-emphysema representation in benchmark dataset is important for validating AI.

PSO-PSP-Net + InceptionV3: An optimized hyper-parameter tuned Computer-Aided Diagnostic model for liver tumor detection using CT scan slices

An automated diagnostic system leads to a supreme requirement in medical image analysis, greatly impacting the death rate due to the high spreading rate of liver tumors. However, the traditional histopathological diagnostic processes cause more disruption in the medical detection framework because of the procedure of manual estimation of CT scans and medical labor-intensive, which lead to the time consumption process. It is a highly challenging task for the segmentation of liver tumor because of the irregular appearance, distinct densities, patchy edges, and tumor sizes. To overcome this issue, an automated computer-aided diagnosis framework has been utilized to diagnose the liver cancer quickly and accurately with the less workload of expert radiologists.Presently, Deep learning-based techniques have been applied to identify the tumor regions and assist radiologists in the initial diagnosis and scrutinizing the severity level. The proposed work presents a modified pyramid scene parsing network (PSP-Net) model based on InceptionV3 deep network architecture with a particle swarm optimization algorithm, which increases the efficiency and effectiveness of the liver diagnostic model. Three publicly accessible benchmark datasets have been engaged with the pre-processing task accomplished by image normalization and data augmentation techniques. Moreover, a hyper-parameter tuned improved PSO-PSP-Net algorithm has analyzed the optimal set of gathered features. In the experimental evaluation, the proposed model outperformed than grey wolf optimization (GWO-PSP-Net), PSO-U-Net, GWO-U-Net, opposition based spotted hyena optimization (O-SHO-CRNN), and grey wolf-class topper optimization (GW-CTO) + U-Net by 8.42 %, 4.9 %, 9.54 %, 5.12 %, and 1.75 %, respectively in terms of accuracy for LiTS dataset. The developed PSO-PSP-Net model attained better accuracy than GWO-PSP-Net, PSO-U-Net, GWO-U-Net, and Residual Atrous U-Net (RA-U-Net) for the segmentation of Type-I and Type-II liver tumors by 6.88 %, 8.44 %, 13.75 %, 5.99 % and 6.12 %, 9.74 %, 17.3 %, and 5.11 %, respectively for 3DIRCAD-b1 dataset. The obtained accuracy of the developed model is 14.09 %, 7.54 %, 16.36 %, 2.64 %, and 14.9 %, 8.86 %, 17.76 %, and 4.87 % maximized than GWO-PSP-Net, PSO-U-Net, GWO-U-Net, and RA-U-Net, respectively, for the segmentation of the infected arteries and bones in the 3DIRCAD-b1 dataset. For the CHAOS dataset, the improved PSO-PSP-Net model outperformed GWO-PSP-Net, PSO-U-Net, and GWO-U-Net, respectively, in terms of overall accuracy by 7.44 %, 8.85 %, and 17.2 %, respectively. The investigational analysis validates the proposed PSO-PSP-Net model's effectiveness and performance in obtaining high segmentation accuracy in comparison with other state-of-the-art approaches.

Parallel Spatio-Temporal Attention Transformer for Video Frame Interpolation

Traditional video frame interpolation methods based on deep convolutional neural networks face challenges in handling large motions. Their performance is limited by the fact that convolutional operations cannot directly integrate the rich temporal and spatial information of inter-frame pixels, and these methods rely heavily on additional inputs such as optical flow to model motion. To address this issue, we develop a novel framework for video frame interpolation that uses Transformer to efficiently model the long-range similarity of inter-frame pixels. Furthermore, to effectively aggregate spatio-temporal features, we design a novel attention mechanism divided into temporal attention and spatial attention. Specifically, spatial attention is used to aggregate intra-frame information, integrating both attention and convolution paradigms through the simple mapping approach. Temporal attention is used to model the similarity of pixels on the timeline. This design achieves parallel processing of these two types of information without extra computational cost, aggregating information in the space–time dimension. In addition, we introduce a context extraction network and multi-scale prediction frame synthesis network to further optimize the performance of the Transformer. Our method and state-of-the-art methods are extensively quantitatively and qualitatively experimented on various benchmark datasets. On the Vimeo90K and UCF101 datasets, our model achieves improvements of 0.09 dB and 0.01 dB in the PSNR metrics over UPR-Net-large, respectively. On the Vimeo90K dataset, our model outperforms FLAVR by 0.07 dB, with only 40.56% of its parameters. The qualitative results show that for complex and large-motion scenes, our method generates sharper and more realistic edges and details.

Leveraging Self-Distillation and Disentanglement Network to Enhance Visual–Semantic Feature Consistency in Generalized Zero-Shot Learning

Generalized zero-shot learning (GZSL) aims to simultaneously recognize both seen classes and unseen classes by training only on seen class samples and auxiliary semantic descriptions. Recent state-of-the-art methods infer unseen classes based on semantic information or synthesize unseen classes using generative models based on semantic information, all of which rely on the correct alignment of visual–semantic features. However, they often overlook the inconsistency between original visual features and semantic attributes. Additionally, due to the existence of cross-modal dataset biases, the visual features extracted and synthesized by the model may also mismatch with some semantic features, which could hinder the model from properly aligning visual–semantic features. To address this issue, this paper proposes a GZSL framework that enhances the consistency of visual–semantic features using a self-distillation and disentanglement network (SDDN). The aim is to utilize the self-distillation and disentanglement network to obtain semantically consistent refined visual features and non-redundant semantic features to enhance the consistency of visual–semantic features. Firstly, SDDN utilizes self-distillation technology to refine the extracted and synthesized visual features of the model. Subsequently, the visual–semantic features are then disentangled and aligned using a disentanglement network to enhance the consistency of the visual–semantic features. Finally, the consistent visual–semantic features are fused to jointly train a GZSL classifier. Extensive experiments demonstrate that the proposed method achieves more competitive results on four challenging benchmark datasets (AWA2, CUB, FLO, and SUN).

A Fast Feedforward Small-World Neural Network for Nonlinear System Modeling.

It is well-documented that cross-layer connections in feedforward small-world neural networks (FSWNNs) enhance the efficient transmission for gradients, thus improving its generalization ability with a fast learning. However, the merits of long-distance cross-layer connections are not fully utilized due to the random rewiring. In this study, aiming to further improve the learning efficiency, a fast FSWNN (FFSWNN) is proposed by taking into account the positive effects of long-distance cross-layer connections, and applied to nonlinear system modeling. First, a novel rewiring rule by giving priority to long-distance cross-layer connections is proposed to increase the gradient transmission efficiency when constructing FFSWNN. Second, an improved ridge regression method is put forward to determine the initial weights with high activation for the sigmoidal neurons in FFSWNN. Finally, to further improve the learning efficiency, an asynchronous learning algorithm is designed to train FFSWNN, with the weights connected to the output layer updated by the ridge regression method and other weights by the gradient descent method. Several experiments are conducted on four benchmark datasets from the University of California Irvine (UCI) machine learning repository and two datasets from real-life problems to evaluate the performance of FFSWNN on nonlinear system modeling. The results show that FFSWNN has significantly faster convergence speed and higher modeling accuracy than the comparative models, and the positive effects of the novel rewiring rule, the improved weight initialization, and the asynchronous learning algorithm on learning efficiency are demonstrated.

Nm-Nano: a machine learning framework for transcriptome-wide single-molecule mapping of 2´-O-methylation (Nm) sites in nanopore direct RNA sequencing datasets

ABSTRACT 2´-O-methylation (Nm) is one of the most abundant modifications found in both mRNAs and noncoding RNAs. It contributes to many biological processes, such as the normal functioning of tRNA, the protection of mRNA against degradation by the decapping and exoribonuclease (DXO) protein, and the biogenesis and specificity of rRNA. Recent advancements in single-molecule sequencing techniques for long read RNA sequencing data offered by Oxford Nanopore technologies have enabled the direct detection of RNA modifications from sequencing data. In this study, we propose a bio-computational framework, Nm-Nano, for predicting the presence of Nm sites in direct RNA sequencing data generated from two human cell lines. The Nm-Nano framework integrates two supervised machine learning (ML) models for predicting Nm sites: Extreme Gradient Boosting (XGBoost) and Random Forest (RF) with K-mer embedding. Evaluation on benchmark datasets from direct RNA sequecing of HeLa and HEK293 cell lines, demonstrates high accuracy (99% with XGBoost and 92% with RF) in identifying Nm sites. Deploying Nm-Nano on HeLa and HEK293 cell lines reveals genes that are frequently modified with Nm. In HeLa cell lines, 125 genes are identified as frequently Nm-modified, showing enrichment in 30 ontologies related to immune response and cellular processes. In HEK293 cell lines, 61 genes are identified as frequently Nm-modified, with enrichment in processes like glycolysis and protein localization. These findings underscore the diverse regulatory roles of Nm modifications in metabolic pathways, protein degradation, and cellular processes. The source code of Nm-Nano can be freely accessed at https://github.com/Janga-Lab/Nm-Nano.

A novel deep learning approach (Bi-xBcNet-96) considering green AI to discover breast cancer using mammography images

AbstractClinical decision support systems (CDSSs) can effectively detect illnesses such as breast cancer (BC) using a variety of medical imaging techniques. BC is a key factor contributing to the rise in the death rate among women worldwide. Early detection will lessen its impact, which may motivate patients to have quick surgical therapy. Computer-aided diagnosis (CAD) systems are designed to provide radiologists recommendations to assist them in diagnosing BC. However, it is still restricted and limited, the interpretability cost, time consumption, and complexity of architecture are not considered. These limitations limit their use in healthcare devices. Therefore, we thought of presenting a revolutionary deep learning (DL) architecture based on recurrent and convolutional neural networks called Bi-xBcNet-96. In order to decrease carbon emissions while developing the DL model for medical image analysis and meet the objectives of sustainable artificial intelligence, this study seeks to attain high accuracy at the lowest computing cost. It takes into consideration the various characteristics of the pathological variation of BC disease in mammography images to obtain high detection accuracy. It consists of six stages: identifying the region of interest, detecting spatial features, discovering the effective features of the BC pathological types that have infected nearby cells in a concentrated area, identifying the relationships between distantly infected cells in some BC pathological types, weighing the extracted features, and classifying the mammography image. According to experimental findings, Bi-xBcNet-96 beat other comparable works on the benchmark datasets, attaining a classification accuracy of 98.88% in DDSM dataset, 100% in INbreast dataset with 5.08% and 0.3% improvements over the state-of-the-art methods, respectively. Furthermore, a 95.79% reduction in computing complexity was achieved.

TQU-SLAM Benchmark Dataset for Comparative Study to Build Visual Odometry Based on Extracted Features from Feature Descriptors and Deep Learning

The problem of data enrichment to train visual SLAM and VO construction models using deep learning (DL) is an urgent problem today in computer vision. DL requires a large amount of data to train a model, and more data with many different contextual and conditional conditions will create a more accurate visual SLAM and VO construction model. In this paper, we introduce the TQU-SLAM benchmark dataset, which includes 160,631 RGB-D frame pairs. It was collected from the corridors of three interconnected buildings comprising a length of about 230 m. The ground-truth data of the TQU-SLAM benchmark dataset were prepared manually, including 6-DOF camera poses, 3D point cloud data, intrinsic parameters, and the transformation matrix between the camera coordinate system and the real world. We also tested the TQU-SLAM benchmark dataset using the PySLAM framework with traditional features such as SHI_TOMASI, SIFT, SURF, ORB, ORB2, AKAZE, KAZE, and BRISK and features extracted from DL such as VGG, DPVO, and TartanVO. The camera pose estimation results are evaluated, and we show that the ORB2 features have the best results (Errd = 5.74 mm), while the ratio of the number of frames with detected keypoints of the SHI_TOMASI feature is the best (rd=98.97%). At the same time, we also present and analyze the challenges of the TQU-SLAM benchmark dataset for building visual SLAM and VO systems.

Balanced Adversarial Tight Matching for Cross-Project Defect Prediction

Cross-project defect prediction (CPDP) is an attractive research area in software testing. It identifies defects in projects with limited labeled data (target projects) by utilizing predictive models from data-rich projects (source projects). Existing CPDP methods based on transfer learning mainly rely on the assumption of a unimodal distribution and consider the case where the feature distribution has one obvious peak. However, in actual situations, the feature distribution of project samples often exhibits multiple peaks that cannot be ignored. It manifests as a multimodal distribution, making it challenging to align distributions between different projects. To address this issue, we propose a balanced adversarial tight-matching model for CPDP. Specifically, this method employs multilinear conditioning to obtain the cross-covariance of both features and classifier predictions, capturing the multimodal distribution of the feature. When reducing the captured multimodal distribution differences, pseudo-labels are needed, but pseudo-labels have uncertainty. Therefore, we additionally add an auxiliary classifier and attempt to generate pseudo-labels using a pseudo-label strategy with less uncertainty. Finally, the feature generator and two classifiers undergo adversarial training to align the multimodal distributions of different projects. This method outperforms the state-of-the-art CPDP model used on the benchmark dataset.

Effective Video Summarization by Extracting Parameter-Free Motion Attention

Video summarization remains a challenging task despite increasing research efforts. Traditional methods focus solely on long-range temporal modeling of video frames, overlooking important local motion information that cannot be captured by frame-level video representations. In this article, we propose the Parameter-free Motion Attention Module (PMAM) to exploit the crucial motion clues potentially contained in adjacent video frames, using a multi-head attention architecture. The PMAM requires no additional training for model parameters, leading to an efficient and effective understanding of video dynamics. Moreover, we introduce the Multi-feature Motion Attention Network (MMAN), integrating the PMAM with local and global multi-head attention based on object-centric and scene-centric video representations. The synergistic combination of local motion information, extracted by the proposed PMAM, with long-range interactions modeled by the local and global multi-head attention mechanism, can significantly enhance the performance of video summarization. Extensive experimental results on the benchmark datasets, SumMe and TVSum, demonstrate that the proposed MMAN outperforms other state-of-the-art methods, resulting in remarkable performance gains.