Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tian Bai 0005

dblp:05/6070-5 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
4since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Rendering · 67% Image and video coding · 33%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering › gaussian splatting
3d gaussian splatting
1.012026
Plug-and-Play Optimization for 3D Gaussian Splatting Compression: Distribution Regularization, Probabilistic Pruning and Detail Compensation · AAAI 2026
Image and video coding
entropy coding
1.012026
Plug-and-Play Optimization for 3D Gaussian Splatting Compression: Distribution Regularization, Probabilistic Pruning and Detail Compensation · AAAI 2026

Methods — techniques the papers use, named apart from their topics

residual learning · 1.0probabilistic pruning · 1.0KL divergence · 1.0
YearPublicationVenuePosition
2026 Plug-and-Play Optimization for 3D Gaussian Splatting Compression: Distribution Regularization, Probabilistic Pruning and Detail Compensation
abstract
Recent advancements in 3D Gaussian Splatting (3DGS) have demonstrated remarkable rendering quality, However, their substantial computational demands hinder practical deployment on resource-constrained devices. We propose a novel plug-and-play structured compression framework that significantly reduces computational overhead while maintaining rendering fidelity. We first discover that the statistical distribution of anchor vectors is decoupled from rendering quality. Based on this finding, we propose a distribution regularization method that enforces alignment to standard Gaussian distribution through KL divergence while optimizing Gaussian radius, significantly improving entropy coding efficiency. Second, we innovatively introduce an opacity-based probabilistic pruning mechanism that transforms pruning into an opacity optimization problem, achieving intelligent scene sparsification while allowing flexible adjustment according to hardware resources. Finally, we design a lightweight high-frequency compensation network that regards the high-frequency loss caused by over-compression as a residual and effectively recovers the high-frequency details lost during the compression process through residual learning. All modules are plug-and-play and can be seamlessly integrated into mainstream structured 3DGS frameworks. Extensive experiments on Synthetic-NeRF, Tanks&Temples, Mip-NeRF360 and DeepBlending datasets demonstrate that our method significantly reduces size by over 80x compared to vanilla 3DGS while simultaneously improving fidelity. Furthermore, it achieves a better size reduction and a 20% improvement in entropy encoding efficiency when compared to HAC, while meeting the requirements for real-time rendering.
Tian Bai 0005, Zheng Qiu, Ziyang Dai
AAAI1
2022 Question-relationship guided graph attention network for visual question answer
Liansheng Zhuang, Zhou Yu 0001, Tian Bai 0005
Multim. Syst.5
2021 Multi-Granularity Hypergraphs and Adversarial Complementary Learning for Person Re-identification
Tian Bai 0005, Wenyu Zhang 0004
BMVC2
2021 Multi-Scale Relation Network for Person Re-identification
abstract
Person re-identification (reID) has received extensive study and achieved great progress in recent years. Extensive research has proved that combining global and local features is an effective solution to improve the performance of person reidentification tasks. While many existing reID approaches are still suffering from occlusions, body part missing, different lighting, and background clutter, where the learned features may achieve a sub-optimal solution. In this paper, we propose an efficient network structure, Multi-Scale Relation Network (MSRN), which can not only extract robust regional features and global features but also integrate the asymptotic cues and relations between them. In addition, we introduce a dynamic loss weight as supplementary components to improve learning efficiency and the representation capacity of our model. Extensive experiments are conducted on three widely used datasets, including Market-I501, DukeMTMC-ReID and CUHK03-NP. The experimental results indicate that our proposed method achieves the state-of-the-art results on three datasets.
Tian Bai 0005, Wenyu Zhang 0004, Mingzhe Lu
ISCC2
2015 Automatic detection and removal of high-density impulse noises
abstract
This study presents a novel method for automatic detection and removal of high‐density impulse noises. The method consists of two parts: the impulse detection part and the impulse noise removal part. In impulse detection part, an automatic detector based on local mean and variance (LMVD) is presented, which can automatically pick out noisy image from massive images and output corrupted grey levels. The detector utilises LMVD of the neighbourhood of corrupted pixels to simulate the cognitive processes of human observing noisy image. In impulse noise removal part, the Newton–Thiele filter (NTF) instead of median filter is applied to remove impulse noise. The process to construct NTF can be divided into two steps: setting up the grid and constructing the Newton–Thiele's rational interpolation on the grid. First, eight adjacent pixels of the corrupted centre pixel are used to construct the two‐dimensional grid. If a pixel in the grid is corrupted, a four‐direction linear interpolation algorithm will be performed to provide a rough estimate to the corrupted pixel. Second, the corrupted centre pixel value will be updated by Newton–Thiele's rational interpolation on the grid. The NTF has better robustness than existing filters because it does not need to adjust window size or other parameters. Simulations reveal that the proposed detector and filter have perfect performance in terms of both quantitative evaluation and visual quality, especially it can remove the impulse noise effectively even at 90% noise level.
Tian Bai 0005, Jieqing Tan
IET Image Process.1
2014 A novel algorithm for removal of salt and pepper noise using continued fractions interpolation
Tian Bai 0005, Jieqing Tan
Signal Process.1