PointCLIMB: An Exemplar-Free Point Cloud Class Incremental Benchmark

• URL: http://arxiv.org/abs/2304.06775v1
• Date: Thu, 13 Apr 2023 18:47:29 GMT
• Title: PointCLIMB: An Exemplar-Free Point Cloud Class Incremental Benchmark
• Authors: Shivanand Kundargi, Tejas Anvekar, Ramesh Ashok Tabib, Uma Mudenagudi
• Abstract summary: We pioneer to leverage exemplar free class incremental learning on Point Clouds. We setup a benchmark for 3D Exemplar free class incremental learning. We investigate performance of various backbones on 3D-Exemplar Free Class Incremental Learning framework.
• Score: 11.992472563628283
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Point clouds offer comprehensive and precise data regarding the contour and configuration of objects. Employing such geometric and topological 3D information of objects in class incremental learning can aid endless application in 3D-computer vision. Well known 3D-point cloud class incremental learning methods for addressing catastrophic forgetting generally entail the usage of previously encountered data, which can present difficulties in situations where there are restrictions on memory or when there are concerns about the legality of the data. Towards this we pioneer to leverage exemplar free class incremental learning on Point Clouds. In this paper we propose PointCLIMB: An exemplar Free Class Incremental Learning Benchmark. We focus on a pragmatic perspective to consider novel classes for class incremental learning on 3D point clouds. We setup a benchmark for 3D Exemplar free class incremental learning. We investigate performance of various backbones on 3D-Exemplar Free Class Incremental Learning framework. We demonstrate our results on ModelNet40 dataset.

Related papers

• Meta Episodic learning with Dynamic Task Sampling for CLIP-based Point Cloud Classification [6.195058023850564]
  We propose a novel meta-episodic learning framework for CLIP-based point cloud classification. We introduce dynamic task sampling within the episode based on performance memory. Experiments show an average performance gain of 3-6% on ModelNet40 and ScanobjectNN datasets.
  arXiv  Detail & Related papers  (2024-04-01T01:56:27Z)
• Test-Time Augmentation for 3D Point Cloud Classification and Segmentation [40.62640761825697]
  Data augmentation is a powerful technique to enhance the performance of a deep learning task. This work explores test-time augmentation (TTA) for 3D point clouds.
  arXiv  Detail & Related papers  (2023-11-22T04:31:09Z)
• PointLLM: Empowering Large Language Models to Understand Point Clouds [63.39876878899682]
  PointLLM understands colored object point clouds with human instructions. It generates contextually appropriate responses, illustrating its grasp of point clouds and common sense.
  arXiv  Detail & Related papers  (2023-08-31T17:59:46Z)
• Clustering based Point Cloud Representation Learning for 3D Analysis [80.88995099442374]
  We propose a clustering based supervised learning scheme for point cloud analysis. Unlike current de-facto, scene-wise training paradigm, our algorithm conducts within-class clustering on the point embedding space. Our algorithm shows notable improvements on famous point cloud segmentation datasets.
  arXiv  Detail & Related papers  (2023-07-27T03:42:12Z)
• Point2Vec for Self-Supervised Representation Learning on Point Clouds [66.53955515020053]
  We extend data2vec to the point cloud domain and report encouraging results on several downstream tasks. We propose point2vec, which unleashes the full potential of data2vec-like pre-training on point clouds.
  arXiv  Detail & Related papers  (2023-03-29T10:08:29Z)
• CLR-GAM: Contrastive Point Cloud Learning with Guided Augmentation and Feature Mapping [12.679625717350113]
  We present CLR-GAM, a contrastive learning-based framework with Guided Augmentation (GA) for efficient dynamic exploration strategy. We empirically demonstrate that the proposed approach achieves state-of-the-art performance on both simulated and real-world 3D point cloud datasets.
  arXiv  Detail & Related papers  (2023-02-28T04:38:52Z)
• PointCaM: Cut-and-Mix for Open-Set Point Cloud Learning [72.07350827773442]
  We propose to solve open-set point cloud learning using a novel Point Cut-and-Mix mechanism. We use the Unknown-Point Simulator to simulate out-of-distribution data in the training stage. The Unknown-Point Estimator module learns to exploit the point cloud's feature context for discriminating the known and unknown data.
  arXiv  Detail & Related papers  (2022-12-05T03:53:51Z)
• Unsupervised Representation Learning for 3D Point Cloud Data [66.92077180228634]
  We propose a simple yet effective approach for unsupervised point cloud learning. In particular, we identify a very useful transformation which generates a good contrastive version of an original point cloud. We conduct experiments on three downstream tasks which are 3D object classification, shape part segmentation and scene segmentation.
  arXiv  Detail & Related papers  (2021-10-13T10:52:45Z)
• TreeGCN-ED: Encoding Point Cloud using a Tree-Structured Graph Network [24.299931323012757]
  This work proposes an autoencoder based framework to generate robust embeddings for point clouds. We demonstrate the applicability of the proposed framework in applications like: 3D point cloud completion and Single image based 3D reconstruction.
  arXiv  Detail & Related papers  (2021-10-07T03:52:56Z)
• Point Discriminative Learning for Unsupervised Representation Learning on 3D Point Clouds [54.31515001741987]
  We propose a point discriminative learning method for unsupervised representation learning on 3D point clouds. We achieve this by imposing a novel point discrimination loss on the middle level and global level point features. Our method learns powerful representations and achieves new state-of-the-art performance.
  arXiv  Detail & Related papers  (2021-08-04T15:11:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.