Fast-match: Fast and robust feature matching on large images

Today’s cameras produce images that often exceed 10 megapix-els. Yet computing and matching local features for images of this size can easily take 20 seconds or more using op-timized matching algorithms. This is much too slow for interactive applications and much too expensive for large scale image operations. We introduce Fast-Match, an al-gorithm designed to match large images efficiently without compromising matching accuracy. It derives its speed from only computing features in those parts of the image that can be confidently matched. Fast-Match is an order of magni-tude faster than the popular Ratio-Match, yet often doubles matching precision for difficult image pairs. 1