Evaluating Deep Clustering Algorithms on Non-Categorical 3D CAD Models
Siyuan Xiang, Chin Tseng, Congcong Wen, Deshana Desai, Yifeng Kou, Binil Starly, Daniele Panozzo, Chen Feng
TL;DR
This work tackles the challenge of evaluating deep clustering on non-categorical 3D CAD models by creating a scalable pairwise similarity annotation workflow for a subset of the ABC dataset, yielding 252{,}648 labeled edges across 22{,}968 shapes. It adapts seven baseline clustering methods to 3D data (point clouds and multi-view representations) and introduces an ensemble-based evaluation protocol to cope with sparse ground-truth annotations. The study demonstrates that two-stage baselines (e.g., AtlasNet, BYOL) can outperform some end-to-end deep clustering approaches (e.g., DEC, SCAN, DeepCluster, IIC) in this domain, while highlighting initialization bias and the need for ensemble methods to obtain robust rankings. By releasing the annotation tools, baselines, and evaluation scripts, the work provides a practical benchmark for guiding future methods and enabling scalable analysis of large 3D shape collections in deep geometric computing.
Abstract
We introduce the first work on benchmarking and evaluating deep clustering algorithms on large-scale non-categorical 3D CAD models. We first propose a workflow to allow expert mechanical engineers to efficiently annotate 252,648 carefully sampled pairwise CAD model similarities, from a subset of the ABC dataset with 22,968 shapes. Using seven baseline deep clustering methods, we then investigate the fundamental challenges of evaluating clustering methods for non-categorical data. Based on these challenges, we propose a novel and viable ensemble-based clustering comparison approach. This work is the first to directly target the underexplored area of deep clustering algorithms for 3D shapes, and we believe it will be an important building block to analyze and utilize the massive 3D shape collections that are starting to appear in deep geometric computing.
