基于布局期望的图像搜索排序模型

Bin Jin, Weiyao Lin, Jianxin Wu, Tianhao Wu, Jun Huang, Chongyang Zhang
{"title":"基于布局期望的图像搜索排序模型","authors":"Bin Jin, Weiyao Lin, Jianxin Wu, Tianhao Wu, Jun Huang, Chongyang Zhang","doi":"10.1109/ICMEW.2012.28","DOIUrl":null,"url":null,"abstract":"In this paper, a new algorithm is proposed for image re-ranking in Web search applications. The proposed algorithm introduces a new layout expectation model for improving the image search results. The motivation for using the expectation model is that users may often have potential expectations about the desired image during the search process. By including the layout expectation model to describe users' expectation on image layouts, the re-ranked search results can become more satisfactory to users. Experimental results demonstrate that our proposed algorithm can significantly improve the re-ranking precision compared with the state-of-the-art algorithms.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Layout-expectation-based Model for Image Search Re-ranking\",\"authors\":\"Bin Jin, Weiyao Lin, Jianxin Wu, Tianhao Wu, Jun Huang, Chongyang Zhang\",\"doi\":\"10.1109/ICMEW.2012.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new algorithm is proposed for image re-ranking in Web search applications. The proposed algorithm introduces a new layout expectation model for improving the image search results. The motivation for using the expectation model is that users may often have potential expectations about the desired image during the search process. By including the layout expectation model to describe users' expectation on image layouts, the re-ranked search results can become more satisfactory to users. Experimental results demonstrate that our proposed algorithm can significantly improve the re-ranking precision compared with the state-of-the-art algorithms.\",\"PeriodicalId\":385797,\"journal\":{\"name\":\"2012 IEEE International Conference on Multimedia and Expo Workshops\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Conference on Multimedia and Expo Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMEW.2012.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Multimedia and Expo Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMEW.2012.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种Web搜索应用中图像重新排序的新算法。该算法引入了一种新的布局期望模型,以改善图像搜索结果。使用期望模型的动机是,在搜索过程中,用户可能经常对所需的图像有潜在的期望。通过引入布局期望模型来描述用户对图像布局的期望,使得重新排序后的搜索结果更让用户满意。实验结果表明,与现有算法相比,该算法能显著提高重排序精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Layout-expectation-based Model for Image Search Re-ranking
In this paper, a new algorithm is proposed for image re-ranking in Web search applications. The proposed algorithm introduces a new layout expectation model for improving the image search results. The motivation for using the expectation model is that users may often have potential expectations about the desired image during the search process. By including the layout expectation model to describe users' expectation on image layouts, the re-ranked search results can become more satisfactory to users. Experimental results demonstrate that our proposed algorithm can significantly improve the re-ranking precision compared with the state-of-the-art algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信