Search

Previous studies in deepfake detection have shown promising results when testing face forgeries from the same dataset as the training. However, the problem remains challenging when one tries to generalize the detector to forgeries from unseen datasets and created by unseen methods. In this work, we present a novel general deepfake detection method, called \textbf{C}urricular \textbf{D}ynamic \textbf{F}orgery \textbf{A}ugmentation (CDFA), which jointly trains a deepfake detector with a forgery augmentation policy network. Unlike the previous works, we propose to progressively apply forgery augmentations following a monotonic curriculum during the training. We further propose a dynamic forgery searching strategy to select one suitable forgery augmentation operation for each image varying between training stages, producing a forgery augmentation policy optimized for better generalization. In addition, we propose a novel forgery augmentation named self-shifted blending image to simply imitate the temporal inconsistency of deepfake generation. Comprehensive experiments show that CDFA can significantly improve both cross-datasets and cross-manipulations performances of various naive deepfake detectors in a plug-and-play way, and make them attain superior performances over the existing methods in several benchmark datasets., Comment: Accepted by ECCV 2024

Image data have been extensively used in Deep Neural Network (DNN) tasks in various scenarios, e.g., autonomous driving and medical image analysis, which incurs significant privacy concerns. Existing privacy protection techniques are unable to efficiently protect such data. For example, Differential Privacy (DP) that is an emerging technique protects data with strong privacy guarantee cannot effectively protect visual features of exposed image dataset. In this paper, we propose a novel privacy-preserving framework VisualMixer that protects the training data of visual DNN tasks by pixel shuffling, while not injecting any noises. VisualMixer utilizes a new privacy metric called Visual Feature Entropy (VFE) to effectively quantify the visual features of an image from both biological and machine vision aspects. In VisualMixer, we devise a task-agnostic image obfuscation method to protect the visual privacy of data for DNN training and inference. For each image, it determines regions for pixel shuffling in the image and the sizes of these regions according to the desired VFE. It shuffles pixels both in the spatial domain and in the chromatic channel space in the regions without injecting noises so that it can prevent visual features from being discerned and recognized, while incurring negligible accuracy loss. Extensive experiments on real-world datasets demonstrate that VisualMixer can effectively preserve the visual privacy with negligible accuracy loss, i.e., at average 2.35 percentage points of model accuracy loss, and almost no performance degradation on model training., Comment: 18 pages, 11 figures

The rapid evolution of Web UI incurs time and effort in maintaining UI tests. Existing techniques in Web UI test repair focus on finding the target elements on the new web page that match the old ones so that the corresponding broken statements can be repaired. We present the first study that investigates the feasibility of using prior Web UI repair techniques for initial local matching and then using ChatGPT to perform global matching. Our key insight is that given a list of elements matched by prior techniques, ChatGPT can leverage the language understanding to perform global view matching and use its code generation model for fixing the broken statements. To mitigate hallucination in ChatGPT, we design an explanation validator that checks whether the provided explanation for the matching results is consistent, and provides hints to ChatGPT via a self-correction prompt to further improve its results. Our evaluation on a widely used dataset shows that the ChatGPT-enhanced techniques improve the effectiveness of existing Web test repair techniques. Our study also shares several important insights in improving future Web UI test repair techniques.

This research mainly explores the characteristics of different strategies and whether VIX INDEX positively influences the investment portfolio in any period. Our portfolio has six significant cryptocurrencies, VIX INDEX and gold. We perform parameter estimation on all raw data and bring the two types into different investment strategies, complete them effectively according to other characteristics, and compare the results. At the same time, we make two different portfolios, one contains VIX INDEX, and one does not have VIX INDEX. We use different portfolios in different portfolio strategies and find that VIX INDEX can positively impact the investment portfolio of cryptocurrencies, no matter in the standard market or the downward market. The research shows that gold has the same attributes as VIX INDEX and should have a specific positive effect, but no comparative experiment has been done., Comment: All authors share co-first authorship

Recent studies shows that the majority of existing deep steganalysis models have a large amount of redundancy, which leads to a huge waste of storage and computing resources. The existing model compression method cannot flexibly compress the convolutional layer in residual shortcut block so that a satisfactory shrinking rate cannot be obtained. In this paper, we propose STD-NET, an unsupervised deep-learning architecture search approach via hierarchical tensor decomposition for image steganalysis. Our proposed strategy will not be restricted by various residual connections, since this strategy does not change the number of input and output channels of the convolution block. We propose a normalized distortion threshold to evaluate the sensitivity of each involved convolutional layer of the base model to guide STD-NET to compress target network in an efficient and unsupervised approach, and obtain two network structures of different shapes with low computation cost and similar performance compared with the original one. Extensive experiments have confirmed that, on one hand, our model can achieve comparable or even better detection performance in various steganalytic scenarios due to the great adaptivity of the obtained network architecture. On the other hand, the experimental results also demonstrate that our proposed strategy is more efficient and can remove more redundancy compared with previous steganalytic network compression methods., Comment: Submitted to IEEE T-DSC

Transfer learning has drawn growing attention with the target of improving statistical efficiency of one study (dataset) by digging information from similar and related auxiliary studies (datasets). In the article, we consider transfer learning problem in estimating undirected semi-parametric graphical model. We propose an algorithm called Trans-Copula-CLIME for estimating undirected graphical model while digging information from similar auxiliary studies, characterizing the similarity between the target graph and each auxiliary graph by the sparsity of a divergence matrix. The proposed method relaxes the restrictive assumption that data follows a Gaussian distribution, which deviates from reality for the fMRI dataset related to Attention Deficit Hyperactivity Disorder (ADHD) considered here. Nonparametric rank-based correlation coefficient estimators are utilized in the Trans-Copula-CLIME procedure to achieve robustness against normality. We establish the convergence rate of the Trans-Copula-CLIME estimator under some mild conditions, which demonstrates that when the similarity between the auxiliary studies and the target study is sufficiently high and the number of informative auxiliary samples is sufficiently large, then the Trans-Copula-CLIME estimator shows great advantage over the existing non-transfer-learning ones. Simulation studies also show that Trans-Copula-CLIME estimator has better performance especially when data are not from Gaussian distribution. At last, the proposed method is applied to infer functional brain connectivity pattern for ADHD patients in the target Beijing site by leveraging the fMRI datasets from New York site.

Over the past few years, detection performance improvements of deep-learning based steganalyzers have been usually achieved through structure expansion. However, excessive expanded structure results in huge computational cost, storage overheads, and consequently difficulty in training and deployment. In this paper we propose CALPA-NET, a ChAnneL-Pruning-Assisted deep residual network architecture search approach to shrink the network structure of existing vast, over-parameterized deep-learning based steganalyzers. We observe that the broad inverted-pyramid structure of existing deep-learning based steganalyzers might contradict the well-established model diversity oriented philosophy, and therefore is not suitable for steganalysis. Then a hybrid criterion combined with two network pruning schemes is introduced to adaptively shrink every involved convolutional layer in a data-driven manner. The resulting network architecture presents a slender bottleneck-like structure. We have conducted extensive experiments on BOSSBase+BOWS2 dataset, more diverse ALASKA dataset and even a large-scale subset extracted from ImageNet CLS-LOC dataset. The experimental results show that the model structure generated by our proposed CALPA-NET can achieve comparative performance with less than two percent of parameters and about one third FLOPs compared to the original steganalytic model. The new model possesses even better adaptivity, transferability, and scalability., Comment: Accepted by IEEE Transactions on Information Forensics & Security

Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved algebraically. In this paper we show explicitly, mostly through examples of 2nd order superintegrable systems in 2 dimensions, how the trajectories can be determined in detail using rather elementary algebraic, geometric and analytic methods applied to the closed quadratic algebra of symmetries of the system. We treat a family of 2nd order degenerate systems: oscillator analogies on Darboux, nonzero constant curvature, and flat spaces, related to one another via contractions, and obeying Kepler's laws. Then we treat two 2nd order nondegenerate systems, an analogy of a caged Coulomb problem on the 2-sphere and its contraction to a Euclidean space caged Coulomb problem. In all cases the symmetry algebra structure provides detailed information about the trajectories. An interesting example is the occurrence of ''metronome orbits'', trajectories confined to an arc rather than a loop, which are indicated clearly from the structure equations but might be overlooked using more traditional methods. We also treat the Post-Winternitz system, an example of a classical 4th order superintegrable system that cannot be solved using separation of variables. Finally we treat a superintegrable system, related to the addition theorem for elliptic functions, whose constants of the motion are only rational in the momenta, a system of special interest because its constants of the motion generate a closed polynomial algebra. This paper contains many new results but we have tried to present most of the materials in a fashion that is easily accessible to nonexperts, in order to provide entr\'ee to superintegrablity theory.

It has been known since 2007 that the Wilson and Racah polynomials can be characterized as basis functions for irreducible representations of the quadratic symmetry algebra of the quantum superintegrable system on the 2-sphere, $H\Psi=E\Psi$, with generic 3-parameter potential. Clearly, the polynomials are expansion coefficients for one eigenbasis of a symmetry operator $L_1$ of $H$ in terms of an eigenbasis of another symmetry operator $L_2$, but the exact relationship appears not to have been made explicit. We work out the details of the expansion to show, explicitly, how the polynomials arise and how the principal properties of these functions: the measure, 3-term recurrence relation, 2nd order difference equation, duality of these relations, permutation symmetry, intertwining operators and an alternate derivation of Wilson functions -- follow from the symmetry of this quantum system. There is active interest in the relation between multivariable Wilson polynomials and the quantum superintegrable system on the $n$-sphere with generic potential, and these results should aid in the generalization. Contracting function space realizations of irreducible representations of this quadratic algebra to the other superintegrable systems one can obtain the full Askey scheme of orthogonal hypergeometric polynomials. All of these contractions of superintegrable systems with potential are uniquely induced by Wigner Lie algebra contractions of $so(3, C )$ and $e(2, C)$. All of the polynomials produced are interpretable as quantum expansion coefficients. It is important to extend this process to higher dimensions., Comment: 10 pages