Allocating images and selecting image collections for distributed visual search | |
Li, Bing ; Duan, Ling-Yu ; Lin, Jie ; Huang, Tiejun | |
2012 | |
英文摘要 | To improve query throughput, distributed image retrieval has been widely used to address the large scale visual search. In textual retrieval, the state-of-the-art approaches attempt to partition a textual database into multiple collections offline and allocate each collection to a server node. For each incoming query, just a few relevant collections are selected to search without seriously sacrificing retrieval accuracy, which enables sever nodes to process multiple queries concurrently. Unlike text retrieval, distributed visual search poses challenges in optimally allocating images and selecting image collections, due to the lack of semantic meanings in Bag of Words (BoW) based representation. In this paper, we propose a novel Semantics Related Distributed Visual Search (SRDVS) model. We employ Latent Dirichlet Allocation (LDA) [2] to discover the latent concepts as an intermediate semantic representation over a large scale image database. We aim to learn an optimal image allocation for each server node and accurately perform collection selection for each query. Experimental results over a million scale image database have demonstrated encouraging performance over state-of-the-art approaches. On average 6% collections are selected, which however yields promising retrieval performance comparable to the exhaustive search over the whole database. Copyright ? 2012 ACM.; EI; 0 |
语种 | 英语 |
DOI标识 | 10.1145/2382336.2382372 |
内容类型 | 其他 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/412170] ![]() |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Li, Bing,Duan, Ling-Yu,Lin, Jie,et al. Allocating images and selecting image collections for distributed visual search. 2012-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论