arXiv subjects

Chao Zhou

Publications and source records attributed to Chao Zhou.

At least 91 records · Page 5Linked to original sources

arXiv2025

The waves-in-space Purcell effect for superconducting qubits

Quantum information processing, especially with quantum error correction, requires both long-lived qubits and fast, quantum non-demolition readout. In superconducting circuits this leads to the requirement to both strongly couple qubits, such as transmons, to readout modes while also protecting them from associated Purcell decay through the readout port. So-called Purcell filters can provide this protection, at the cost of significant increases in circuit components and complexity. However, as we demonstrate in this work, visualizing the qubit fields in space reveals locations where the qubit fields are strong and cavity fields weak; simply placing ports at these locations provides intrinsic Purcell protection. For a $λ/2$ readout mode in the `chip-in-tube' geometry, we show both millisecond level Purcell protection and, conversely, greatly enhanced Purcell decay (qubit lifetime of 1~$μ$s) simply by relocating the readout port. This method of integrating the Purcell protection into the qubit-cavity geometry can be generalized to other 3D implementations, such as post-cavities, as well as planar geometries. For qubit frequencies below the readout mode this effect is quite distinct from the multi-mode Purcell effect, which we demonstrate in a 3D-post geometry where we show both Purcell protection of the qubit while spoiling the quality factor of higher cavity harmonics to protect against dephasing due to stray photons in these modes.

quant-ph↗

arXiv2025

KVQ: Boosting Video Quality Assessment via Saliency-guided Local Perception

Video Quality Assessment (VQA), which intends to predict the perceptual quality of videos, has attracted increasing attention. Due to factors like motion blur or specific distortions, the quality of different regions in a video varies. Recognizing the region-wise local quality within a video is beneficial for assessing global quality and can guide us in adopting fine-grained enhancement or transcoding strategies. Due to the heavy cost of annotating region-wise quality, the lack of ground truth constraints from relevant datasets further complicates the utilization of local perception. Inspired by the Human Visual System (HVS) that links global quality to the local texture of different regions and their visual saliency, we propose a Kaleidoscope Video Quality Assessment (KVQ) framework, which aims to effectively assess both saliency and local texture, thereby facilitating the assessment of global quality. Our framework extracts visual saliency and allocates attention using Fusion-Window Attention (FWA) while incorporating a Local Perception Constraint (LPC) to mitigate the reliance of regional texture perception on neighboring areas. KVQ obtains significant improvements across multiple scenarios on five VQA benchmarks compared to SOTA methods. Furthermore, to assess local perception, we establish a new Local Perception Visual Quality (LPVQ) dataset with region-wise annotations. Experimental results demonstrate the capability of KVQ in perceiving local distortions. KVQ models and the LPVQ dataset will be available at https://github.com/qyp2000/KVQ.

cs.CV↗

arXiv2025

Rotatable Antennas for Integrated Sensing and Communications

In this letter, we propose to deploy rotatable antennas (RAs) at the base station (BS) to enhance both communication and sensing (C&S) performances, by exploiting a new spatial degree-of-freedom (DoF) offered by array rotation. Specifically, we formulate a multi-objective optimization problem to simultaneously maximize the sum-rate of multiple communication users and minimize the Cramér-Rao bound (CRB) for target angle estimation, by jointly optimizing the transmit beamforming vectors and the array rotation angle at the BS. To solve this problem, we first equivalently decompose it into two subproblems, corresponding to an inner problem for beamforming optimization and an outer problem for array rotation optimization. Although these two subproblems are non-convex, we obtain their high-quality solutions by applying the block coordinate descent (BCD) technique and one-dimensional exhaustive search, respectively. Moreover, we show that for the communication-only case, RAs provide an additional rotation gain to improve communication performance; while for the sensing-only case, the equivalent spatial aperture can be enlarged by RAs for achieving higher sensing accuracy. Finally, numerical results are presented to showcase the performance gains of RAs over fixed-rotation antennas in integrated sensing and communications (ISAC).

eess.SP↗

arXiv2025

Neural Network for Blind Unmixing: a novel MatrixConv Unmixing (MCU) Approach

Hyperspectral image (HSI) unmixing is a challenging research problem that tries to identify the constituent components, known as endmembers, and their corresponding proportions, known as abundances, in the scene by analysing images captured by hyperspectral cameras. Recently, many deep learning based unmixing approaches have been proposed with the surge of machine learning techniques, especially convolutional neural networks (CNN). However, these methods face two notable challenges: 1. They frequently yield results lacking physical significance, such as signatures corresponding to unknown or non-existent materials. 2. CNNs, as general-purpose network structures, are not explicitly tailored for unmixing tasks. In response to these concerns, our work draws inspiration from double deep image prior (DIP) techniques and algorithm unrolling, presenting a novel network structure that effectively addresses both issues. Specifically, we first propose a MatrixConv Unmixing (MCU) approach for endmember and abundance estimation, respectively, which can be solved via certain iterative solvers. We then unroll these solvers to build two sub-networks, endmember estimation DIP (UEDIP) and abundance estimation DIP (UADIP), to generate the estimation of endmember and abundance, respectively. The overall network is constructed by assembling these two sub-networks. In order to generate meaningful unmixing results, we also propose a composite loss function. To further improve the unmixing quality, we also add explicitly a regularizer for endmember and abundance estimation, respectively. The proposed methods are tested for effectiveness on both synthetic and real datasets.

eess.IV↗

arXiv2025

Learning Surrogate Potential Mean Field Games via Gaussian Processes: A Data-Driven Approach to Ill-Posed Inverse Problems

Mean field games (MFGs) describe the collective behavior of large populations of interacting agents. In this work, we tackle ill-posed inverse problems in potential MFGs, aiming to recover the agents' population, momentum, and environmental setup from limited, noisy measurements and partial observations. These problems are ill-posed because multiple MFG configurations can explain the same data, or different parameters can yield nearly identical observations. Nonetheless, they remain crucial in practice for real-world scenarios where data are inherently sparse or noisy, or where the MFG structure is not fully determined. Our focus is on finding surrogate MFGs that accurately reproduce the observed data despite these challenges. We propose two Gaussian process (GP)-based frameworks: an inf-sup formulation and a bilevel approach. The choice between them depends on whether the unknown parameters introduce concavity in the objective. In the inf-sup framework, we use the linearity of GPs and their parameterization structure to maintain convex-concave properties, allowing us to apply standard convex optimization algorithms. In the bilevel framework, we employ a gradient-descent-based algorithm and introduce two methods for computing the outer gradient. The first method leverages an existing solver for the inner potential MFG and applies automatic differentiation, while the second adopts an adjoint-based strategy that computes the outer gradient independently of the inner solver. Our numerical experiments show that when sufficient prior information is available, the unknown parameters can be accurately recovered. Otherwise, if prior information is limited, the inverse problem is ill-posed, but our frameworks can still produce surrogate MFG models that closely match observed data.

cs.LG↗

arXiv2025

Secure Information Embedding in Forensic 3D Fingerprinting

Printer fingerprinting techniques have long played a critical role in forensic applications, including the tracking of counterfeiters and the safeguarding of confidential information. The rise of 3D printing technology introduces significant risks to public safety, enabling individuals with internet access and consumer-grade 3D printers to produce untraceable firearms, counterfeit products, and more. This growing threat calls for a better mechanism to track the production of 3D-printed parts. Inspired by the success of fingerprinting on traditional 2D printers, we introduce SIDE (\textbf{S}ecure \textbf{I}nformation Embe\textbf{D}ding and \textbf{E}xtraction), a novel fingerprinting framework tailored for 3D printing. SIDE addresses the adversarial challenges of 3D print forensics by offering both secure information embedding and extraction. First, through novel coding-theoretic techniques, SIDE is both~\emph{break-resilient} and~\emph{loss-tolerant}, enabling fingerprint recovery even if the adversary breaks the print into fragments and conceals a portion of them. Second, SIDE further leverages Trusted Execution Environments (TEE) to secure the fingerprint embedding process.

cs.CR↗

arXiv2025

Theoretical lower limit of coercive field in ferroelectric hafnia

The high coercive field ($E_c$) of hafnia-based ferroelectrics presents a major obstacle to their applications. The ferroelectric switching mechanisms in hafnia that dictate $E_c$, especially those related to domain nucleation in the Nucleation-Limited-Switching (NLS) model and domain wall motion in the Kolmogorov-Avrami-Ishibas (KAI) model, have remained elusive. We develop a deep-learning-assisted multiscale approach, incorporating atomistic insights into the critical nucleus, to predict both NLS- and KAI-type coercive fields. The theoretical NLS-type $E_c$ values agree with previous experimental results as well as our own measurements and also exhibit the correct thickness scaling for films between 3 and 20 nm. Combined theoretical and experimental investigations reveal that the giant $E_c$ in hafnia-based ferroelectrics arises from the ultra-thin geometry, which confines switching to the NLS mechanism. We predict that the theoretical lower limit for KAI-type $E_c$ is 0.1 MV/cm arsing from mobile domain walls. The activation of KAI-type switching to achieve lower $E_c$ is supported by our experimental demonstration of a low coercive field of 1 MV/cm in a 60 nm ferroelectric (HfO$_2$)$_n$/(ZrO$_2$)$_n$ ($n=3$ unit cells) superlattices. These findings establish a comprehensive framework for understanding ferroelectric switching in hafnia and highlight the potential of geometry and domain-wall engineering to achieve low-$E_c$ devices.

cond-mat.mtrl-sci↗

arXiv2025

Visual Autoregressive Modeling for Image Super-Resolution

Image Super-Resolution (ISR) has seen significant progress with the introduction of remarkable generative models. However, challenges such as the trade-off issues between fidelity and realism, as well as computational complexity, have also posed limitations on their application. Building upon the tremendous success of autoregressive models in the language domain, we propose \textbf{VARSR}, a novel visual autoregressive modeling for ISR framework with the form of next-scale prediction. To effectively integrate and preserve semantic information in low-resolution images, we propose using prefix tokens to incorporate the condition. Scale-aligned Rotary Positional Encodings are introduced to capture spatial structures and the diffusion refiner is utilized for modeling quantization residual loss to achieve pixel-level fidelity. Image-based Classifier-free Guidance is proposed to guide the generation of more realistic images. Furthermore, we collect large-scale data and design a training process to obtain robust generative priors. Quantitative and qualitative results show that VARSR is capable of generating high-fidelity and high-realism images with more efficiency than diffusion-based methods. Our codes will be released at https://github.com/qyp2000/VARSR.

cs.CV↗

arXiv2025

©Plug-in Authorization for Human Content Copyright Protection in Text-to-Image Model

This paper addresses the contentious issue of copyright infringement in images generated by text-to-image models, sparking debates among AI developers, content creators, and legal entities. State-of-the-art models create high-quality content without crediting original creators, causing concern in the artistic community. To mitigate this, we propose the ©Plug-in Authorization framework, introducing three operations: addition, extraction, and combination. Addition involves training a ©plug-in for specific copyright, facilitating proper credit attribution. Extraction allows creators to reclaim copyright from infringing models, and combination enables users to merge different ©plug-ins. These operations act as permits, incentivizing fair use and providing flexibility in authorization. We present innovative approaches,"Reverse LoRA" for extraction and "EasyMerge" for seamless combination. Experiments in artist-style replication and cartoon IP recreation demonstrate ©plug-ins' effectiveness, offering a valuable solution for human copyright protection in the age of generative AIs. The code is available at https://github.com/zc1023/-Plug-in-Authorization.git.

cs.AI↗

arXiv2025

Fatigue-free ferroelectricity in Hf0.5Zr0.5O2 ultrathin films via interfacial design

Due to traits of CMOS compatibility and scalability, HfO2-based ferroelectrics are promising candidates for next-generation memory devices. However, their commercialization has been greatly hindered by reliability issues, with fatigue being a major impediment. We report the fatigue-free behavior in interface-designed Hf0.5Zr0.5O2-based heterostructures. A coherent CeO2-x/Hf0.5Zr0.5O2 heterointerface is constructed, wherein CeO2-x acts as an oxygen sponge, capable of reversibly accepting and releasing oxygen vacancies. This design effectively alleviates defect aggregation at the electrode-ferroelectric interface, enabling improved switching characteristics. Further, a symmetric capacitor architecture is designed to minimize the imprint, thereby suppressing the cycling-induced oriented defect drift. The two-pronged technique mitigates oxygen-voltammetry-generated chemical/energy fluctuations, suppressing the formation of paraelectric phase and polarization degradation. The design ensures a fatigue-free feature exceeding 10^11 switching cycles and an endurance lifetime surpassing 10^12 cycles for Hf0.5Zr0.5O2-based capacitors, along with excellent temperature stability and retention. These findings pave the way for developing ultra-stable hafnia-based ferroelectric devices.

cond-mat.mtrl-sci↗

arXiv2024

Plug-and-Play Tri-Branch Invertible Block for Image Rescaling

High-resolution (HR) images are commonly downscaled to low-resolution (LR) to reduce bandwidth, followed by upscaling to restore their original details. Recent advancements in image rescaling algorithms have employed invertible neural networks (INNs) to create a unified framework for downscaling and upscaling, ensuring a one-to-one mapping between LR and HR images. Traditional methods, utilizing dual-branch based vanilla invertible blocks, process high-frequency and low-frequency information separately, often relying on specific distributions to model high-frequency components. However, processing the low-frequency component directly in the RGB domain introduces channel redundancy, limiting the efficiency of image reconstruction. To address these challenges, we propose a plug-and-play tri-branch invertible block (T-InvBlocks) that decomposes the low-frequency branch into luminance (Y) and chrominance (CbCr) components, reducing redundancy and enhancing feature processing. Additionally, we adopt an all-zero mapping strategy for high-frequency components during upscaling, focusing essential rescaling information within the LR image. Our T-InvBlocks can be seamlessly integrated into existing rescaling models, improving performance in both general rescaling tasks and scenarios involving lossy compression. Extensive experiments confirm that our method advances the state of the art in HR image reconstruction.

eess.IV↗

arXiv2024

Retrieval Augmented Image Harmonization

When embedding objects (foreground) into images (background), considering the influence of photography conditions like illumination, it is usually necessary to perform image harmonization to make the foreground object coordinate with the background image in terms of brightness, color, and etc. Although existing image harmonization methods have made continuous efforts toward visually pleasing results, they are still plagued by two main issues. Firstly, the image harmonization becomes highly ill-posed when there are no contents similar to the foreground object in the background, making the harmonization results unreliable. Secondly, even when similar contents are available, the harmonization process is often interfered with by irrelevant areas, mainly attributed to an insufficient understanding of image contents and inaccurate attention. As a remedy, we present a retrieval-augmented image harmonization (Raiha) framework, which seeks proper reference images to reduce the ill-posedness and restricts the attention to better utilize the useful information. Specifically, an efficient retrieval method is designed to find reference images that contain similar objects as the foreground while the illumination is consistent with the background. For training the Raiha framework to effectively utilize the reference information, a data augmentation strategy is delicately designed by leveraging existing non-reference image harmonization datasets. Besides, the image content priors are introduced to ensure reasonable attention. With the presented Raiha framework, the image harmonization performance is greatly boosted under both non-reference and retrieval-augmented settings. The source code and pre-trained models will be publicly available.

cs.CV↗

arXiv2024

Half-integer Topological Defects Paired via String Micelles in Polar Liquids

Ferroelectric nematic (NF) liquid crystals present a compelling platform for exploring topological defects in polar fields, while their structural properties can be significantly altered by ionic doping. In this study, we demonstrate that doping the ferroelectric nematic material RM734 with cationic polymers enable the formation of polymeric micelles that connect pairs of half-integer topological defects. Polarizing optical microscopy reveals that these string defects exhibit butterfly textures, featured with a two-dimensional polarization field divided by Néel-type kink-walls into domains exhibiting either uniform polarization or negative splay and bend deformations. Through analysis of electrophoretic motion and direct measurements of polarization divergences, we show that the string micelles are positively charged and their side regions exhibit positive bound charges. To elucidate these observations, we propose a charge double layer model for the string defects: the positive charged cationic polymer chains and densely packed RM734 molecules form a Stern charge layer, while small anionic ions and positive bound charges constitute the charge diffusion layer. Notably, our experiments indicate that only cationic polymer doping effectively induces the formation of these unique string defects. These findings enhance our understanding of ionic doping effects and provide valuable insights for engineering polar topologies in liquid crystal systems.

cond-mat.soft↗

arXiv2024

Learning Spatially Decoupled Color Representations for Facial Image Colorization

Image colorization methods have shown prominent performance on natural images. However, since humans are more sensitive to faces, existing methods are insufficient to meet the demands when applied to facial images, typically showing unnatural and uneven colorization results. In this paper, we investigate the facial image colorization task and find that the problems with facial images can be attributed to an insufficient understanding of facial components. As a remedy, by introducing facial component priors, we present a novel facial image colorization framework dubbed FCNet. Specifically, we learn a decoupled color representation for each face component (e.g., lips, skin, eyes, and hair) under the guidance of face parsing maps. A chromatic and spatial augmentation strategy is presented to facilitate the learning procedure, which requires only grayscale and color facial image pairs. After training, the presented FCNet can be naturally applied to facial image colorization with single or multiple reference images. To expand the application paradigms to scenarios with no reference images, we further train two alternative modules, which predict the color representations from the grayscale input or a random seed, respectively. Extensive experiments show that our method can perform favorably against existing methods in various application scenarios (i.e., no-, single-, and multi-reference facial image colorization). The source code and pre-trained models will be publicly available.

cs.CV↗

arXiv2024

Linear-Quadratic Mean Field Control with Non-Convex Data

In this manuscript, we study a class of linear-quadratic (LQ) mean field control problems with a common noise and their corresponding $N$-particle systems. The mean field control problems considered are not standard LQ mean field control problems in the sense that their dependence on the mean field terms can be non-linear and non-convex. Therefore, all the existing methods to deal with LQ mean field control problems fail. The key idea to solve our LQ mean field control problem is to utilize the common noise. We first prove the global well-posedness of the corresponding Hamilton-Jacobi equations via the non-degeneracy of the common noise. In contrast to the LQ mean field games master equations, the Hamilton-Jacobi equations for the LQ mean field control problems can not be reduced to finite-dimensional PDEs. We then globally solve the Hamilton-Jacobi equations for $N$-particle systems. As byproducts, we derive the optimal quantitative convergence results from the $N$-particle systems to the mean field control problem and the propagation of chaos property for the related optimal trajectories. This paper extends the results in [{\sc M. Li, C. Mou, Z. Wu and C. Zhou}, \emph{Trans. Amer. Math. Soc.}, 376(06) (2023), pp.~4105--4143] to the LQ mean field control problems.

math.OC↗

arXiv2024

CPGA: Coding Priors-Guided Aggregation Network for Compressed Video Quality Enhancement

Recently, numerous approaches have achieved notable success in compressed video quality enhancement (VQE). However, these methods usually ignore the utilization of valuable coding priors inherently embedded in compressed videos, such as motion vectors and residual frames, which carry abundant temporal and spatial information. To remedy this problem, we propose the Coding Priors-Guided Aggregation (CPGA) network to utilize temporal and spatial information from coding priors. The CPGA mainly consists of an inter-frame temporal aggregation (ITA) module and a multi-scale non-local aggregation (MNA) module. Specifically, the ITA module aggregates temporal information from consecutive frames and coding priors, while the MNA module globally captures spatial information guided by residual frames. In addition, to facilitate research in VQE task, we newly construct the Video Coding Priors (VCP) dataset, comprising 300 videos with various coding priors extracted from corresponding bitstreams. It remedies the shortage of previous datasets on the lack of coding information. Experimental results demonstrate the superiority of our method compared to existing state-of-the-art methods. The code and dataset will be released at https://github.com/VQE-CPGA/CPGA.git .

eess.IV↗

arXiv2024

Paraphrase Identification with Deep Learning: A Review of Datasets and Methods

The rapid progress of Natural Language Processing (NLP) technologies has led to the widespread availability and effectiveness of text generation tools such as ChatGPT and Claude. While highly useful, these technologies also pose significant risks to the credibility of various media forms if they are employed for paraphrased plagiarism -- one of the most subtle forms of content misuse in scientific literature and general text media. Although automated methods for paraphrase identification have been developed, detecting this type of plagiarism remains challenging due to the inconsistent nature of the datasets used to train these methods. In this article, we examine traditional and contemporary approaches to paraphrase identification, investigating how the under-representation of certain paraphrase types in popular datasets, including those used to train Large Language Models (LLMs), affects the ability to detect plagiarism. We introduce and validate a new refined typology for paraphrases (ReParaphrased, REfined PARAPHRASE typology definitions) to better understand the disparities in paraphrase type representation. Lastly, we propose new directions for future research and dataset development to enhance AI-based paraphrase detection.

cs.CL↗

arXiv2024

OAPT: Offset-Aware Partition Transformer for Double JPEG Artifacts Removal

Deep learning-based methods have shown remarkable performance in single JPEG artifacts removal task. However, existing methods tend to degrade on double JPEG images, which are prevalent in real-world scenarios. To address this issue, we propose Offset-Aware Partition Transformer for double JPEG artifacts removal, termed as OAPT. We conduct an analysis of double JPEG compression that results in up to four patterns within each 8x8 block and design our model to cluster the similar patterns to remedy the difficulty of restoration. Our OAPT consists of two components: compression offset predictor and image reconstructor. Specifically, the predictor estimates pixel offsets between the first and second compression, which are then utilized to divide different patterns. The reconstructor is mainly based on several Hybrid Partition Attention Blocks (HPAB), combining vanilla window-based self-attention and sparse attention for clustered pattern features. Extensive experiments demonstrate that OAPT outperforms the state-of-the-art method by more than 0.16dB in double JPEG image restoration task. Moreover, without increasing any computation cost, the pattern clustering module in HPAB can serve as a plugin to enhance other transformer-based image restoration methods. The code will be available at https://github.com/QMoQ/OAPT.git .

eess.IV↗