Name
Title | ||
|---|---|---|
Concatenation hashing: A relative position preserving method for learning binary codes |
Abstract | ||
|---|---|---|
•By employing the clustering technique and concatenating the substrings learnt by the hash functions in each cluster, the proposed method can model the complex relationship among the data and alleviate the effect brought from the boundary of the cluster.•An alternating optimization is developed to simultaneously discover the cluster structures of the data and learn the hash functions to preserve the relative positions of the data to each cluster center.•The experiments show that the proposed method is competitive to or better than other unsupervised hashing methods. Especially when learning the long codes in order to achieve the high search precision, the proposed method is obviously superior to the other methods. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.patcog.2019.107151 | Pattern Recognition |
Keywords | DocType | Volume |
Unsupervised hashing,Approximate nearest neighbor search,Clustering | Journal | 100 |
Issue | ISSN | Citations |
1 | 0031-3203 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhenyu Weng | 1 | 6 | 3.85 |
| Zhu Yuesheng | 2 | 112 | 39.21 |