arXiv subjects

Qi Zhao

Publications and source records attributed to Qi Zhao.

At least 109 records · Page 6Linked to original sources

arXiv2025

An Integrated AI-Enabled System Using One Class Twin Cross Learning (OCT-X) for Early Gastric Cancer Detection

Early detection of gastric cancer, a leading cause of cancer-related mortality worldwide, remains hampered by the limitations of current diagnostic technologies, leading to high rates of misdiagnosis and missed diagnoses. To address these challenges, we propose an integrated system that synergizes advanced hardware and software technologies to balance speed-accuracy. Our study introduces the One Class Twin Cross Learning (OCT-X) algorithm. Leveraging a novel fast double-threshold grid search strategy (FDT-GS) and a patch-based deep fully convolutional network, OCT-X maximizes diagnostic accuracy through real-time data processing and seamless lesion surveillance. The hardware component includes an all-in-one point-of-care testing (POCT) device with high-resolution imaging sensors, real-time data processing, and wireless connectivity, facilitated by the NI CompactDAQ and LabVIEW software. Our integrated system achieved an unprecedented diagnostic accuracy of 99.70%, significantly outperforming existing models by up to 4.47%, and demonstrated a 10% improvement in multirate adaptability. These findings underscore the potential of OCT-X as well as the integrated system in clinical diagnostics, offering a path toward more accurate, efficient, and less invasive early gastric cancer detection. Future research will explore broader applications, further advancing oncological diagnostics. Code is available at https://github.com/liu37972/Multirate-Location-on-OCT-X-Learning.git.

eess.IV↗

arXiv2025

Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations

Trotter and linear-combination-of-unitary (LCU) are two popular Hamiltonian simulation methods. We propose Hamiltonian simulation algorithms using LCU to compensate Trotter error, which enjoy both of their advantages. By adding few gates after the Kth-order Trotter, we realize a better time scaling than 2Kth-order Trotter. Our first algorithm exponentially improves the accuracy scaling of the Kth-order Trotter formula. In the second algorithm, we consider the detailed structure of Hamiltonians and construct LCU for Trotter errors with commutator scaling. Consequently, for lattice Hamiltonians, the algorithm enjoys almost linear system-size dependence and quadratically improves the accuracy of the Kth-order Trotter.

quant-ph↗

arXiv2025

Synthetic Video Enhances Physical Fidelity in Video Synthesis

We investigate how to enhance the physical fidelity of video generation models by leveraging synthetic videos derived from computer graphics pipelines. These rendered videos respect real-world physics, such as maintaining 3D consistency, and serve as a valuable resource that can potentially improve video generation models. To harness this potential, we propose a solution that curates and integrates synthetic data while introducing a method to transfer its physical realism to the model, significantly reducing unwanted artifacts. Through experiments on three representative tasks emphasizing physical consistency, we demonstrate its efficacy in enhancing physical fidelity. While our model still lacks a deep understanding of physics, our work offers one of the first empirical demonstrations that synthetic video enhances physical fidelity in video synthesis. Website: https://kevinz8866.github.io/simulation/

eess.IV↗

arXiv2025

ASP-VMUNet: Atrous Shifted Parallel Vision Mamba U-Net for Skin Lesion Segmentation

Skin lesion segmentation is a critical challenge in computer vision, and it is essential to separate pathological features from healthy skin for diagnostics accurately. Traditional Convolutional Neural Networks (CNNs) are limited by narrow receptive fields, and Transformers face significant computational burdens. This paper presents a novel skin lesion segmentation framework, the Atrous Shifted Parallel Vision Mamba UNet (ASP-VMUNet), which integrates the efficient and scalable Mamba architecture to overcome limitations in traditional CNNs and computationally demanding Transformers. The framework introduces an atrous scan technique that minimizes background interference and expands the receptive field, enhancing Mamba's scanning capabilities. Additionally, the inclusion of a Parallel Vision Mamba (PVM) layer and a shift round operation optimizes feature segmentation and fosters rich inter-segment information exchange. A supplementary CNN branch with a Selective-Kernel (SK) Block further refines the segmentation by blending local and global contextual information. Tested on four benchmark datasets (ISIC16/17/18 and PH2), ASP-VMUNet demonstrates superior performance in skin lesion segmentation, validated by comprehensive ablation studies. This approach not only advances medical image segmentation but also highlights the benefits of hybrid architectures in medical imaging technology. Our code is available at https://github.com/BaoBao0926/ASP-VMUNet/tree/main.

eess.IV↗

arXiv2025

DreamInsert: Zero-Shot Image-to-Video Object Insertion from A Single Image

Recent developments in generative diffusion models have turned many dreams into realities. For video object insertion, existing methods typically require additional information, such as a reference video or a 3D asset of the object, to generate the synthetic motion. However, inserting an object from a single reference photo into a target background video remains an uncharted area due to the lack of unseen motion information. We propose DreamInsert, which achieves Image-to-Video Object Insertion in a training-free manner for the first time. By incorporating the trajectory of the object into consideration, DreamInsert can predict the unseen object movement, fuse it harmoniously with the background video, and generate the desired video seamlessly. More significantly, DreamInsert is both simple and effective, achieving zero-shot insertion without end-to-end training or additional fine-tuning on well-designed image-video data pairs. We demonstrated the effectiveness of DreamInsert through a variety of experiments. Leveraging this capability, we present the first results for Image-to-Video object insertion in a training-free manner, paving exciting new directions for future content creation and synthesis. The code will be released soon.

cs.CV↗

arXiv2025

CameraCtrl II: Dynamic Scene Exploration via Camera-controlled Video Diffusion Models

This paper introduces CameraCtrl II, a framework that enables large-scale dynamic scene exploration through a camera-controlled video diffusion model. Previous camera-conditioned video generative models suffer from diminished video dynamics and limited range of viewpoints when generating videos with large camera movement. We take an approach that progressively expands the generation of dynamic scenes -- first enhancing dynamic content within individual video clip, then extending this capability to create seamless explorations across broad viewpoint ranges. Specifically, we construct a dataset featuring a large degree of dynamics with camera parameter annotations for training while designing a lightweight camera injection module and training scheme to preserve dynamics of the pretrained models. Building on these improved single-clip techniques, we enable extended scene exploration by allowing users to iteratively specify camera trajectories for generating coherent video sequences. Experiments across diverse scenarios demonstrate that CameraCtrl Ii enables camera-controlled dynamic scene synthesis with substantially wider spatial exploration than previous approaches.

cs.CV↗

arXiv2025

Entanglement-induced exponential advantage in amplitude estimation via state matrixization

Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing and underpins numerous quantum algorithms. In this work, we introduce a novel algorithmic framework for quantum amplitude estimation by transforming pure states into their matrix forms (Matrixization) and encoding them into non-diagonal blocks of density operators and diagonal blocks of unitary operators. Utilizing the construction details of state preparation circuits, we systematically reconstruct amplitude estimation algorithms within the novel matrixization framework through a technique known as channel block encoding. Compared with the standard approach, amplitude estimation through matrixization can have a different complexity that depends on the entanglement properties of the two quantum states. Specifically, our new algorithm can have exponentially smaller gate complexity when one of the two quantum states is prepared by a linear-depth quantum circuit that is below maximal entanglement under a certain bi-partition and the other state is maximally entangled. We later generalize this result to broader regimes and discuss implications. Our results demonstrate that the near-optimal performance of the standard amplitude estimation algorithm can be surpassed in specific cases.

quant-ph↗

arXiv2025

On Quantizing Neural Representation for Variable-Rate Video Coding

This work introduces NeuroQuant, a novel post-training quantization (PTQ) approach tailored to non-generalized Implicit Neural Representations for variable-rate Video Coding (INR-VC). Unlike existing methods that require extensive weight retraining for each target bitrate, we hypothesize that variable-rate coding can be achieved by adjusting quantization parameters (QPs) of pre-trained weights. Our study reveals that traditional quantization methods, which assume inter-layer independence, are ineffective for non-generalized INR-VC models due to significant dependencies across layers. To address this, we redefine variable-rate INR-VC as a mixed-precision quantization problem and establish a theoretical framework for sensitivity criteria aimed at simplified, fine-grained rate control. Additionally, we propose network-wise calibration and channel-wise quantization strategies to minimize quantization-induced errors, arriving at a unified formula for representation-oriented PTQ calibration. Our experimental evaluations demonstrate that NeuroQuant significantly outperforms existing techniques in varying bitwidth quantization and compression efficiency, accelerating encoding by up to eight times and enabling quantization down to INT2 with minimal reconstruction loss. This work introduces variable-rate INR-VC for the first time and lays a theoretical foundation for future research in rate-distortion optimization, advancing the field of video coding technology. The materials will be available at https://github.com/Eric-qi/NeuroQuant.

eess.IV↗

arXiv2025

Self-supervised Attribute-aware Dynamic Preference Ranking Alignment

Reinforcement Learning from Human Feedback and its variants excel in aligning with human intentions to generate helpful, harmless, and honest responses. However, most of them rely on costly human-annotated pairwise comparisons for supervised alignment, which is not suitable for list-level scenarios, such as community question answering. Additionally, human preferences are influenced by multiple intrinsic factors in responses, leading to decision-making inconsistencies. Therefore, we propose \textbf{Se}lf-supervised \textbf{A}ttribute-aware \textbf{d}ynamic \textbf{p}reference \textbf{ra}nking, called \shortname. \ It quantifies preference differences between responses based on Attribute-Perceptual Distance Factors (APDF) and dynamically determines the list-wise alignment order. Furthermore, it achieves fine-grained preference difference learning and enables precise alignment with the optimal one. We specifically constructed a challenging code preference dataset named StaCoCoQA, and introduced more cost-effective and scalable preference evaluation metrics: PrefHit and PrefRecall. Extensive experimental results show that SeAdpra exhibits superior performance and generalizability on both StaCoCoQA and preference datasets from eight popular domains.

cs.CL↗

arXiv2025

The Gas-to-Dust Ratio Investigation in the Massive Star-Forming region M17

M17 is a well-known massive star-forming region, and its Gas-to-Dust Ratio (GDR) may vary significantly compared to the other areas. The mass of gas can be traced by the ${\rm CO}$ emission observed in the \emph{Milky Way Imaging Scroll Painting (MWISP) project}. The dust mass can be traced by analyzing the interstellar extinction magnitude obtained from the \emph{United Kingdom Infrared Telescope (UKIRT)}. We computed the ratio ${W({\rm CO})/A_V}$: for ${A_V \le }$ 10 mag, ${{ W(^{12}{\rm CO})/ A_V}= (6.27 \pm 0.19)}$ ${\mathrm{{K \cdot km/s} \cdot mag^{-1}}}$ and ${{ W(^{13}{\rm CO})/ A_V} = (0.75 \pm 0.72)}$ ${ \mathrm{{K \cdot km/s} \cdot mag^{-1}}}$; whereas for ${{A_V} \ge 10}$ mag, ${{ W(^{12}{\rm CO})/ A_V} = (15.8 \pm 0.06) }$ ${\mathrm{{K \cdot km/s} \cdot mag^{-1}}}$ and ${{ W(^{13}{\rm CO})/ A_V} = (3.11 \pm 0.25)}$ ${ \mathrm{{K \cdot km/s} \cdot mag^{-1}}}$. Then, we converted the ${W({\rm CO})/A_V}$ into ${N(\rm H)/A_V}$. Using the WD01 model, we derived the GDR: for ${A_V \le }$ 10 mag, the GDRs were ${118 \pm 9}$ for ${^{12}{\rm CO}}$ and ${83 \pm 62}$ for ${^{13}{\rm CO}}$, comparable to those of the Milky Way; however, for ${A_V \ge }$ 10 mag, the GDRs increased significantly to ${296 \pm 3}$ for ${^{12}{\rm CO}}$ and ${387 \pm 40}$ for ${^{13}{\rm CO}}$, approximately three times higher than those of the Milky Way. In the discussion, we compared the results of this work with previous studies and provided a detailed discussion of the influence of massive stars and other factors on GDR.

astro-ph.GA↗

arXiv2025

Two measurement bases are asymptotically informationally complete for any pure state tomography

One of the fundamental questions in quantum information theory is to find how many measurement bases are required to obtain the full information of a quantum state. While a minimum of four measurement bases is typically required to determine an arbitrary pure state, we prove that for any states generated by finite-depth Clifford + T circuits, just two measurement bases are sufficient. More generally, we prove that two measurement bases are informationally complete for determining algebraic pure states whose state-vector elements represented in the computational basis are algebraic numbers. Since any pure state can be asymptotically approximated by a sequence of algebraic states with arbitrarily high precision, our scheme is referred to as asymptotically informationally complete for pure state tomography. Furthermore, existing works mostly construct the measurements using entangled bases. So far, the best result requires $O(n)$ local measurement bases for $n$-qubit pure-state tomography. Here, we show that two measurement bases that involve polynomial elementary gates are sufficient for uniquely determining sparse algebraic states. Moreover, we prove that two local measurement bases, involving single-qubit local operations only, are informationally complete for certain algebraic states, such as GHZ-like and W-like states. Besides, our two-measurement-bases scheme remains valid for mixed states with certain types of noises. We numerically test the uniqueness of the reconstructed states under two (local) measurement bases with and without measurement and depolarising types of noise. Our scheme provides a theoretical guarantee for pure state tomography in the fault-tolerant quantum computing regime.

quant-ph↗

arXiv2025

Enhancing Graph Representation Learning with Localized Topological Features

Representation learning on graphs is a fundamental problem that can be crucial in various tasks. Graph neural networks, the dominant approach for graph representation learning, are limited in their representation power. Therefore, it can be beneficial to explicitly extract and incorporate high-order topological and geometric information into these models. In this paper, we propose a principled approach to extract the rich connectivity information of graphs based on the theory of persistent homology. Our method utilizes the topological features to enhance the representation learning of graph neural networks and achieve state-of-the-art performance on various node classification and link prediction benchmarks. We also explore the option of end-to-end learning of the topological features, i.e., treating topological computation as a differentiable operator during learning. Our theoretical analysis and empirical study provide insights and potential guidelines for employing topological features in graph learning tasks.

cs.LG↗

arXiv2025

Detecting Defective Wafers Via Modular Networks

The growing availability of sensors within semiconductor manufacturing processes makes it feasible to detect defective wafers with data-driven models. Without directly measuring the quality of semiconductor devices, they capture the modalities between diverse sensor readings and can be used to predict key quality indicators (KQI, \textit{e.g.}, roughness, resistance) to detect faulty products, significantly reducing the capital and human cost in maintaining physical metrology steps. Nevertheless, existing models pay little attention to the correlations among different processes for diverse wafer products and commonly struggle with generalizability issues. To enable generic fault detection, in this work, we propose a modular network (MN) trained using time series stage-wise datasets that embodies the structure of the manufacturing process. It decomposes KQI prediction as a combination of stage modules to simulate compositional semiconductor manufacturing, universally enhancing faulty wafer detection among different wafer types and manufacturing processes. Extensive experiments demonstrate the usefulness of our approach, and shed light on how the compositional design provides an interpretable interface for more practical applications.

cs.LG↗

arXiv2024

Exponentially reduced circuit depths in Lindbladian simulation

Quantum computers can efficiently simulate Lindbladian dynamics, enabling powerful applications in open system simulation, thermal and ground-state preparation, autonomous quantum error correction, dissipative engineering, and more. Despite the abundance of well-established algorithms for closed-system dynamics, simulating open quantum systems on digital quantum computers remains challenging due to the intrinsic requirement for non-unitary operations. Existing methods face a critical trade-off: either relying on resource-intensive multi-qubit operations with experimentally challenging approaches or employing deep quantum circuits to suppress simulation errors using experimentally friendly methods. In this work, we challenge this perceived trade-off by proposing an efficient Lindbladian simulation framework that minimizes circuit depths while remaining experimentally accessible. Based on the incoherent linear combination of superoperators, our method achieves exponential reductions in circuit depth using at most two ancilla qubits and the straightforward Trotter decomposition of the process. Furthermore, our approach extends to simulate time-dependent Lindbladian dynamics, achieving logarithmic dependence on the inverse accuracy for the first time. Rigorous numerical simulations demonstrate clear advantages of our method over existing techniques. This work provides a practical and scalable solution for simulating open quantum systems on quantum devices.

quant-ph↗

arXiv2024

Is Your Text-to-Image Model Robust to Caption Noise?

In text-to-image (T2I) generation, a prevalent training technique involves utilizing Vision Language Models (VLMs) for image re-captioning. Even though VLMs are known to exhibit hallucination, generating descriptive content that deviates from the visual reality, the ramifications of such caption hallucinations on T2I generation performance remain under-explored. Through our empirical investigation, we first establish a comprehensive dataset comprising VLM-generated captions, and then systematically analyze how caption hallucination influences generation outcomes. Our findings reveal that (1) the disparities in caption quality persistently impact model outputs during fine-tuning. (2) VLMs confidence scores serve as reliable indicators for detecting and characterizing noise-related patterns in the data distribution. (3) even subtle variations in caption fidelity have significant effects on the quality of learned representations. These findings collectively emphasize the profound impact of caption quality on model performance and highlight the need for more sophisticated robust training algorithm in T2I. In response to these observations, we propose a approach leveraging VLM confidence score to mitigate caption noise, thereby enhancing the robustness of T2I models against hallucination in caption.

cs.CV↗

arXiv2024

Holistic Adversarially Robust Pruning

Neural networks can be drastically shrunk in size by removing redundant parameters. While crucial for the deployment on resource-constraint hardware, oftentimes, compression comes with a severe drop in accuracy and lack of adversarial robustness. Despite recent advances, counteracting both aspects has only succeeded for moderate compression rates so far. We propose a novel method, HARP, that copes with aggressive pruning significantly better than prior work. For this, we consider the network holistically. We learn a global compression strategy that optimizes how many parameters (compression rate) and which parameters (scoring connections) to prune specific to each layer individually. Our method fine-tunes an existing model with dynamic regularization, that follows a step-wise incremental function balancing the different objectives. It starts by favoring robustness before shifting focus on reaching the target compression rate and only then handles the objectives equally. The learned compression strategies allow us to maintain the pre-trained model natural accuracy and its adversarial robustness for a reduction by 99% of the network original size. Moreover, we observe a crucial influence of non-uniform compression across layers.

cs.LG↗

arXiv2024

CLIP-TNseg: A Multi-Modal Hybrid Framework for Thyroid Nodule Segmentation in Ultrasound Images

Thyroid nodule segmentation in ultrasound images is crucial for accurate diagnosis and treatment planning. However, existing methods face challenges in segmentation accuracy, interpretability, and generalization, which hinder their performance. This letter proposes a novel framework, CLIP-TNseg, to address these issues by integrating a multimodal large model with a neural network architecture. CLIP-TNseg consists of two main branches: the Coarse-grained Branch, which extracts high-level semantic features from a frozen CLIP model, and the Fine-grained Branch, which captures fine-grained features using U-Net style residual blocks. These features are fused and processed by the prediction head to generate precise segmentation maps. CLIP-TNseg leverages the Coarse-grained Branch to enhance semantic understanding through textual and high-level visual features, while the Fine-grained Branch refines spatial details, enabling precise and robust segmentation. Extensive experiments on public and our newly collected datasets demonstrate its competitive performance. Our code and the original dataset are available at https://github.com/jayxjsun/CLIP-TNseg.

cs.CV↗

arXiv2024

Detecting entanglement and nonlocality with minimum observable length

Quantum entanglement and nonlocality are foundational to quantum technologies, driving quantum computation, communication, and cryptography innovations. To benchmark the capabilities of these quantum techniques, efficient detection and accurate quantification methods are indispensable. This paper focuses on the concept of "detection length" -- a metric that quantifies the extent of measurement globality required to verify entanglement or nonlocality. We extend the detection length framework to encompass various entanglement categories and nonlocality phenomena, providing a comprehensive analytical model to determine detection lengths for specified forms of entanglement. Furthermore, we exploit semidefinite programming techniques to construct entanglement witnesses and Bell's inequalities tailored to specific minimal detection lengths, offering an upper bound for detection lengths in given states. By assessing the noise robustness of these witnesses, we demonstrate that witnesses with shorter detection lengths can exhibit superior performance under certain conditions.

quant-ph↗