Group Membership Prediction

Abstract

The group membership prediction (GMP) problem involves predicting whether or not a collection of instances share a certain semantic property. For instance, in kinship verification given a collection of images, the goal is to predict whether or not they share a familial relationship. In this context we propose a novel probability model and introduce latent view-specific and view-shared random variables to jointly account for the view-specific appearance and cross-view similarities among data instances. Our model posits that data from each view is independent conditioned on the shared variables. This postulate leads to a parametric probability model that decomposes group membership likelihood into a tensor product of data-independent parameters and data-dependent factors. We propose learning the data-independent parameters in a discriminative way with bilinear classifiers, and test our prediction algorithm on challenging visual recognition tasks such as multi-camera person re-identification and kinship verification. On most benchmark datasets, our method can significantly outperform the current state-of-the-art.

Cite

Text

Zhang et al. "Group Membership Prediction." International Conference on Computer Vision, 2015. doi:10.1109/ICCV.2015.446

Markdown

[Zhang et al. "Group Membership Prediction." International Conference on Computer Vision, 2015.](https://mlanthology.org/iccv/2015/zhang2015iccv-group/) doi:10.1109/ICCV.2015.446

BibTeX

@inproceedings{zhang2015iccv-group,
  title     = {{Group Membership Prediction}},
  author    = {Zhang, Ziming and Chen, Yuting and Saligrama, Venkatesh},
  booktitle = {International Conference on Computer Vision},
  year      = {2015},
  doi       = {10.1109/ICCV.2015.446},
  url       = {https://mlanthology.org/iccv/2015/zhang2015iccv-group/}
}