Jie Liang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jie Liang has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Ronggang Wang
Guangdong Provincial Key Laboratory of Ultra High Definition Immersive Media Technology, Shenzhen Graduate School, Peking University, Shenzhen, China
5 shared publications - Chao Wang
Pengcheng Laboratory, Shenzhen, China
3 shared publications - Jiahao Wu
Guangdong Provincial Key Laboratory of Ultra High Definition Immersive Media Technology, Shenzhen Graduate School, Peking University, Shenzhen, China
3 shared publications - Jiayu Yang
Pengcheng Laboratory, Shenzhen, China
3 shared publications - Kaiqiang Xiong
Guangdong Provincial Key Laboratory of Ultra High Definition Immersive Media Technology, Shenzhen Graduate School, Peking University, Shenzhen, Guangdong, China and Pengcheng Laboratory, Shenzhen, Guangdong, China
3 shared publications - Xiang Li
School of Software and Microelectronics, Peking University, Beijing, Beijing, China, Pengcheng Laboratory, Shenzhen, Guangdong, China, and Guangdong Provincial Key Laboratory of Ultra High Definition Immersive Media Technology, Shenzhen Graduate School, Peking University, Shenzhen, Guangdong, China
2 shared publications
Latest Publications
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
FocalGS: Adaptive Focal 3D Gaussian Splatting for Continuous Zoom Rendering
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessFocalGS: Adaptive Focal 3D Gaussian Splatting for Continuous Zoom Rendering
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5349-5358
DyGS-Dataset: A High-Fidelity and Temporal-stable Dynamic 3DGS Dataset
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5349-5358
Open AccessDyGS-Dataset: A High-Fidelity and Temporal-stable Dynamic 3DGS Dataset
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-13
ATGS: Anchored Temporal Gaussian Splatting for Long Volumetric Video Representation
Volumetric video enables immersive free viewpoint rendering of dynamic real world scenes, yet existing methods struggle with long sequences and complex motions, often leading to temporal instability and visual artifacts. To address these challenges, we propose ATGS, a Gaussian splatting based framework for volumetric video reconstruction. Our key insight is that explicitly tracking long term complex motion with individual Gaussian primitives is inherently unstable. Instead, we organize Gaussians around time conditioned anchors that localize their spatial and temporal support, thereby reducing long range motion complexity. We further introduce a temporal windowing strategy to activate only anchors relevant to the queried time, which improves scalability and temporal coherence. In addition, to ensure spatial and temporal stability, we design a compact set of multi level anchor features that encode global features, local spatial features, and local temporal features, jointly constraining Gaussian generation. Extensive experiments demonstrate that ATGS consistently outperforms prior methods on long sequence volumetric videos with complex motions. Project page: https://github.com/WuJH2001/ATGS.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-13
Open AccessATGS: Anchored Temporal Gaussian Splatting for Long Volumetric Video Representation
Volumetric video enables immersive free viewpoint rendering of dynamic real world scenes, yet existing methods struggle with long sequences and complex motions, often leading to temporal instability and visual artifacts. To address these challenges, we propose ATGS, a Gaussian splatting based framework for volumetric video reconstruction. Our key insight is that explicitly tracking long term complex motion with individual Gaussian primitives is inherently unstable. Instead, we organize Gaussians around time conditioned anchors that localize their spatial and temporal support, thereby reducing long range motion complexity. We further introduce a temporal windowing strategy to activate only anchors relevant to the queried time, which improves scalability and temporal coherence. In addition, to ensure spatial and temporal stability, we design a compact set of multi level anchor features that encode global features, local spatial features, and local temporal features, jointly constraining Gaussian generation. Extensive experiments demonstrate that ATGS consistently outperforms prior methods on long sequence volumetric videos with complex motions. Project page: https://github.com/WuJH2001/ATGS.
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 6967-6976
Excavating the Most Critical Gaussians: Sparse Selection and Structural Optimization for Efficient 3DGS Compression
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 6967-6976
Open AccessExcavating the Most Critical Gaussians: Sparse Selection and Structural Optimization for Efficient 3DGS Compression
- Open Access
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 3141-3150
High Fidelity Aggregated Planar Prior Assisted PatchMatch Multi-View Stereo
The quality of 3D models reconstructed by PatchMatch Multi-View Stereo remains a challenging problem due to unreliable photometric consistency in object boundaries and textureless areas. Since textureless areas usually exhibit strong planarity, previous methods used planar prior to improve the reconstruction performance. However, their planar prior ignores the depth discontinuity at the object boundary, making the boundary inaccurate (not sharp). In addition, due to the unreliable planar models in large-scale low-textured objects, the reconstruction results are incomplete. To address the above issues, we introduce the segmentation generated from Segment Anything Model into PatchMatch. Using segmentation to determine whether the depth is continuous based on the characteristics of segmentation and depth sharing boundaries. Then we construct Boundary Plane that fits the object boundary and Object Plane to increase consistency of planes in large-scale textureless objects. Finally, we use a probability graph model to calculate Aggregated Prior guided by Multiple Planes and embed it into the matching cost. The experimental results indicate that our method achieves SOTA in boundary sharpness on ETH3D and improves the completeness of weakly textured objects.
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 3141-3150
Open AccessHigh Fidelity Aggregated Planar Prior Assisted PatchMatch Multi-View Stereo
The quality of 3D models reconstructed by PatchMatch Multi-View Stereo remains a challenging problem due to unreliable photometric consistency in object boundaries and textureless areas. Since textureless areas usually exhibit strong planarity, previous methods used planar prior to improve the reconstruction performance. However, their planar prior ignores the depth discontinuity at the object boundary, making the boundary inaccurate (not sharp). In addition, due to the unreliable planar models in large-scale low-textured objects, the reconstruction results are incomplete. To address the above issues, we introduce the segmentation generated from Segment Anything Model into PatchMatch. Using segmentation to determine whether the depth is continuous based on the characteristics of segmentation and depth sharing boundaries. Then we construct Boundary Plane that fits the object boundary and Object Plane to increase consistency of planes in large-scale textureless objects. Finally, we use a probability graph model to calculate Aggregated Prior guided by Multiple Planes and embed it into the matching cost. The experimental results indicate that our method achieves SOTA in boundary sharpness on ETH3D and improves the completeness of weakly textured objects.