Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 379718, 10 pages
http://dx.doi.org/10.1155/2013/379718
Research Article

Maximum Variance Hashing via Column Generation

1College of Computer, National University of Defense Technology, Changsha, Hunan 410073, China
2School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China
3School of Computer Science, The University of Adelaide, Adelaide, SA 5005, Australia

Received 23 January 2013; Accepted 6 March 2013

Academic Editor: Shengyong Chen

Copyright © 2013 Lei Luo 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. M. S. Lew, N. Sebe, C. Djeraba, and R. Jain, “Content-based multimedia information retrieval: state of the art and challenges,” ACM Transactions on Multimedia Computing, Communications and Applications, vol. 2, no. 1, pp. 1–19, 2006. View at Google Scholar · View at Scopus
  2. S. Chen, J. Zhang, Y. Li, and J. Zhang, “A hierarchical model incorporating segmented regions and pixel descriptors for video background subtraction,” IEEE Transactions on Industrial Informatics, vol. 8, no. 1, pp. 118–127, 2012. View at Google Scholar
  3. L. Luo, C. Shen, C. Zhang, and A. van den Hengel, “Shape similarity analysis by self-tuning locally constrained mixeddiffusion,” IEEE Transactions on Multimedia, 2013. View at Google Scholar
  4. A. Torralba, R. Fergus, and W. T. Freeman, “80 million tiny images: a large data set for nonparametric object and scene recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 11, pp. 1958–1970, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. C. Strecha, A. Bronstein, M. Bronstein, and P. Fua, “LDAHash: improved matching with smaller descriptors,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 1, pp. 66–78, 2012. View at Google Scholar
  6. A. Gionis, P. Indyk, R. Motwani et al., “Similarity search in high dimensions via hashing,” in Proceedings of the International Conference on Very Large Data Bases, pp. 518–529, 1999.
  7. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, “Locality-sensitive hashing scheme based on p-stable distributions,” in Proceedings of the 20th Annual Symposium on Computational Geometry (SCG '04), pp. 253–262, June 2004. View at Scopus
  8. B. Kulis, P. Jain, and K. Grauman, “Fast similarity search for learned metrics,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 12, pp. 2143–2157, 2009. View at Google Scholar
  9. B. Kulis and K. Grauman, “Kernelized locality-sensitive hashing,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 6, pp. 1092–1104, 2012. View at Google Scholar
  10. M. Raginsky and S. Lazebnik, “Locality-sensitive binary codes from shift-invariant kernels,” Advances in Neural Information Processing Systems, vol. 22, 2009. View at Google Scholar
  11. J. Wang, S. Kumar, and S. Chang, “Semi-supervised hashing for large scale search,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 12, pp. 2393–2406, 2012. View at Google Scholar
  12. Y. Weiss, A. Torralba, and R. Fergus, “Spectral hashing,” Advances in Neural Information Processing Systems, 2008. View at Google Scholar
  13. L. Van der Maaten, E. Postma, and H. Van Den Herik, “Dimensionality reduction: a comparative review,” Journal of Machine Learning Research, vol. 10, pp. 1–41, 2009. View at Google Scholar
  14. K. Weinberger and L. Saul, “Unsupervised learning of image manifolds by semidefinite programming,” International Journal of Computer Vision, vol. 70, no. 1, pp. 77–90, 2006. View at Google Scholar
  15. W. Liu, J. Wang, S. Kumar, and S. Chang, “Hashing with graphs,” in Proceedings of the International Conference on Machine Learning, 2011.
  16. Y. Bengio, O. Delalleau, N. Le Roux, J. F. Paiement, P. Vincent, and M. Ouimet, “Learning eigenfunctions links spectral embedding and kernel PCA,” Neural Computation, vol. 16, no. 10, pp. 2197–2219, 2004. View at Publisher · View at Google Scholar · View at Scopus
  17. L. Van Der Maaten and G. Hinton, “Visualizing data using t-SNE,” Journal of Machine Learning Research, vol. 9, pp. 2579–2625, 2008. View at Google Scholar · View at Scopus
  18. A. Demiriz, K. P. Bennett, and J. Shawe-Taylor, “Linear programming boosting via column generation,” Machine Learning, vol. 46, no. 1–3, pp. 225–254, 2002. View at Publisher · View at Google Scholar · View at Scopus
  19. C. Shen and H. Li, “On the dual formulation of boosting algorithms,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 12, pp. 2216–2231, 2010. View at Google Scholar
  20. W. Iba and P. Langley, “Induction of one-level decision trees,” in Proceedings of the International Conference on Machine Learning, pp. 233–240, 1992.
  21. Mosek, “The MOSEK interior point optimizer,” http://www.mosek.com.
  22. D. Zhang, J. Wang, D. Cai, and J. Lu, “Self-taught hashing for fast similarity search,” in Proceedings of the 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '10), pp. 18–25, 2010.
  23. L. Saul, K. Weinberger, J. Ham, F. Sha, and D. Lee, “Spectral methods for dimensionality reduction,” Semisupervised Learn, pp. 293–308, 2006. View at Google Scholar
  24. 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