Abstract: Highlights•A generalisation of local feature matching: keypoints are replaced by k-keygraphs.•Given keypoint matches, finding keygraph matches has a negligible computational cost.•With 4-keygraphs, more than 99% of the incorrect keypoint matches are eliminated.•4-keygraphs require 1% of the RANSAC iterations in comparison with 2-keygraphs.
Loading