Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

U-Motion: Learned Point Cloud Video Compression with U-Structured Temporal Context Generation

T0 review · 3 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read U-Motion, a learned point cloud video codec, reports double-digit bit-rate savings over MPEG G-PCC-GesTM and the learning-based Unicorn via hierarchical group motion compensation.

desk verdict A well-engineered U-structured inter-prediction framework for point cloud video, but the headline gains are undermined by a self-implemented Unicorn baseline and an underspecified tuning protocol. read the letter →

arxiv 2411.14501 v4 pith:NNGLFXN4 submitted 2024-11-21 cs.CV eess.IV

Tingyu Fan , Yueyu Hu , Ran Gong , Yao Wang This is my paper · ORCID
classification cs.CVeess.IV
keywords pointcloudvideocompressionlearning-basedmotionestimationcompensationU-Netarchitecturerate-distortionoptimizationattributegeometry
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that point cloud video compression can be substantially improved by doing explicit, multi-scale motion estimation and compensation on the 3D point cloud itself, rather than relying on learned convolutional kernels or 2D projections as in prior methods. The proposed system, U-Motion, uses a U-Net-like hierarchy (U-Inter) that propagates motion information top-down, predictively codes motion bottom-up, and warps the reference frame with multiple motion groups per scale. On the MPEG Common Test Condition for dense dynamic point clouds, U-Motion reports an average 14.11% bit-rate reduction over MPEG G-PCC-GesTM v3.0 for color (Y-PSNR) and 22.75%/25.74% reductions over the learning-based Unicorn for geometry (D1/D2). If these numbers hold, learned motion estimation becomes a practical tool for both geometry and attribute coding in a single codec.

What carries the argument

The central mechanism is the U-Inter module, a U-Net-shaped inter-frame predictor embedded at each octree level. It combines (1) top-down motion propagation, which fuses fine-scale motion features into coarser scales so that motion at every scale is informed by the full hierarchy; (2) bottom-up motion predictive coding, which contextually detaches and restores motion features to cut motion bit rate; and (3) multi-scale group motion compensation, which divides latent channels into groups and warps each group with its own 3D adaptive weighted interpolation (3DAWI) of the reference frame. A spatial-temporal predictive coding module (context detach/restore) then codes the current frame's latent against both the warped temporal context and an intra context from the lower scale.

What would settle it

Re-run the attribute experiments with lambda/QP pairs tuned only on the 8iVFB training sequences and evaluate on the four Owlii test sequences; if the CTC-Overall Y-PSNR BD-rate gain over G-PCC-GesTM falls from -14.11% to a much smaller number, the reported gain depends on tuning on test data. Similarly, for geometry, retune the six rate points on 8iVFB only and recompute the D1/D2 BD-rate against Unicorn.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that a single learned codec can outperform both the MPEG rule-based standard and the prior learned state-of-the-art by treating motion as a hierarchical, rate-constrained quantity. The U-Inter module estimates motion coarse-to-fine, propagates fine motion details to coarser scales via top-down connections, and compresses motion features bottom-up using decoded coarser-scale motion as context. Multi-scale group motion compensation then warps multiple feature groups per scale, and a spatial-temporal predictive coding module removes remaining cross-scale redundancy. The paper reports CTC-Overall BD-rate gains of -14.11% (Y) and -9.84% (YUV) against G-PCC-GesTM for attributes, and -22.75% (D1) and -25.74% (D2) against Unicorn for geometry, with larger gains on 10-bit sequences that match the training distribution.

Load-bearing premise

The experimental gains assume that the rate-control operating points (lambda and QP) were tuned on data separate from the test sequences, since the paper says the pairs were chosen by traversing 'a subset of dataset' without stating that the subset excludes the evaluation set.

Editorial extensions

If this is right

  • If U-Motion's gains hold at the claimed magnitudes, learned point cloud video codecs can now beat the MPEG standard on both geometry and color with one architecture, which simplifies hardware and deployment.
  • The rate-control scheme from DCVC-FM (global-and-local quantization) lets a single trained model operate across a wide range of bit rates, so one codec can serve streaming scenarios without retraining per rate.
  • Multi-scale group motion compensation suggests that feature channels in a point cloud latent can have different motion, so future codecs may allocate finer motion groups where local movement is large.
  • The authors' rate-allocation analysis shows that most motion bits are spent at the two lowest scales, implying that higher-scale residual motion coding may be unnecessary; they themselves flag this as a direction for future versions.
  • Because the attribute experiments assume losslessly coded geometry, the reported attribute gains are for color-only compression, and a full-system comparison that includes geometry bits could change the absolute numbers though not necessarily the ranking.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable extension: applying the same U-structured motion module to larger-motion point clouds such as LiDAR scans would stress the fine-scale motion estimation, where the paper's own visualizations show the largest gains.
  • The authors leave implicit that U-Inter could be used as a temporal prediction plugin for any static point cloud codec, since the motion bitstream is separated from the latent bitstream.
  • One implication of the rate-allocation analysis is that future versions could drop higher-scale motion coding entirely, reducing complexity without quality loss, a point the paper mentions only as future work.
  • A cross-domain guess worth checking: the U-shaped motion propagation may transfer to other irregular 3D data such as dynamic meshes or neural radiance fields with temporal structure.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper proposes U-Motion, a learned point cloud video codec that handles both geometry and attributes via a hierarchical U-structured inter-frame prediction module (U-Inter). U-Inter performs coarse-to-fine motion estimation, top-down motion propagation, bottom-up motion predictive coding, and multi-scale group motion compensation, followed by a spatial-temporal predictive coding module that removes cross-scale redundancy. Experiments follow the MPEG CTC for dense dynamic point clouds. The authors report BD-rate gains over G-PCC-GesTM v3.0 for attribute compression and over the learning-based Unicorn and D-DPCC for both attribute and geometry compression, together with ablations that support the usefulness of each proposed component.

Significance. If the reported gains are reliable, U-Motion is a meaningful step for learned dynamic point cloud compression: it extends explicit motion estimation/compensation to a unified geometry-and-attribute framework, and the proposed multi-scale group motion compensation with top-down propagation is a well-motivated architectural contribution. The paper includes multiple ablation studies that isolate the contribution of each module, which strengthens the internal evidence. However, the significance currently hinges on comparisons against a self-implemented Unicorn baseline trained on a different data distribution, on an unspecified tuning procedure for the reported rate points, and on an abstract-level claim of 'significant gains' that is not supported on two of the four MPEG CTC test sequences. These issues are load-bearing and need to be addressed before the central claims can be accepted.

major comments (3)
  1. [Section 4.2, Tables 1 and 2] The comparison against Unicorn is based on the authors' own re-implementation, not the original code, and Section 4.2 admits that the re-implementation was trained on 8iVFB only, which 'yields lower performance for basketball player than that reported in [33] due to the data distribution difference.' Because the reported BD-rate gains over Unicorn (e.g., -24.10% Y for attributes and -22.75% D1 for geometry) are measured against this potentially weaker model, the claim of significant gains over 'recently published learning-based methods' is not established. The authors should present published Unicorn numbers on the same test sequences and settings, or otherwise validate their re-implementation, and should explicitly qualify the comparison as being against a re-trained baseline.
  2. [Supplementary Section 2.1] The reported R-D curves are produced from eleven lambda/QP pairs that are selected by traversing combinations 'on a subset of dataset.' The paper does not state whether this subset is disjoint from the six test sequences. If any test sequence is included in the tuning subset, the reported BD-rate gains are inflated and do not reflect generalization. The authors must specify the tuning subset, demonstrate that it is disjoint from the evaluation set, and ideally report sensitivity of the BD-rate results to the choice of operating points.
  3. [Table 1 and Section 4.3] The abstract claims 'significant gains' over G-PCC-GesTM, but Table 1 shows that on dancer_vox11 U-Motion loses to G-PCC-GesTM by +20.92% Y and +28.94% YUV, and on basketball_player_vox11 the Y gain is only -4.05%. The CTC-Overall average is therefore driven primarily by the two 10-bit sequences, exercise_vox10 and model_vox10. The paper should either temper the abstract and conclusion to reflect the per-sequence variability, or provide evidence that the 11-bit sequence losses are an artifact of the experimental setup rather than a systematic weakness.
minor comments (4)
  1. [References [32] and [33]] References [32] and [33] list the same title 'A versatile point cloud compressor using universal multiscale conditional coding--part i: Geometry'; one of these is likely intended to be Part II for attributes and should be corrected.
  2. [Section 3.3] The sentence 'and add to the the decoded residual motion' contains a duplicated 'the' and should be corrected.
  3. [Figure 7] The legend label 'w/o bottm-up' contains a typo: it should read 'w/o bottom-up'.
  4. [Section 4.3] The statement that attribute compression assumes losslessly coded geometry whose bits are not factored into the rate is important context, but it should be repeated clearly in the abstract or introduction so that readers do not compare these numbers with end-to-end codecs that include geometry bits.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the paper's claims are empirical R-D comparisons, with no derivation chain that reduces to its own inputs.

full rationale

U-Motion is an empirical compression system; its central claims are BD-rate measurements against G-PCC-GesTM, Unicorn, and D-DPCC. There is no analytical derivation in which an output quantity is defined in terms of the quantity it is said to predict, nor is any reported gain equal by construction to a fitted parameter. The supplementary selection of lambda/QP pairs 'on a subset of dataset' is a rate-point tuning procedure, not a fitted parameter renamed as a prediction; without evidence that the subset includes the test sequences, this is a protocol-transparency concern, not a circular reduction. The Unicorn baseline is a re-implementation trained on 8iVFB only, and the D-DPCC numbers were 'provided by the authors'; these bear on whether the comparisons are faithful and fair, but they are not a self-citation chain that forces the conclusion, since D-DPCC is published prior work and the comparisons are external benchmarks rather than derivations. Borrowed components (3DAWI from [9], APU from [32], YOGA base-layer, DCVC-FM rate control) are cited as building blocks, not as justifications that the claimed gains hold by definition. No step in the paper reduces Eq. X to Eq. Y by construction, so the circularity score is 0.

Assumptions & free parameters 3 free parameters · 5 assumptions · 0 invented entities

The central claim rests primarily on the network architecture, which is described only at a module level without released code. The main data-dependent free parameters are the lambda/QP operating points tuned on a dataset subset; if that subset overlaps the test sequences, the reported gains are inflated. No new physical entities are introduced.

free parameters (3)
  • lambda values for rate control = [300, 460, 705, 910, 1655, 2537, 3888, 5960, 9134, 14000, 16000]
    These rate-distortion tradeoff parameters are selected by traversing combinations on a subset of the dataset (Supplementary Section 2.1) to produce the R-D curve; they are not fixed a priori.
  • G-PCC base layer QP values = [20, 20, 16, 16, 16, 16, 12, 12, 8, 8, 8]
    The QP for the G-PCC base layer is paired with lambda and tuned on the same subset to achieve the best R-D pairs; this couples the learned model to a hand-tuned standard codec operating point.
  • motion group sizes G_l (per scale) = not specified exactly; large at coarse scales, merged to fewer at fine scales
    A design choice that trades motion expressiveness against complexity; no ablation of the specific sizes is provided.
assumptions (5)
  • standard math Gaussian entropy model with CDF-based probability estimation for quantized features
    Adopted from Ballé et al. for entropy coding; assumed valid for the learned latent distributions.
  • domain assumption Sparse convolution (Minkowski) can represent and process point cloud latents at multiple scales
    Underpins all encoder/decoder and motion estimation modules; no proof that sparse convolution preserves the needed information.
  • domain assumption K-NN search-based adaptive weighted interpolation (3DAWI) yields accurate temporal context for arbitrary motions
    The warping in Eq. (2) assumes nearest neighbors in the reference frame provide a good reconstruction; the alpha penalty and K are not analyzed.
  • domain assumption Training data (8iVFB, 10-bit, low motion) is representative enough for test data (Owlii, including 11-bit, larger motion)
    The paper itself reports degraded performance on 11-bit sequences, questioning this premise.
  • domain assumption MPEG CTC protocol (including use of original frame as I-frame and excluding I-frame bits) is an appropriate comparison setting
    Used for all methods, but this protocol favors P-frame-only learned codecs over full codecs like G-PCC that may need intra coding.

how reviews work

0 comments
Cite this review

Pith. "Pith review of U-Motion: Learned Point Cloud Video Compression with U-Structured Temporal Context Generation." pith.science (2026). https://pith.science/paper/NNGLFXN4

@misc{pith2026241114501,
  author       = {Pith},
  title        = {Pith review of: U-Motion: Learned Point Cloud Video Compression with U-Structured Temporal Context Generation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NNGLFXN4}},
  note         = {Machine review of arXiv:2411.14501}
}
read the original abstract

Point cloud video (PCV) is a versatile 3D representation of dynamic scenes with emerging applications. This paper introduces U-Motion, a learning-based compression scheme for both PCV geometry and attributes. We propose a U-Structured inter-frame prediction framework, U-Inter, which performs explicit motion estimation and compensation (ME/MC) at different scales with varying levels of detail. It integrates Top-Down (Fine-to-Coarse) Motion Propagation, Bottom-Up Motion Predictive Coding and Multi-scale Group Motion Compensation to enable accurate motion estimation and efficient motion compression at each scale. In addition, we design a multi-scale spatial-temporal predictive coding module to capture the cross-scale spatial redundancy remaining after U-Inter prediction. We conduct experiments following the MPEG Common Test Condition for dense dynamic point clouds and demonstrate that U-Motion can achieve significant gains over MPEG G-PCC-GesTM v3.0 and recently published learning-based methods for both geometry and attribute compression.

Figures

Figures reproduced from arXiv: 2411.14501 by the authors.

Figure 1
Figure 1. The overall architecture of U-Motion for attribute. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. The network architecture for U-Inter module. [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. The network architecture for Spatial-Temporal Predic [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (8 more)
Figure 4
Figure 4. Figure 4: Y-PSNR Performance comparison on attribute (color) compression among our method, Unicorn and G-PCC-GesTM. [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 5
Figure 5. Figure 5: D1-PSNR performance comparison on lossy geometry compression among our method, Unicorn and D-DPCC. The inconsistency [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]
Figure 7
Figure 7. Figure 7: Ablation study on U-Inter’s different modules. [PITH_FULL_IMAGE:figures/full_fig_p007_7.png]
Figure 8
Figure 8. Figure 8: Group motion flow magnitude visualization. In the ”Combination” column, gray points belong to reference frame, whereas black [PITH_FULL_IMAGE:figures/full_fig_p008_8.png]
Figure 9
Figure 9. Figure 9: Detailed architectures of each module. Conv( [PITH_FULL_IMAGE:figures/full_fig_p009_9.png]
Figure 10
Figure 10. Figure 10: YUV-PSNR Performance comparison on attribute (color) compression among our method, Unicorn and G-PCC-GesTM. [PITH_FULL_IMAGE:figures/full_fig_p010_10.png]
Figure 11
Figure 11. Figure 11: D2-PSNR performance comparison on lossy geometry compression among our method, Unicorn and D-DPCC [PITH_FULL_IMAGE:figures/full_fig_p010_11.png]
Figure 12
Figure 12. Figure 12: Rate allocation between motion and latent over differ [PITH_FULL_IMAGE:figures/full_fig_p011_12.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Point Cloud Compression and Objective Quality Assessment: A Survey

    cs.CV 2025-06 conditional novelty 2.0 of 10

    A survey of point cloud compression and objective quality assessment that benchmarks representative methods on standard datasets and distills design insights.

Reference graph

Works this paper leans on

36 extracted references · 34 canonical work pages · cited by 1 Pith paper

  1. [33]

    A versatile point cloud compressor us- ing universal multiscale conditional coding–part i: Geome- try

    Jianqiang Wang, Ruixiang Xue, Jiaxin Li, Dandan Ding, Yi Lin, and Zhan Ma. A versatile point cloud compressor us- ing universal multiscale conditional coding–part i: Geome- try. IEEE transactions on pattern analysis and machine in- telligence, 2024. 1, 2, 6, 7

    work page 2024

  2. [1]

    [ai-3dgc][ee5.6] summary report of ee 5.6 on dataset selection for ai-pcc call for proposal (cfp)

    Anique Akhtar and Geert Van Der Auwera. [ai-3dgc][ee5.6] summary report of ee 5.6 on dataset selection for ai-pcc call for proposal (cfp). MPEG-I WG 07 MPEG 3D Graphics Coding and Haptics Coding, m66563, 2024. 2

    work page 2024

  3. [2]

    Inter- frame compression for dynamic point cloud geometry cod- ing

    Anique Akhtar, Zhu Li, and Geert Van der Auwera. Inter- frame compression for dynamic point cloud geometry cod- ing. IEEE Transactions on Image Processing, 2024. 2

    2024

  4. [3]

    End- to-end optimized image compression

    Johannes Ball ´e, Valero Laparra, and Eero P Simoncelli. End- to-end optimized image compression. In 5th International Conference on Learning Representations, ICLR 2017, 2017. 5

    work page 2017

  5. [4]

    Variational image compres- sion with a scale hyperprior

    Johannes Ball ´e, David Minnen, Saurabh Singh, Sung Jin Hwang, and Nick Johnston. Variational image compres- sion with a scale hyperprior. In International Conference on Learning Representations, 2018. 5

    work page 2018

  6. [5]

    4d spatio-temporal convnets: Minkowski convolutional neural networks

    Christopher Choy, JunYoung Gwak, and Silvio Savarese. 4d spatio-temporal convnets: Minkowski convolutional neural networks. In CVPR, pages 3075–3084, 2019. 1, 2

    work page 2019

  7. [6]

    G- pcc 2nd edition codec description

    WG 07 MPEG 3D Graphics Coding and Haptics Coding. G- pcc 2nd edition codec description. MPEG-I WG 07 MPEG 3D Graphics Coding and Haptics Coding, w23041, 2023. 2

    work page 2023

  8. [7]

    Motion- compensated compression of dynamic voxelized point clouds

    Ricardo L de Queiroz and Philip A Chou. Motion- compensated compression of dynamic voxelized point clouds. IEEE Transactions on Image Processing , 26(8): 3886–3895, 2017. 2

    work page 2017

Show all 36 references
  1. [8]

    8i voxelized full bodies-a vox- elized point cloud dataset

    Eugene d’Eon, Bob Harrison, Taos Myers, and Philip A Chou. 8i voxelized full bodies-a vox- elized point cloud dataset. ISO/IEC JTC1/SC29 Joint WG11/WG1 (MPEG/JPEG) input document WG11M40059/WG1M74006, 7:8, 2017. 6

    2017

  2. [9]

    D-dpcc: Deep dynamic point cloud compression via 3d motion prediction

    Tingyu Fan, Linyao Gao, Yiling Xu, Zhu Li, and Dong Wang. D-dpcc: Deep dynamic point cloud compression via 3d motion prediction. In Proceedings of the Thirty- First International Joint Conference on Artificial Intelli- gence, IJCAI-22, pages 898–904. International Joint Confer...

    2022

  3. [10]

    3dac: Learning attribute compression for point clouds

    Guangchi Fang, Qingyong Hu, Hanyun Wang, Yiling Xu, and Yulan Guo. 3dac: Learning attribute compression for point clouds. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 14819– 14828, 2022. 2

    2022

  4. [11]

    Oc- tattention: Octree-based large-scale contexts model for point cloud compression

    Chunyang Fu, Ge Li, Rui Song, Wei Gao, and Shan Liu. Oc- tattention: Octree-based large-scale contexts model for point cloud compression. In Proceedings of the AAAI conference on artificial intelligence, pages 625–633, 2022. 2

    2022

  5. [12]

    An overview of ongoing point cloud compression standardiza- tion activities: Video-based (v-pcc) and geometry-based (g- pcc)

    Danillo Graziosi, Ohji Nakagami, Shinroku Kuma, Alexan- dre Zaghetto, Teruhiko Suzuki, and Ali Tabatabai. An overview of ongoing point cloud compression standardiza- tion activities: Video-based (v-pcc) and geometry-based (g- pcc). APSIPA Transactions on Signal and Information...

    2020

  6. [13]

    Best-effort projection based attribute compression for 3d point cloud

    Lanyi He, Wenjie Zhu, and Yiling Xu. Best-effort projection based attribute compression for 3d point cloud. In2017 23rd Asia-Pacific Conference on Communications (APCC), pages 1–6. IEEE, 2017. 2

    2017

  7. [14]

    Low latency point cloud rendering with learned splatting

    Yueyu Hu, Ran Gong, Qi Sun, and Yao Wang. Low latency point cloud rendering with learned splatting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pat- tern Recognition, pages 5752–5761, 2024. 1

    2024

  8. [15]

    Fvc: A new framework towards deep video compression in feature space

    Zhihao Hu, Guo Lu, and Dong Xu. Fvc: A new framework towards deep video compression in feature space. In Pro- ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 1502–1511, 2021. 2

    2021

  9. [16]

    Coarse-to-fine deep video coding with hyperprior- guided mode prediction

    Zhihao Hu, Guo Lu, Jinyang Guo, Shan Liu, Wei Jiang, and Dong Xu. Coarse-to-fine deep video coding with hyperprior- guided mode prediction. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 5921–5930, 2022. 2

    2022

  10. [17]

    An end-to-end dynamic point cloud geometry compression in latent space

    Zhaoyi Jiang, Guoliang Wang, Gary KL Tam, Chao Song, Frederick WB Li, and Bailin Yang. An end-to-end dynamic point cloud geometry compression in latent space. Displays, 80:102528, 2023. 2, 3, 4, 8

    2023

  11. [18]

    Owlii dy- namic human mesh sequence dataset

    Cao Keming, Xu Yi, Lu Yao, and Wen Ziyu. Owlii dy- namic human mesh sequence dataset. Document ISO/IEC JTC1/SC29/WG11 m42816, San Diego, 2018. 6

    2018

  12. [19]

    Deep contextual video com- pression

    Jiahao Li, Bin Li, and Yan Lu. Deep contextual video com- pression. Advances in Neural Information Processing Sys- tems, 34:18114–18125, 2021. 2, 4, 5

    2021

  13. [20]

    Hybrid spatial-temporal en- tropy modelling for neural video compression

    Jiahao Li, Bin Li, and Yan Lu. Hybrid spatial-temporal en- tropy modelling for neural video compression. In Proceed- ings of the 30th ACM International Conference on Multime- dia, pages 1503–1511, 2022. 3, 1

    2022

  14. [21]

    Neural video compression with diverse contexts

    Jiahao Li, Bin Li, and Yan Lu. Neural video compression with diverse contexts. In Proceedings of the IEEE/CVF Con- ference on Computer Vision and Pattern Recognition, pages 22616–22626, 2023. 3, 4

    2023

  15. [22]

    Neural video compression with feature modulation

    Jiahao Li, Bin Li, and Yan Lu. Neural video compression with feature modulation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 26099–26108, 2024. 3, 5, 1

    2024

  16. [23]

    Dvc: An end-to-end deep video com- pression framework

    Guo Lu, Wanli Ouyang, Dong Xu, Xiaoyun Zhang, Chunlei Cai, and Zhiyong Gao. Dvc: An end-to-end deep video com- pression framework. In Proceedings of the IEEE/CVF con- ference on computer vision and pattern recognition , pages 11006–11015, 2019. 2

    2019

  17. [24]

    White paper on g-pcc

    Ohji Nakagami, Sebastien Lasserre, Sugio Toshiyasu, and Marius Preda. White paper on g-pcc. In ISO/IEC JTC 1/SC 29/AG 03 N0111, 2023. 1, 2

    2023

  18. [25]

    Con- trastive pre-training with multi-view fusion for no-reference point cloud quality assessment

    Ziyu Shan, Yujie Zhang, Qi Yang, Haichen Yang, Yiling Xu, Jenq-Neng Hwang, Xiaozhong Xu, and Shan Liu. Con- trastive pre-training with multi-view fusion for no-reference point cloud quality assessment. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Re...

    2024

  19. [26]

    Deep-pcac: An end-to-end deep lossy compres- sion framework for point cloud attributes.IEEE Transactions on Multimedia, 24:2617–2632, 2021

    Xihua Sheng, Li Li, Dong Liu, Zhiwei Xiong, Zhu Li, and Feng Wu. Deep-pcac: An end-to-end deep lossy compres- sion framework for point cloud attributes.IEEE Transactions on Multimedia, 24:2617–2632, 2021. 1

    2021

  20. [27]

    Temporal context mining for learned video compression

    Xihua Sheng, Jiahao Li, Bin Li, Li Li, Dong Liu, and Yan Lu. Temporal context mining for learned video compression. IEEE Transactions on Multimedia, 25:7311–7322, 2022. 2

    2022

  21. [28]

    Graph- based motion estimation and compensation for dynamic 4 3d point cloud compression

    Dorina Thanou, Philip A Chou, and Pascal Frossard. Graph- based motion estimation and compensation for dynamic 4 3d point cloud compression. In 2015 IEEE International Conference on Image Processing (ICIP), pages 3235–3239. IEEE, 2015. 2

    2015

  22. [29]

    Multi- scale point cloud geometry compression

    Jianqiang Wang, Dandan Ding, Zhu Li, and Zhan Ma. Multi- scale point cloud geometry compression. In2021 Data Com- pression Conference (DCC), pages 73–82. IEEE, 2021. 2, 1

    2021

  23. [30]

    Sparse tensor-based multi- scale representation for point cloud geometry compression

    Jianqiang Wang, Dandan Ding, Zhu Li, Xiaoxing Feng, Chuntong Cao, and Zhan Ma. Sparse tensor-based multi- scale representation for point cloud geometry compression. IEEE TPAMI, 45(7):9055–9071, 2022. 1, 2

    2022

  24. [31]

    Dynamic point cloud geometry compression us- ing multiscale inter conditional coding

    Jianqiang Wang, Dandan Ding, Hao Chen, and Zhan Ma. Dynamic point cloud geometry compression us- ing multiscale inter conditional coding. arXiv preprint arXiv:2301.12165, 2023. 1

    2023 arXiv

  25. [32]

    A versatile point cloud compressor us- ing universal multiscale conditional coding–part i: Geome- try

    Jianqiang Wang, Ruixiang Xue, Jiaxin Li, Dandan Ding, Yi Lin, and Zhan Ma. A versatile point cloud compressor us- ing universal multiscale conditional coding–part i: Geome- try. IEEE transactions on pattern analysis and machine in- telligence, 2024. 1, 2, 5, 6

    2024

  26. [34]

    Learning dynamic point cloud compression via hi- erarchical inter-frame block matching

    Shuting Xia, Tingyu Fan, Yiling Xu, Jenq-Neng Hwang, and Zhu Li. Learning dynamic point cloud compression via hi- erarchical inter-frame block matching. In Proceedings of the 31st ACM International Conference on Multimedia , pages 7993–8003, 2023. 2, 3

    2023

  27. [35]

    Yoga: Yet another geometry-based point cloud compressor

    Junteng Zhang, Tong Chen, Dandan Ding, and Zhan Ma. Yoga: Yet another geometry-based point cloud compressor. In Proceedings of the 31st ACM International Conference on Multimedia, pages 9070–9081, 2023. 1, 2

    2023

  28. [36]

    View- dependent dynamic point cloud compression

    Wenjie Zhu, Zhan Ma, Yiling Xu, Li Li, and Zhu Li. View- dependent dynamic point cloud compression. IEEE Trans- actions on Circuits and Systems for Video Technology , 31 (2):765–781, 2020. 2 5

    2020

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.