Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 352849, 12 pages
http://dx.doi.org/10.1155/2015/352849
Research Article

Chi-Squared Distance Metric Learning for Histogram Data

1Laboratory of Spatial Information Processing, School of Computer and Information Engineering, Henan University, Kaifeng 475004, China
2Department of Information Engineering, Shengda Trade Economics and Management College of Zhengzhou, Zhengzhou 451191, China

Received 11 December 2014; Revised 25 March 2015; Accepted 27 March 2015

Academic Editor: Davide Spinello

Copyright © 2015 Wei Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” International Journal of Computer Vision, vol. 60, no. 2, pp. 91–110, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. H. Bay, A. Ess, T. Tuytelaars, and L. van Gool, “Speeded-up robust features (surf),” Computer Vision and Image Understanding, vol. 110, no. 3, pp. 346–359, 2008. View at Publisher · View at Google Scholar · View at Scopus
  3. A. Oliva and A. Torralba, “Modeling the shape of the scene: a holistic representation of the spatial envelope,” International Journal of Computer Vision, vol. 42, no. 3, pp. 145–175, 2001. View at Publisher · View at Google Scholar · View at Scopus
  4. N. Dalal and B. Triggs, “Histograms of oriented gradients for human detection,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '05), vol. 1, pp. 886–893, San Diego, Calif, USA, June 2005. View at Publisher · View at Google Scholar · View at Scopus
  5. H. Ling and K. Okada, “Diffusion distance for histogram comparison,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '06), vol. 1, pp. 246–253, June 2006. View at Publisher · View at Google Scholar · View at Scopus
  6. Y. Rubner, C. Tomasi, and L. J. Guibas, “The earth mover's distance as a metric for image retrieval,” International Journal of Computer Vision, vol. 40, no. 2, pp. 99–121, 2000. View at Publisher · View at Google Scholar · View at Scopus
  7. O. Pele and M. Werman, “The quadratic-chi histogram distance family,” in Computer Vision—ECCV 2010, vol. 6312 of Lecture Notes in Computer Science, pp. 749–762, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  8. H. Ling and K. Okada, “An efficient earth mover's distance algorithm for robust histogram comparison,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 5, pp. 840–853, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. O. Pele and M. Werman, “A linear time histogram metric for improved SIFT matching,” in Computer Vision—ECCV 2008, vol. 5304 of Lecture Notes in Computer Science, pp. 495–508, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  10. O. Pele and M. Werman, “Fast and robust earth mover's distances,” in Proceedings of the 12th International Conference on Computer Vision (ICCV '09), pp. 460–467, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. O. Pele and B. Taskar, “The tangent earth mover's distance,” in Geometric Science of Information, F. Nielsen and F. Barbaresco, Eds., vol. 8085 of Lecture Notes in Computer Science, pp. 397–404, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  12. M. Cuturi and D. Avis, “Ground metric learning,” Journal of Machine Learning Research, vol. 15, pp. 533–564, 2014. View at Google Scholar · View at MathSciNet
  13. F. Wang and L. J. Guibas, “Supervised earth mover's distance learning and its computer vision applications,” in Computer Vision—ECCV 2012: 12th European Conference on Computer Vision, Florence, Italy, October 7–13, 2012, Proceedings, Part I, vol. 7572 of Lecture Notes in Computer Science, pp. 442–455, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  14. S. Noh, “χ2 metric learning for nearest neighbor classification and its analysis,” in Proceedings of the 21st International Conference on Pattern Recognition (ICPR '12), pp. 991–995, 2012.
  15. K. Dor, T. Stephen, W. Kilian, S. Fei, and L. Gert, “Nonlinear metric learning,” Advances in Neural Information Processing Systems 25, pp. 2582–2590, 2012. View at Google Scholar
  16. T. Le and M. Cuturi, “Generalized aitchison embeddings for histograms,” JMLR: Workshop and Conference Proceedings, vol. 29, pp. 293–308, 2013. View at Google Scholar
  17. E. P. Xing, M. I. Jordan, S. Russell, and A. Ng, “Distance metric learning with application to clustering with sideinformation,” in Advances in Neural Information Processing Systems, vol. 15, pp. 505–512, 2002. View at Google Scholar
  18. J. Goldberger, S. Roweis, G. Hinton, and R. Salakhutdinov, “Neighbourhood components analysis,” in Advances in Neural Information Processing Systems, vol. 17, pp. 513–520, 2004. View at Google Scholar
  19. K. Q. Weinberger and L. K. Saul, “Distance metric learning for large margin nearest neighbor classification,” Journal of Machine Learning Research, vol. 10, pp. 207–244, 2009. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  20. J. V. Davis, B. Kulis, P. Jain, S. Sra, and I. S. Dhillon, “Information-theoretic metric learning,” in Proceedings of the 24th International Conference on Machine Learning (ICML '07), pp. 209–216, June 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. W. Bian and D. Tao, “Constrained empirical risk minimization framework for distance metric learning,” IEEE Transactions on Neural Networks and Learning Systems, vol. 23, no. 8, pp. 1194–1205, 2012. View at Publisher · View at Google Scholar · View at Scopus
  22. F. Wang, W. Zuo, L. Zhang, D. Meng, and D. Zhang, “A Kernel classification framework for metric learning,” IEEE Transactions on Neural Networks and Learning Systems, 2014. View at Publisher · View at Google Scholar
  23. C.-C. Chang, “A boosting approach for supervised mahalanobis distance metric learning,” Pattern Recognition, vol. 45, no. 2, pp. 844–862, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. C. Shen, J. Kim, F. Liu, L. Wang, and A. van den Hengel, “Efficient dual approach to distance metric learning,” IEEE Transactions on Neural Networks and Learning Systems, vol. 25, no. 2, pp. 394–406, 2014. View at Publisher · View at Google Scholar · View at Scopus
  25. P. Yang, K. Huang, and C.-L. Liu, “A multi-task framework for metric learning with common subspace,” Neural Computing and Applications, vol. 22, no. 7-8, pp. 1337–1347, 2013. View at Publisher · View at Google Scholar · View at Scopus
  26. T. Hastie and R. Tibshirani, “Discriminant adaptive nearest neighbor classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 6, pp. 607–616, 1996. View at Publisher · View at Google Scholar · View at Scopus
  27. J. Wang, A. Kalousis, and A. Woznica, “Parametric local metric learning for nearest neighbor classification,” in Advances in Neural Information Processing Systems, F. Pereira, C. Burges, L. Bottou, and K. Weinberger, Eds., vol. 25, pp. 1601–1609, Curran Associates, 2012. View at Google Scholar
  28. Y. Mu, W. Ding, and D. Tao, “Local discriminative distance metrics ensemble learning,” Pattern Recognition, vol. 46, no. 8, pp. 2337–2349, 2013. View at Publisher · View at Google Scholar · View at Scopus
  29. M. Sugiyama, “Dimensionality reduction of multimodal labeled data by local fisher discriminant analysis-squared distance metric learning for histogram data 11 sis,” Journal of Machine Learning Research, vol. 8, pp. 1027–1061, 2007. View at Google Scholar
  30. L. Torresani and K. C. Lee, “Large margin component analysis,” in Advances in Neural Information Processing Systems, pp. 1385–1392, 2006. View at Google Scholar
  31. M. Soleymani Baghshah and S. Bagheri Shouraki, “Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data,” Pattern Recognition, vol. 43, no. 8, pp. 2982–2992, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  32. J. Wang, H. T. Do, A. Woznica, and A. Kalousis, “Metric learning with multiple kernels,” in Advances in Neural Information Processing Systems, J. Shawe-Taylor, R. Zemel, P. Bartlett, F. Pereira, and K. Weinberger, Eds., vol. 24, pp. 1170–1178, Curran Associates, 2011. View at Google Scholar
  33. S. Chopra, R. Hadsell, and Y. LeCun, “Learning a similarity metric discriminatively, with application to face verification,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '05), vol. 1, pp. 539–546, June 2005. View at Publisher · View at Google Scholar · View at Scopus
  34. Z. Xu, K. Q. Weinberger, and O. Chapelle, “Distance metric learning for kernel machines,” http://arxiv.org/abs/1208.3422.
  35. B. Aurélien, H. Amaury, and S. Marc, “A survey on metric learning for feature vectors and structured data,” http://arxiv.org/abs/1306.6709.
  36. B. Kulis, “Metric learning: a survey,” Foundations and Trends in Machine Learning, vol. 5, no. 4, pp. 287–364, 2012. View at Publisher · View at Google Scholar · View at Scopus
  37. L. Yang and R. Jin, Distance Metric Learning: A Comprehensive Survey, Michigan State Universiy, 2006.
  38. R. Gilad-Bachrach, A. Navot, and N. Tishby, “Margin based feature selection—theory and algorithms,” in Proceedings of the 21st International Conference on Machine Learning (ICML '04), pp. 43–50, ACM, 2004. View at Publisher · View at Google Scholar
  39. J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra, “Efficient projections onto the l1-ball for learning in high dimensions,” in Proceedings of the 25th International Conference on Machine Learning, pp. 272–279, ACM, 2008.
  40. K. Saenko, B. Kulis, M. Fritz, and T. Darrell, “Adapting visual category models to new domains,” in Computer Vision—ECCV 2010, vol. 6314 of Lecture Notes in Computer Science, pp. 213–226, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  41. B. Gong, Y. Shi, F. Sha, and K. Grauman, “Geodesic flow kernel for unsupervised domain adaptation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '12), pp. 2066–2073, June 2012. View at Publisher · View at Google Scholar · View at Scopus
  42. G. Griffin, A. Holub, and P. Perona, Caltech-256 Object Category Dataset, 2007.
  43. A. Globerson and S. T. Roweis, “Metric learning by collapsing classes,” in Advances in Neural Information Processing Systems, pp. 451–458, 2005. View at Google Scholar