EUVIMEDEUVIMED entdecken
Crossref

3-D Point Cloud Attribute Compression With $ p$-Laplacian Embedding Graph Dictionary Learning

Xin Li, Wenrui Dai, Shaohui Li, Chenglin Li, Junni Zou, Hongkai Xiong

IEEE Transactions on Pattern Analysis and Machine Intelligence · 2024-02 · 46 (2) · 975-993

DOI: 10.1109/tpami.2023.3328377 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024-02. Verfasst von Xin Li und 5 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 79 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Program of Shanghai Science and Technology Innovation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

3-D point clouds facilitate 3-D visual applications with detailed information of objects and scenes but bring about enormous challenges to design efficient compression technologies. The irregular signal statistics and high-order geometric structures of 3-D point clouds cannot be fully exploited by existing sparse representation and deep learning based point cloud attribute compression schemes and graph dictionary learning paradigms. In this paper, we propose a novel p-Laplacian embedding graph dictionary learning framework that jointly exploits the varying signal statistics and high-order geometric structures for 3-D point cloud attribute compression. The proposed framework formulates a nonconvex minimization constrained by p-Laplacian embedding regularization to learn a graph dictionary varying smoothly along the high-order geometric structures. An efficient alternating optimization paradigm is developed by harnessing ADMM to solve the nonconvex minimization. To our best knowledge, this paper proposes the first graph dictionary learning framework for point cloud compression. Furthermore, we devise an efficient layered compression scheme that integrates the proposed framework to exploit the correlations of 3-D point clouds in a structured fashion. Experimental results demonstrate that the proposed framework is superior to state-of-the-art transform-based methods in M-term approximation and point cloud attribute compression and outperforms recent MPEG G-PCC reference software.

Förderung

  • National Natural Science Foundation of China
  • Program of Shanghai Science and Technology Innovation

Zitieren

APA

Li, X., Dai, W., Li, S., Li, C., Zou, J., & Xiong, H. (2024). 3-D Point Cloud Attribute Compression With $ p$-Laplacian Embedding Graph Dictionary Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 46(2), 975-993. https://doi.org/10.1109/tpami.2023.3328377

Vancouver

Li X, Dai W, Li S, Li C, Zou J, Xiong H. 3-D Point Cloud Attribute Compression With $ p$-Laplacian Embedding Graph Dictionary Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2024;46(2):975-993. doi:10.1109/tpami.2023.3328377

BibTeX
@article{Li2024,
  author = {Li, Xin and Dai, Wenrui and Li, Shaohui and Li, Chenglin and Zou, Junni and Xiong, Hongkai},
  title = {3-D Point Cloud Attribute Compression With $ p$-Laplacian Embedding Graph Dictionary Learning},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {2024},
  volume = {46},
  number = {2},
  pages = {975--993},
  doi = {10.1109/tpami.2023.3328377}
}
Kostenlos starten →