Neighborhood Matching for Image Retrieval Articles uri icon

publication date

  • March 2017

start page

  • 544

end page

  • 558

issue

  • 3

volume

  • 19

International Standard Serial Number (ISSN)

  • 1520-9210

Electronic International Standard Serial Number (EISSN)

  • 1941-0077

abstract

  • In the last few years, large-scale image retrieval has attracted a lot of attention from the multimedia community. Usual approaches addressing this task first generate an initial ranking of the reference images using fast approximations that do not take into consideration the spatial arrangement of local features in the image (e.g., the bag-of-words paradigm). The top positions of the rankings are then re-estimatedwith verificationmethods that deal with more complex information, such as the geometric layout of the image. This verification step allows pruning of many false positives at the expense of an increase in the computational complexity, whichmay prevent its application to large-scale retrieval problems. This paper describes a geometric method known as neighborhood matching (NM), which revisits the keypointmatching process by considering a neighborhood around each keypoint and improves the efficiency of a geometric verification step in the image search system. Multiple strategies are proposed and compared to incorporate NM into a large-scale image retrieval framework. A detailed analysis and comparison of these strategies and baseline methods have been investigated. The experiments show that the proposed method not only improves the computational efficiency, but also increases the retrieval performance and outperforms state-of-the-artmethods in standard datasets, such as the Oxford 5 k and 105 k datasets, for which the spatial verification step has a significant impact on the system performance.

keywords

  • geometric verification; image retrieval; neighborhood matching (nm); robust estimation; object retrieval; re-ranking; search; scale; features; localization; quantization; geometry; codes; model