Searcharxiv⌕ Search

arXiv subjects

Yanhong Liu

Publications and source records attributed to Yanhong Liu.

13 recordsLinked to original sources
arXiv2026

Unified Face Attack Detection via Fine-Grained Semantic Guidance

The growing applications of facial recognition systems are accompanied by increasingly diverse security threats. Existing datasets lack detailed textual descriptions of forgery cues, leading most prior methods to treat face attack detection primarily as a visual recognition task. In this paper, building upon the large-scale MS-UFAD dataset which contains over 8 million attack images, we enrich each image with a fine-grained textual description of forgery cues. Furthermore, we propose a Dual Alignment Forgery Network(DAF-Net) to better leverage these textual information. Extensive experiments demonstrate that our approach extracts more generalizable and semantically meaningful forgery representations from attack images, outperforming both vision-only methods and approaches based on coarse-grained descriptions.

cs.CV↗
arXiv2026

Difference-Based High-Dimensional Long-Run Covariance Matrix Estimation for Mean-shift Time Series

We consider estimation of high-dimensional long-run covariance matrices for time series with nonconstant means, a setting in which conventional estimators can be severely biased. To address this difficulty, we propose a difference-based initial estimator that is robust to a broad class of mean variations, and combine it with hard thresholding, soft thresholding, and tapering to obtain sparse long-run covariance estimators for high-dimensional data. We derive convergence rates for the resulting estimators under general temporal dependence and time-varying mean structures, showing explicitly how the rates depend on covariance sparsity, mean variation, dimension, and sample size. Numerical experiments show that the proposed methods perform favorably in high dimensions, especially when the mean evolves over time.

stat.ME↗
arXiv2026

Explainable Deepfake Detection with RL Enhanced Self-Blended Images

Most prior deepfake detection methods lack explainable outputs. With the growing interest in multimodal large language models (MLLMs), researchers have started exploring their use in interpretable deepfake detection. However, a major obstacle in applying MLLMs to this task is the scarcity of high-quality datasets with detailed forgery attribution annotations, as textual annotation is both costly and challenging - particularly for high-fidelity forged images or videos. Moreover, multiple studies have shown that reinforcement learning (RL) can substantially enhance performance in visual tasks, especially in improving cross-domain generalization. To facilitate the adoption of mainstream MLLM frameworks in deepfake detection with reduced annotation cost, and to investigate the potential of RL in this context, we propose an automated Chain-of-Thought (CoT) data generation framework based on Self-Blended Images, along with an RL-enhanced deepfake detection framework. Extensive experiments validate the effectiveness of our CoT data construction pipeline, tailored reward mechanism, and feedback-driven synthetic data generation approach. Our method achieves performance competitive with state-of-the-art (SOTA) approaches across multiple cross-dataset benchmarks. Implementation details are available at https://github.com/deon1219/rlsbi.

cs.CV↗
arXiv2025

The Lost-K and Shorter-J Phenomenon in Non-Standard Ballistocardiography Data

Non-standard ballistocardiogram(BCG) data generally do not have prominent J peaks. This paper introduces two phenomena that reduce the prominence of Jpeaks: the shorter-J phenomenon and the lost-K phenomenon, both of which are commonly observed in non-standard BCG signals . This paper also proposes three signal transformation methods that effectively improve the lost-K and shorter-J phenomena. The methods were evaluated on a time-aligned ECG-BCG dataset with 40 subjects. The results show that based on the transformed signal, simple J-peak-based methods using only the detection of local maxima or minima show better performance in locating J-peaks and extracting BCG cycles, especially for non-standard BCG data.

eess.SP↗
arXiv2025

High Dimensional Sparse Canonical Correlation Analysis for Elliptical Symmetric Distributions

This paper proposes a robust high-dimensional sparse canonical correlation analysis (CCA) method for investigating linear relationships between two high-dimensional random vectors, focusing on elliptical symmetric distributions. Traditional CCA methods, based on sample covariance matrices, struggle in high-dimensional settings, particularly when data exhibit heavy-tailed distributions. To address this, we introduce the spatial-sign covariance matrix as a robust estimator, combined with a sparsity-inducing penalty to efficiently estimate canonical correlations. Theoretical analysis shows that our method is consistent and robust under mild conditions, converging at an optimal rate even in the presence of heavy tails. Simulation studies demonstrate that our approach outperforms existing sparse CCA methods, particularly under heavy-tailed distributions. A real-world application further confirms the method's robustness and efficiency in practice. Our work provides a novel solution for high-dimensional canonical correlation analysis, offering significant advantages over traditional methods in terms of both stability and performance.

stat.ME↗
arXiv2025

Observe Then Act: Asynchronous Active Vision-Action Model for Robotic Manipulation

In real-world scenarios, many robotic manipulation tasks are hindered by occlusions and limited fields of view, posing significant challenges for passive observation-based models that rely on fixed or wrist-mounted cameras. In this paper, we investigate the problem of robotic manipulation under limited visual observation and propose a task-driven asynchronous active vision-action model.Our model serially connects a camera Next-Best-View (NBV) policy with a gripper Next-Best Pose (NBP) policy, and trains them in a sensor-motor coordination framework using few-shot reinforcement learning. This approach allows the agent to adjust a third-person camera to actively observe the environment based on the task goal, and subsequently infer the appropriate manipulation actions.We trained and evaluated our model on 8 viewpoint-constrained tasks in RLBench. The results demonstrate that our model consistently outperforms baseline algorithms, showcasing its effectiveness in handling visual constraints in manipulation tasks.

cs.RO↗
arXiv2025

Device-aware Optical Adversarial Attack for a Portable Projector-camera System

Deep-learning-based face recognition (FR) systems are susceptible to adversarial examples in both digital and physical domains. Physical attacks present a greater threat to deployed systems as adversaries can easily access the input channel, allowing them to provide malicious inputs to impersonate a victim. This paper addresses the limitations of existing projector-camera-based adversarial light attacks in practical FR setups. By incorporating device-aware adaptations into the digital attack algorithm, such as resolution-aware and color-aware adjustments, we mitigate the degradation from digital to physical domains. Experimental validation showcases the efficacy of our proposed algorithm against real and spoof adversaries, achieving high physical similarity scores in FR models and state-of-the-art commercial systems. On average, there is only a 14% reduction in scores from digital to physical attacks, with high attack success rate in both white- and black-box scenarios.

cs.CV↗
arXiv2024

Unified Physical-Digital Face Attack Detection

Face Recognition (FR) systems can suffer from physical (i.e., print photo) and digital (i.e., DeepFake) attacks. However, previous related work rarely considers both situations at the same time. This implies the deployment of multiple models and thus more computational burden. The main reasons for this lack of an integrated model are caused by two factors: (1) The lack of a dataset including both physical and digital attacks with ID consistency which means the same ID covers the real face and all attack types; (2) Given the large intra-class variance between these two attacks, it is difficult to learn a compact feature space to detect both attacks simultaneously. To address these issues, we collect a Unified physical-digital Attack dataset, called UniAttackData. The dataset consists of $1,800$ participations of 2 and 12 physical and digital attacks, respectively, resulting in a total of 29,706 videos. Then, we propose a Unified Attack Detection framework based on Vision-Language Models (VLMs), namely UniAttackDetection, which includes three main modules: the Teacher-Student Prompts (TSP) module, focused on acquiring unified and specific knowledge respectively; the Unified Knowledge Mining (UKM) module, designed to capture a comprehensive feature space; and the Sample-Level Prompt Interaction (SLPI) module, aimed at grasping sample-level semantics. These three modules seamlessly form a robust unified attack detection framework. Extensive experiments on UniAttackData and three other datasets demonstrate the superiority of our approach for unified face attack detection.

cs.CV↗
arXiv2017

Establishing and storing of deterministic quantum entanglement among three distant atomic ensembles

It is crucial for physical realization of quantum information networks to first establish entanglement among multiple space-separated quantum memories and then at a user-controlled moment to transfer the stored entanglement to quantum channels for distribution and conveyance of information. Here we present an experimental demonstration on generation, storage and transfer of deterministic quantum entanglement among three spatially separated atomic ensembles. The off-line prepared multipartite entanglement of optical modes is mapped into three distant atomic ensembles to establish entanglement of atomic spin waves via electromagnetically-induced-transparency light-matter interaction. Then the stored atomic entanglement is transferred into a tripartite quadrature entangled state of light, which is space-separated and can be dynamically allocated to three quantum channels for conveying quantum information. The existence of entanglement among released three optical modes verifies that the system has capacity of preserving multipartite entanglement. The presented protocol can be directly extended to larger quantum networks with more nodes.

quant-ph↗
arXiv2017

Experimental generation of tripartite polarization entangled states of bright optical beams

The multipartite polarization entangled states of bright optical beams directly associating with the spin states of atomic ensembles are one of the essential resources in the future quantum information networks, which can be conveniently utilized to transfer and convert quantum states across a network composed of many atomic nodes. In this letter, we present the experimental demonstration of tripartite polarization entanglement described by Stokes operators of optical field. The tripartite entangled states of light at the frequency resonant with D1 line of Rubidium atoms are transformed into the continuous variable polarization entanglement among three bright optical beams via an optical beam splitter network. The obtained entanglement is confirmed by the extended criterion for polarization entanglement of multipartite quantized optical modes.

quant-ph↗
arXiv2010

Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order to take advantage of the strengths of each technique for analyzing various components. But the time to analyze a state-based component modeled by TA may be prohibitively high, due to the state space explosion problem. In this paper, we propose a framework of granularity-based interfacing to speed up the analysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granularities and then based on RTC theory, we derive lower and upper bounds on arrival patterns of the fine output streams using the causality closure algorithm. Our framework can help to achieve tradeoffs between precision and analysis time.

cs.PF↗
arXiv2010

Stacking Dependent Optical Conductivity of Bilayer Graphene

The optical conductivities of graphene layers are strongly dependent on their stacking orders. Our first-principle calculations show that while the optical conductivities of single layer graphene (SLG) and bilayer graphene (BLG) with Bernal stacking are almost frequency independent in the visible region, the optical conductivity of twisted bilayer graphene (TBG) is frequency dependent, giving rise to additional absorption features due to the band folding effect. Experimentally, we obtain from contrast spectra the optical conductivity profiles of BLG with different stacking geometries. Some TBG samples show additional features in their conductivity spectra in full agreement with our calculation results, while a few samples give universal conductivity values similar to that of SLG. We propose those variations of optical conductivity spectra of TBG samples originate from the difference between the commensurate and incommensurate stackings. Our results reveal that the optical conductivity measurements of graphene layers indeed provide an efficient way to select graphene films with desirable electronic and optical properties, which would great help the future application of those large scale misoriented graphene films in photonic devices.

cond-mat.mtrl-sci↗
arXiv2010

Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order to take advantage of the strengths of each technique for analyzing various components. But the time to analyze a state-based component modeled by TA may be prohibitively high, due to the state space explosion problem. In this paper, we propose a framework of granularity-based interfacing to speed up the analysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granularities and then based on RTC theory, we derive lower and upper bounds on arrival patterns of the fine output streams using the causality closure algorithm. Our framework can help to achieve tradeoffs between precision and analysis time.

cs.PF↗