SearcharxivSearch

arXiv subjects

Zhixi Wang

Publications and source records attributed to Zhixi Wang.

9 recordsLinked to original sources

SharpTimeGS: Sharp and Stable Dynamic Gaussian Splatting via Lifespan Modulation

Novel view synthesis of dynamic scenes is fundamental to achieving photorealistic 4D reconstruction and immersive visual experiences. Recent progress in Gaussian-based representations has significantly improved real-time rendering quality, yet existing methods still struggle to maintain a balance between long-term static and short-term dynamic regions in both representation and optimization. To address this, we present SharpTimeGS, a lifespan-aware 4D Gaussian framework that achieves temporally adaptive modeling of both static and dynamic regions under a unified representation. Specifically, we introduce a learnable lifespan parameter that reformulates temporal visibility from a Gaussian-shaped decay into a flat-top profile, allowing primitives to remain consistently active over their intended duration and avoiding redundant densification. In addition, the learned lifespan modulates each primitives' motion, reducing drift in long-lived static points while retaining unrestricted motion for short-lived dynamic ones. This effectively decouples motion magnitude from temporal duration, improving long-term stability without compromising dynamic fidelity. Moreover, we design a lifespan-velocity-aware densification strategy that mitigates optimization imbalance between static and dynamic regions by allocating more capacity to regions with pronounced motion while keeping static areas compact and stable. Extensive experiments on multiple benchmarks demonstrate that our method achieves state-of-the-art performance while supporting real-time rendering up to 4K resolution at 100 FPS on one RTX 4090.

cs.CV

LSNet: Extremely Light-Weight Siamese Network For Change Detection in Remote Sensing Image

The Siamese network is becoming the mainstream in change detection of remote sensing images (RSI). However, in recent years, the development of more complicated structure, module and training processe has resulted in the cumbersome model, which hampers their application in large-scale RSI processing. To this end, this paper proposes an extremely lightweight Siamese network (LSNet) for RSI change detection, which replaces standard convolution with depthwise separable atrous convolution, and removes redundant dense connections, retaining only valid feature flows while performing Siamese feature fusion, greatly compressing parameters and computation amount. Compared with the first-place model on the CCD dataset, the parameters and the computation amount of LSNet is greatly reduced by 90.35\% and 91.34\% respectively, with only a 1.5\% drops in accuracy.

cs.CV

Super quantum discord for X-type states

Weak measurement is a new way to manipulate and control quantum systems. Different from projection measurement, weak measurement only makes a small change in status. Applying weak measurement to quantum discord, Singh and Pati proposed a new kind of quantum correlations called "super quantum discord (SQD)" [Annals of Physics \textbf{343},141(2014)]. Unfortunately, the super quantum discord is also difficult to calculate. There are only few explicit formulae about SQD. We derive an analytical formulae of SQD for general X-type two-qubit states, which surpass the conclusion for Werner states and Bell diagonal states. Furthermore, our results reveal more knowledge about the new insight of quantum correlation and give a new way to compare SQD with normal quantum discord. Finally, we analyze its dynamics under nondissipative channels.

quant-ph

A Note On Heisenberg Categorification

A categorification of the Heisenberg algebra is constructed in by Khovanov using graphical calculus, and left with a conjecture on the isomorphism between the Heisenberg algebra and Grothendieck ring of the constructed category. We give a proof of Khovanov's conjectured statement in this paper from a categorification of some deformed Heisenberg algebra.

math-ph

Categorification of the Heisenberg algebra and MacMahon function

Starting from a one dimensional vector space, we construct a categorification $'\mathcal H$ of a deformed Heiserberg algebra $'H$ by Cautis and Licata's method. The Grothendieck ring of $'\mathcal H$ is $'H$. As an application, we discuss some related partition functions related to the MacMahon function of 3D Young diagram. We expect further applications of the results of this paper.

math-ph

Relative entropy of entanglement of rotationally invariant states

We calculate the relative entropy of entanglement for rotationally invariant states of spin-1/2 and arbitrary spin-$j$ particles or of spin-1 particle and spin-$j$ particle with integer $j$. A lower bound of relative entropy of entanglement and an upper bound of distillable entanglement are presented for rotationally invariant states of spin-1 particle and spin-$j$ particle with half-integer $j$.

quant-ph

The tripartite separability of density matrices of graphs

The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein {\it et al.} Annals of Combinatorics, {\bf 10}(2006)291 to tripartite states. Then we proved that the degree condition defined in Braunstein {\it et al.} Phys. Rev. A {\bf 73}, (2006)012320 is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.

quant-ph

Achievable efficiencies for probabilistically cloning the states

We present an example of quantum computational tasks whose performance is enhanced if we distribute quantum information using quantum cloning. Furthermore we give achievable efficiencies for probabilistic cloning the quantum states used in implemented tasks for which cloning provides some enhancement in performance.

quant-ph