Non-Rigid 3D Shape Retrieval via Large Margin Nearest Neighbor Embedding

Abstract

In this paper, we propose a highly efficient metric learning approach to non-rigid 3D shape analysis. From a training set of 3D shapes from different classes, we learn a transformation of the shapes which optimally enforces a clustering of shapes from the same class. In contrast to existing approaches, we do not perform a transformation of individual local point descriptors, but a linear embedding of the entire distribution of shape descriptors. It turns out that this embedding of the input shapes is sufficiently powerful to enable state of the art retrieval performance using a simple nearest neighbor classifier. We demonstrate experimentally that our approach substantially outperforms the state of the art non-rigid 3D shape retrieval methods on the recent benchmark data set SHREC’14 Non-Rigid 3D Human Models, both in classification accuracy and runtime.

Cite

Text

Chiotellis et al. "Non-Rigid 3D Shape Retrieval via Large Margin Nearest Neighbor Embedding." European Conference on Computer Vision, 2016. doi:10.1007/978-3-319-46475-6_21

Markdown

[Chiotellis et al. "Non-Rigid 3D Shape Retrieval via Large Margin Nearest Neighbor Embedding." European Conference on Computer Vision, 2016.](https://mlanthology.org/eccv/2016/chiotellis2016eccv-non/) doi:10.1007/978-3-319-46475-6_21

BibTeX

@inproceedings{chiotellis2016eccv-non,
  title     = {{Non-Rigid 3D Shape Retrieval via Large Margin Nearest Neighbor Embedding}},
  author    = {Chiotellis, Ioannis and Triebel, Rudolph and Windheuser, Thomas and Cremers, Daniel},
  booktitle = {European Conference on Computer Vision},
  year      = {2016},
  pages     = {327-342},
  doi       = {10.1007/978-3-319-46475-6_21},
  url       = {https://mlanthology.org/eccv/2016/chiotellis2016eccv-non/}
}