Transformational Approach for Alignment-free Image Matching Applications

K. Komal, Nandita Bhattacharjee, D. Albrecht, B. Srinivasan
{"title":"Transformational Approach for Alignment-free Image Matching Applications","authors":"K. Komal, Nandita Bhattacharjee, D. Albrecht, B. Srinivasan","doi":"10.1145/3151848.3151855","DOIUrl":null,"url":null,"abstract":"One of the fundamental steps in computer vision and image processing applications is the alignment of images before matching. A number of alignment methods based on features points, pixel information and transformation parameters have been proposed in the literature. All these methods either suffer from accurate detection of feature points or are computationally expensive that makes the entire matching process time consuming. The fast matching of images performed without alignment can benefit a number of image matching applications. In this paper, a transformational approach is proposed that identifies whether two images are similar or not without performing an alignment. The matching without alignment reduces the computation time of the entire matching process. The effectiveness of the proposed approach has been demonstrated on UMD logo dataset. The robustness of the proposed approach to additive noise shows that high accuracy can be achieved even when the noise is as high as 20%. Furthermore, the computation time is improved by decreasing the number of projections without affecting the matching accuracy. The experiments demonstrate that the proposed method is not only efficient but also highly accurate as compared to existing approaches.","PeriodicalId":218635,"journal":{"name":"Proceedings of the 15th International Conference on Advances in Mobile Computing & Multimedia","volume":"76 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 15th International Conference on Advances in Mobile Computing & Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3151848.3151855","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

One of the fundamental steps in computer vision and image processing applications is the alignment of images before matching. A number of alignment methods based on features points, pixel information and transformation parameters have been proposed in the literature. All these methods either suffer from accurate detection of feature points or are computationally expensive that makes the entire matching process time consuming. The fast matching of images performed without alignment can benefit a number of image matching applications. In this paper, a transformational approach is proposed that identifies whether two images are similar or not without performing an alignment. The matching without alignment reduces the computation time of the entire matching process. The effectiveness of the proposed approach has been demonstrated on UMD logo dataset. The robustness of the proposed approach to additive noise shows that high accuracy can be achieved even when the noise is as high as 20%. Furthermore, the computation time is improved by decreasing the number of projections without affecting the matching accuracy. The experiments demonstrate that the proposed method is not only efficient but also highly accurate as compared to existing approaches.
无对齐图像匹配应用的转换方法
计算机视觉和图像处理应用的基本步骤之一是在匹配之前对图像进行对齐。文献中提出了许多基于特征点、像素信息和变换参数的对齐方法。所有这些方法要么无法准确检测特征点,要么计算量大,使得整个匹配过程耗时。在不对齐的情况下执行图像的快速匹配可以使许多图像匹配应用受益。本文提出了一种转换方法,可以在不执行对齐的情况下识别两幅图像是否相似。不对齐的匹配减少了整个匹配过程的计算时间。在UMD标识数据集上验证了该方法的有效性。该方法对加性噪声的鲁棒性表明,即使噪声高达20%,也能获得较高的精度。此外,在不影响匹配精度的情况下,通过减少投影数来提高计算时间。实验表明,与现有方法相比,该方法不仅效率高,而且精度高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书