Online Sketching Hashing | |
Leng, Cong1![]() ![]() ![]() ![]() | |
2015 | |
会议日期 | 2015 |
会议地点 | USA |
关键词 | Sketching |
英文摘要 |
Recently, hashing based approximate nearest neighbor (ANN) search has attracted much attention. Extensive new algorithms have been developed and successfully applied to
different applications. However, two critical problems are rarely mentioned. First, in real-world applications, the data often comes in a streaming fashion but most of existing hashing methods are batch based models. Second, when the dataset becomes huge, it is almost impossible to load all the data into memory to train hashing models. In this paper, we propose a novel approach to handle these two problems simultaneously based on the idea of data sketching. A sketch of one dataset preserves its major characters but with significantly smaller size. With a small size sketch, our method can learn hash functions in an online fashion, while needs rather low computational complexity and storage space.
Extensive experiments on two large scale benchmarks and one synthetic dataset demonstrate the efficacy of the proposed method. |
会议录 | IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
![]() |
内容类型 | 会议论文 |
源URL | [http://ir.ia.ac.cn/handle/173211/11785] ![]() |
专题 | 自动化研究所_模式识别国家重点实验室_图像与视频分析团队 |
通讯作者 | Cheng, Jian |
作者单位 | 1.中科院自动化研究所 2.北京航空航天大学 |
推荐引用方式 GB/T 7714 | Leng, Cong,Wu, Jiaxiang,Cheng, Jian,et al. Online Sketching Hashing[C]. 见:. USA. 2015. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论