New 2D Feature Descriptor Free from Orientation Compensation with k-Means Clustering

Manel Benaissa, A. Bennia
{"title":"New 2D Feature Descriptor Free from Orientation Compensation with k-Means Clustering","authors":"Manel Benaissa, A. Bennia","doi":"10.25073/jaec.201824.211","DOIUrl":null,"url":null,"abstract":"In this paper, we propose two novel approaches in the field of feature description and matching. The first approach concerns the feature description and matching part, where we proposed an orientation invariant feature descriptor without an additional step dedicated to this task. We exploited the information provided by two representations of the image (intensity and gradient) for a better understanding and representation of the feature point distribution. The provided information is summarized in two cumulative histograms and used in the feature description and matching process. In the context of object detection, we introduced an unsupervised learning method based on k-means clustering. Which we used as an outlier pre-elimination phase after the matching process to improve our descriptor precision. Experiments shown its robustness to image changes and a clear increase in terms of precision of the tested descriptors after the pre-elimination phase.This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium provided the original work is properly cited.","PeriodicalId":250655,"journal":{"name":"J. Adv. Eng. Comput.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Adv. Eng. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25073/jaec.201824.211","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, we propose two novel approaches in the field of feature description and matching. The first approach concerns the feature description and matching part, where we proposed an orientation invariant feature descriptor without an additional step dedicated to this task. We exploited the information provided by two representations of the image (intensity and gradient) for a better understanding and representation of the feature point distribution. The provided information is summarized in two cumulative histograms and used in the feature description and matching process. In the context of object detection, we introduced an unsupervised learning method based on k-means clustering. Which we used as an outlier pre-elimination phase after the matching process to improve our descriptor precision. Experiments shown its robustness to image changes and a clear increase in terms of precision of the tested descriptors after the pre-elimination phase.This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium provided the original work is properly cited.
基于k-Means聚类的无方向补偿二维特征描述子
在本文中,我们提出了两种新的特征描述和匹配方法。第一种方法涉及特征描述和匹配部分,其中我们提出了一个方向不变的特征描述符,而没有额外的步骤专门用于此任务。我们利用图像的两种表示(强度和梯度)提供的信息来更好地理解和表示特征点分布。所提供的信息汇总在两个累积直方图中,并用于特征描述和匹配过程。在目标检测方面,我们引入了一种基于k-means聚类的无监督学习方法。我们将其用作匹配过程后的离群值预消除阶段,以提高描述符的精度。实验表明,该方法对图像变化具有鲁棒性,并且经过预消去阶段后,所测试描述符的精度有明显提高。这是一篇在知识共享署名许可(http://creativecommons.org/licenses/by/4.0/)条款下发布的开放获取文章,该许可允许在任何媒介上不受限制地使用、分发和复制,只要原始作品被适当引用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信