access icon free Kernelised reference-wise metric learning

Unlike the doublet or triplet constraints, a novel kernelised reference-wise metric learning is proposed by constructing reference-wise constraints, which contain similarity information of each sample to all reference samples. After selecting several representative training samples as the reference set, the training data are first mapped into a projected space by the reference sample matrix. Then the problem of metric learning is casted as a multi-label classification problem under the reference-wise constraints, in which an l 2-norm regularised least squares canonical correlation analysis can be used. Besides, the formulation is generalised to kernelised version for further boosting the performance. Experiments on two benchmark person re-identification datasets demonstrate that the approach clearly outperforms the state-of-the-art methods.

Inspec keywords: learning (artificial intelligence); matrix algebra

Other keywords: reference sample matrix; kernelised version; representative training samples; Kernelised reference wise metric learning; multilabel classification problem

Subjects: Algebra; Learning in AI (theory)

References

    1. 1)
    2. 2)
      • 6. Liao, S., Hu, Y., Zhu, X., Li, S.Z.: ‘Person reidentification by local maximal occurrence representation and metric learning’. Proc. IEEE Conf. Computer Vision and Pattern Recognition, Boston, USA, 2015, pp. 21972206.
    3. 3)
      • 13. Cheng, D.S., Cristani, M., Stoppa, M., Bazzani, L., Murinon, V.: ‘Custom pictorial structures for re-identification’. Proc. British Machine Vision Conf., Dundee, UK, 2011, pp. 68.168.11.
    4. 4)
      • 5. Xiong, F., Gou, M.R., Camps, O., Sznaier, M.: ‘Person re-identification using kernel-based metric learning methods’. Proc. European Conf. Computer Vision, Zurich, Switzerland, 2014, pp. 116.
    5. 5)
      • 2. Kostinger, M., Hirzer, M., Wohlhart, P., Roth, P.M., Bischof, H.: ‘Large scale metric learning from equivalence constraints’. Proc. IEEE Conf. Computer Vision and Pattern Recognition, Providence, USA, 2012, pp. 22882295.
    6. 6)
      • 14. Baltieri, D., Vezzani, R., Cucchiara, R.: ‘3dpes: 3d people dataset for surveillance and forensics’. Proc. Int. ACM Workshop on Multimedia Access to 3D Human Objects, Arizona, USA, 2011, pp. 5964.
    7. 7)
    8. 8)
    9. 9)
      • 7. Shi, Y., Bellet, A., Sha, F.: ‘Sparse compositional metric learning’. Proc. AAAI Conf. Artificial Intelligence, Quebe, Canada, 2014.
    10. 10)
    11. 11)
      • 11. Davis, J.V., Kulis, B., Jain, P., Sra, S., Dhillon, I.S.: ‘Information-theoretic metric learning’. Proc. Int. Conf. Machine Learning, Oregon, USA, 2007, pp. 209216.
    12. 12)
      • 12. Weinberger, K.Q., Saul, L.K.: ‘Distance metric learning for large margin nearest neighbor classification’, J. Mach. Learn. Res., 2009, 10, (1), pp. 207244.
    13. 13)
      • 4. Mignon, A., Jurie, F.: ‘PCCA: A new approach for distance learning from sparse pairwise constraints’. Proc. IEEE Conf. Computer Vision and Pattern Recognition, Providence, USA, 2012, pp. 26662672.
    14. 14)
      • 1. Yao, B.H., Zhao, Z.C., Liu, K.: ‘Metric learning with trace-norm regularization for person re-identification’. Proc. IEEE Conf. Image Processing, Paris, France, 2014, pp. 24422446.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2016.4079
Loading

Related content

content/journals/10.1049/el.2016.4079
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading