Demo Data from EDBT 2026 / reviewers in the wild / expert
Shuting Xia
dblp:347/1265
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 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
2 papers |
Image and video coding · 100% | |
| Artificial intelligence
2 papers |
3D vision · 49% Video understanding and tracking · 37% Efficient and distributed learning · 15% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video coding
point cloud compression |
1.5 | 2 | 2025 | LINR-PCGC: Lossless Implicit Neural Representations for Point Cloud Geometry Compression · ICCV 2025 Learning Dynamic Point Cloud Compression via Hierarchical Inter-frame Block Matching · ACM Multimedia 2023 |
Computer vision › 3D vision
implicit neural representation |
0.9 | 1 | 2025 | LINR-PCGC: Lossless Implicit Neural Representations for Point Cloud Geometry Compression · ICCV 2025 |
Image and video coding › point cloud compression
dynamic point cloud compression |
0.7 | 1 | 2023 | Learning Dynamic Point Cloud Compression via Hierarchical Inter-frame Block Matching · ACM Multimedia 2023 |
Machine learning › Efficient and distributed learning
model compression |
0.3 | 1 | 2025 | LINR-PCGC: Lossless Implicit Neural Representations for Point Cloud Geometry Compression · ICCV 2025 |
Methods — techniques the papers use, named apart from their topics
network initialization · 1.7multiscale sparse convolution · 1.7implicit neural representation · 1.7hierarchical block matching · 1.3deep entropy model · 1.3kNN attention · 0.7KNN-attention · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | LINR-PCGC: Lossless Implicit Neural Representations for Point Cloud Geometry CompressionabstractExisting AI-based point cloud compression methods struggle with dependence on specific training data distributions, which limits their real-world deployment. Implicit Neural Representation (INR) methods solve the above problem by encoding overfitted network parameters to the bitstream, resulting in more distribution-agnostic results. However, due to the limitation of encoding time and decoder size, current INR based methods only consider lossy geometry compression. In this paper, we propose the first INR based lossless point cloud geometry compression method called Lossless Implicit Neural Representations for Point Cloud Geometry Compression (LINR-PCGC). To accelerate encoding speed, we design a group of point clouds level coding framework with an effective network initialization strategy, which can reduce around 60% encoding time. A lightweight coding network based on multiscale SparseConv, consisting of scale context extraction, child node prediction, and model compression modules, is proposed to realize fast inference and compact decoder size. Experimental results show that our method consistently outperforms traditional and AI-based methods: for example, with the convergence time in the MVUB dataset, our method reduces the bitstream by approximately 21.21% compared to G-PCC TMC13v23 and 21.95% compared to SparsePCGC. Our project can be seen on https://huangwenjie2023.github.io/LINR-PCGC/. Qi Yang 0003, Shuting Xia, Yiling Xu, Zhu Li 0001 |
ICCV | 3 |
| 2023 | Learning Dynamic Point Cloud Compression via Hierarchical Inter-frame Block Matchingabstract3D dynamic point cloud (DPC) compression relies on mining its temporal context, which faces significant challenges due to DPC's sparsity and non-uniform structure. Existing methods are limited in capturing sufficient temporal dependencies. Therefore, this paper proposes a learning-based DPC compression framework via hierarchical block-matching-based inter-prediction module to compensate and compress the DPC geometry in latent space. Specifically, we propose a hierarchical motion estimation and motion compensation (Hie-ME/MC) framework for flexible inter-prediction, which dynamically selects the granularity of optical flow to encapsulate the motion information accurately. To improve the motion estimation efficiency of the proposed inter-prediction module, we further design a KNN-attention block matching (KABM) network that determines the impact of potential corresponding points based on the geometry and feature correlation. Finally, we compress the residual and the multi-scale optical flow with a fully-factorized deep entropy model. The experiment result on the MPEG-specified Owlii Dynamic Human Dynamic Point Cloud (Owlii) dataset shows that our framework outperforms the previous state-of-the-art methods and the MPEG standard V-PCC v18 in inter-frame low-delay mode. Shuting Xia, Tingyu Fan, Yiling Xu, Jenq-Neng Hwang, Zhu Li 0001 |
ACM Multimedia | 1 |