FeatureLego: Volume Exploration Using Exhaustive Clustering of Super-Voxels
Shreeraj Jadhav, Saad Nadeem, Arie Kaufman

TL;DR
FeatureLego introduces an efficient volume exploration framework that uses exhaustive clustering of super-voxels to enable detailed and hierarchical semantic feature selection in 3D volumes.
Contribution
The paper proposes a novel voxel clustering method and a hierarchical exploration framework that improves semantic feature selection in volumetric data.
Findings
Effective volume exploration demonstrated on multiple datasets.
Hierarchical clustering enables intuitive user interaction.
Exhaustive clustering captures diverse semantic boundaries.
Abstract
We present a volume exploration framework, FeatureLego, that uses a novel voxel clustering approach for efficient selection of semantic features. We partition the input volume into a set of compact super-voxels that represent the finest selection granularity. We then perform an exhaustive clustering of these super-voxels using a graph-based clustering method. Unlike the prevalent brute-force parameter sampling approaches, we propose an efficient algorithm to perform this exhaustive clustering. By computing an exhaustive set of clusters, we aim to capture as many boundaries as possible and ensure that the user has sufficient options for efficiently selecting semantically relevant features. Furthermore, we merge all the computed clusters into a single tree of meta-clusters that can be used for hierarchical exploration. We implement an intuitive user-interface to interactively explore…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
