L EARNING TO G ROUP : A B OTTOM -U P F RAMEWORK FOR 3D P ART D ISCOVERY IN U NSEEN C ATEGORIES
Anonymous authors
Paper under double-blind review
A BSTRACT
We address the problem of learning to discover 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 learningbased iterative grouping 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 novel categories.
On a recently proposed large-scale ﬁne-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 strong shape segmentation baselines shows that we achieve the state-of-the-art performance.
I NTRODUCTION
Perceptual grouping has been a long-standing problem in the study of vision systems (Hoffman & Richards, 1984).
The process of perceptual grouping determines which regions of the visual input belong together as parts of higher-order perceptual units.
Back to the 1930s, Wertheimer (1938) listed several vital factors, such as similarity, proximity, and good continuation, which lead to visual grouping.
In the era of deep learning, high-level cues can be learned from massive annotated datasets.
However, even to this day, learning-based segmentation algorithms are still far inferior to human visual systems when it comes to unseen categories.
In this paper, we present a new general learning-based framework for the perceptual grouping task, focusing especially on the case of 3D shape part discovery in the zero-shot learning setting.
With the power of big data, deep neural networks that learn data-driven features to segment shape parts, such as (Kalogerakis et al., 2010; Graham et al., 2018; Mo et al., 2019), have demonstrated the state-of-the-art performance on many shape segmentation benchmarks (Yi et al., 2016; Mo et al., 2019).
The key to success is to train with large-scale annotated training samples and learn to extract features that maximally exploit the data structure of the training categories.
These networks usually have large receptive ﬁelds that extract features from the whole input shape and take advantage of learning global context for understanding part semantics and shape structures.
While learning such features with global contextual information leads to superior performance on the training categories, they often fail miserably on unseen categories (Figure 1), as big domain gaps are observed across seen and unseen categories.
On the contrary, classical shape segmentation methods, such as (Kaick et al., 2014), that use manually designed features with relatively more local context, though giving inferior segmentation results, can perform much better for unseen object classes.
In fact, many globally different shapes share similar parts locally.
For example, airplanes, cars, and swivel chairs all have wheels as sub-components, even though the global geometry is totally different.
Having the knowledge of wheels learned from airplanes should help recognize wheels for cars and swivel chairs, since the local geometry and semantic functionality of wheels share across the boundary of object classes.
Also, automatic part discovery for unseen categories is more favorable than collecting manually labeled ground-truth for every new category for shape segmentation.
In this paper, we aim to combine the beneﬁts of learning data-driven part priors and extracting localcontext features to perform part discovery across object categories in a zero-shot setting.
We start from learning to propose a pool of superpixel-like sub-parts within local context for each shape.
Then, we learn a grouping policy that seeks to progressively increase the part local context and group sub-parts for ﬁnal part proposals.
What lies in the heart of our algorithm is to learn a function to assess whether two parts should be grouped.
Different from prior deep segmentation work that learns point features, our formulation essentially learns part-level features.
Borrowing ideas from
Reinforcement Learning (RL), we formalize the process as a contextual bandit problem and train a local grouping policy to pick a pair of sub-parts to group iteratively.
In both steps, we learn features within part local context aiming for generalizing to unseen categories.
Our learning-based agglomerative clustering framework deviates drastically from the prevailing deep segmentation pipelines and makes one step towards generalizable part discovery in unseen object categories.
To summarize, we make the following contributions:
• We formulate the task of zero-shot part discovery on a large-scale ﬁne-grained shape segmentation benchmark PartNet (Mo et al., 2019); • We propose a learning-based agglomerative clustering framework that learns to do part proposals and grouping from training categories and generalizes to unseen novel categories; • We quantitatively compare our approach to several baseline methods and demonstrate the state-of-the-art results for part discovery in unseen object categories.
R ELATED W ORK
Shape segmentation has been a classic and fundamental problem in computer vision and graphics.
Dated back to 1990s, researchers have started to design heuristic geometric criterion for segmenting 3D meshes, including methods based on morphological watersheds (Mangan & Whitaker, 1999),
K-means (Shlafman et al., 2002), core extraction (Katz et al., 2005), graph cuts (Golovinskiy &
Funkhouser, 2008), random walks (Lai et al., 2008), spectral clustering (Liu & Zhang, 2004) and primitive ﬁtting (Attene et al., 2006a), to name a few.
See Attene et al.
(2006b);
Shamir (2008); Chen et al.
(2009) for more comprehensive surveys on mesh segmentation.
Many papers study mesh cosegmentation that discover consistent part segmentation over a collection of shapes (Golovinskiy &
Funkhouser, 2009; Huang et al., 2011; Sidi et al., 2011; Hu et al., 2012; Wang et al., 2012; Van Kaick et al., 2013).
Our approach takes point clouds as inputs as they are closer to the real-world scanners.
Different from meshes, point cloud data lacks the local vertex normal and connectivity information.
Kaick et al.
(2014) segments point cloud shapes under the part convexity constraints.
Our work learns shared part priors from training categories and thus can adapt to different segmentation granularity required by different end-stream tasks.
In recent years, with the increasing availability of annotated shape segmentation datasets (Chen et al., 2009; Yi et al., 2016; Mo et al., 2019), many supervised learning approaches succeed in refreshing the state-of-the-arts.
Kalogerakis et al.
; Guo et al.
; Wang et al.
(2018a) learn to label mesh faces with semantic labels deﬁned by human.
See Xu et al.
for a recent survey.
More recent works propose novel 3D deep network architectures segmenting shapes represented as 2D images (Kalogerakis et al., 2017), 3D voxels (Maturana & Scherer, 2015), sparse volumetric representations (Klokov & Lempitsky, 2017; Riegler et al., 2017; Wang et al., 2017; Graham et al., 2018), point clouds (Qi et al., 2017a;b; Wang et al., 2018b; Yi et al., 2019) and graph-based representations (Yi et al., 2017).
These methods take advantage of sufﬁcient training samples of seen categories and demonstrate appealing performance for shape segmentation.
However, they often perform much worse when testing on unseen categories, as the networks overﬁt their weights to the global shape context in training categories.
Our work focus on learning context-free part knowledges and perform part discovery in a zero-shot setting on unseen object classes.
There are also a few relevant works trying to reduce supervisions for shape part segmentation.
Makadia & Yumer (2014) learns from sparsely labeled data that only one vertex per part is given the ground-truth.
Yi et al.
(2016) proposes an active learning framework to propogate part labels from a selected sets of shapes with human labeling.
Lv et al.
(2012) proposes a semi-supervised Conditional Random Field (CRF) optimization model for mesh segmentation.
Shu et al.
(2016) proposes an unsupervised learning method for learning features to group superpixels on meshes.
Our work processes point cloud data and focus on a zero-shot setting, while part knowledge can be learned from training categories and transferred to unseen categories.
Our work is also related to many recent research studying learning based bottom-up methods for 2D instance segmentation.
These methods learn an per-pixel embedding and utilize a clustering algorithm (Newell et al., 2017; Fathi et al., 2017) as post-process or integrating a recurrent meanshift module (Kong & Fowlkes, 2018) to generate ﬁnal instances.
Bai & Urtasun (2017) predicts the energy of the watershed transform and Liu et al.
(2017) predicts object breakpoints and use a cascade of networks to group the pixels into lines, components and objects sequentially.
Our work is signiﬁcant different from previous methods as our method does not rely on an fully convolutional neural network to process the whole scene.
Our work can generalize better to unseen categories as our method reduces the inﬂuences of context.
P ROBLEM F ORMULATION
We consider the task of zero-shot shape part discovery on 3D point clouds in unseen object categories.
For a 3D shape S ( e.g. a 3D chair model), we consider the point cloud C S
= { p 1 , p 2 , · · · , p N } sampled from the surface of the 3D model.
A part P i = { p i 1 , p i 2 , · · · , p i t } ⊆
C S deﬁnes a group of points that has certain interesting semantics for some speciﬁc downstream task.
A set of part proposal P S
= { P 1 , P 2 , · · · , P S } comprises of several interesting part regions on S that are useful for various tasks.
The task of shape part discovery on point clouds is to produce P predS for each input shape point cloud C S .
Ground-truth proposal set P gtS is a manually labeled set of parts that are useful for some human-deﬁned downstream tasks.
A good algorithm should predict P predS such that P gtS ⊆
P predS within an upper-bound limit of part numbers M .
A category of shapes T = { S 1 , S 2 , · · · } gathers all shapes that belong to one semantic category.
For example, T chair includes all chair 3D models in a dataset.
Zero-shot shape part discovery considers two sets of object categories T train =
{ T 1 , T 2 , · · · , T u } and T test =
{ T u +1 , T u +2 , · · · , T v } , where
T i ∩ T j = ∅ for any i (cid:54) =
j .
For each shape S ∈ T ∈ T train , a manually labeled part proposal subset P gtS ⊆
P S is given for algorithms to use.
It provides algorithms an opportunity to develop the concept of parts in the training categories.
No ground-truth part proposals are provided for shapes in testing categories T test .
Algorithms are expected to predict P predS for any shape S ∈ T ∈ T test .
M ETHOD
Our method starts with proposing a set of small superpixel-like (Ren & Malik, 2003) sub-parts of the given shape.
We refer readers to Appendix A for more details of our sub-part proposing method.
Given a set of sub-parts, our method iteratively groups together the sub-parts belonging to the same parts in ground-truth and produce larger sub-parts, until no sub-part can further group each other.
The remaining sub-parts in the ﬁnal stage become a pool of part proposals for the input shape.
Our perceptual grouping process is a sequential decision process.
We formulate the perceptual grouping process as a contextual bandit (one-step Markov Decision Process) (Langford & Zhang, 2007).
In each iteration, we use a policy network to select a pair of sub-parts and send it to the veriﬁcation network to verify whether we should group the selected pair of sub-parts.
If yes, we group the selected pair of sub-parts into a larger sub-part.
Otherwise, we will not consider this pair in the latter grouping process.
Our policy network is composed of two sub-modules: a purity module and a rectiﬁcation module.
The purity module inputs unary information and measures how likely two sub-parts belong to the same part in ground-truth after grouping and the rectiﬁcation module inputs binary information and further decides the pair to select.
We describe more technical network design choices in Section 4.1.
To train the entire pipeline, we borrow the on-policy training scheme from Reinforcement Learning (RL) to train these networks, in order to match the data distribution during training and inference stages, as described in Section 4.2.
[Figure]
Duplicate
Purity Module: Two sub-parts that belong to the same ground-truth part should group together.
We deﬁne purity score U ( P ) for a sub-part P as the maximum ratio of the intersection of P with the ground-truth parts { P gti } .
More formally,
[Equation]
where p enumerates all points in the shape point cloud and I is the indicator function.
We train a purity module to predict the purity score.
It employs a PointNet that takes as input a merged sub-part P ij = P
i ∪ P j and predicts the purity score.
Figure 2 (a) shows the architecture.
Rectiﬁcation Module: We observe that a purity module is not enough to fully select the best pair of sub-parts to group in practice.
For example, when a large sub-part tries to group with a small one from a different ground-truth part, the part geometry of the grouping outcome is primarily dominated by the large sub-part, and thus the purity module tends to produce a high purity score, which results in selecting a pair that should not be grouped.
To address this issue, we consider learning a rectiﬁcation module to correct the failure case given by the purity module.
We design the rectiﬁcation module as in Figure 2 (b).
The rectiﬁcation module takes two sub-parts as inputs, extracts features using a shared PointNet, concatenates the two part features and outputs a real-valued rectiﬁcation score R ( P ) , based purely on local information.
Different from the purity module that takes the grouped subpart as input, the rectiﬁcation module explicitly takes two subparts as inputs in order to compare the two sub-part features for decision making.
Policy Network: We deﬁne policy score by making the product of purity score and rectiﬁcation score .
We deﬁne the policy π ( P i , P j |P ) as a distribution over all possible pairs characterized by a softmax layer as shown in line 6 of Algorithm 1.
The goal of the policy is to maximize the objective maximize
[Equation]
The reward, or the merge-ability score M ( P i , P j ) deﬁnes whether we could group two sub-parts P i and P j .
To compute the reward M ( P i , P j ) : we ﬁrst calculate the instance label of the corresponding ground-truth part for sub-parts P i , P j as l i and l j .
We set M ( P i , P j ) to be one if the two sub-parts have the same instance label and the purity scores of two sub-parts are greater than 0 . 8 .
Veriﬁcation Network: Since the policy scores sum to one overall pairs of sub-parts, there is no explicit signal from the policy network on whether the pair should be grouped.
We train a separate veriﬁcation network that is specialized to verify whether we should group the selected pair.
Here also exists a cascaded structure where the veriﬁcation network will focus on the pairs selected by the policy network and make a double veriﬁcation.
The veriﬁcation network takes a pair of shape as input and outputs values from zero to one after a Sigmoid layer.
Figure 2 (c) illustrates the network architecture: a PointNet ﬁrst extracts the part feature for each sub-part, then two sub-part point clouds are augmented with the extracted part features and concatenated together to pass through another PointNet to obtain the ﬁnal score.
Notice that our design of the veriﬁcation network is a combination of the purity module and rectiﬁcation module.
We want to extract both the input sub-part features and the part feature after grouping.
4. N ETWORK T RAINING
In this section, we illustrate how to train the two networks jointly as an entire pipeline.
We use
Reinforcement Learning (RL) on-policy training and borrow the standard RL training techniques, such as epsilon-greedy exploration and replay buffer sampling.
We also discuss the detailed loss designs for training the policy network and the veriﬁcation network.
RL On-policy Training Borrowing ideas from the ﬁeld of Reinforcement Learning (RL), we train the policy network and the veriﬁcation network in an on-policy fashion.
On-policy training alternates between the data sampling step and the network training step.
The data sampling step ﬁxes the network parameters and then runs the inference-time pipeline to collect the grouping trajectories, including all pairs of sub-parts seen during the process and all the grouping operations taken by the pipeline.
The network training step uses the trajectory data collected from the data sampling step to compute losses for different network modules and performs steps of gradient descents to update the network parameters.
We fully describe the on-policy training algorithm in Algorithm 2.
We adapt epsilon-greedy strategy (Mnih et al., 2013) into the training stage.
We start from involving 80% random sampling samples during inference as selected pairs and decay the ratio with 10% step size in each epoch.
We ﬁnd that random actions not only improve the exploration in the action space and but also serve as the data-augmentation role.
The random actions collect more samples to train the networks, which improves the transfer performance in unseen categories.
Also, purely on-policy training would drop all experience but only use the data sampled by current policy.
This is not data efﬁcient, so we borrow the idea from DQN (Mnih et al., 2013) and use the replay buffer to store and utilize the experience.
The replay buffer stores all the states and actions during the inference stage.
When updating the policy networks, we sample a batch of transitions, i.e. , the grouped sub-parts, and the sub-part pools when the algorithm groups the sub-parts from the replay buffer.
The batch data is used to compute losses and gradients to update the two networks.
Training Losses As shown in Algorithm 2, to train the networks, we sample a batch of data ( P ki , P kj , P k ) k ≤ N from the replay buffer, where P ki , P kj is the grouped pair and P k is the corresponding sub-parts pool.
We ﬁrst calculate the reward M kgt and ground-truth purity score U kgt for each data in the batch.
For updating the rectiﬁcation module, we ﬁx the purity module and calculate the policy gradient (Sutton et al., 2000) of the policy network with the reward M kgt shown in line 11.
As the rectiﬁcation module is a part of the policy network, the gradient will update the rectiﬁcation
Algorithm score U kgt
= U ( P ki ∪ P kj ) 10:
Set
M kgt = M ( P ki , P kj ) 11: policy
[Equation]
(cid:88)
[Equation]
Update purity module by minimizing the l 2 loss with purity score U kgt :
[Equation]
Update veriﬁcation network by minimizing the cross entropy loss :
[Equation]
while 15: while module by backpropagation.
We then use the l 2 loss in line 12 to train the purity module and use the cross entropy loss in line 13 to train the veriﬁcation network.
E XPERIMENTS AND A NALYSIS
In this section, we conduct quantitative evaluations of our proposed framework and present extensive comparisons to four previous state-of-the-art shape segmentation methods using PartNet dataset (Mo et al., 2019) in zero-shot part discovery setting.
We also show a diagnostic analysis of how the discovered part knowledge transfers across different object categories.
5. D ATASET AND E VALUATION
We use the recently proposed PartNet dataset (Mo et al., 2019) as the main testbed.
PartNet provides ﬁne-grained, hierarchical and instance-level part annotations for 26,671 3D models from 24 object categories.
PartNet deﬁnes up to three levels of non-overlapping part segmentation for each object category, from coarse-grained parts ( e.g. chair back, chair base) to ﬁne-grained ones ( e.g. chair back vertical bar, swivel chair wheel).
Unless otherwise noticed, we use 3 categories ( i.e. Chair, Lamp, and Storage Furniture) 1 for training and take the rest 21 categories as unseen categories for testing.
In zero-shot part discovery setting, we aim to propose parts that are useful under various different use cases.
PartNet provides multi-level human-deﬁned semantic parts that can serve as a sub-sampled pool of interesting parts.
Thus, we adopt Mean Recall (Hosang et al., 2015; Sung et al., 2018) as the evaluation metric to measure how the predicted part pool covers the PartNet-deﬁned parts.
To elaborate on the calculation of Mean Recall, we ﬁrst deﬁne R t as the fraction of ground-truth parts that have Intersection-over-Union (IoU) over t with any predicted part.
Mean Recall is then deﬁned as the average values of R t ’s where t varies from 0 .
5 to 0 .
95 with 0 .
as a step size.
5. B ASELINE M ETHODS
We compare our approach to four previous state-of-the-art methods as follows:
• PartNet-InsSeg : Mo et al.
(2019) proposed a part instance segmentation network that employs a PointNet++ (Qi et al., 2017b) as the backbone that takes as input the whole shape point cloud and directly predicts multiple part instance masks.
The method is a top-down label-prediction method that uses the global shape information.
• SGPN :
Wang et al.
(2018b) presented a learning-based bottom-up pipeline, which inputs the whole shape point cloud to extract per-point features and compute pairwise afﬁnity matrix for point clustering.
The global context is involved in learning the features.
• GSPN :
Yi et al.
(2019) introduced a deep region-based method that learns generative models for part proposals.
The method proposes local bounding boxes but still uses globalaware features for predicting boxes and segmenting parts inside local boxes.
• WCSeg : Kaick et al.
(2014) is a non-learning based method based on the convexity assumption of parts.
The method leverages hand-engineered heuristics relying on local statistics to segment shapes, thus is more agnostic to the object categories.
All the three deep learning-based methods take advantage of the global shape context to achieve state-of-the-art shape part segmentation results on PartNet.
However, these networks are prone to over-ﬁtting to training categories and have a hard time transferring part knowledge to unseen categories.
WCSeg, as a non-learning based method, demonstrates good generalization capability to unseen categories, but is limited by the part convexity assumption.
[Table]
5. R ESULTS AND A NALYSIS
We compare our proposed framework to the four baseline methods under the Mean Recall metric.
For PartNet-InsSeg, SGPN, GSPN and our method, we train three networks corresponding to three levels of segmentation for training categories ( e.g. Chair, Lamp, and Storage Furniture).
We remove the part semantics prediction branch from the three baseline methods, as semantics are not transferable to novel testing categories.
For WCSeg, point normals are required by the routine to check local patch continuity.
PartNet experiments (Mo et al., 2019) usually assume no such point normals as inputs.
Thus, we approximately compute normals based on the input point clouds by reconstructing surface with ball pivoting (Bernardini et al., 1999).
Then, to obtain three-levels of part proposals for WCSeg, we manually tune hyperparameters in the procedure at each level of part annotations on training categories to have the best performance on three seen categories.
Since the segmentation levels for different categories may not share consistent part granularity ( e.g. display level-2 parts may correspond to chair level-3 parts), we gather together the part proposals generated by methods at all three levels as a joint pool of proposals for evaluation on levels of unseen categories.
For the proposed method, we involve limited context only on seen categories as presented in Appendix B.1.
B e d
L a m p
[Figure]
Reference
We present quantitative and qualitative evaluations to baseline methods in Table 1, Figure 3 and
Appendix C. For each testing category, we report the average values of Mean Recall scores at all levels.
See the appendix Table 6 for detailed numbers at all levels.
We observe that our approach achieves the best performance on average among all testing novel categories, while championingout of 20 categories.
5. P ART K NOWLEDGE T RANSFER A NALYSIS
[Table]
The core of our method is to learn local-context part knowledge from training categories that is able to transfer to novel unseen categories.
Such learned part knowledge may also include non-transferable category-speciﬁc information, such as the part geometry and the part boundary types.
Training our framework on more various object categories is beneﬁcial to learn more generalizable knowledge that shares in common.
However, due to the difﬁculties in acquiring human annotated ﬁne-grained parts ( e.g. PartNet (Mo et al., 2019)), we can often conduct training on a few training categories.
Thus, we are interested to know how to select categories to achieve the best performance in all categories.
Different object categories have different part patterns that block part knowledge transfers across category boundaries.
However, presumably, similar categories, such as tables and chairs, often share common part patterns that are easier to transfer.
For example, tables and chairs are both composed of legs, surfaces, bar stretchers and wheels, which offers a good opportunity for transferring local-context part knowledge.
We analyze the capability of transferring part knowledge across category boundaries under our framework.
Table 2 presents experimental results of doing cross-validation using chairs, tables and lamps by training on one category and testing on another.
We observe that, chairs and tables transfer part knowledge to each other as expected, while the network trained on lamps demonstrates much worse performance on generalizing to chairs and tables.
C ONCLUSION
In this paper, we introduced a data-driven iterative perceptual grouping pipeline for the task of zero-shot 3D shape part discovery.
At the core of our method is to learn part-level features within part local contexts, in order to generalize the part discovery process to unseen novel categories.
We conducted extensive evaluation and analysis of our method and presented thorough quantitative comparisons to four state-of-the-art shape segmentation algorithms.
We demonstrated that our method successfully extracts locally-aware part knowledge from training categories and transfers the knowledge to unseen novel categories.
Our method achieved the best performance over all four baseline methods on the PartNet dataset.
B A BLATION S TUDIES B. C ONTEXT E FFECTS
In this section, we conduct experiments about the effects of involving more context for training models on seen categories and unseen categories.
We add a branch to the veriﬁcation network and extend it into Figure 5.
This branch takes all the sub-parts where the minimum distance with the input sub-part pair (cid:96) 2 ≤ 0 .
01 as input and thus encodes more context information for decision making.
Note that the involved context is still restricted in a very local region and the module can not “see” the whole shape.
Now, there are two branches can be used to determine whether we should group the pair.
The original binary branch is driven by purely local contextual information.
The newly added one encodes more context information.
[Figure]
To test the effectiveness of involving more context, we train the model with the extended veriﬁcation network on Chair, Lamp, and Storage Furniture and test them in two ways.
We make decisions by only using the original binary branch.
We make decisions by using the original binary branch when the size of the sub-part pool is ≥ 32 and using the newly added branch when the size of the sub-part pool is ≤ 32 .
We choose 32 as an empirical threshold here based on our observation that when the size of the pool is ≤ 32 , the sub-parts in the pool will be relative large and the additional local context will help make grouping decisions in most scenarios.
From the results listed in Table 4, we can point out that the involved context helps to consistently improve the performance on seen categories, but has negative effects on most unseen categories.
When the context is similar between the seen categories and unseen categories, such as patterns between Storage Furniture and Bed, the involved context can help make decisions.
The phenomenon indicates a future direction that we train the model with involving more context but use them on unseen categories only when we found a similar context we have seen during training.
It also enables the proposed method to achieve higher performance on seen categories without degrading the performance on unseen categories by involving contexts only when testing on seen categories and discarding it for unseen categories.
We adopt this way for obtaining ﬁnal scores.
[Table]
B. C OMPONENTS A NALYSIS
In our pipeline, we use the policy network to learn to pick pairs of sub-parts and adopt on-policy training for boosting the performance.
For the policy network, it consists of the purity module and the rectiﬁcation module, which process the unary information and binary information respectively.
Here, we show the quantitative results and validate the effectiveness of these components.
The results are listed in Table 5, where we train the model on the Chair of level-3 annotations.
• Purity Module: The purity module takes the unary information (a grouped pair) as input and output the purity score.
Similar to the objectness score Alexe et al.
(2012) used in object detection, the purity score serves as the partness score to measure the quality of the proposal.
We optimize the purity module by regressing the ground-truth purity scores and use such meaningful supervision to help learn the policy.
The results of ”no purity” row in Table 5 show the effectiveness of this module.
• Rectiﬁcation Module: The rectiﬁcation module is involved to rectify the failure cases for the purity network.
Our experiments shows that without the rectiﬁcation module, our decision process will easily converge to a trajectory that a pair of sub-part with unbalanced size will usually be chosen to group results in situations that one huge sub-part dominate the sub-part pool and bring in performance drop as shown in Table 5, the ”no rectiﬁcation” row.
Please also refer to Appendix B.3 to see some relating qualitative results.
• On-Policy Training:
The on-policy training will sample training data that matches the inference process without the requirement of carefully designing the sampling strategy.
Without it, our networks suffer from a decrease in performance as shown in Table 5, the ”off-policy” row.
[Table] [Table]
[Table] [Table]
no rectiﬁcation
[Table] [Table]
[Table] [Table]
[Table] [Table]
B. R ELATIVE S IZE V ISUALIZATIONS
We involve the rectiﬁcation module and learn the policy to pick pairs of sub-parts for grouping.
The rectiﬁcation module may bring several beneﬁts.
Here we demonstrate the effectiveness of the rectiﬁcation module from one aspect that this module will encourage to pick equal size pairs of sub-parts.
In our experiments, we found if we only follow the guidance of the purity network, our policy will tend to choose the pair comprising one big sub-part and one small sub-part.
Like the descriptions in Section 4.1, the geometry of such unequal size pairs will be dominated by the big sub-part and thus raise the possibilities of errors.
The rectiﬁcation module can alleviate this situation and encourage the learned policy to choose more equal size pairs.
To evaluate this point, we deﬁne the relative size for the selected pairs.
Given a pair of sub-parts
P i and P j , we deﬁne the relative size as P i P j + P j P i where the smaller value means the size of the pair
P
i and P j are more equal, and the minimum value is 2 .
We train two models with and without the rectiﬁcation module separately on Chair of level-3 annotations and test on Chair.
We plot the relative size for the process of grouping and show some randomly sampled results in Figure 6.
Every picture shows the grouping process for one shape, the x-axis is the iteration number of the process, the y-axis is the deﬁned metric.
From the results, we can clearly see the rectiﬁcation module helps to choose more equal size pairs.
Only when it comes to the late stage, where the size of parts is various and it is hard to ﬁnd size equal pairs, our policy will pick size unequal pairs.
Therefore, the rectiﬁcation module helps to prevent the trajectory converging to catastrophic cases in which larger sub-parts dominate the feature for purity score prediction and fail to predict the purity for the grouped sub-parts.
Also, intuitively, the intermediate sub-parts generated during the grouping process may have various patterns and are irregular.
This increases the burden of models to recognize, and the learned ”equal-size selection” like rule may help to form regular intermediate sub-parts and alleviate this issue.
[Figure]
C F ULL E XPERIMENTS C. I MPLEMENTATION D ETAILS
We will train our model on three categories (Chair, Lamp, and Storage Furniture) and test on all categories.
For each method, we train three models corresponding to three levels of segmentation annotations for training categories.
All the point clouds of shapes used in our experiments have 10000 points.
For the compared baselines, the input size is 10000 points.
For our proposed method, the input size of a sub-part is 1024 .
Since our task does not need semantic labels, so we remove the semantic segmentation loss for all the deep learning methods.
• PartNet-InsSeg: We follow the default settings and hyper-parameters described in the paper where the output instance number is 200 , and loss weights are 1 except 0 .
1 for the regularization term.
We train the model for a total of 120 epochs with the learning rate starting from 0 .
001 and decaying 0 .
5 every 15 epochs.
The whole training process will take 4 days on a single 1080Ti GPU.
• SGPN:
Following the same experiment setting in Mo et al.
(2019), where the max group number is set to 200 .
The learning rate is 0 .
initially and decays by a factor of 0 .every 40000 iterations.
The model is trained on one 1080Ti GPU for 50 epochs.
It takesdays to train the network and 20 seconds to process each shape in the inference phase.
• GSPN:
The maximum number of detection per shape is 200.
The number of points of each generated instance is set to 512 .
NMS ( Non-Maximum Suppression) of threshold 0 . 8 is applied after proposal generation.
As in Yi et al.
(2019), we train GSPN ﬁrst for 20 epochs and then ﬁne-tune it jointly with R-PointNet for another 20 epochs.
The learning rate is initialized to 0 .
001 and decays by a factor of 0 .
7 every 10000 steps.
Each stage of training takes 2 days respectively.
WCSeg: This method requires out-ward normal as input which is lacked in the point clouds.
In order to perform this method and compare it as fair as possible, we
ﬁrst generate
out-ward normals for input point clouds
as follows:
a) we employ ball-pivoting Bernardini et al.
1999) to reconstruct surface for input point clouds.
b) we keep one face ﬁxed and re-orient the faces order coherently so that the generated face normal is all out-ward.
c) we transfer the face normals back to the vertices’ normals.
As a traditional method, the performance is very sensitive to all hyper-parameters, we tune four parameters recommended in the paper by grid searching on seen categories and then test on unseen categories.
More speciﬁcally, we randomly select 100 object instances for each of the three seen categories (i.e. Chair, Lamp, and Storage Furniture) as our grid search dataset.
Then we conduct a grid search on the 300 instances regarding the parameters ( θ 1 , θ 2 , θ 3 , σ ) in WCSeg.
Based on the recommended parameters from the original paper
Kaick et al.
(2014), we apply relative shifts with the range of [ − 20% , +20%] on each parameter to form 3 4 = 81 sets of parameters.
Among these parameters, we choose the set with the highest mean recall on fore-mentioned grid search dataset as the parameter for each level.
We eventually select ( θ 1 = 0 .
950 , θ 2 = 0 .
704 , θ 3 = 0 .
403 , σ = 0 . 069 ) for
Level-1, ( θ 1 = 1 .
426 , θ 2 = 0 .
845 , θ 3 = 0 .
504 , σ = 0 . 086 ) for Level-2, and ( θ 1 = 1 .
188 , θ 2 = 0 .
563 , θ 3 = 0 .
504 , σ = 0 . 069 )
for Level-3 in our experiments.
We use the MATLAB code provided by the paper and perform it on our Intel(R) Xeon(R)
Gold 6126 CPU cluster with 16 CPU cores used.
For the inference, WCSeg takes about 2 .
2 minutes to process each shape per CPU core and about 4 days to ﬁnish testing over PartNet’s part instance segmentation dataset.
• Our: For each shape, we ﬁrst use the sub-part proposal module to generate sub-part proposals as
described in Appendix A. For training the proposal module, we use batch sizeand learning rate starting from 0 .
001 and decaying 0 .
5 every 15 epochs for a total ofepochs.
After this, we will gain 128 proposals and then remove the proposals whose purity score is lower than 0 . 8 .
The rest proposals form our initial sub-parts pool.
In the training phase, we can calculate the ground-truth purity score according to the annotations.
In the inference phase, we will use the trained purity module to predict the purity score.
To short the whole training time, we train the proposal module on level-3 annotations and use it for training the policy network and veriﬁcation network on all three levels.
After gaining the initial sub-part pool, we begin our grouping process.
During the process, we will use the policy network comprising the purity module and the rectiﬁcation module to pick the pair of sub-parts and use the veriﬁcation network to determine whether we should group the pair.
If a pair of sub-parts should be grouped, we will add the new grouped part into the sub-parts pool and remove the input two sub-parts from the pool.
We will iteratively group the sub-parts until no more available pairs.
So for each shape, we generate a trajectory and collect training data from the trajectory.
In the training phase, for each iteration, we sample 64 pairs and calculate the policy score by using both the purity module and the rectiﬁcation module.
To accelerate the training process, we sample 10 pairs not 1 pair from the 64 pairs and send them to the veriﬁcation network to determine whether we should group the pair of sub-parts.
The 10 pairs comprise rank n pairs and 10 − n random sampling pairs since we adapt epsilon-greedy strategy where start from involving 8 random sampling samples and decay the number with 1 in each epoch.
The minimal number of random sampling pairs is 1 .
In the inference phase, for each iteration, we will calculate the policy score for all pairs and send the pair with the highest score to the veriﬁcation network.
Note that we use the prediction of the veriﬁcation network not the ground-truth annotations to determine whether we should group and generate the trajectory.
According to ablation studies in Appendix B.2, this on-policy manual is important for the ﬁnal performance.
For the level-3 model, we choose the pairs where two sub-parts are close to each other within the minimum distance (cid:96) 2 ≤ 0 .
For the leveland level-2 model, we will ﬁrst choose the neighboring pairs and group them.
When all neighboring pairs have been processed, we remove the neighboring constraints and group the pairs until no more available pairs.
We collect the training data from the trajectories and form the replay buffer for each module, where each replay buffer only can hold up to data from 4 trajectories.
The size of the input point cloud to all three modules is 1024 by sampling from the sub-parts.
In each iteration, we train all the modules on corresponding replay buffers.
We train the modules for a total of 1200 iterations with the learning rate starting from 0 .
001 and decaying 0 .every 150 epochs.
The batch size for the purity module, the veriﬁcation network is 128 , for the rectiﬁcation module is 2 .
The whole training process will take 4 days on a single 1080Ti GPU.
For the inference, the method takes about 3 seconds to process each shape.
C. F ULL E XPERIMENTAL R ESULTS
We present the full table including Mean Recall scores at all levels and the performance on seen categories in Table 6.
We involve more context only on seen categories the same as the way presented in Appendix B.1.
C. M ORE Q UALITATIVE R ESULTS
We provide qualitative results of GSPN, SGPN, WCSeg, PartNet-InsSeg, and our proposed methods for the zero-shot part discovery.
We train the models on Chair, Lamp, and Storage Furniture of level3 (the most ﬁne-grained level) of PartNet Dataset and test on the other unseen categories.
We also list the corresponding most ﬁne-grained ground-truth annotations for reference (Some categories may only have the level-1 annotation).
Note that the ground-truth annotation only provides one possible segmentation that satisﬁes category-speciﬁc human-deﬁned semantic meanings.
[Table]
Reference
F a u ce t F a u ce t
D oo r D oo r
D i s p l a y D i s p l a y
E a r ph on e
E a r phon e
GSPN
SGPN
WCSeg
PartNet
Ours
Reference
[Table]
T r a s h C a n
T
[Table]
a s h
[Table]
a n
L a p t op L a p t op
[Table]
ug
[Table]
Reference
H a t
D i s h w a s h e r
R e fr
i g e r a t
o r
S c i ss o r s
[Table]
a
[Table]
o ttl e
[Table]
l
[Table]
c
[Table]
Reference
[Table]
[Table]
[Table]
[Table]
are average among seen categories and weighted average among seen categories over shape numbers, respectively.
UAvg and
WUAvg are average among unseen categories and weighted average among unseen categories over shape numbers, respectively.