中文摘要：

A lot of 3D shape descriptors for 3D shape retrieval have been presented so far.This paper proposes a new mechanism,which employs several existing global and local 3D shape descriptors as input.With the sparse theory,some descriptors which play the most important role in measuring similarity between query model and the model in the dataset are selected automatically and an affinity matrix is constructed.Spectral clustering method can be implemented to this affinity matrix.Spectral embedding of this affinity matrix can be applied to retrieval,which integrating almost all the advantages of selected descriptors.In order to verify the performance of our approach,we perform experimental comparisons on Princeton Shape Benchmark database.Test results show that our method is a pose-oblivious,efficient and robustness method for either complete or incomplete models.

英文摘要：

A lot of 3D shape descriptors for 3D shape retrieval have been presented so far. This paper proposes a new mechanism, which employs several existing global and local 3D shape descriptors as input. With the sparse theory, some descriptors which play the most important role in measuring similarity between query model and the model in the dataset are selected automatically and an affinity matrix is constructed. Spectral clustering method can be implemented to this affinity matrix. Spectral embedding of this affinity matrix can be applied to retrieval, which integrating almost all the advantages of selected descriptors. In order to verify the performance of our approach, we perform experimental comparisons on Princeton Shape Benchmark database. Test results show that our method is a pose-oblivious, efficient and robustness method for either complete or incomplete models.