LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Liu, Li; Lin, Zijia; Shao, Ling; Shen, Fumin; Ding, Guiguang; Han, Jungong (2017)
Publisher: IEEE
Languages: English
Types: Article
Subjects: G400
With the dramatic development of the Internet, how to exploit large-scale retrieval techniques for multimodal web data has become one of the most popular but challenging problems in computer vision and multimedia. Recently, hashing methods are used for fast nearest neighbor search in large-scale data spaces, by embedding high-dimensional feature descriptors into a similarity preserving Hamming space with a low dimension. Inspired by this, in this paper, we introduce a novel supervised cross-modality hashing framework, which can generate unified binary codes for instances represented in different modalities. Particularly, in the learning phase, each bit of a code can be sequentially learned with a discrete optimization scheme that jointly minimizes its empirical loss based on a boosting strategy. In a bitwise manner, hash functions are then learned for each modality, mapping the corresponding representations into unified hash codes. We regard this approach as cross-modality sequential discrete hashing (CSDH), which can effectively reduce the quantization errors arisen in the oversimplified rounding-off step and thus lead to high-quality binary codes. In the test phase, a simple fusion scheme is utilized to generate a unified hash code for final retrieval by merging the predicted hashing results of an unseen instance from different modalities. The proposed CSDH has been systematically evaluated on three standard data sets: Wiki, MIRFlickr, and NUS-WIDE, and the results show that our method significantly outperforms the state-of-the-art multimodality hashing techniques.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] D. Wang, X. Gao, X. Wang, and L. He, “Semantic topic multimodal hashing for cross-media retrieval,” in Proceedings of the International Joint Conference on Artificial Intelligence, 2015, pp. 3890-3896.
    • [2] J. Song, Y. Yang, Z. Huang, H. T. Shen, and J. Luo, “Effective multiple feature hashing for large-scale near-duplicate video retrieval,” IEEE Transactions on Multimedia, vol. 15, no. 8, pp. 1997-2008, 2013.
    • [3] M. M. Bronstein, A. M. Bronstein, F. Michel, and N. Paragios, “Data fusion through cross-modality metric learning using similarity-sensitive hashing,” in IEEE Conference on Computer Vision and Pattern Recognition, 2010, pp. 3594-3601.
    • [4] S. Kumar and R. Udupa, “Learning hash functions for cross-view similarity search,” in International Joint Conference on Artificial Intelligence, 2011, pp. 1360-1365.
    • [5] L. Liu, M. Yu, and L. Shao, “Multiview alignment hashing for efficient image search,” IEEE Transactions on Image Processing, vol. 24, no. 3, pp. 956-966.
    • [6] Y. Zhen and D.-Y. Yeung, “A probabilistic model for multimodal hash function learning,” in SIGKDD, 2012, pp. 940-948.
    • [7] --, “Co-regularized hashing for multimodal data,” in Advances in Neural Information Processing Systems, 2012, pp. 1376-1384.
    • [8] X. Zhu, Z. Huang, H. T. Shen, and X. Zhao, “Linear cross-modal hashing for efficient multimedia search,” in International Conference on Multimedia, 2013, pp. 143-152.
    • [9] J. Song, Y. Yang, Y. Yang, Z. Huang, and H. T. Shen, “Inter-media hashing for large-scale retrieval from heterogeneous data sources,” in ACM SIGMOD International Conference on Management of Data, 2013, pp. 785-796.
    • [10] X. Liu, C. Deng, B. Lang, D. Tao, and X. Li, “Query-adaptive reciprocal hash tables for nearest neighbor search,” IEEE Transactions on Image Processing, vol. 25, no. 2, pp. 907-919, 2016.
    • [11] X. Liu, L. Huang, C. Deng, J. Lu, and B. Lang, “Multi-view complementary hash tables for nearest neighbor search,” in IEEE International Conference on Computer Vision, 2015, pp. 1107-1115.
    • [12] V. Gaede and O. Gu¨ nther, “Multidimensional access methods,” ACM Computing Surveys (CSUR), vol. 30, no. 2, pp. 170-231, 1998.
    • [13] D. Wang, X. Gao, and X. Wang, “Semi-supervised constraints preserving hashing,” Neurocomputing, vol. 167, pp. 230-242, 2015.
    • [14] L. Cao, Z. Li, Y. Mu, and S.-F. Chang, “Submodular video hashing: a unified framework towards video pooling and indexing,” in Proceedings of the ACM international conference on Multimedia, 2012, pp. 299-308.
    • [15] X. Liu, X. Fan, C. Deng, Z. Li, H. Su, and D. Tao, “Multilinear hyperplane hashing,” in IEEE Conference on Computer Vision and Pattern Recognition, 2016, pp. 5119-5127.
    • [16] X. Liu, B. Du, C. Deng, M. Liu, and B. Lang, “Structure sensitive hashing with adaptive product quantization,” IEEE Transactions on Cybernetics, 2015.
    • [17] Y. Liu, F. Wu, Y. Yang, Y. Zhuang, and A. G. Hauptmann, “Spline regression hashing for fast image search,” IEEE Transactions on Image Processing, vol. 21, no. 10, pp. 4480-4491, 2012.
    • [18] W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang, “Supervised hashing with kernels,” in IEEE Conference on Computer Vision and Pattern Recognition, 2012, pp. 2074-2081.
    • [19] Y. Weiss, A. Torralba, and R. Fergus, “Spectral hashing,” in Advances in Neural Information Processing Systems, 2008, pp. 1753-1760.
    • [20] A. Gionis, P. Indyk, and R. Motwani, “Similarity search in high dimensions via hashing,” in VLDB, 1999, pp. 518-529.
    • [21] J. Wang, S. Kumar, and S.-F. Chang, “Semi-supervised hashing for large-scale search,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 12, pp. 2393-2406, 2012.
    • [22] B. Kulis and K. Grauman, “Kernelized locality-sensitive hashing for scalable image search,” in International Conference on Computer Vision, 2009.
    • [23] Y. Gong, S. Lazebnik, A. Gordo, and F. Perronnin, “Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 12, pp. 2916-2929, 2013.
    • [24] W. Liu, J. Wang, S. Kumar, and S.-F. Chang, “Hashing with graphs,” in International Conference on Machine Learning, 2011.
    • [25] J.-P. Heo, Y. Lee, J. He, S.-F. Chang, and S.-E. Yoon, “Spherical hashing,” in IEEE Conference on Computer Vision and Pattern Recognition, 2012.
    • [26] F. Shen, C. Shen, W. Liu, and H. Tao Shen, “Supervised discrete hashing,” in IEEE Conference on Computer Vision and Pattern Recognition, 2015, pp. 37-45.
    • [27] F. Shen, W. Liu, S. Zhang, Y. Yang, and H. Tao Shen, “Learning binary codes for maximum inner product search,” in IEEE International Conference on Computer Vision, 2015, pp. 4148-4156.
    • [28] D. Zhang and W.-J. Li, “Large-scale supervised multimodal hashing with semantic correlation maximization.” in Association for the Advancement of Artificial Intelligence Conference, 2014, pp. 2177-2183.
    • [29] Z. Lin, G. Ding, M. Hu, and J. Wang, “Semantics-preserving hashing for cross-view retrieval,” in IEEE Conference on Computer Vision and Pattern Recognition, 2015, pp. 3864-3872.
    • [30] J. Zhou, G. Ding, Y. Guo, Q. Liu, and X. Dong, “Kernel-based supervised hashing for cross-view similarity search,” in IEEE International Conference on Multimedia and Expo, 2014, pp. 1-6.
    • [31] G. Ding, Y. Guo, and J. Zhou, “Collective matrix factorization hashing for multimodal data,” in IEEE Conference on Computer Vision and Pattern Recognition, 2014, pp. 2083-2090.
    • [32] B. Wu, Q. Yang, W.-S. Zheng, Y. Wang, and J. Wang, “Quantized correlation hashing for fast cross-modal search,” in Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015.
    • [33] A. Shrivastava and P. Li, “Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips),” in Advances in Neural Information Processing Systems, 2014, pp. 2321-2329.
    • [34] G. Lin, C. Shen, Q. Shi, A. Hengel, and D. Suter, “Fast supervised hashing with decision trees for high-dimensional data,” in IEEE Conference on Computer Vision and Pattern Recognition, 2014, pp. 1963-1970.
    • [35] L. Liu, M. Yu, and L. Shao, “Projection bank: From high-dimensional data to medium-length binary codes,” in International Conference on Computer Vision, 2015, pp. 2821-2829.
    • [36] Z. Cai, L. Liu, M. Yu, and L. Shao, “Latent structure preserving hashing,” in BMVC, 2015.
    • [37] L. Liu, M. Yu, and L. Shao, “Latent structure preserving hashing,” Internatinal Journal of Computer Vision, 2016.
    • [38] J. Song, Y. Yang, X. Li, Z. Huang, and Y. Yang, “Robust hashing with local models for approximate similarity search,” IEEE Transactions on Cybernetics, vol. 44, no. 7, pp. 1225-1236, 2014.
    • [39] Y. Gao, M. Shi, D. Tao, and C. Xu, “Database saliency for fast image retrieval,” IEEE Transactions on Multimedia, vol. 17, no. 3, pp. 359- 369, 2015.
    • [40] J. Yu, D. Tao, M. Wang, and Y. Rui, “Learning to rank using user clicks and visual features for image retrieval,” IEEE Transactions on Cybernetics, vol. 45, no. 4, pp. 767-779, 2015.
    • [41] J. Zhou, G. Ding, and Y. Guo, “Latent semantic sparse hashing for crossmodal similarity search,” in Proceedings of the international ACM SIGIR conference on Research & development in information retrieval, 2014, pp. 415-424.
    • [42] L. Liu, M. Yu, and L. Shao, “Unsupervised local feature hashing for image similarity search,” vol. 11, no. 99, pp. 1-11, 2015.
    • [43] W. Liu, C. Mu, S. Kumar, and S.-F. Chang, “Discrete graph hashing,” in Advances in Neural Information Processing Systems, 2014, pp. 3419- 3427.
    • [44] W.-C. Kang, W.-J. Li, and Z.-H. Zhou, “Column sampling based discrete supervised hashing,” pp. 3432-3438, 2016.
    • [45] J. Friedman, T. Hastie, R. Tibshirani et al., “Additive logistic regression: a statistical view of boosting (with discussion and a rejoinder by the authors),” The annals of statistics, vol. 28, no. 2, pp. 337-407, 2000.
    • [46] L. Liu and L. Shao, “Sequential compact code learning for unsupervised image hashing,” IEEE Transactions on Neural Networks and Learning Systems, vol. 12, no. 99, pp. 1-11, 2015.
    • [47] J. Qin, L. Liu, Z. Zhang, Y. Wang, and L. Shao, “Compressive sequential learning for action similarity labeling,” IEEE Transactions on Image Processing, vol. 25, no. 2, pp. 756-769, 2016.
    • [48] X. Liu, J. He, C. Deng, and B. Lang, “Collaborative hashing,” in IEEE Conference on Computer Vision and Pattern Recognition, 2014, pp. 2139-2146.
    • [49] J. Malick, J. Povh, F. Rendl, and A. Wiegele, “Regularization methods for semidefinite programming,” SIAM Journal on Optimization, vol. 20, no. 1, pp. 336-356, 2009.
    • [50] L. Liu and L. Shao, “Discriminative partition sparsity analysis,” in International Conference on Pattern Recognition (ICPR), 2014, pp. 1597-1602.
    • [51] G. McLachlan and D. Peel, Finite mixture models. John Wiley & Sons, 2004.
    • [52] P. Viola and M. Jones, “Rapid object detection using a boosted cascade of simple features,” in Computer Vision and Pattern Recognition, 2001. CVPR 2001. Proceedings of the 2001 IEEE Computer Society Conference on, vol. 1, 2001, pp. I-511.
    • [53] N. Rasiwasia, J. C. Pereira, E. Coviello, G. Doyle, G. R. G. Lanckriet, R. Levy, and N. Vasconcelos, “A new approach to cross-modal multimedia retrieval,” in International Conference on Multimedia, 2010, pp. 251-260.
    • [54] D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” International Journal of Computer Vision, vol. 60, no. 2, pp. 91-110, 2004.
    • [55] M. J. Huiskes and M. S. Lew, “The mir flickr retrieval evaluation,” in Proceedings of the ACM international conference on Multimedia information retrieval, 2008, pp. 39-43.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article