Xu, WeiweiShi, ZhouxuXu, MingliangZhou, KunWang, JingdongZhou, BinWang, JinrongYuan, ZhenmingThomas Funkhouser and Shi-Min Hu2015-03-032015-03-0320141467-8659https://doi.org/10.1111/cgf.12436We propose a transductive shape segmentation algorithm, which can transfer prior segmentation results in database to new shapes without explicitly specification of prior category information. Our method first partitions an input shape into a set of segmentations as a data preparation, and then a linear integer programming algorithm is used to select segments from them to form the final optimal segmentation. The key idea is to maximize the segment similarity between the segments in the input shape and the segments in database, where the segment similarity is computed through sparse reconstruction error. The segment-level similarity enables to handle a large amount of shapes with significant topology or shape variations with a small set of segmented example shapes. Experimental results show that our algorithm can generate high quality segmentation and semantic labeling results in the Princeton segmentation benchmark.