Weihang Liu

Weihang Liu

Auto-generated profile, based on publicly available information

Weihang Liu

School of Information Science and Technology, ShanghaiTech University, Shanghai, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 February 2026 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
XZXue Xian Zheng
Xue Xian Zheng
WLWeihang Liu
Weihang Liu
XLXin Lou
Xin Lou
SVStefan Vlaski
Stefan Vlaski
TATareq Y. Al-Naffouri
Tareq Y. Al-Naffouri
This paper introduces an innovative error feedback framework designed to mitigate quantization noise in distributed graph filtering, where communications are constrained to quantized messages. It comes from error spectrum shaping techniques from state-space digital filters, and therefore establishes connections between quantized filtering processes over different domains. In contrast to existing error compensation methods, our framework quantitatively feeds back the quantization noise for exact compensation. We examine the framework under three key scenarios: (i) deterministic graph filtering, (ii) graph filtering over random graphs, and (iii) graph filtering with random node-asynchronous updates. Rigorous theoretical analysis demonstrates that the proposed framework significantly reduces the effect of quantization noise, and we provide closed-form solutions for the optimal error feedback coefficients. Moreover, this quantitative error feedback mechanism can be seamlessly integrated into communication-efficient decentralized optimization frameworks, enabling lower error floors. Numerical experiments validate the theoretical results, consistently showing that our method outperforms conventional quantization strategies in terms of both accuracy and robustness.


1 May 2025 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Open access
WLWeihang Liu
Weihang Liu
XZXue Xian Zheng
Xue Xian Zheng
YLYuke Li
Yuke Li
TATareq Y. Al-Naffouri
Tareq Y. Al-Naffouri
JYJingyi Yu
Jingyi Yu
XLXin Lou
Xin Lou
This paper introduces the concept of Content-Aware Radiance Fields (CoARF), which adaptively aligns the model complexity with the scene intricacy. By examining the intricacies of radiance fields from three perspectives, model complexity is adapted through scalable feature grids, dynamic neural networks, and model quantization. Specifically, we propose a hash collision detection mechanism that removes redundant feature grid by restricting the valid hash collision to reasonable level, making the space complexity scalable. We introduce an uncertainty-aware decoded layer, where simple points are early-exited to prevent them from being processed by deeper network layers, ensuring computational complexity scalable. Furthermore, we propose Learned Bitwidth Quantization (LBQ) and Adversarial Content-Aware Quantization (A-CAQ) paradigms by making the bitwidth of parameters differentiable and trainable, allowing for adjustable quantization schemes. Building on these techniques, the proposed CoARF++ framework enables a scalable pipeline for radiance fields that is tailored to the unique characteristics of scene complexity and quality requirement. Extensive experiments demonstrate a significant and adjustable reduction in model complexity across various NeRF variants, while maintaining the necessary reconstruction and rendering quality, making it advantageous for the practical deployment of radiance field models. Codes are available at https://github.com/WeihangLiu2024/Content_Aware_NeRF.

14 December 2025
Verified
Conference Paper
Open access
WLWeihang Liu
Weihang Liu
YZYuhui Zhong
Yuhui Zhong
YLYuke Li
Yuke Li
XCXi Chen
Xi Chen
JCJiadi Cui
Jiadi Cui
YZYingliang Zhang
Yingliang Zhang

23 February 2026 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
WLWeihang Liu
Weihang Liu
YLYuke Li
Yuke Li
YLYuxuan Li
Yuxuan Li
JYJingyi Yu
Jingyi Yu
XLXin Lou
Xin Lou
3D Gaussian Splatting (3DGS) achieves photorealistic rendering but requires global sorting for α-blending, causing noticeable “popping” artifacts and hindering deployment on edge devices. While sort-free Order-Independent Transparency (OIT) methods circumvent sorting, they introduce “transparency” artifacts and suffer from inefficiency due to the absence of physical constraints. To address these limitations, we present Duplex-GS, a dual-hierarchy framework leveraging proxy-guided spatial organization and a novel hybrid renderer that combines α-blending with reformulated Weighted-Sum Rendering (WSR). We introduce explicit ellipsoidal cell proxies to encapsulate local Gaussians, which enables efficient proxy-level rasterization. This strategy drastically reduces the overhead associated with global sorting. Furthermore, we propose a physically grounded WSR scheme with cell-level early termination, which restores the physical constraints absent in prior OIT-based 3DGS methods, effectively eliminating both popping and transparency artifacts. Extensive experiments on diverse real-world benchmarks demonstrate the effectiveness of the OIT-based paradigm for 3DGS, enabled by a practical dual-hierarchy implementation. Quantitatively, our method delivers high-fidelity real-time rendering, outperforming prior OIT-based 3DGS methods by 1.5×– 4× in speed, while reducing radix-sort cost by 29.8%– 86.9% compared with conventional α-blending without compromising visual quality. Project page: https://duplexgs.github.io/.

19 July 2026
Verified
Conference Paper
Open access
JDJunRan Ding
JunRan Ding
WLWeiHang Liu
WeiHang Liu
YLYuKe Li
YuKe Li
YWYiZhou Wang
YiZhou Wang
ALAnTong Li
AnTong Li
JYJingYi Yu
JingYi Yu
We present SHARP-GS, a high-performance framework that unlocks real-time 8K rendering for immersive virtual experiences by overcoming the scaling bottlenecks of 3D Gaussian Splatting (3DGS). While 3DGS excels at real-time view synthesis, its performance degrades non-linearly at ultra-high resolutions due to excessive binning overhead, uncoalesced memory access, and redundant per-pixel arithmetic. SHARP-GS addresses these inefficiencies through three key contributions: (i) Resolution-Aware Adaptive Binning, which maintains a constant overlap factor via dynamic tile sizing and employs fine-grained sub-tile culling; (ii) a Morton-Ordered Memory Layout to ensure spatially coherent memory access; and (iii) Forward Differencing, which replaces expensive probability density function evaluations with efficient incremental updates. On high-end consumer GPUs, our framework achieves an average 2.55× speedup at 8K resolution, sustaining over 250 FPS with negligible visual quality loss. This performance delivers the necessary pixel throughput to enable high-fidelity, 120 Hz stereoscopic VR experiences. Code and data for this paper are at https://github.com/dingjr7/SHARP-GS.