T3DNet: Compressing Point Cloud Models for Lightweight 3-D Recognition

The 3-D point cloud has been widely used in many mobile application scenarios, including autonomous driving and 3-D sensing on mobile devices. However, existing 3-D point cloud models tend to be large and cumbersome, making them hard to deploy on edged devices due to their high memory requirements and nonreal-time latency. There has been a lack of research on how to compress 3-D point cloud models into lightweight models. In this article, we propose a method called T3DNet (tiny 3-D network with augmentation and distillation) to address this issue. We find that the tiny model after network augmentation is much easier for a teacher to distill. Instead of gradually reducing the parameters through techniques, such as pruning or quantization, we predefine a tiny model and improve its performance through auxiliary supervision from augmented networks and the original model. We evaluate our method on several public datasets, including ModelNet40, ShapeNet, and ScanObjectNN. Our method can achieve high compression rates without significant accuracy sacrifice, achieving state-of-the-art performances on three datasets against existing methods. Amazingly, our T3DNet is 58 smaller and 54 faster than the original model yet with only 1.4 accuracy descent on the ModelNet40 dataset. Our code is available at https://github.com/Zhiyuan002/T3DNet.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Cybernetics
Published
2024-11-21
DOI
https://doi.org/10.1109/tcyb.2024.3487220
Citations
3
Primary Topic
3D Shape Modeling and Analysis
Type
article
Field-Weighted Citation Impact
1.12

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

T3DNet: Compressing Point Cloud Models for Lightweight 3-D Recognition

Jianfei Yang, Lihua Xie, Yunjiao Zhou, Zhiyuan Yang
3 citations
IEEE Transactions on Cybernetics
3D Shape Modeling and Analysis
1.12
article

T3DNet: Compressing Point Cloud Models for Lightweight 3-D Recognition

Jianfei Yang, Lihua Xie, Yunjiao Zhou, Zhiyuan Yang
article en
3 citations

Abstract

The 3-D point cloud has been widely used in many mobile application scenarios, including autonomous driving and 3-D sensing on mobile devices. However, existing 3-D point cloud models tend to be large and cumbersome, making them hard to deploy on edged devices due to their high memory requirements and nonreal-time latency. There has been a lack of research on how to compress 3-D point cloud models into lightweight models. In this article, we propose a method called T3DNet (tiny 3-D network with augmentation and distillation) to address this issue. We find that the tiny model after network augmentation is much easier for a teacher to distill. Instead of gradually reducing the parameters through techniques, such as pruning or quantization, we predefine a tiny model and improve its performance through auxiliary supervision from augmented networks and the original model. We evaluate our method on several public datasets, including ModelNet40, ShapeNet, and ScanObjectNN. Our method can achieve high compression rates without significant accuracy sacrifice, achieving state-of-the-art performances on three datasets against existing methods. Amazingly, our T3DNet is 58 smaller and 54 faster than the original model yet with only 1.4 accuracy descent on the ModelNet40 dataset. Our code is available at https://github.com/Zhiyuan002/T3DNet.

IEEE Transactions on CyberneticsVol. 55(2)
Nanyang Technological University (SG)
Nanyang Technological University
Openalex Percentile: Top 24%
3D Shape Modeling and Analysis
1.12
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.