SIFT-NMI Algorithm for Image Matching
- 1 July 2011
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
SIFT-NMI algorithm is proposed for image matching based on SIFT (Scale-invariant feature transform) and NMI (Normalized Moment of Intertia) algorithm in this paper. Firstly, the SIFT algorithm is used to obtain the coordinates and vector matrix of the image's feature points. Then, the moment of intertia of the vector is obtained based on NMI algorithm and the pairs of matching features points are determined via setting the threshold. Ultimately, the best pairs of feature points are selected via ant colony. Matlab simulation results show that the SIFT-NMI algorithm overcomes the defects of the SIFT algorithm and NMI algorithm, since SIFT algorithm cannot do quantitative calculation and NMI algorithm cannot calculate affine image; by using SIFT-NMI algorithm we can improve the accuracy and speed of matching.Keywords
This publication has 4 references indexed in Scilit:
- A performance evaluation of local descriptorsIeee Transactions On Pattern Analysis and Machine Intelligence, 2005
- Distinctive Image Features from Scale-Invariant KeypointsInternational Journal of Computer Vision, 2004
- Object recognition from local scale-invariant featuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- The Laplacian Pyramid as a Compact Image CodeIEEE Transactions on Communications, 1983