RLSAK: A recursive least square approximation with k-means for transformation model estimation in image registration techniques

Sistu Ganesh, Nivedita Tripathi, Gineesh Sukumaran
{"title":"RLSAK: A recursive least square approximation with k-means for transformation model estimation in image registration techniques","authors":"Sistu Ganesh, Nivedita Tripathi, Gineesh Sukumaran","doi":"10.1109/ICHCI-IEEE.2013.6887775","DOIUrl":null,"url":null,"abstract":"This paper aims to present a new transformation model estimation frame work for feature based image registration techniques. In general Feature based image registration techniques involves Feature detection, matching, transformation model estimation, image resampling and transformation. Very little work has been done in the area of transformation model estimation compared to wide range of techniques available in Feature Detection and matching. While RANSAC (Random Sample Consensus) and LMS (Least Median of Squares) are the most commonly used methods for robust global transformation estimation in affine and perspective transformations, research is going on for the methods that would do well in the presence of a very high number of outlier data and overcome the disadvantages of these state of art techniques. This motivated us to develop a new algorithm which not only uses the spatial relations between the feature points but also make use of the image intensity profiles for robust model estimation even in presence of outliers. In current approach, first the Euclidean distances created by the matched feature points is clustered and matching error for each cluster is computed using intensity information. The feature point pairs of the cluster having minimum error are retained. Now by applying mean filtering followed by recursive least square approximation, the transformation model is estimated. The efficiency of the proposed methodology is demonstrated on different datasets under different transformations & for different areas of application. The method has shown significant improvements in accuracy compared to other existing techniques even in the presence of large number of outliers.","PeriodicalId":419263,"journal":{"name":"2013 International Conference on Human Computer Interactions (ICHCI)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Human Computer Interactions (ICHCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICHCI-IEEE.2013.6887775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper aims to present a new transformation model estimation frame work for feature based image registration techniques. In general Feature based image registration techniques involves Feature detection, matching, transformation model estimation, image resampling and transformation. Very little work has been done in the area of transformation model estimation compared to wide range of techniques available in Feature Detection and matching. While RANSAC (Random Sample Consensus) and LMS (Least Median of Squares) are the most commonly used methods for robust global transformation estimation in affine and perspective transformations, research is going on for the methods that would do well in the presence of a very high number of outlier data and overcome the disadvantages of these state of art techniques. This motivated us to develop a new algorithm which not only uses the spatial relations between the feature points but also make use of the image intensity profiles for robust model estimation even in presence of outliers. In current approach, first the Euclidean distances created by the matched feature points is clustered and matching error for each cluster is computed using intensity information. The feature point pairs of the cluster having minimum error are retained. Now by applying mean filtering followed by recursive least square approximation, the transformation model is estimated. The efficiency of the proposed methodology is demonstrated on different datasets under different transformations & for different areas of application. The method has shown significant improvements in accuracy compared to other existing techniques even in the presence of large number of outliers.
RLSAK:图像配准技术中变换模型估计的递归最小二乘近似
针对基于特征的图像配准技术,提出了一种新的变换模型估计框架。一般来说,基于特征的图像配准技术包括特征检测、匹配、变换模型估计、图像重采样和变换。与特征检测和匹配中广泛可用的技术相比,在转换模型估计领域做的工作很少。虽然RANSAC(随机样本共识)和LMS(最小二乘中值)是在仿射和透视变换中最常用的鲁棒全局变换估计方法,但研究人员正在研究在存在大量异常数据的情况下表现良好的方法,并克服这些最先进技术的缺点。这促使我们开发了一种新的算法,该算法不仅利用特征点之间的空间关系,而且在存在异常值的情况下也利用图像强度轮廓进行鲁棒模型估计。在目前的方法中,首先对匹配的特征点产生的欧氏距离进行聚类,并利用强度信息计算每个聚类的匹配误差。保留误差最小的聚类特征点对。然后采用均值滤波和递推最小二乘逼近的方法对变换模型进行估计。在不同的数据集、不同的转换和不同的应用领域上证明了该方法的有效性。即使在存在大量异常值的情况下,与其他现有技术相比,该方法也显示出显着的准确性提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信