Deep Image Set Hashing
2016 · Jie Feng, Svebor Karaman, I-Hong Jhuo, et al.
Abstract
In applications involving matching of image sets, the information from multiple images must be effectively exploited to represent each set. State-of-the-art methods use probabilistic distribution or subspace to model a set and use specific distance measure to compare two sets. These methods are slow to compute and not compact to use in a large scale scenario. Learning-based hashing is often used in large scale image retrieval as they provide a compact representation of each sample and the Hamming distance can be used to efficiently compare two samples. However, most hashing methods encode each image separately and discard knowledge that multiple images in the same set represent the same object or person. We investigate the set hashing problem by combining both set representation and hashing in a single deep neural network. An image set is first passed to a CNN module to extract image features, then these features are aggregated using two types of set feature to capture both set specifi
Authors
(none)
Tags
Stats
Related papers
- Deep Hashing: A Joint Approach For Image Signature Learning (2016)5.24
- Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
- Unsupervised Semantic Deep Hashing (2018)10.48
- Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26
- SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
- Deep Residual Hashing (2016)0.00
- Transhash: Transformer-based Hamming Hashing For Efficient Image Retrieval (2021)13.44
- Hierarchy Neighborhood Discriminative Hashing For An Unified View Of Single-label And Multi-label Image Retrieval (2019)0.00