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

XiaoHan Li

dblp:384/3756 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0003-3109-9413ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 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
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › point cloud compression
geometry compression
0.812024
Multi-Space Point Geometry Compression With Progressive Relation-Aware Transformer · IEEE Trans. Multim. 2024
Image and video coding › point cloud compression
learned point cloud compression
0.812024
Multi-Space Point Geometry Compression With Progressive Relation-Aware Transformer · IEEE Trans. Multim. 2024
Image and video coding
point cloud compression
0.812024
Multi-Space Point Geometry Compression With Progressive Relation-Aware Transformer · IEEE Trans. Multim. 2024

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

transformer · 0.8entropy coding · 0.8autoencoder · 0.8attention · 0.8
YearPublicationVenuePosition
2024 Multi-Space Point Geometry Compression With Progressive Relation-Aware Transformer
abstract
Deep network-based point cloud geometry compression is becoming more crucial and attractive due to constantly expanding 3D applications. The current strategy employing holistic point clouds as input imposes limitations on the compressed point cloud size and results in the loss of local geometry information, simplifying the repetition of local point cloud patterns. Nevertheless, employing point cloud patches as input results in a fresh set of erroneous points within the spliced point cloud. This occurrence can be attributed to the loss of global information and the relationship among the point cloud patches. Hence, this paper introduces a novel framework for progressive downsampling point cloud compression that follows the principles of two distinct methodologies. Our strategy still uses the autoencoder structure. Specifically, the encoder reduces the point cloud size and learns features incorporating local patch structure information and global semantic information. At the same time, the decoder upsamples the quantized and entropy-encoded features to reconstruct the original point cloud. More specifically, the geometrical details inside the patch and the relationship between patches are encoded to obtain the point cloud's global semantic and local geometry information. Concurrently, the computational burden is reduced by partitioning the complete point cloud input into segments and conducting continuous downsampling. Furthermore, we introduced an attention-based point cloud deconvolution module to address the localized repeating concentrations in reconstructed point clouds resulting from linear interpolation. This module samples the parent node and its neighboring relationships in the multi-space domain to improve the characteristics of the parent nodes to be sampled. It then uses the deconvolution to create sub-node characteristics that are more varied than the linear interpolation. Empirical evidence demonstrates that the proposed methodology achieves a effective equilibrium between the compression quality and ratio.
Wenxiang Shen, Baoye Zhang, Hao Xu 0027, XiaoHan Li, Jun Wu 0006
IEEE Trans. Multim.4