Rank-SIFT: Learning to rank repeatable local interest points

Authors:
Bing Li; Rong Xiao; Zhiwei Li; Rui Cai; Bao-Liang Lu; Lei Zhang
Affiliations:
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China;Microsoft Res. Asia, Beijing, China;Microsoft Res. Asia, Beijing, China;Microsoft Res. Asia, Beijing, China;Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China;Microsoft Res. Asia, Beijing, China
Venue:
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Year:
2011

Citing 0
Cited 2

Image region description using orthogonal combination of local binary patterns enhanced with color information

Pattern Recognition
Image search—from thousands to billions in 20 years

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Sections on the 20th Anniversary of ACM International Conference on Multimedia, Best Papers of ACM Multimedia 2012

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scale-invariant feature transform (SIFT) has been well studied in recent years. Most related research efforts focused on designing and learning effective descriptors to characterize a local interest point. However, how to identify stable local interest points is still a very challenging problem. In this paper, we propose a set of differential features, and based on them we adopt a data-driven approach to learn a ranking function to sort local interest points according to their stabilities across images containing the same visual objects. Compared with the handcrafted rule-based method used by the standard SIFT algorithm, our algorithm substantially improves the stability of detected local interest point on a very challenging benchmark dataset, in which images were generated under very different imaging conditions. Experimental results on the Oxford and PASCAL databases further demonstrate the superior performance of the proposed algorithm on both object image retrieval and category recognition.