Supervised class graph preserving hashing for image retrieval and classification

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the explosive growth of data, hashing-based techniques have attracted significant attention due to their efficient retrieval and storage reduction ability. However, most hashing methods do not have the ability of predicting the labels directly. In this paper, we propose a novel supervised hashing approach, namely Class Graph Preserving Hashing (CGPH), which can well incorporate label information into hashing codes and classify the samples with binary codes directly. Specifically, CGPH learns hashing functions by ensuring label consistency and preserving class graph similarity among hashing codes simultaneously. Then, it learns effective binary codes through orthogonal transformation by minimizing the quantization error between hashing function and binary codes. In addition, an iterative method is proposed for the optimization problem in CGPH. Extensive experiments on two large scale real-world image data sets show that CGPH outperforms or is comparable to state-of-the-art hashing methods in both image retrieval and classification tasks.

Cite

CITATION STYLE

APA

Feng, L., Xu, X. S., Guo, S., & Wang, X. L. (2017). Supervised class graph preserving hashing for image retrieval and classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10132 LNCS, pp. 391–403). Springer Verlag. https://doi.org/10.1007/978-3-319-51811-4_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free