An improved SIFT matching algorithm based on locality preserving projection LPP

Authors:
Peng Cao;Ting Rui;Jin-lin Zhang;You Zhou
Affiliations:
PLA University of Science and Technology, Nan Jing, China;PLA University of Science and Technology, Nan Jing, China;PLA University of Science and Technology, Nan Jing, China;Jiangsu Institute of Economic and Trade Technology, Nan Jing, China
Venue:
Proceedings of the 4th International Conference on Internet Multimedia Computing and Service
Year:
2012

Citing 5
Cited 0

Feature Detection with Automatic Scale Selection

International Journal of Computer Vision
Laplacian Eigenmaps for dimensionality reduction and data representation

Neural Computation
Object Recognition from Local Scale-Invariant Features

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
Towards automatic visual obstacle avoidance

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problems of high dimensional feature vectors lead to large data calculating and time consuming in Scale Invariant Feature Transform (SIFT) feature matching. This paper combines the SIFT and Locality Preserving Projection (LPP) as the LPP-SIFT algorithm. First, use the SIFT algorithm to extract feature point vectors, then by the linear LPP dimensionality reduction method, reduce the amount of data. Use the Euclidean distance similarity criteria to achieve the coarse matching feature point vectors. Then re-match each pair of the match points by the way of the Gaussian neighborhood weighted average to get rid of the mismatch points. The experimental results show that the improved LPP-SIFT algorithm can reduce the amount of data, enhance the real-time and has a high matching accuracy and matching efficiency.