A Hybrid Distance Metric Learning for Image Ranking

Rasika Subhash Dhawane, Bela Joglekar
{"title":"A Hybrid Distance Metric Learning for Image Ranking","authors":"Rasika Subhash Dhawane, Bela Joglekar","doi":"10.1145/2983402.2983442","DOIUrl":null,"url":null,"abstract":"The Distance Metric Learning (DML) has been in attentive on image retrieval, but many of the previous methods are used for classification and clustering of the images. In this paper, we are focusing on designing the ordinal DML algorithms for image ranking purpose, hence the rank levels among the images can be well measured by us. A new hybrid approach is proposed in this paper in order to improve efficiency of existing system. Proposed approach is a hybrid algorithm of linear and nonlinear distance metric learning methods. First of all we present a linear ordinal Mahalanobis DML model which tries to preserve the local geometry information as well as the ordinal relationship of the data. Then a nonlinear DML method by kernelizing the above model is developed, here most of the real-world image data with nonlinear structures is considered. for further improvemrnt of the ranking performance, we derive a multiple kernel DML approach taken by the idea of multiple-kernel learning which performs different kernel operations on different kinds of features of image. Extensive experimental analysis demonstrates the relevant results.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third International Symposium on Computer Vision and the Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2983402.2983442","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Distance Metric Learning (DML) has been in attentive on image retrieval, but many of the previous methods are used for classification and clustering of the images. In this paper, we are focusing on designing the ordinal DML algorithms for image ranking purpose, hence the rank levels among the images can be well measured by us. A new hybrid approach is proposed in this paper in order to improve efficiency of existing system. Proposed approach is a hybrid algorithm of linear and nonlinear distance metric learning methods. First of all we present a linear ordinal Mahalanobis DML model which tries to preserve the local geometry information as well as the ordinal relationship of the data. Then a nonlinear DML method by kernelizing the above model is developed, here most of the real-world image data with nonlinear structures is considered. for further improvemrnt of the ranking performance, we derive a multiple kernel DML approach taken by the idea of multiple-kernel learning which performs different kernel operations on different kinds of features of image. Extensive experimental analysis demonstrates the relevant results.
一种用于图像排序的混合距离度量学习
距离度量学习(Distance Metric Learning, DML)在图像检索方面一直受到关注,但以往的方法大多用于图像的分类和聚类。在本文中,我们专注于设计用于图像排序的有序DML算法,因此我们可以很好地测量图像之间的排名水平。为了提高现有系统的效率,本文提出了一种新的混合方法。该方法是一种线性和非线性距离度量学习方法的混合算法。首先提出了一种线性有序Mahalanobis DML模型,该模型既保留了局部几何信息,又保留了数据的有序关系。然后,通过对上述模型进行核化,提出了一种非线性DML方法,该方法考虑了大多数具有非线性结构的真实图像数据。广泛的实验分析证实了相关结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信