Multiple feature kernel hashing for large-scale visual search
From MaRDI portal
Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Machine vision and scene understanding (68T45)
Recommendations
Cites work
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- Locality-sensitive hashing scheme based on \(p\)-stable distributions
- Modeling the shape of the scene: A holistic representation of the spatial envelope
- Multidimensional binary search trees used for associative searching
- Multiple kernel learning algorithms
- Similarity estimation techniques from rounding algorithms
Cited in
(6)- Bit selection hashing for large scale image retrieval
- Approximately nearest neighborhood image search using unsupervised hashing via homogeneous kernels
- Iterated local search optimized hashing for image copy detection
- Maximum variance hashing via column generation
- Consensus hashing
- Deep kernel supervised hashing for node classification in structural networks
This page was built for publication: Multiple feature kernel hashing for large-scale visual search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898328)