Locality preserving verification for image search

Shanmin Pang, Jianru Xue, Nanning Zheng, Qi Tian

Abstract

Establishing correct correspondences between two images has a wide range of applications, such as 2D and 3D registration, structure from motion, and image retrieval. In this paper, we propose a new matching method based on spatial constraints. The proposed method has linear time complexity, and is efficient when applying it to image retrieval. The main assumption behind our method is that, the local geometric structure among a feature point and its neighbors, is not easily affected by both geometric and photometric transformations, and thus should be preserved in their corresponding images. We model this local geometric structure by linear coefficients that reconstruct the point from its neighbors. The method is flexible, as it can not only estimate the number of correct matches between two images efficiently, but also determine the correctness of each match accurately. Furthermore, it is simple and easy to be implemented. When applying the proposed method on re-ranking images in an image search engine, it outperforms the-state-of-the-art techniques.
BibTeX
@inproceedings{pang2013locality,
  author = {Shanmin Pang and Jianru Xue and Nanning Zheng and Qi Tian},
  title = {{Locality preserving verification for image search}},
  booktitle = {ACM Multimedia},
  year = {2013},
  doi = {10.1145/2502081.2502140},
}

Loading related content...

Figure