Unsupervised Similarity Learning through Cartesian Product of Ranking References for Image Retrieval Tasks

Lucas Pascotti Valem, D. C. G. Pedronette
{"title":"Unsupervised Similarity Learning through Cartesian Product of Ranking References for Image Retrieval Tasks","authors":"Lucas Pascotti Valem, D. C. G. Pedronette","doi":"10.1109/SIBGRAPI.2016.042","DOIUrl":null,"url":null,"abstract":"Despite the consistent advances in visual features and other Content-Based Image Retrieval techniques, measuring the similarity among images is still a challenging task for effective image retrieval. In this scenario, similarity learning approaches capable of improving the effectiveness of retrieval in an unsupervised way are indispensable. A novel method, called Cartesian Product of Ranking References (CPRR), is proposed with this objective in this paper. The proposed method uses Cartesian product operations based on rank information for exploiting the underlying structure of datasets. Only subsets of ranked lists are required, demanding low computational efforts. An extensive experimental evaluation was conducted considering various aspects, four public datasets and several image features. Besides effectiveness, experiments were also conducted to assess the efficiency of the method, considering parallel and heterogeneous computing on CPU and GPU devices. The proposed method achieved significant effectiveness gains, including competitive state-of-the-art results on popular benchmarks.","PeriodicalId":201572,"journal":{"name":"2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBGRAPI.2016.042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Despite the consistent advances in visual features and other Content-Based Image Retrieval techniques, measuring the similarity among images is still a challenging task for effective image retrieval. In this scenario, similarity learning approaches capable of improving the effectiveness of retrieval in an unsupervised way are indispensable. A novel method, called Cartesian Product of Ranking References (CPRR), is proposed with this objective in this paper. The proposed method uses Cartesian product operations based on rank information for exploiting the underlying structure of datasets. Only subsets of ranked lists are required, demanding low computational efforts. An extensive experimental evaluation was conducted considering various aspects, four public datasets and several image features. Besides effectiveness, experiments were also conducted to assess the efficiency of the method, considering parallel and heterogeneous computing on CPU and GPU devices. The proposed method achieved significant effectiveness gains, including competitive state-of-the-art results on popular benchmarks.
基于参考文献排序笛卡尔积的无监督相似学习
尽管视觉特征和其他基于内容的图像检索技术不断取得进展,但测量图像之间的相似性仍然是有效的图像检索的一个具有挑战性的任务。在这种情况下,能够以无监督的方式提高检索效率的相似学习方法是必不可少的。为此,本文提出了一种新的评价方法——排名参考文献笛卡尔积法。该方法利用基于秩信息的笛卡尔积运算来挖掘数据集的底层结构。只需要排序列表的子集,需要较少的计算量。从多个方面、四个公共数据集和多个图像特征进行了广泛的实验评估。除了有效性之外,还进行了实验来评估该方法的效率,同时考虑了CPU和GPU设备上的并行和异构计算。所提出的方法取得了显著的有效性收益,包括在流行基准上取得具有竞争力的最新成果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信