Researcher profile

Ce Wang

Ce Wang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
9works
0followers
13topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

9 published item(s)

preprint2026arXiv

SlimDiffSR: Toward Lightweight and Efficient Remote Sensing Image Super-Resolution via Diffusion Model Distillation

Diffusion models have recently achieved remarkable performance in image super-resolution (SR), but their high computational cost limits practical deployment in remote sensing applications. To address this issue, we propose SlimDiffSR, a lightweight and efficient diffusion-based framework for real-world remote sensing image super-resolution. Unlike existing single-step diffusion methods that rely on fixed timesteps, we first introduce an uncertainty-guided timestep assignment strategy to construct a stronger single-step teacher model, where reconstruction difficulty is explicitly linked to diffusion timesteps, enabling adaptive generative strength. Building upon this teacher, we further present a structured pruning strategy tailored to remote sensing imagery, which systematically removes redundant semantic modules and replaces standard operations with lightweight designs, including frequency-separable convolution, direction-separable convolution, and a query-driven global aggregation module. These components explicitly exploit the unique characteristics of remote sensing data, such as sparse high-frequency details, strong directional patterns, and long-range spatial dependencies. To enhance knowledge transfer, we incorporate Maximum Mean Discrepancy (MMD) into the distillation process to align feature distributions between the teacher and student models. Extensive experiments on multiple remote sensing benchmarks demonstrate that SlimDiffSR achieves a favorable balance between efficiency and reconstruction quality. In particular, it attains up to $200\times$ inference acceleration and a $20\times$ reduction in model parameters compared with multi-step diffusion models, while achieving competitive perceptual quality and clearly outperforming existing lightweight diffusion baselines in efficiency. The code is available at: https://github.com/wwangcece/SlimDiffSR.

preprint2026arXiv

Unsupervised Topological Phase Discovery in Periodically Driven Systems via Floquet-Bloch State

Floquet engineering offers an unparalleled platform for realizing novel non-equilibrium topological phases. However, the unique structure of Floquet systems, which includes multiple quasienergy gaps, poses a significant challenge to classification using conventional analytical methods. We propose a novel unsupervised machine learning framework that employs a kernel defined in momentum-time ($\boldsymbol{k},t$) space, constructed directly from Floquet-Bloch eigenstates. This approach is intrinsically data-driven and requires no prior knowledge of the underlying topological invariants, providing a fundamental advantage over prior methods that rely on abstract concepts like the micromotion operator or homotopic transformations. Crucially, this work successfully reveals the intrinsic topological characteristics encoded within the Floquet eigenstates themselves. We demonstrate that our method robustly and simultaneously identifies the topological invariants associated with both the $0$-gap and the $π$-gap across various symmetry classes (1D AIII, 1D D, and 2D A), establishing a robust methodology for the systematic classification and discovery of complex non-equilibrium topological matter.

preprint2022arXiv

3D endoscopic depth estimation using 3D surface-aware constraints

Robotic-assisted surgery allows surgeons to conduct precise surgical operations with stereo vision and flexible motor control. However, the lack of 3D spatial perception limits situational awareness during procedures and hinders mastering surgical skills in the narrow abdominal space. Depth estimation, as a representative perception task, is typically defined as an image reconstruction problem. In this work, we show that depth estimation can be reformed from a 3D surface perspective. We propose a loss function for depth estimation that integrates the surface-aware constraints, leading to a faster and better convergence with the valid information from spatial information. In addition, camera parameters are incorporated into the training pipeline to increase the control and transparency of the depth estimation. We also integrate a specularity removal module to recover more buried image information. Quantitative experimental results on endoscopic datasets and user studies with medical professionals demonstrate the effectiveness of our method.

preprint2022arXiv

Universal Segmentation of 33 Anatomies

In the paper, we present an approach for learning a single model that universally segments 33 anatomical structures, including vertebrae, pelvic bones, and abdominal organs. Our model building has to address the following challenges. Firstly, while it is ideal to learn such a model from a large-scale, fully-annotated dataset, it is practically hard to curate such a dataset. Thus, we resort to learn from a union of multiple datasets, with each dataset containing the images that are partially labeled. Secondly, along the line of partial labelling, we contribute an open-source, large-scale vertebra segmentation dataset for the benefit of spine analysis community, CTSpine1K, boasting over 1,000 3D volumes and over 11K annotated vertebrae. Thirdly, in a 3D medical image segmentation task, due to the limitation of GPU memory, we always train a model using cropped patches as inputs instead a whole 3D volume, which limits the amount of contextual information to be learned. To this, we propose a cross-patch transformer module to fuse more information in adjacent patches, which enlarges the aggregated receptive field for improved segmentation performance. This is especially important for segmenting, say, the elongated spine. Based on 7 partially labeled datasets that collectively contain about 2,800 3D volumes, we successfully learn such a universal model. Finally, we evaluate the universal model on multiple open-source datasets, proving that our model has a good generalization performance and can potentially serve as a solid foundation for downstream tasks.

preprint2021arXiv

Measuring Bayesian Robustness Using Rényi Divergence

This paper deals with measuring the Bayesian robustness of classes of contaminated priors. Two different classes of priors in the neighborhood of the elicited prior are considered. The first one is the well-known $ε$-contaminated class, while the second one is the geometric mixing class. The proposed measure of robustness is based on computing the curvature of Rényi divergence between posterior distributions. Examples are used to illustrate the results by using simulated and real data sets.

preprint2021arXiv

Noise Enhanced Neural Networks for Analytic Continuation

Analytic continuation maps imaginary-time Green's functions obtained by various theoretical/numerical methods to real-time response functions that can be directly compared with experiments. Analytic continuation is an important bridge between many-body theories and experiments but is also a challenging problem because such mappings are ill-conditioned. In this work, we develop a neural network-based method for this problem. The training data is generated either using synthetic Gaussian-type spectral functions or from exactly solvable models where the analytic continuation can be obtained analytically. Then, we applied the trained neural network to the testing data, either with synthetic noise or intrinsic noise in Monte Carlo simulations. We conclude that the best performance is always achieved when a proper amount of noise is added to the training data. Moreover, our method can successfully capture multi-peak structure in the resulting response function for the cases with the best performance. The method can be combined with Monte Carlo simulations to compare with experiments on real-time dynamics.

preprint2020arXiv

First image then video: A two-stage network for spatiotemporal video denoising

Video denoising is to remove noise from noise-corrupted data, thus recovering true signals via spatiotemporal processing. Existing approaches for spatiotemporal video denoising tend to suffer from motion blur artifacts, that is, the boundary of a moving object tends to appear blurry especially when the object undergoes a fast motion, causing optical flow calculation to break down. In this paper, we address this challenge by designing a first-image-then-video two-stage denoising neural network, consisting of an image denoising module for spatially reducing intra-frame noise followed by a regular spatiotemporal video denoising module. The intuition is simple yet powerful and effective: the first stage of image denoising effectively reduces the noise level and, therefore, allows the second stage of spatiotemporal denoising for better modeling and learning everywhere, including along the moving object boundaries. This two-stage network, when trained in an end-to-end fashion, yields the state-of-the-art performances on the video denoising benchmark Vimeo90K dataset in terms of both denoising quality and computation. It also enables an unsupervised approach that achieves comparable performance to existing supervised approaches.

preprint2020arXiv

Higher-Dimensional Open Quantum Walk Constructed from Quantum Bernoulli Noises

Quantum Bernoulli noises are annihilation and creation operators acting on Bernoulli functionals, which satisfy the canonical anti-commutation relations (CAR) in equal-time. In this paper, we use quantum Bernoulli noises to introduce a model of open quantum walk on the $d$-dimensional integer lattice $\mathbb{Z}^d$ for a general positive integer $d\geq 2$, which we call the $d$-dimensional open QBN walk. We obtain a quantum channel representation of the $d$-dimensional open QBN walk, and find that it admits the ``separability-preserving'' property. We prove that, for a wide range of choices of its initial state, the $d$-dimensional open QBN walk has a limit probability distribution of $d$-dimensional Gauss type. Finally we unveil links between the $d$-dimensional open QBN walk and the unitary quantum walk recently introduced in [Ce Wang and Caishi Wang, Higher-dimensional quantum walk in terms of quantum Bernoulli noises, Entropy 2020, 22, 504].

preprint2019arXiv

Linking invariant for the quench dynamics of a two-dimensional two-band Chern insulator

We discuss the topological invariant in the (2+1)-dimensional quench dynamics of a two-dimensional two-band Chern insulator starting from a topological initial state (i.e., with a nonzero Chern number $c_i$), evolved by a post-quench Hamiltonian (with Chern number $c_f$). In contrast to the process with $c_i=0$ studied in previous works, this process cannot be characterized by the Hopf invariant that is described by the sphere homotopy group $π_3(S^2)=\mathbb{Z}$. It is possible, however, to calculate a variant of the Chern-Simons integral with a complementary part to cancel the Chern number of the initial spin configuration, which at the same time does not affect the (2+1)-dimensional topology. We show that the modified Chern-Simons integral gives rise to a topological invariant of this quench process, i.e., the linking invariant in the $\mathbb{Z}_{2c_i}$ class: $ν= (c_f - c_i) \mod (2c_i)$. We give concrete examples to illustrate this result and also show the detailed deduction to get this linking invariant.