Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

A Distance-Computation-Free Search Scheme for Binary Code Databases

Published: 01 March 2016 Publication History

Abstract

Recently, binary codes have been widely used in many multimedia applications to approximate high-dimensional multimedia features for practical similarity search due to the highly compact data representation and efficient distance computation. While the majority of the hashing methods aim at learning more accurate hash codes, only a few of them focus on indexing methods to accelerate the search for binary code databases. Among these indexing methods, most of them suffer from extremely high memory cost or extensive Hamming distance computations. In this paper, we propose a new Hamming distance search scheme for large scale binary code databases, which is free of Hamming distance computations to return the exact results. Without the necessity to compare database binary codes with queries, the search performance can be improved and databases can be externally maintained. More specifically, we adopt the inverted multi-index data structure to index binary codes. Importantly, the Hamming distance information embedded in the structure is utilized in the designed search scheme such that the verification of exact results no longer relies on Hamming distance computations. As a step further, we optimize the performance of the inverted multi-index structure by taking the code distributions among different bits into account for index construction. Empirical results on large-scale binary code databases demonstrate the superiority of our method over existing approaches in terms of both memory usage and search efficiency.

Cited By

View all
  • (2024)Self-Supervised Temporal Sensitive Hashing for Video RetrievalIEEE Transactions on Multimedia10.1109/TMM.2024.338518326(9021-9035)Online publication date: 1-Jan-2024
  • (2021)Generalizing the Pigeonhole Principle for Similarity Search in Hamming SpaceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.289959733:2(489-505)Online publication date: 11-Jan-2021
  • (2021)Towards Large-Scale Object Instance Search: A Multi-Block N-Ary TrieIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2020.296654131:1(372-386)Online publication date: 6-Jan-2021
  • Show More Cited By
  1. A Distance-Computation-Free Search Scheme for Binary Code Databases

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Multimedia
    IEEE Transactions on Multimedia  Volume 18, Issue 3
    March 2016
    231 pages

    Publisher

    IEEE Press

    Publication History

    Published: 01 March 2016

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 22 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Self-Supervised Temporal Sensitive Hashing for Video RetrievalIEEE Transactions on Multimedia10.1109/TMM.2024.338518326(9021-9035)Online publication date: 1-Jan-2024
    • (2021)Generalizing the Pigeonhole Principle for Similarity Search in Hamming SpaceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.289959733:2(489-505)Online publication date: 11-Jan-2021
    • (2021)Towards Large-Scale Object Instance Search: A Multi-Block N-Ary TrieIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2020.296654131:1(372-386)Online publication date: 6-Jan-2021
    • (2020)Unsupervised nonlinear feature selection algorithm via kernel functionNeural Computing and Applications10.1007/s00521-018-3853-y32:11(6443-6454)Online publication date: 1-Jun-2020
    • (2020)Spectral clustering algorithm combining local covariance matrix with normalizationNeural Computing and Applications10.1007/s00521-018-3852-z32:11(6611-6618)Online publication date: 1-Jun-2020
    • (2020)Mutual kNN based spectral clusteringNeural Computing and Applications10.1007/s00521-018-3836-z32:11(6435-6442)Online publication date: 1-Jun-2020
    • (2019)Double-Bit Quantization and Index Hashing for Nearest Neighbor SearchIEEE Transactions on Multimedia10.1109/TMM.2018.287289821:5(1248-1260)Online publication date: 1-May-2019
    • (2019)More is BetterIEEE Transactions on Image Processing10.1109/TIP.2018.285541528:1(32-44)Online publication date: 1-Jan-2019
    • (2019)Improved Search in Hamming Space Using Deep Multi-Index HashingIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2018.286992129:9(2844-2855)Online publication date: 3-Sep-2019
    • (2019)Generalized zero-shot learning for action recognition with web-scale video dataWorld Wide Web10.1007/s11280-018-0642-622:2(807-824)Online publication date: 1-Mar-2019
    • Show More Cited By

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media