Multi-vector feature space based on pseudo-euclidean space and oblique basis for similarity searches of images

Yasuo Yamane, T. Hoshiai, H. Tsuda, Kaoru Katayama, Manabu Ohta, H. Ishikawa
{"title":"Multi-vector feature space based on pseudo-euclidean space and oblique basis for similarity searches of images","authors":"Yasuo Yamane, T. Hoshiai, H. Tsuda, Kaoru Katayama, Manabu Ohta, H. Ishikawa","doi":"10.1145/1039470.1039479","DOIUrl":null,"url":null,"abstract":"Investigators have tried to increase the precision of similarity searches of images by using distance functions that reflect the similarity of features. When the quadratic-form distance is used, however, dissimilar images can be judged to be similar. We therefore propose that the similarity of images be evaluated using a measure of distance in a multi-vector feature space based on pseudo-Euclidean space and an oblique basis (MVPO). In this space an image is represented by a set of vectors each of which represents each feature. And we propose a distance (called D-distance) between two sets of vectors. Roughly speaking, it is the distance between solids.Another representative distance used in similarity searches is the Earth Mover's Distance (EMD). It can be formalized using MVPO, and that explains well why EMD outperforms quad-ratic-form distance. The main difference between EMD and D-distance is that EMD is based on partial matching and D-distance is based on total matching.We also discuss performance issues of MPVO and D-distance to address practical use of them.","PeriodicalId":346313,"journal":{"name":"Computer Vision meets Databases","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Vision meets Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1039470.1039479","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Investigators have tried to increase the precision of similarity searches of images by using distance functions that reflect the similarity of features. When the quadratic-form distance is used, however, dissimilar images can be judged to be similar. We therefore propose that the similarity of images be evaluated using a measure of distance in a multi-vector feature space based on pseudo-Euclidean space and an oblique basis (MVPO). In this space an image is represented by a set of vectors each of which represents each feature. And we propose a distance (called D-distance) between two sets of vectors. Roughly speaking, it is the distance between solids.Another representative distance used in similarity searches is the Earth Mover's Distance (EMD). It can be formalized using MVPO, and that explains well why EMD outperforms quad-ratic-form distance. The main difference between EMD and D-distance is that EMD is based on partial matching and D-distance is based on total matching.We also discuss performance issues of MPVO and D-distance to address practical use of them.
基于伪欧氏空间和斜基的多向量特征空间图像相似性搜索
研究者试图通过使用反映特征相似性的距离函数来提高图像相似性搜索的精度。然而,当使用二次形式的距离时,不同的图像可以被判断为相似。因此,我们建议使用基于伪欧几里得空间和斜基(MVPO)的多向量特征空间中的距离度量来评估图像的相似性。在这个空间中,图像由一组向量表示,每个向量表示每个特征。我们提出两个向量集之间的距离(称为d -距离)。粗略地说,它是固体之间的距离。在相似搜索中使用的另一个代表性距离是地球移动距离(EMD)。它可以使用MVPO形式化,这很好地解释了为什么EMD优于二次形式的距离。EMD和D-distance的主要区别在于EMD是基于部分匹配的,而D-distance是基于全匹配的。我们还讨论了MPVO和D-distance的性能问题,以解决它们的实际使用问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信