Visual search reranking via adaptive particle swarm optimization

详细信息    查看全文

• 作者：Lu Zhang^a ; ^{luzhangustc@gmail.com} ; Tao Mei^b ; ^{tmei@microsoft.com} ; Yuan Liu^a ; ^{yuanliu.ustc@gmail.com} ; Dacheng Tao^c ; ^{dacheng.tao@uts.edu.au} ; He-Qin Zhou^a ; ^{hqzhou@ustc.edu.cn} [Author vitae]
• 关键词：Visual search reranking ; Adaptive particle swarm optimization ; List distance ; Video search
• 刊名：Pattern Recognition
• 出版年：2011
• 出版时间：August 2011
• 年：2011
• 卷：44
• 期：8
• 页码：1811-1820
• 全文大小：1034 K

文摘

Visual search reranking involves an optimization process that uses visual content to recover the “genuine” ranking list from the helpful but noisy one generated by textual search. This paper presents an evolutionary approach, called Adaptive Particle Swarm Optimization (APSO), for unsupervised visual search reranking. The proposed approach incorporates the visual consistency regularization and the ranking list distance. In addition, to address the problem that existing list distance fails to capture the genuine disagreement between two ranking lists, we propose a numerical ranking list distance. Furthermore, the parameters in APSO are self-tuned adaptively according to the fitness values of the particles to avoid being trapped in local optima. We conduct extensive experiments on automatic search task over TRECVID 2006–2007 benchmarks and show significant and consistent improvements over state-of-the-art works.