Unsupervised approach for object matching using Speeded Up Robust Features

A. Vardhan, N. Verma, R. K. Sevakula, A. Salour
{"title":"Unsupervised approach for object matching using Speeded Up Robust Features","authors":"A. Vardhan, N. Verma, R. K. Sevakula, A. Salour","doi":"10.1109/AIPR.2015.7444541","DOIUrl":null,"url":null,"abstract":"Autonomous object counting system is of great use in retail stores, industries and also in research processes. In this paper, a Speeded Up Robust Feature (SURF) based robust algorithm for identifying, counting and locating all instances of a defined object in any image, has been proposed. The defined object is referred to as prototype and the image in which one wishes to count the prototype is referred to as scene image. The algorithm starts by detecting the interest points for SURF in both, prototype and scene images. The SURF points on prototype are first clustered using density based clustering; then SURF points in each cluster are matched with those in scene image. The SURF points in scene image that have been matched w.r.t. a single cluster, are clustered using the same clustering algorithm. Each cluster formed in scene image represents an instance of prototype object in the image. Homography transforms are further used to give exact location and span of each prototype object in the scene image. Once the span of each prototype is defined, SURF points within this span are matched with the prototype image and then Homography transform is once again applied while considering the newly matched SURF points; thus eliminating noisy detection/s of prototype. While the same process is repeated with each cluster, a novel centroid based algorithm for merging repeated detections of same prototype instance is used. Carrying the benefits of SURF and Homography transforms, the algorithm is capable of detecting all prototype instances present in scene image, irrespective of their scale and orientation. The complete algorithm has also been integrated into a desktop application, which uses camera feed to report the real time count of the prototype in the scene image.","PeriodicalId":440673,"journal":{"name":"2015 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIPR.2015.7444541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

Autonomous object counting system is of great use in retail stores, industries and also in research processes. In this paper, a Speeded Up Robust Feature (SURF) based robust algorithm for identifying, counting and locating all instances of a defined object in any image, has been proposed. The defined object is referred to as prototype and the image in which one wishes to count the prototype is referred to as scene image. The algorithm starts by detecting the interest points for SURF in both, prototype and scene images. The SURF points on prototype are first clustered using density based clustering; then SURF points in each cluster are matched with those in scene image. The SURF points in scene image that have been matched w.r.t. a single cluster, are clustered using the same clustering algorithm. Each cluster formed in scene image represents an instance of prototype object in the image. Homography transforms are further used to give exact location and span of each prototype object in the scene image. Once the span of each prototype is defined, SURF points within this span are matched with the prototype image and then Homography transform is once again applied while considering the newly matched SURF points; thus eliminating noisy detection/s of prototype. While the same process is repeated with each cluster, a novel centroid based algorithm for merging repeated detections of same prototype instance is used. Carrying the benefits of SURF and Homography transforms, the algorithm is capable of detecting all prototype instances present in scene image, irrespective of their scale and orientation. The complete algorithm has also been integrated into a desktop application, which uses camera feed to report the real time count of the prototype in the scene image.
基于加速鲁棒特征的无监督对象匹配方法
自动物体计数系统在零售商店、工业和研究过程中都有很大的应用。本文提出了一种基于加速鲁棒特征(SURF)的鲁棒算法,用于识别、计数和定位任意图像中定义对象的所有实例。被定义的对象被称为原型,人们希望在其中计算原型的图像被称为场景图像。该算法首先在原型和场景图像中检测SURF的兴趣点。首先利用基于密度的聚类方法对原型上的SURF点进行聚类;然后将每个聚类中的SURF点与场景图像中的SURF点进行匹配。将场景图像中的SURF点与单个聚类匹配后,使用相同的聚类算法进行聚类。场景图像中形成的每一个聚类都代表了图像中原型对象的一个实例。在此基础上,进一步利用单应性变换给出每个原型对象在场景图像中的准确位置和跨度。一旦定义了每个原型的跨度,将该跨度内的SURF点与原型图像进行匹配,然后在考虑新匹配的SURF点的同时再次进行单应性变换;从而消除了原型的噪声检测/s。在每个聚类重复同一过程的同时,采用了一种新的基于质心的算法来合并同一原型实例的重复检测。该算法结合了SURF和同形变换的优点,能够检测出场景图像中存在的所有原型实例,而不考虑它们的规模和方向。完整的算法也被集成到一个桌面应用程序中,该应用程序使用摄像头馈送来报告场景图像中原型的实时计数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信