A Feature Matching Algorithm Based on Improved GMS

ZHU Shiyu; CHEN Zhihua

doi:10.3969/j.issn.1671-637x.2023.07.009

[2] MUJA M,LOWE D G.Scalable nearest neighbor algorithms for high dimensional data［J］.IEEE Transactions on Pattern Analysis and Machine Intelligence,2014,36(11):2227-2240.

[3] BAY H,TUYTELAARS T,VAN GOOL L.SURF:speeded up robust features［C］//Computer Vision-ECCV 2006.Berlin:Springer,2006:404-417.

[4] CALONDER M,LEPETIT V,STRECHA C,et al.BRIEF:binary robust independent elementary features［C］//ECCV′10:Proceedings of the 11th European Conference on Computer Vision:Part IV.Berlin: Springer,2010:778-792.

[5] RUBLEE E,RABAUD V,KONOLIGE K,et al.ORB:an efficient alternative to SIFT or SURF［C］//International Conference on Computer Vision.Piscataway:IEEE,2011:2564-2571.

[6] BIAN J W,LIN W Y,LIU Y,et al.GMS:grid-based motion statistics for fast,ultra-robust feature correspondence［J］.International Journal of Computer Vision,2019,128(6):1580-1593.

[7] BIAN J W,LIN W Y,MATSUSHITA Y,et al.GMS:grid-based motion statistics for fast,ultra-robust feature correspondence［C］//IEEE Conference on Computer Vision and Pattern Recognition(CVPR).Piscataway:IEEE, 2017:2828-2837.

[13] FISCHLER M A,BOLLES R C.Random sample consensus［J］.Communications of the ACM,1981,24(6):381-395.

[14] SATTLER T,LEIBE B,KOBBELT L.SCRAMSAC:improving RANSAC′s efficiency with a spatial consistency filter［C］//IEEE 12th International Conference on Computer Vision.Piscataway:IEEE,2009:2090-2097.