Bit selection hashing for large scale image retrieval

DOI10.7641/CTA.2017.60608MaRDI QIDQ4574718zbMATH OpenFDO

Authors Xing Tian, Xiaoyi Lu, Wing W. Y. Ng, Jiajian Huang

Publication date 18 July 2018

Full work available at URL https://doi.org/10.7641/CTA.2017.60608

zbMATH Keywords

bit selectionlarge-scale image retrievalunsupervised hashing method

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Pattern recognition, speech recognition (68T10)

Recommendations

• A large-scale image retrieval method based on improved spectral hashing
• A weighted hashing algorithm based on local structured information for image retrieval
• Sparse graph based self-supervised hashing for scalable image retrieval
• Multiple feature kernel hashing for large-scale visual search
• Deep supervised hashing for fast image retrieval

Cited in

(8)

• Approximately nearest neighborhood image search using unsupervised hashing via homogeneous kernels
• A large-scale image retrieval method based on improved spectral hashing
• A weighted hashing algorithm based on local structured information for image retrieval
• BSIFT: Toward Data-Independent Codebook for Large Scale Image Search
• Global Hashing System for Fast Image Search
• Latent Semantic Minimal Hashing for Image Retrieval
• Hash Bit Selection for Nearest Neighbor Search
• Learning Binary Hash Codes for Large-Scale Image Search

This page was built for publication: Bit selection hashing for large scale image retrieval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4574718)