Scalable object instance recognition based on keygraph matching

• Published in: Pattern recognition letters Vol. 114; pp. 53 - 62
• Main Authors: Dazzi, Estephan, de Campos, Teofilo, Hilton, Adrian, Cesar, Roberto M.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 15.10.2018; Elsevier Science Ltd
• Subjects: Affine transformations; Apexes; Clutter; Computer applications; Graph theory; Graph topological properties; Local invariant features; Mapping; Matching; Matching concept; Mathematical analysis; Object recognition; Occlusion; Pattern recognition; Semi-local graph matching; Topology; Local invariant features; 41A10; 65D05; 65D17; Graph topological properties; Semi-local graph matching; 41A05

•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...