Discrete Multi-graph Hashing for Large-Scale Visual Search
- Publication Type:
- Journal Article
- Citation:
- Neural Processing Letters, 2019, 49 (3), pp. 1055 - 1069
- Issue Date:
- 2019-06-15
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Discrete Multi-graph Hashing for Large-Scale Visual Search.pdf | Published Version | 1.41 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2018, Springer Science+Business Media, LLC, part of Springer Nature. Hashing has become a promising technique to be applied to the large-scale visual retrieval tasks. Multi-view data has multiple views, providing more comprehensive information. The challenges of using hashing to handle multi-view data lie in two aspects: (1) How to integrate multiple views effectively? (2) How to reduce the distortion error in the quantization stage? In this paper, we propose a novel hashing method, called discrete multi-graph hashing (DMGH), to address the above challenges. DMGH uses a multi-graph learning technique to fuse multiple views, and adaptively learns the weights of each view. In addition, DMGH explicitly minimizes the distortion errors by carefully designing a quantization regularization term. An alternative algorithm is developed to solve the proposed optimization problem. The optimization algorithm is very efficient due to the low-rank property of the anchor graph. The experiments on three large-scale datasets demonstrate the proposed method outperforms the existing multi-view hashing methods.
Please use this identifier to cite or link to this item: