Latent structure preserving hashing
From MaRDI portal
Recommendations
- Structure-preserving smooth projective hashing
- scientific article; zbMATH DE number 1559577
- A Sparse Embedding and Least Variance Encoding Approach to Hashing
- Latent Semantic Minimal Hashing for Image Retrieval
- Hashing with Angular Reconstructive Embeddings
- Global similarity preserving hashing
- A General Framework for Linear Distance Preserving Hashing
Cites work
- A Fast Learning Algorithm for Deep Belief Nets
- A generalized solution of the orthogonal Procrustes problem
- Biased Discriminant Euclidean Embedding for Content-Based Image Retrieval
- Diffusion Sparse Least-Mean Squares Over Networks
- scientific article; zbMATH DE number 1547349 (Why is no real title available?)
- Learning the parts of objects by non-negative matrix factorization
- Modeling the shape of the scene: A holistic representation of the spatial envelope
- Multiview Alignment Hashing for Efficient Image Search
- Non-negative matrix factorization with sparseness constraints
- Visualizing data using t-SNE
Cited in
(8)- Global similarity preserving hashing
- Unsupervised binary representation learning with deep variational networks
- Structured learning of binary codes with column generation for optimizing ranking measures
- Sharing hash codes for multiple purposes
- Maximum variance hashing via column generation
- Image retrieval algorithm based on sparse reconstruction coding
- Consensus hashing
- Multiple feature kernel hashing for large-scale visual search
This page was built for publication: Latent structure preserving hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193760)
