SearcharxivSearch

arXiv subjects

Hang Long

Publications and source records attributed to Hang Long.

9 recordsLinked to original sources

LATO.2: Factorized 3D Mesh Generation with Vertex and Topology Flow

Flow matching over carefully designed latent representations has recently emerged as a powerful paradigm for topology-aware mesh generation. Existing approaches, however, model vertices and connectivity jointly in a joint latent space, entangling continuous vertex geometry with discrete combinatorial structure; this complicates flow learning and manifests as drifting vertices and broken surfaces. We present LATO.2, a factorized flow matching framework that decomposes mesh generation into a vertex flow followed by a connectivity flow conditioned on the realized vertices, with both stages anchored to a shared coarse voxel scaffold. Dedicated VAEs underpin the two stages, recovering vertices at sub-voxel precision and embedding discrete connectivity into a continuous latent space. We demonstrate two advantages unique to this factorization: (i) part-wise generation, in which the scaffold is partitioned and each part synthesized at full latent capacity, yielding substantially higher-resolution meshes than a monolithic latent permits; and (ii) topology-adaptive editing, in which manipulating first-stage vertices induces the corresponding connectivity without re-optimization. Experiments show that LATO.2 surpasses state-of-the-art topology-aware mesh generators in geometric fidelity and connectivity quality.

cs.GR

SubdivAR: Autoregressive Next-Scale Prediction for Neural Mesh Subdivision

Mesh subdivision is a fundamental operation for converting coarse, editable meshes into high-resolution surfaces, with broad applications in digital asset creation. Classical rule-based schemes rely on fixed local refinement rules and often produce over-smoothed surfaces. Recent neural subdivision methods improve detail synthesis, but remain constrained by local modeling and exhibit limited generalizability. We present SubdivAR, a neural mesh subdivision framework based on our proposed Mesh Autoregressive Representation (MAR). MAR arranges meshes at different subdivision levels into an ordered scale sequence, reformulating subdivision as autoregressive next-scale prediction. To support this formulation, we introduce a Hybrid Topology-Aware Transformer that combines global semantic attention with topology-constrained local feature aggregation. SubdivAR adopts a next-scale coordinate prediction paradigm, regressing vertex offsets at each refinement stage to preserve subdivision topology while recovering fine-grained geometric details. To enable reliable learning, we construct FII-40K, a curated dataset of nearly 40,000 high-quality meshes with multi-level subdivision supervision. Experiments show that SubdivAR outperforms state-of-the-art baselines, reducing Hausdorff Distance and Chamfer Distance by 18.8% and 14.2%, respectively, and demonstrates strong robustness on complex open-surface geometries.

cs.CV

LATO: 3D Mesh Flow Matching with Structured TOpology Preserving LAtents

In this paper, we introduce LATO, a novel topology-preserving latent representation that enables scalable, flow matching-based synthesis of explicit 3D meshes. LATO represents a mesh as a Vertex Displacement Field (VDF) anchored on surface, incorporating a sparse voxel Variational Autoencoder (VAE) to compress this explicit signal into a structured, topology-aware voxel latent. To decapsulate the mesh, the VAE decoder progressively subdivides and prunes latent voxels to instantiate precise vertex locations. In the end, a dedicated connection head queries the voxel latent to predict edge connectivity between vertex pairs directly, allowing mesh topology to be recovered without isosurface extraction or heuristic meshing. For generative modeling, LATO adopts a two-stage flow matching process, first synthesizing the structure voxels and subsequently refining the voxel-wise topology features. Compared to prior isosurface/triangle-based diffusion models and autoregressive generation approaches, LATO generates meshes with complex geometry, well-formed topology while being highly efficient in inference.

cs.CV

MeshRipple: Structured Autoregressive Generation of Artist-Meshes

Meshes serve as a primary representation for 3D assets. Autoregressive mesh generators serialize faces into sequences and train on truncated segments with sliding-window inference to cope with memory limits. However, this mismatch breaks long-range geometric dependencies, producing holes and fragmented components. To address this critical limitation, we introduce MeshRipple, which expands a mesh outward from an active generation frontier, akin to a ripple on a surface. MeshRipple rests on three key innovations: a frontier-aware BFS tokenization that aligns the generation order with surface topology; an expansive prediction strategy that maintains coherent, connected surface growth; and a sparse-attention global memory that provides an effectively unbounded receptive field to resolve long-range topological dependencies. This integrated design enables MeshRipple to generate meshes with high surface fidelity and topological completeness, outperforming strong recent baselines.

cs.CV

An Enhanced LMMSE Channel Estimation under High Speed Railway Scenarios

With the rapid deployment of the high speed railway (HSR), the wireless communication in HSR has been one of the indispensable scenarios in the fifth generation (5G) communications. In order to improve the performance of the orthogonal frequency division multiplexing (OFDM) system in the HSR scenarios, we propose an enhanced linear minimum mean square error channel estimation scheme based on multi-path Doppler frequency offset (DFO) estimation in this paper. The proposed scheme can estimate DFO of each path, and generate the frequency and time channel correlation more accurately, which can improve the accuracy of channel estimation in the HSR scenarios. Simulation results show that the proposed scheme can reduce the channel estimation error and achieve attractive gain in the HSR scenarios.

cs.IT

Adaptive Spectrum Sharing of LTE Co-existing with WLAN in Unlicensed Frequency Bands

With the increase of wireless communication demands, licensed spectrum for long term evolution (LTE) is no longer enough. The research effort has focused on implementing LTE to unlicensed frequency bands in recent years, which unavoidably brings the problem of LTE co-existence with other existing systems on the same band. This paper proposes an adaptive co-existence mechanism for LTE and wireless local area networks (WLAN) to enable a significant system performance of WLAN while LTE does not lose much as well. LTE realizes the co-existence by allocating time resources dynamically according to the traffic load of WLAN system.

cs.NI

A Closed-Loop UL Power Control Scheme for Interference Mitigation in Dynamic TD-LTE Systems

The TD-LTE system is envisaged to adopt dynamic time division duplexing (TDD) transmissions for small cells to adapt their communication service to the fast variation of downlink (DL) and uplink (UL) traffic demands. However, different DL/UL directions for the same subframe in adjacent cells will result in new destructive interference components, i.e., eNB-to-eNB and UE-to-UE, with levels that can significantly differ from one subframe to another. In this paper, a feasible UL power control mechanism is proposed to manage eNB-to-eNB interference, where different UL power control parameters are set based on different interference level. We consider the geometric location information and the subframe set selection process about adjacent eNBs when the interference level is estimated. The performance of the proposed scheme is evaluated through system level simulations and it is shown that the scheme can achieve preferable improvement in terms of UL average and 5%-ile packet throughputs compared with the original scheme without power control. Also, the UE-to-UE interference is not worse when the UE transmit power become higher.

cs.NI

An SMDP-based Resource Management Scheme for Distributed Cloud Systems

In this paper, the resource management problem in geographically distributed cloud systems is considered. The Follow Me Cloud concept which enables service migration across federated data centers (DCs) is adopted. Therefore, there are two types of service requests to the DC, i.e., new requests (NRs) initiated in the local service area and migration requests (MRs) generated when mobile users move across service areas. A novel resource management scheme is proposed to help the resource manager decide whether to accept the service requests (NRs or MRs) or not and determine how much resources should be allocated to each service (if accepted). The optimization objective is to maximize the average system reward and keep the rejection probability of service requests under a certain threshold. Numerical results indicate that the proposed scheme can significantly improve the overall system utility as well as the user experience compared with other resource management schemes.

cs.NI

Divisible Load Scheduling in Mobile Grid based on Stackelberg Pricing Game

Nowadays, it has become feasible to use mobile nodes as contributing entities in computing systems. In this paper, we consider a computational grid in which the mobile devices can share their idle resources to realize parallel processing. The overall computing task can be arbitrarily partitioned into multiple subtasks to be distributed to mobile resource providers (RPs). In this process, the computation load scheduling problem is highlighted. Based on the optimization objective, i.e., minimizing the task makespan, a buyer-seller model in which the task sponsor can inspire the SPs to share their computing resources by paying certain profits, is proposed. The Stackelberg Pricing Game (SPG) is employed to obtain the optimal price and shared resource amount of each SP. Finally, we evaluate the performance of the proposed algorithm by system simulation and the results indicate that the SPG-based load scheduling algorithm can significantly improve the time gain in mobile grid systems.

cs.DC