Location Recognition using Prioritized Feature Matching.pdfVIP

Location Recognition using Prioritized Feature Matching Yunpeng Li Noah Snavely Daniel P. Huttenlocher Department of Computer Science, Cornell University, Ithaca, NY 14853 yuli,snavely,dph@cs.cornell.edu Abstract. We present a fast, simple location recognition and image localization method that leverages feature correspondence and geometry estimated from large Internet photo collections. Such recovered structure contains a significant amount of useful information about images and image features that is not available when considering images in isolation. For instance, we can predict which views will be the most common, which feature points in a scene are most reliable, and which features in the scene tend to co-occur in the same image. Based on this informa- tion, we devise an adaptive, prioritized algorithm for matching a representative set of SIFT features covering a large scene to a query image for efficient local- ization. Our approach is based on considering features in the scene database, and matching them to query image features, as opposed to more conventional meth- ods that match image features to visual words or database features. We find this approach results in improved performance, due to the richer knowledge of char- acteristics of the database features compared to query image features. We present experiments on two large city-scale photo collections, showing that our algorithm compares favorably to image retrieval-style approaches to location recognition. Key words: Location recognition, image registration, image matching, structure from motion 1 Introduction In the past few years, the massive collections of imagery on the Internet have inspired a wave of work on locatio