Image Matching Based on Dual and Graph Transformation Matching
Image matching is an essential step in many image processing applications such as registration, mosaicking. Scale invariant feature transform (SIFT) is one of the most applicable and powerful methods proposed in the last decade for image matching that In this paper, double matching is used to increase matching precision in SIFT algorithm. Although dual matching in the SIFT algorithm has a very good performance, this method is not suitable for matching images with identical patterns. In this paper, using dual matching in SIFT algorithm and integrating it with graph transformation matching (GTM) algorithm, we have offered a new and efficient method to improve matching performance in images with duplicated patterns. Simulation results confirm the superiority of the proposed methods in comparison with SIFT and RANSAC in terms of and precision of matching, SITMMC and SITMMR.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.