Searcharxiv⌕ Search

arXiv subjects

Xiao Tang

Publications and source records attributed to Xiao Tang.

At least 55 records · Page 3Linked to original sources

Zero-P-to-3: Zero-Shot Partial-View Images to 3D Object

Generative 3D reconstruction shows strong potential in incomplete observations. While sparse-view and single-image reconstruction are well-researched, partial observation remains underexplored. In this context, dense views are accessible only from a specific angular range, with other perspectives remaining inaccessible. This task presents two main challenges: (i) limited View Range: observations confined to a narrow angular scope prevent effective traditional interpolation techniques that require evenly distributed perspectives. (ii) inconsistent Generation: views created for invisible regions often lack coherence with both visible regions and each other, compromising reconstruction consistency. To address these challenges, we propose \method, a novel training-free approach that integrates the local dense observations and multi-source priors for reconstruction. Our method introduces a fusion-based strategy to effectively align these priors in DDIM sampling, thereby generating multi-view consistent images to supervise invisible views. We further design an iterative refinement strategy, which uses the geometric structures of the object to enhance reconstruction quality. Extensive experiments on multiple datasets show the superiority of our method over SOTAs, especially in invisible regions.

cs.CV↗

Unfolded Deep Graph Learning for Networked Over-the-Air Computation

Over-the-air computation (AirComp) has emerged as a promising technology that enables simultaneous transmission and computation through wireless channels. In this paper, we investigate the networked AirComp in multiple clusters allowing diversified data computation, which is yet challenged by the transceiver coordination and interference management therein. Particularly, we aim to maximize the multi-cluster weighted-sum AirComp rate, where the transmission scalar as well as receive beamforming are jointly investigated while addressing the interference issue. From an optimization perspective, we decompose the formulated problem and adopt the alternating optimization technique with an iterative process to approximate the solution. Then, we reinterpret the iterations through the principle of algorithm unfolding, where the channel condition and mutual interference in the AirComp network constitute an underlying graph. Accordingly, the proposed unfolding architecture learns the weights parameterized by graph neural networks, which is trained through stochastic gradient descent approach. Simulation results show that our proposals outperform the conventional schemes, and the proposed unfolded graph learning substantially alleviates the interference and achieves superior computation performance, with strong and efficient adaptation to the dynamic and scalable networks.

eess.SP↗

Giant Rashba splitting in PtTe/PtTe$_2$ heterostructure

Achieving a large spin splitting is highly desirable for spintronic devices, which often requires breaking of the inversion symmetry. However, many atomically thin films are centrosymmetric, making them unsuitable for spintronic applications. Here, we report a strategy to achieve inversion symmetry breaking from a centrosymmetric transition metal dichalcogenide (TMDC) bilayer PtTe$_2$, leading to a giant Rashba spin splitting. Specifically, the thermal annealing turns one layer of PtTe$_2$ sample into a transition metal monochalcogenide (TMMC) PtTe through Te extraction, thus forming PtTe/PtTe$_2$ heterostructure with inversion symmetry breaking. In the naturally-formed PtTe/PtTe$_2$ heterostructure, we observe a giant Rashba spin splitting with Rashba coefficient of $α_{R}$ = 1.8 eV$\cdot$$Å$, as revealed by spin- and angle-resolved photoemission spectroscopy measurements. Our work demonstrates a convenient and effective pathway for achieving pronounced Rashba splitting in centrosymmetric TMDC thin films by creating TMMC/TMDC heterostructure, thereby extending their potential applications to spintronics.

cond-mat.mtrl-sci↗

Deep Learning-Assisted Jamming Mitigation with Movable Antenna Array

This paper reveals the potential of movable antennas in enhancing anti-jamming communication. We consider a legitimate communication link in the presence of multiple jammers and propose deploying a movable antenna array at the receiver to combat jamming attacks. We formulate the problem as a signal-to-interference-plus-noise ratio maximization, by jointly optimizing the receive beamforming and antenna element positioning. Due to the non-convexity and multi-fold difficulties from an optimization perspective, we develop a deep learning-based framework where beamforming is tackled as a Rayleigh quotient problem, while antenna positioning is addressed through multi-layer perceptron training. The neural network parameters are optimized using stochastic gradient descent to achieve effective jamming mitigation strategy, featuring offline training with marginal complexity for online inference. Numerical results demonstrate that the proposed approach achieves near-optimal anti-jamming performance thereby significantly improving the efficiency in strategy determination.

eess.SP↗

Direction-Aware Hybrid Representation Learning for 3D Hand Pose and Shape Estimation

Most model-based 3D hand pose and shape estimation methods directly regress the parametric model parameters from an image to obtain 3D joints under weak supervision. However, these methods involve solving a complex optimization problem with many local minima, making training difficult. To address this challenge, we propose learning direction-aware hybrid features (DaHyF) that fuse implicit image features and explicit 2D joint coordinate features. This fusion is enhanced by the pixel direction information in the camera coordinate system to estimate pose, shape, and camera viewpoint. Our method directly predicts 3D hand poses with DaHyF representation and reduces jittering during motion capture using prediction confidence based on contrastive learning. We evaluate our method on the FreiHAND dataset and show that it outperforms existing state-of-the-art methods by more than 33% in accuracy. DaHyF also achieves the top ranking on both the HO3Dv2 and HO3Dv3 leaderboards for the metric of Mean Joint Error (after scale and translation alignment). Compared to the second-best results, the largest improvement observed is 10%. We also demonstrate its effectiveness in real-time motion capture scenarios with hand position variability, occlusion, and motion blur.

cs.CV↗

Deep Graph Reinforcement Learning for UAV-Enabled Multi-User Secure Communications

While unmanned aerial vehicles (UAVs) with flexible mobility are envisioned to enhance physical layer security in wireless communications, the efficient security design that adapts to such high network dynamics is rather challenging. The conventional approaches extended from optimization perspectives are usually quite involved, especially when jointly considering factors in different scales such as deployment and transmission in UAV-related scenarios. In this paper, we address the UAV-enabled multi-user secure communications by proposing a deep graph reinforcement learning framework. Specifically, we reinterpret the security beamforming as a graph neural network (GNN) learning task, where mutual interference among users is managed through the message-passing mechanism. Then, the UAV deployment is obtained through soft actor-critic reinforcement learning, where the GNN-based security beamforming is exploited to guide the deployment strategy update. Simulation results demonstrate that the proposed approach achieves near-optimal security performance and significantly enhances the efficiency of strategy determination. Moreover, the deep graph reinforcement learning framework offers a scalable solution, adaptable to various network scenarios and configurations, establishing a robust basis for information security in UAV-enabled communications.

eess.SP↗

DashGaussian: Optimizing 3D Gaussian Splatting in 200 Seconds

3D Gaussian Splatting (3DGS) renders pixels by rasterizing Gaussian primitives, where the rendering resolution and the primitive number, concluded as the optimization complexity, dominate the time cost in primitive optimization. In this paper, we propose DashGaussian, a scheduling scheme over the optimization complexity of 3DGS that strips redundant complexity to accelerate 3DGS optimization. Specifically, we formulate 3DGS optimization as progressively fitting 3DGS to higher levels of frequency components in the training views, and propose a dynamic rendering resolution scheme that largely reduces the optimization complexity based on this formulation. Besides, we argue that a specific rendering resolution should cooperate with a proper primitive number for a better balance between computing redundancy and fitting quality, where we schedule the growth of the primitives to synchronize with the rendering resolution. Extensive experiments show that our method accelerates the optimization of various 3DGS backbones by 45.7% on average while preserving the rendering quality.

cs.CV↗

Decoupling Appearance Variations with 3D Consistent Features in Gaussian Splatting

Gaussian Splatting has emerged as a prominent 3D representation in novel view synthesis, but it still suffers from appearance variations, which are caused by various factors, such as modern camera ISPs, different time of day, weather conditions, and local light changes. These variations can lead to floaters and color distortions in the rendered images/videos. Recent appearance modeling approaches in Gaussian Splatting are either tightly coupled with the rendering process, hindering real-time rendering, or they only account for mild global variations, performing poorly in scenes with local light changes. In this paper, we propose DAVIGS, a method that decouples appearance variations in a plug-and-play and efficient manner. By transforming the rendering results at the image level instead of the Gaussian level, our approach can model appearance variations with minimal optimization time and memory overhead. Furthermore, our method gathers appearance-related information in 3D space to transform the rendered images, thus building 3D consistency across views implicitly. We validate our method on several appearance-variant scenes, and demonstrate that it achieves state-of-the-art rendering quality with minimal training time and memory usage, without compromising rendering speeds. Additionally, it provides performance improvements for different Gaussian Splatting baselines in a plug-and-play manner.

cs.CV↗

RIS-Assisted Simultaneous Legitimate Monitoring and Jamming for Industrial Wireless Networks

In this paper, we study reconfigurable intelligent surface (RIS)-assisted simultaneous legitimate monitoring and jamming techniques for industrial environments, so that egitimate monitor (LM) and legitimate jammers (LJs) can sustainably monitor and interfere with suspicious communications with minimum transmission power. Specifically, we propose a Block Coordinate Descent-Particle Swarm Optimization (BCD-PSO) based scheme to optimize RIS's phase shift matrix and minimize LJs' transmission power, while successfully jamming and stably monitoring unauthorized communications. Simulation results demonstrate that the proposed BCD-PSO can enhance the performances in terms of monitoring, resource utilization and robustness. Moreover, we effectively exam the best deployment of RIS towards diverse objectives.

eess.SY↗

Rethinking the Alignment of Psychotherapy Dialogue Generation with Motivational Interviewing Strategies

Recent advancements in large language models (LLMs) have shown promise in generating psychotherapeutic dialogues, particularly in the context of motivational interviewing (MI). However, the inherent lack of transparency in LLM outputs presents significant challenges given the sensitive nature of psychotherapy. Applying MI strategies, a set of MI skills, to generate more controllable therapeutic-adherent conversations with explainability provides a possible solution. In this work, we explore the alignment of LLMs with MI strategies by first prompting the LLMs to predict the appropriate strategies as reasoning and then utilizing these strategies to guide the subsequent dialogue generation. We seek to investigate whether such alignment leads to more controllable and explainable generations. Multiple experiments including automatic and human evaluations are conducted to validate the effectiveness of MI strategies in aligning psychotherapy dialogue generation. Our findings demonstrate the potential of LLMs in producing strategically aligned dialogues and suggest directions for practical applications in psychotherapeutic settings.

cs.CL↗

Manipulating the symmetry of photon-dressed electronic states

Strong light-matter interaction provides opportunities for tailoring the physical properties of quantum materials on the ultrafast timescale by forming photon-dressed electronic states, i.e., Floquet-Bloch states. While the light field can in principle imprint its symmetry properties onto the photon-dressed electronic states, so far, how to experimentally detect and further engineer the symmetry of photon-dressed electronic states remains elusive. Here by utilizing time- and angle-resolved photoemission spectroscopy (TrARPES) with polarization-dependent study, we directly visualize the parity symmetry of Floquet-Bloch states in black phosphorus. The photon-dressed sideband exhibits opposite photoemission intensity to the valence band at the $Γ$ point,suggesting a switch of the parity induced by the light field. Moreover, a "hot spot" with strong intensity confined near $Γ$ is observed, indicating a momentum-dependent modulation beyond the parity switch. Combining with theoretical calculations, we reveal the light-induced engineering of the wave function of the Floquet-Bloch states as a result of the hybridization between the conduction and valence bands with opposite parities, and show that the "hot spot" is intrinsically dictated by the symmetry properties of black phosphorus. Our work suggests TrARPES as a direct probe for the parity of the photon-dressed electronic states with energy- and momentum-resolved information, providing an example for engineering the wave function and symmetry of such photon-dressed electronic states via Floquet engineering.

cond-mat.mes-hall↗

Takens Theorem for nonautonomous partially hyperbolic dynamical systems

Takens Theorem for a partially hyperbolic dynamics provides a normal linearization along the center manifold. In this paper, we give the nonautonomous version of Takens Theorem under non-resonance conditions formulated in terms of the dichotomy spectrum. In our proof, one difficulty is to solve homological equations for the normal form theory which involve a center variable, while another difficulty is to find the dichotomy spectrum of a certain matrix cocycle that is block lower triangular. In order to overcome those difficulties, in comparison with the autonomous case, we need an additional term in the (nonautonomous) non-resonance conditions to guarantee certain spectral gap conditions. This additional term disappears naturally in the autonomous case.

math.DS↗

MEGA: Maximum-Entropy Genetic Algorithm for Router Nodes Placement in Wireless Mesh Networks

Over the past decade, Wireless Mesh Networks (WMNs) have seen significant advancements due to their simple deployment, cost-effectiveness, ease of implementation and reliable service coverage. However, despite these advantages, the placement of nodes in WMNs presents a critical challenge that significantly impacts their performance. This issue is recognized as an NP-hard problem, underscoring the necessity of development optimization algorithms, such as heuristic and metaheuristic approaches. This motivates us to develop the Maximum Entropy Genetic Algorithm (MEGA) to address the issue of mesh router node placement in WMNs. To assess the proposed method, we conducted experiments across various scenarios with different settings, focusing on key metrics such as network connectivity and user coverage. The simulation results show a comparison of MEGA with other prominent algorithms, such as the Coyote Optimization Algorithm (COA), Firefly Algorithm (FA), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO), revealing MEGA's effectiveness and usability in determining optimal locations for mesh routers.

cs.NI↗

MirrorGaussian: Reflecting 3D Gaussians for Reconstructing Mirror Reflections

3D Gaussian Splatting showcases notable advancements in photo-realistic and real-time novel view synthesis. However, it faces challenges in modeling mirror reflections, which exhibit substantial appearance variations from different viewpoints. To tackle this problem, we present MirrorGaussian, the first method for mirror scene reconstruction with real-time rendering based on 3D Gaussian Splatting. The key insight is grounded on the mirror symmetry between the real-world space and the virtual mirror space. We introduce an intuitive dual-rendering strategy that enables differentiable rasterization of both the real-world 3D Gaussians and the mirrored counterpart obtained by reflecting the former about the mirror plane. All 3D Gaussians are jointly optimized with the mirror plane in an end-to-end framework. MirrorGaussian achieves high-quality and real-time rendering in scenes with mirrors, empowering scene editing like adding new mirrors and objects. Comprehensive experiments on multiple datasets demonstrate that our approach significantly outperforms existing methods, achieving state-of-the-art results. Project page: https://mirror-gaussian.github.io/.

cs.CV↗

3D Geometry-aware Deformable Gaussian Splatting for Dynamic View Synthesis

In this paper, we propose a 3D geometry-aware deformable Gaussian Splatting method for dynamic view synthesis. Existing neural radiance fields (NeRF) based solutions learn the deformation in an implicit manner, which cannot incorporate 3D scene geometry. Therefore, the learned deformation is not necessarily geometrically coherent, which results in unsatisfactory dynamic view synthesis and 3D dynamic reconstruction. Recently, 3D Gaussian Splatting provides a new representation of the 3D scene, building upon which the 3D geometry could be exploited in learning the complex 3D deformation. Specifically, the scenes are represented as a collection of 3D Gaussian, where each 3D Gaussian is optimized to move and rotate over time to model the deformation. To enforce the 3D scene geometry constraint during deformation, we explicitly extract 3D geometry features and integrate them in learning the 3D deformation. In this way, our solution achieves 3D geometry-aware deformation modeling, which enables improved dynamic view synthesis and 3D dynamic reconstruction. Extensive experimental results on both synthetic and real datasets prove the superiority of our solution, which achieves new state-of-the-art performance. The project is available at https://npucvr.github.io/GaGS/

cs.CV↗

VastGaussian: Vast 3D Gaussians for Large Scene Reconstruction

Existing NeRF-based methods for large scene reconstruction often have limitations in visual quality and rendering speed. While the recent 3D Gaussian Splatting works well on small-scale and object-centric scenes, scaling it up to large scenes poses challenges due to limited video memory, long optimization time, and noticeable appearance variations. To address these challenges, we present VastGaussian, the first method for high-quality reconstruction and real-time rendering on large scenes based on 3D Gaussian Splatting. We propose a progressive partitioning strategy to divide a large scene into multiple cells, where the training cameras and point cloud are properly distributed with an airspace-aware visibility criterion. These cells are merged into a complete scene after parallel optimization. We also introduce decoupled appearance modeling into the optimization process to reduce appearance variations in the rendered images. Our approach outperforms existing NeRF-based methods and achieves state-of-the-art results on multiple large scene datasets, enabling fast optimization and high-fidelity real-time rendering.

cs.CV↗

BrickPal: Augmented Reality-based Assembly Instructions for Brick Models

The assembly instruction is a mandatory component of Lego-like brick sets.The conventional production of assembly instructions requires a considerable amount of manual fine-tuning, which is intractable for casual users and customized brick sets.Moreover, the traditional paper-based instructions lack expressiveness and interactivity.To tackle the two problems above, we present BrickPal, an augmented reality-based system, which visualizes assembly instructions in an augmented reality head-mounted display. It utilizes Natural Language Processing (NLP) techniques to generate plausible assembly sequences, and provide real-time guidance in the AR headset.Our user study demonstrates BrickPal's effectiveness at assisting users in brick assembly compared to traditional assembly methods. Additionally, the NLP algorithm-generated assembly sequences achieve the same usability with manually adapted sequences.

cs.HC↗

Power and Interference Control for VLC-Based UDN: A Reinforcement Learning Approach

Visible light communication (VLC) has been widely applied as a promising solution for modern short range communication. When it comes to the deployment of LED arrays in VLC networks, the emerging ultra-dense network (UDN) technology can be adopted to expand the VLC network's capacity. However, the problem of inter-cell interference (ICI) mitigation and efficient power control in the VLC-based UDN is still a critical challenge. To this end, a reinforcement learning (RL) based VLC UDN architecture is devised in this paper. The deployment of the cells is optimized via spatial reuse to mitigate ICI. An RL-based algorithm is proposed to dynamically optimize the policy of power and interference control, maximizing the system utility in the complicated and dynamic environment. Simulation results demonstrate the superiority of the proposed scheme, it increase the system utility and achievable data rate while reducing the energy consumption and ICI, which outperforms the benchmark scheme.

eess.SP↗