Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Learning to Group: A Bottom-Up Framework for 3D Part Discovery in Unseen Categories (2002.06478v4)

Published 16 Feb 2020 in cs.CV and cs.LG

Abstract: We address the problem of discovering 3D parts for objects in unseen categories. Being able to learn the geometry prior of parts and transfer this prior to unseen categories pose fundamental challenges on data-driven shape segmentation approaches. Formulated as a contextual bandit problem, we propose a learning-based agglomerative clustering framework which learns a grouping policy to progressively group small part proposals into bigger ones in a bottom-up fashion. At the core of our approach is to restrict the local context for extracting part-level features, which encourages the generalizability to unseen categories. On the large-scale fine-grained 3D part dataset, PartNet, we demonstrate that our method can transfer knowledge of parts learned from 3 training categories to 21 unseen testing categories without seeing any annotated samples. Quantitative comparisons against four shape segmentation baselines shows that our approach achieve the state-of-the-art performance.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Tiange Luo (13 papers)
  2. Kaichun Mo (41 papers)
  3. Zhiao Huang (28 papers)
  4. Jiarui Xu (33 papers)
  5. Siyu Hu (6 papers)
  6. Liwei Wang (239 papers)
  7. Hao Su (218 papers)
Citations (38)

Summary

We haven't generated a summary for this paper yet.