With the development of Internet technology, deepfake (DF) videos can spread rapidly through online platforms, providing a new way of cyberbullying by generating nude pictures of female victims and using their faces to generate pornographic movies, which bring potential harm to individuals, society, and the country. Recently, there have been some really impressive results with DF detection models. These models have shown excellent outstanding performance when they are trained and tested using data from the same dataset. However, detecting DF remains difficult when the data comes from challenging datasets. To address this issue, this article aims to enhance the model's generalization by taking full advantage of the learning and representation capabilities of convolutional neural networks (CNNs) to adaptively suppress image texture information and catch deeper and more universal forgery features. Specifically, we introduce the texture suppression module (TSM) as a first step to suppress image content while simultaneously revealing the differences between authentic and tampered regions. Then, we carefully designed the cross stream interaction module (CSIM) and the cross stream mix block (CSMB) module to fully exploit the extracted forgery traces. Our proposed model has demonstrated superior generalization performance in extensive experiments.

With the rapid growth of Internet technology, security concerns have risen, particularly with the prevalence of Deepfakes, a popular visual forgery technique. Therefore, there is necessary to research more powerful methods to detect Deepfakes. However, many Convolutional Neural Networks-based detection methods struggle with cross-database performance, often overfitting to specific color textures. We observe that image noises can weaken the influence of color textures and expose the forgery traces in the noise domain. This is because tampering techniques, when altering face images, disrupt the consistency of feature distribution in the noise space. And the forgery traces in the noise space are complementary to the tampering artifacts present in the image space information. Therefore, we propose a novel face forgery detection network that combines spatial domain and noise domain. Our Dual Feature Fusion Module and Local Enhancement Attention Module contribute to more comprehensive feature representations, enhancing our method’s discriminative ability. Experimental results demonstrate superior performance compared to existing methods on mainstream datasets. https://github.com/jhchen1998/DeepfakeDetection.

Video frame interpolation is a challenging task in the video processing field. Benefiting from the development of deep learning, many video frame interpolation methods have been proposed, which focus on sampling pixels with useful information to synthesize each output pixel using their own sampling operation. However, these works have data redundancy limitations and fail to sample the correct pixel of complex motions. To solve these problems, we propose a new warping framework to sample called multi-scale expandable deformable convolution(MSEConv) which employs a deep fully convolutional neural network to estimate multiple small-scale kernel weights with different expansion degrees and adaptive weight allocation for each pixel synthesis. MSEConv covers most prevailing research methods as special cases of it, thus MSEConv is also possible to be transferred to existing works for performance improvement. To further improve the robustness of the whole network to occlusion, we also introduce a data preprocessing method for mask occlusion in video frame interpolation. Quantitative and qualitative experiments show that our method shows a robust performance comparable to or even superior to the state-of-the-art method. Our source code and visual comparable results are available at https://github.com/Pumpkin123709/MSEConv.

Video frame interpolation (VFI) is of great importance for many video applications, yet it is still challenging even in the era of deep learning. Some existing VFI models directly exploit existing lightweight network frameworks, thus making synthesized in-between frames blurry and creating artifacts due to imprecise motion representation. The other existing VFI models typically depend on heavy model architectures with a large number of parameters, preventing them from being deployed on small terminals. To address these issues, we propose a local lightweight VFI network ( L 2 BEC 2 ) that leverages bidirectional encoding structure with channel attention cascade. Specifically, we improve visual quality by introducing a forward and backward encoding structure with channel attention cascade to better characterize motion information. Furthermore, we introduce a local lightweight strategy into the state-of-the-art Adaptive Collaboration of Flows (AdaCoF) model to simplify its model parameters. Compared with the original AdaCoF model, the proposed L 2 BEC 2 obtains performance gain at the cost of only one-third of the number of parameters and performs favorably against the state-of-the-art works on public datasets. Our source code is available at https://github.com/Pumpkin123709/LBEC.git .

The decomposition of multi-subject fMRI data using rank-(L,L,1,1) block term decomposition (BTD) can preserve higher-way data structure and is more robust to noise effects by decomposing shared spatial maps (SMs) into a product of two rank-L loading matrices. However, since the number of whole-brain voxels is very large and rank L is larger than 1, the rank-(L,L,1,1) BTD requires high computation and memory. Therefore, we propose an accelerated rank-(L,L,1,1) BTD algorithm based upon the method of alternating least squares (ALS). We speed up updates of loading matrices by reducing fMRI data into subspaces, and add an orthonormality constraint on shared SMs to improve the performance. Moreover, we evaluate the rank-L effect on the proposed method for actual task-related fMRI data. The proposed method shows better performance when L=35. Meanwhile, experimental comparison results verify that the proposed method largely reduced (17.36 times) computation time compared to ALS while also providing satisfying separation performance.

Sparse unmixing separates the pixel of hyperspectral images into a collection of pure spectral signatures and the associated fractional coefficients with a complete spectral library as a priori, avoiding the drawback of inaccurate extraction of endmember information from the original hyperspectral image. As a state-of-the-art sparse unmixing method, fast multiscale spatial regularization unmixing algorithm (MUA) consists of two procedures, concerning on the approximation image domain and the original domain, respectively. However, it ignores the inter-superpixel correlation of the original domain that each superpixel only involves a small number of spectral signatures, and ignores the spectral variability of the approximate image domain. We address these two issues by introducing two different weighting factors to enhance the unmixing result. The effectiveness of our proposed algorithm is demonstrated by the experimental results on both synthetic and real hyperspectral data. The code and datasets of this letter can be found at https://github.com/wangtaowei11/Unmixing-Algorithm.

With the increasing number of electric vehicles (EVs), temporary charging demands grow rapidly. Unlike charging at home or workplace, temporary charging requires less waiting time. In this article, a mobile edge computing (MEC)-enabled charging and discharging networking system algorithm (CDNSA) is proposed to minimize the waiting time for EVs in charging stations (CSs). A software-defined network (SDN) paradigm is adopted to enhance the data transmission efficiency for MEC servers. In CDNSA, the optimization problem is formulated as a mixed-integer nonlinear programming (MINLP). A heuristic algorithm is proposed to solve the optimal CS selection variables for EVs that needs to be charged (EVCs) and EVs that can be discharged (EVDs), and then a remaining problem nonlinear programming (NLP) is obtained. By verifying the convexity of each continuous variable, the NLP is solved by adopting the block coordinate descent (BCD) method. In simulation, the optimality of CDNSA is verified by comparing with the exhaustive algorithm in terms of minimizing maximal waiting time (MMWT) of CSs. We also compare CDNSA with other benchmarks to illustrate its advantage.

Seam carving has been widely used in image resizing due to its superior performance in avoiding image distortion and deformation, which can maliciously be used on purpose, such as tampering contents of an image. As a result, seam-carving detection is becoming crucially important to recognize the image authenticity. However, existing methods do not perform well in the accuracy of seam-carving detection especially when the scaling ratio is low. In this paper, we propose an image forensic approach based on the cooccurrence of adjacent local binary patterns (LBPs), which employs LBP to better display texture information. Specifically, a total of 24 energy-based, seam-based, half-seam-based, and noise-based features in the LBP domain are applied to the seam-carving detection. Moreover, the cooccurrence features of adjacent LBPs are combined to highlight the local relationship between LBPs. Besides, SVM after training is adopted for feature classification to determine whether an image is seam-carved or not. Experimental results demonstrate the effectiveness in improving the detection accuracy with respect to different scaling ratios, especially under low scaling ratios.

The electrocardiogram (ECG) signal can easily be affected by various types of noises while being recorded, which decreases the accuracy of subsequent diagnosis. Therefore, the efficient denoising of ECG signals has become an important research topic. In the paper, we proposed an efficient ECG denoising approach based on empirical mode decomposition (EMD), sample entropy, and improved threshold function. This method can better remove the noise of ECG signals and provide better diagnosis service for the computer-based automatic medical system. The proposed work includes three stages of analysis: (1) EMD is used to decompose the signal into finite intrinsic mode functions (IMFs), and according to the sample entropy of each order of IMF following EMD, the order of IMFs denoised is determined; (2) the new threshold function is adopted to denoise these IMFs after the order of IMFs denoised is determined; and (3) the signal is reconstructed and smoothed. The proposed method solves the shortcoming of discarding the first-order IMF directly in traditional EMD denoising and proposes a new threshold denoising function to improve the traditional soft and hard threshold functions. We further conduct simulation experiments of ECG signals from the MIT-BIH database, in which three types of noise are simulated: white Gaussian noise, electromyogram (EMG), and power line interference. The experimental results show that the proposed method is robust to a variety of noise types. Moreover, we analyze the effectiveness of the proposed method under different input SNR with reference to improving SNR ( SNR imp ) and mean square error ( MSE ), then compare the denoising algorithm proposed in this paper with previous ECG signal denoising techniques. The results demonstrate that the proposed method has a higher SNR imp and a lower MSE . Qualitative and quantitative studies demonstrate that the proposed algorithm is a good ECG signal denoising method.

As a powerful learning tool, Extreme Learning Machine (ELM) shows its merits in classification, regression and clustering by offering both high prediction accuracy and high learning speed. Among numerous ELM varieties, multiple kernel ELM draws intensive attention from researchers because it can leverage information from multiple heterogeneous sources, which is a common scenario in big data era. Despite remarkable efforts for supervised multiple kernel ELM, few publications have addressed the unsupervised case, which is more critical yet challenging for tackling realistic problem. In this paper, we address this problem by proposing a two-stage unsupervised multiple kernel extreme learning machine, which is suitable for fast multiple-view clustering. This approach learns the cluster and kernel combination weights alternatively. At the first stage, it generates cluster label based on a given combined kernel. Then, at the second stage, the kernel combination weights are learned by distance label based extreme learning machine based on the label generated at the previous stage. Experimental results on both synthetic and real data sets demonstrate its outstanding performance in term of both accuracy and learning speed.

Energy efficiency has been a hot research topic for many years and many routing algorithms have been proposed to improve energy efficiency and to prolong lifetime for wireless sensor networks (WSNs). Since nodes close to the sink usually need to consume more energy to forward data of its neighbours to sink, they will exhaust energy more quickly. These nodes are called hot spot nodes and we call this phenomenon hot spot problem. In this paper, an Enhanced Power Efficient Gathering in Sensor Information Systems (EPEGASIS) algorithm is proposed to alleviate the hot spots problem from four aspects. Firstly, optimal communication distance is determined to reduce the energy consumption during transmission. Then threshold value is set to protect the dying nodes and mobile sink technology is used to balance the energy consumption among nodes. Next, the node can adjust its communication range according to its distance to the sink node. Finally, extensive experiments have been performed to show that our proposed EPEGASIS performs better in terms of lifetime, energy consumption, and network latency.