Efficient and Robust Feature Matching via Local Descriptor Generalized Hough Transform

Abstract:

Robust and efficient indistinctive feature matching and outliers removal is an essential problem in many computer vision applications. In this paper we present a simple and fast algorithm named as LDGTH (Local Descriptor Generalized Hough Transform) to handle this problem. The main characteristics of the proposed method include: (1) A novel local descriptor generalized hough transform framework is presented in which the local geometric characteristics of invariant feature descriptors are fused together as a global constraint for feature correspondence verification. (2) Different from standard generalized hough transform, our approach greatly reduces the computational and storage requirements of parameter space through taking advantage of the invariant feature correspondences. (3) The proposed algorithm can be seamlessly embedded into the existing image matching framework, and significantly improve the image matching performance both in speed and robustness in challenge conditions. In the experiment we use both synthetic image data and real world data with high outliers ratio and severe changes in view point, scale, illumination, image blur, compression and noises to evaluate the proposed method, and the results demonstrate that our approach achieves achieves faster and better matching performance compared to the traditional algorithms.

• Periodical: Applied Mechanics and Materials (Volumes 373-375)
• Pages: 536-540
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.373-375.536
• Online since: August 2013
• Authors: Jing Li, Tao Yang
• Keywords: Efficient Image Matching, Generalized Hough Transform, Outliers Removal

References

[1] H.Y. Chen, Y.Y. Lin, B.Y. Chen. Robust feature matching with alternate hough and inverted hough transforms. CVPR. (2013).

DOI: 10.1109/cvpr.2013.356

[2] D.G. Lowe. Distinctive image features from scale invariant keypoints. IJCV. (2004) 60(2): 91-110.

DOI: 10.1023/b:visi.0000029664.99615.94

[3] M. Toews,W. Wells. SURF: speeded up robust features. CVIU. (2008)110(3): 346-359.

[4] Y. Ke,R. Sukthankar. PCA-SIFT: A more distinctive representation for local image descriptors. CVPR. (2004) 506-513.

DOI: 10.1109/cvpr.2004.1315206

[5] M.S. Ryoo, J.K. Aggarwal. SIFT-Rank: ordinal description for invariant feature correspondence. CVPR. (2009).

[6] E. Rublee,V. Rabaud,K. Konolige,G. Bradski. ORB: An efficient alternative to SIFT or SURF. IJCV. (2011) 2564-2571.

DOI: 10.1109/iccv.2011.6126544

[7] M. Calonder,V. Lepetit,C. Strecha,P. Fua. BRIEF: binary robust independent elementary features. ECCV. (2010) 778-792.

DOI: 10.1007/978-3-642-15561-1_56

[8] M. Ozuysal, M. Calonder, V. Lepetit, P. Fua. Fast keypoint recognition using random ferns. TPAMI. (2010) 32(3): 448-461.

DOI: 10.1109/tpami.2009.23

[9] T. Trzcinski, M. Christoudias, P. Fua, V. Lepetit. Boosting binary keypoint descriptors. CVPR. (2013).

DOI: 10.1109/cvpr.2013.370

[10] R. Khan, J. Weijer, F. Khan, D. Muselet, C. Ducottet, C. Barat. Discriminative color descriptors. CVPR. (2013).

DOI: 10.1109/cvpr.2013.369

[11] S. Choi, T. Kim, and W. Yu. Performance evaluation of RANSAC family. BMVC. (2009).

[12] D.H. Ballard. Generalizing the hough transform to detect arbitrary shapes. Pattern Recognition. (1981) 13(2): 111-122.

DOI: 10.1016/0031-3203(81)90009-1