mlsanityData to 14 Oct 2026

A Geometrically Constrained Point Matching based on View-invariant Cross-ratios, and Homography

arXiv 2211.03007 ↗First posted 6 Nov 2022cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

In computer vision, finding point correspondence among images plays an important role in many applications, such as image stitching, image retrieval, visual localization, etc. Most of the research worksfocus on the matching of local feature before a sampling method is employed, such as RANSAC, to verify initial matching results via repeated fitting of certain global transformation among the images. However, incorrect matches may still exist, while careful examination of such problems is often skipped. Accordingly, a geometrically constrained algorithm is proposed in this work to verify the correctness of initially matched SIFT keypoints based on view-invariant cross-ratios (CRs). By randomly forming pentagons from these keypoints and matching their shape and location among images with CRs, robust planar region estimation can be achieved efficiently for the above verification, while correct and incorrect matches of keypoints can be examined easily with respect to those shape and location matched pentagons. Experimental results show that satisfactory results can be obtained for various scenes with single as well as multiple planar regions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 21 references that are in the map. First posted on arXiv 6 Nov 2022.

Builds on

4 of 21 references.

References · 4

  1. 2017Learning to Find Good Correspondencescited by 176
  2. 2017Graph-Cut RANSACcited by 133
  3. 2019Neural-Guided RANSAC: Learning Where to Sample Model Hypothesescited by 129
  4. 2018MAGSAC: marginalizing sample consensuscited by 123

Built on by

Not cited yet.