Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/3104322.3104465guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Sequential projection learning for hashing with compact codes

Published: 21 June 2010 Publication History

Abstract

Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing methods either use random projections or extract principal directions from the data to derive hash functions. The resulting embedding suffers from poor discrimination when compact codes are used. In this paper, we propose a novel data-dependent projection learning method such that each hash function is designed to correct the errors made by the previous one sequentially. The proposed method easily adapts to both unsupervised and semi-supervised scenarios and shows significant performance gains over the state-of-the-art methods on two large datasets containing up to 1 million points.

References

[1]
Baluja, S. and Covell, M. Learning to hash: forgiving hash functions and applications. Data Mining and Knowledge Discovery, 17(3):402-430, 2008.
[2]
Datar, M., Immorlica, N., Indyk, P., and Mirrokni. V.S. Locality-sensitive hashing scheme based on p-stable distributions. In the 20th annual Symp. on Computational Geometry, pp. 253-262, 2004.
[3]
Hinton, GE and Salakhutdinov, RR. Reducing the dimensionality of data with neural networks. Science, 313(5786):504, 2006.
[4]
Lowe, D. G. Distinctive Image Features from Scale-Invariant Keypoints. Int. J. Computer Vision, 60 (2):91-110, 2004.
[5]
Raginsky, M. and Lazebnik, S. Locality-Sensitive Binary Codes from Shift-Invariant Kernels. In The Neural Information Processing Systems, volume 22, 2009.
[6]
Shakhnarovich, G. Learning task-specific similarity. PhD thesis, Massachusetts Institute of Technology, 2005.
[7]
Torralba, A., Fergus, R., and Weiss, Y. Small codes and large image databases for recognition. In Int. Conf. on Computer Vision and Pattern Recognition, pp. 1-8, 2008.
[8]
Turpin, A. and Scholer, F. User performance versus precision measures for simple search tasks. In Proc. of ACM SIGIR, pp. 18, 2006.
[9]
Wang, J., Kumar, S., and Chang, S.-F. Semi-Supervised Hashing for Scalable Image Retrieval. In Int. Conf. on Computer Vision and Pattern Recognition, 2010.
[10]
Weiss, Y., Torralba, A., and Fergus, R. Spectral hashing. In The Neural Information Processing Systems, volume 21, pp. 1753-1760, 2008.

Cited By

View all
  • (2019)Supervised set-to-set hashing in visual recognitionProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367147(803-810)Online publication date: 10-Aug-2019
  • (2019)Feature Pyramid HashingProceedings of the 2019 on International Conference on Multimedia Retrieval10.1145/3323873.3325015(114-122)Online publication date: 5-Jun-2019
  • (2019)SSDHIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2017.277133229:1(212-225)Online publication date: 1-Jan-2019
  • Show More Cited By

Index Terms

  1. Sequential projection learning for hashing with compact codes
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Guide Proceedings
    ICML'10: Proceedings of the 27th International Conference on International Conference on Machine Learning
    June 2010
    1262 pages
    ISBN:9781605589077

    Sponsors

    • NSF: National Science Foundation
    • Xerox
    • Microsoft Research: Microsoft Research
    • Yahoo!
    • IBM: IBM

    Publisher

    Omnipress

    Madison, WI, United States

    Publication History

    Published: 21 June 2010

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 18 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Supervised set-to-set hashing in visual recognitionProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367147(803-810)Online publication date: 10-Aug-2019
    • (2019)Feature Pyramid HashingProceedings of the 2019 on International Conference on Multimedia Retrieval10.1145/3323873.3325015(114-122)Online publication date: 5-Jun-2019
    • (2019)SSDHIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2017.277133229:1(212-225)Online publication date: 1-Jan-2019
    • (2019)Supervised deep hashing for image content securityMultimedia Tools and Applications10.1007/s11042-017-5433-z78:1(661-676)Online publication date: 1-Jan-2019
    • (2019)A survey of image data indexing techniquesArtificial Intelligence Review10.1007/s10462-018-9673-852:2(1189-1266)Online publication date: 1-Aug-2019
    • (2018)Binary coding based label distribution learningProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304889.3305047(2783-2789)Online publication date: 13-Jul-2018
    • (2018)Graph regularized supervised cross-view hashingMultimedia Tools and Applications10.5555/3287850.328787877:21(28207-28224)Online publication date: 1-Nov-2018
    • (2018)Query-Adaptive Image Retrieval by Deep-Weighted HashingIEEE Transactions on Multimedia10.1109/TMM.2018.280476320:9(2400-2414)Online publication date: 1-Sep-2018
    • (2018)Supervised Distributed Hashing for Large-Scale Multimedia RetrievalIEEE Transactions on Multimedia10.1109/TMM.2017.274916020:3(675-686)Online publication date: 1-Mar-2018
    • (2017)Deep supervised discrete hashingProceedings of the 31st International Conference on Neural Information Processing Systems10.5555/3294996.3295009(2479-2488)Online publication date: 4-Dec-2017
    • Show More Cited By

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media