Learning Flexible Binary Code for Linear Projection Based Hashing with Random Forest
文献类型：会议论文
| 作者 | Shuze Du; Wei Zhang; Shifeng Chen; Yafei Wen |
| 出版日期 | 2014 |
| 会议名称 | Pattern Recognition (ICPR), 2014 22nd International Conference on |
| 会议地点 | 中国 |
| 英文摘要 | Existing linear projection based hashing methods have witnessed many progresses in finding the approximate nearest neighbor(s) of a given query. They perform well when using a short code. But their code length depends on the original data dimension, thus their performance can not be further improved with higher number of bits for low dimensional data. In addition, in the case of high dimensional data, it is not a good choice to produce each bit by a sign function. In this paper, we propose a novel random forest based approach to cope with the above shortcomings. The bits are obtained by recording the paths when a point traversing each tree in the forest. Then we propose a new metric to calculate the similarity between any two codes. Experimental results on two large benchmark datasets show that our approach outperforms its counterparts and demonstrate its superiority over the existing state-of-the-art hashing methods for descriptor retrieval. |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/5503]  |
| 专题 | 深圳先进技术研究院_集成所 |
| 作者单位 | 2014 |
| 推荐引用方式 GB/T 7714 | Shuze Du,Wei Zhang,Shifeng Chen,et al. Learning Flexible Binary Code for Linear Projection Based Hashing with Random Forest[C]. 见:Pattern Recognition (ICPR), 2014 22nd International Conference on. 中国. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。