Open AccessReference‐omitted affine soft correspondence algorithm
Author(s) -
Zhang PengPeng,
Qiao Yu,
Wang ShengZheng,
Yang Jie
Publication year - 2016
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2015.0254
Subject(s) - affine transformation , outlier , matching (statistics) , algorithm , harris affine region detector , set (abstract data type) , point set registration , affine combination , scale (ratio) , mathematics , computer science , affine hull , affine shape adaptation , artificial intelligence , point (geometry) , affine space , statistics , geometry , physics , quantum mechanics , programming language
In this study, an affine registration algorithm with reference‐omitted scheme and soft correspondence is proposed. It is an iterative method with two‐step matching process at each iteration, named as forward matching and backward matching. Due to the introduction of backward matching, two sets of points are alternately to be reference set, such that the selection of reference set is omitted. Failure caused by different reference sets can be corrected with the reference‐omitted scheme, and even there is obvious difference in scale. Additionally, soft correspondence is applied to avoid estimating the initial transformations. The simulation and real experimental results show that the proposed method substantially outperforms the current affine registration methods, especially when the scale difference between two sets of points is obvious or there are outliers in one set.