Source author record

Zhe Yang

Zhe Yang appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

17works
11topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

17 published item(s)

preprint2026arXiv

Towards Generalized Image Manipulation Localization via Score-based Model

With the rapid evolution of synthetic media, Image Manipulation Localization (IML) has emerged as a critical component in multimedia forensics for ensuring the integrity of digital content. However, generalization remains a core challenge, as existing discriminative methods typically learn a fixed decision boundary that tends to overfit to specific training artifacts and fails to adapt to unseen manipulation types. To address this, we propose DiffIML, a novel framework that introduces score-based generative modeling to IML. Diverging from the direct estimation of hard boundaries, DiffIML approximates the score function, the gradient of the log-likelihood, to capture the intrinsic geometric topology of mask distributions. This paradigm leverages structural priors to iteratively recover coherent masks from noise, thereby circumventing the brittleness associated with discriminative models. Under this formulation, diffusion models serve as an effective numerical solver for the learned score function.To ensure practicality, we respectively resolve the efficiency and stability bottlenecks of standard diffusion by: (1) utilizing a Lightweight Mask-Specific VAE for fast latent-space process and a decoupled architecture with a lightweight denoising UNet, (2) edge supervision and error prior to mitigate error accumulation during sampling. Extensive experiments of two distinct protocols on eight non-generative and three generative benchmarks demonstrate that DiffIML consistently outperforms state-of-the-art methods, yielding remarkable generalization improvements on diverse unseen datasets. The code will be publicly available.

preprint2022arXiv

Entanglement Wedge Minimum Cross-Section in Holographic Axion Gravity Theories

We study the mixed state entanglement properties in two holographic axion models by examining the behavior of the entanglement wedge minimum cross section (EWCS), and comparing it with the holographic entanglement entropy (HEE) and mutual information (MI). We find that the behavior of HEE, MI and EWCS with Hawking temperature is monotonic, while the behavior with the axion parameter $k$ is more rich, which depends on the size of the configuration and the values of the other two parameters. Interestingly, the EWCS monotonically increases with the coupling constant $κ$ between the axion field and the Maxwell field, while HEE and MI can be non-monotonic. It suggests that the EWCS, as a mixed state entanglement measure, captures distinct degrees of freedom from the HEE and MI indeed. We also provide analytical understandings for most of the numerical results.

preprint2022arXiv

Mixed State Entanglement For Holographic Systems With A Scalar Hair

We study the mixed state entanglement of an asymptotic AdS black hole system with scalar hair. Through numerical calculations, we find that the holographic entanglement entropy (HEE) presents a non-monotonic behavior with the system parameter, depending on the size of the subregion. In addition, the mutual information (MI) also shows non-monotonic behavior in certain ranges of system parameters. However, the entanglement wedge minimum cross-section (EWCS), which is a mixed state entanglement measure, increases monotonically with the AdS radius; meanwhile, shows non-monotonic with the temperature. We also give analytical understandings of the phenomena above.

preprint2022arXiv

Scenario Generation for Cooling, Heating, and Power Loads Using Generative Moment Matching Networks

Scenario generations of cooling, heating, and power loads are of great significance for the economic operation and stability analysis of integrated energy systems. In this paper, a novel deep generative network is proposed to model cooling, heating, and power load curves based on a generative moment matching networks (GMMN) where an auto-encoder transforms high-dimensional load curves into low-dimensional latent variables and the maximum mean discrepancy represents the similarity metrics between the generated samples and the real samples. After training the model, the new scenarios are generated by feeding Gaussian noises to the scenario generator of the GMMN. Unlike the explicit density models, the proposed GMMN does not need to artificially assume the probability distribution of the load curves, which leads to stronger universality. The simulation results show that the GMMN not only fits the probability distribution of multi-class load curves well, but also accurately captures the shape (e.g., large peaks, fast ramps, and fluctuation), frequency-domain characteristics, and temporal-spatial correlations of cooling, heating, and power loads. Furthermore, the energy consumption of generated samples closely resembles that of real samples.

preprint2022arXiv

Short-Term Power Prediction for Renewable Energy Using Hybrid Graph Convolutional Network and Long Short-Term Memory Approach

Accurate short-term solar and wind power predictions play an important role in the planning and operation of power systems. However, the short-term power prediction of renewable energy has always been considered a complex regression problem, owing to the fluctuation and intermittence of output powers and the law of dynamic change with time due to local weather conditions, i.e. spatio-temporal correlation. To capture the spatio-temporal features simultaneously, this paper proposes a new graph neural network-based short-term power forecasting approach, which combines the graph convolutional network (GCN) and long short-term memory (LSTM). Specifically, the GCN is employed to learn complex spatial correlations between adjacent renewable energies, and the LSTM is used to learn dynamic changes of power generation curves. The simulation results show that the proposed hybrid approach can model the spatio-temporal correlation of renewable energies, and its performance outperforms popular baselines on real-world datasets.

preprint2020arXiv

Instant Ghost Imaging: Algorithm and On-chip Implementation

Ghost imaging (GI) is an imaging technique that uses the correlation between two light beams to reconstruct the image of an object. Conventional GI algorithms require large memory space to store the measured data and perform complicated offline calculations, limiting practical applications of GI. Here we develop an instant ghost imaging (IGI) technique with a differential algorithm and an implemented high-speed on-chip IGI hardware system. This algorithm uses the signal between consecutive temporal measurements to reduce the memory requirements without degradation of image quality compared with conventional GI algorithms. The on-chip IGI system can immediately reconstruct the image once the measurement finishes; there is no need to rely on post-processing or offline reconstruction. This system can be developed into a realtime imaging system. These features make IGI a faster, cheaper, and more compact alternative to a conventional GI system and make it viable for practical applications of GI.

preprint2020arXiv

Instant ghost imaging: improving robustness for ghost imaging subject to optical background noise

Ghost imaging (GI) is an imaging technique that uses the second-order correlation between two light beams to obtain the image of an object. However, standard GI is affected by optical background noise, which reduces its practical use. We investigated the robustness of an instant ghost imaging (IGI) algorithm against optical background noise and compare it with the conventional GI algorithm. Our results show that IGI is extremely resistant to spatiotemporally varying optical background noise that can change over a large range. When the noise is large in relation to the signal, IGI will still perform well in conditions that prevent the conventional GI algorithm from generating an image because IGI uses signal differences for imaging. Signal differences are intrinsically resistant to common noise modes, so the IGI algorithm is strongly robust against noise. This research is of great significance for the practical application of GI.

preprint2020arXiv

Instant single-pixel imaging: on-chip real-time implementation based on instant ghost imaging algorithm

Single-pixel imaging (SPI) uses a single-pixel detector to create an image of an object. SPI relies on a computer to construct an image, thus increasing both the size and cost of SPI and limiting its application. We developed instant single-pixel imaging (ISPI), an on-chip SPI system that implements real-time imaging at a rate of 25 fps. ISPI uses the instant ghost imaging algorithm we proposed which leverages signal differences for image creation. It does not require a computer, which greatly reduces its cost and size. The reconstruct time of ISPI for image creation is almost zero because little processing is required after signal detection. ISPI paves the way for the practical application of SPI.

preprint2016arXiv

Architectures of Soft Robotic Locomotion Enabled by Simple Mechanical Principles

In nature, a variety of limbless locomotion patterns flourish from the small or basic life form (Escherichia coli, the amoeba, etc.) to the large or intelligent creatures (e.g., slugs, starfishes, earthworms, octopuses, jellyfishes, and snakes). Many bioinspired soft robots based on locomotion have been developed in the past decades. In this work, based on the kinematics and dynamics of two representative locomotion modes (i.e., worm-like crawling and snake-like slithering), we propose a broad set of innovative designs for soft mobile robots through simple mechanical principles. Inspired by and go beyond existing biological systems, these designs include 1-D (dimensional), 2-D, and 3-D robotic locomotion patterns enabled by simple actuation of continuous beams. We report herein over 20 locomotion modes achieving various locomotion functions, including crawling, rising, running, creeping, squirming, slithering, swimming, jumping, turning, turning over, helix rolling, wheeling, etc. Some of them are able to reach high speed, high efficiency, and overcome obstacles. All these locomotion strategies and functions can be integrated into a simple beam model. The proposed simple and robust models are adaptive for severe and complex environments. These elegant designs for diverse robotic locomotion patterns are expected to underpin future deployments of soft robots and to inspire series of advanced designs.

preprint2015arXiv

On Anticipated backward stochastic differential equations with Markov chain noise

In 2013, Lu and Ren \cite {luren} considered anticipated backward stochastic differential equations driven by finite state, continuous time Markov chain noise and established the existence and uniqueness of the solutions of these equations and a scalar comparison theorem. In this paper, we provide an estimate for their solutions and study the duality between these equations and stochastic differential delayed equations with Markov chain noise. Finally we derive another comparison theorem for these solutions depending only on the two drivers.

preprint2015arXiv

Reflected Backward Stochastic Differential Equations for a Finite State Markov Chain Model and Applications to American Options

In this paper, we introduce a new kind of reflected backward stochastic differential equations (RBSDEs) driven by a martingale, in a Markov chain model, but not driven by Brownian motion, and give existence and uniqueness results for the new equations. Then we discuss American options in a finite state Markov chain model, in the presence of a stochastic discount function (SDF) and using the theory of the new RBSDEs. We show that there exists a constrained super-hedging strategy for an American option, which is unique in our framework as the solution to an RBSDE.

preprint2015arXiv

Some Properties of Reflected Backward Stochastic Differential Equations for a Finite State Markov Chain Model

In this paper, we provide an estimate for the solutions of reflected backward stochastic differential equations (RBSDEs) driven by a Markov chain, derive a continuous dependence property for their solutions with respect to the parameters of the equations, and show similar properties for solutions of backward stochastic differential equations (BSDEs). We finally establish a comparison result for the solutions of RBSDEs driven by a Markov chain.

preprint2015arXiv

Transfer of high-dimensional quantum state through an XXZ-Heisenberg quantum spin chain

We propose and analyze an efficient high-dimensional quantum state transfer scheme through an $XXZ$-Heisenberg spin chain in an inhomogeneous magnetic field. By the use of a combination of coherent quantum coupling and free spin-wave approximation, pure unitary evolution results in a perfect high-dimensional swap operation between two remote quantum registers mediated by a uniform quantum data bus, and the feasibility is confirmed by numerical simulations. Also, we observe that either the strong $z$-directional coupling or high quantum spin number can partly suppress the thermal excitations and protect quantum information from the thermal noises when the quantum data bus is in the thermal equilibrium state.

preprint2014arXiv

Backward Stochastic Differential Equations with Continuous Coefficients in a Markov Chain Model and with Applications to European Options

In this paper we discuss backward stochastic differential equations with Markov chain noise, having continuous drivers. We obtain the existence of a solution which is possibly not unique. Moreover, we show there is a minimal solution for this kind of equation and derive the corresponding comparison result. This is applied to pricing of European options in a market with Markov chain noise.

preprint2014arXiv

Comparison and converse comparison theorems for backward stochastic differential equations with Markov chain noise

Comparison and converse comparison theorems are important parts of the research on backward stochastic differential equations. In this paper, we obtain comparison results for one dimensional backward stochastic differential equations with Markov chain noise, extending and generalizing previous work under natural and simplified hypotheses, and establish a converse comparison theorem for the same type of equation after giving the definition and properties of a type of nonlinear expectation: $f$-expectation.

preprint2014arXiv

Realistic Interpretation of Quantum Mechanics and Encounter-Delayed-Choice Experiment

A realistic interpretation(REIN) of wave function in quantum mechanics is briefly presented in this work. In REIN, the wave function of a microscopic object is just its real existence rather than a mere mathematical description. Quantum object can exist in disjoint regions of space which just as the wave function distributes, travels at a finite speed, and collapses instantly upon a measurement. The single photon interference in a Mach-Zehnder interferometer is analyzed using REIN. In particular, we proposed and experimentally implemented a generalized delayed-choice experiment, the encounter-delayed-choice(EDC) experiment, in which the second beam splitter is inserted at the encounter of the two sub-waves from the two arms. In the EDC experiment, the front parts of wave functions before the beam splitter insertion do not interfere and show the particle nature, and the back parts of the wave functions will interfere and show a wave nature. The predicted phenomenon is clearly demonstrated in the experiment, and supports the REIN idea.

preprint2009arXiv

Anticipated backward stochastic differential equations

In this paper we discuss new types of differential equations which we call anticipated backward stochastic differential equations (anticipated BSDEs). In these equations the generator includes not only the values of solutions of the present but also the future. We show that these anticipated BSDEs have unique solutions, a comparison theorem for their solutions, and a duality between them and stochastic differential delay equations.