Locally Uniform Comparison Image Descriptor

Keypoint matching between pairs of images using popular descriptors like SIFT or a faster variant called SURF is at the heart of many computer vision algorithms including recognition, mosaicing, and structure from motion. However, SIFT and SURF do not perform well for real-time or mobile applications. As an alternative very fast binary descriptors like BRIEF and related methods use pairwise comparisons of pixel intensities in an image patch. We present an analysis of BRIEF and related approaches revealing that they are hashing schemes on the ordinal correlation metric Kendall's tau. Here, we introduce Locally Uniform Comparison Image Descriptor (LUCID), a simple description method based on linear time permutation distances between the ordering of RGB values of two image patches. LUCID is computable in linear time with respect to the number of pixels and does not require floating point computation.

[1]  J. Marden.  Analyzing and Modeling Rank Data , 1996 .

[2]  Gary R. Bradski,et al.  ORB: An efficient alternative to SIFT or SURF , 2011, 2011 International Conference on Computer Vision.

[3]  Cordelia Schmid,et al.  A Performance Evaluation of Local Descriptors , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[5]  Moses Charikar,et al.  Similarity estimation techniques from rounding algorithms , 2002, STOC '02.

[6]  William M. Wells,et al.  SIFT-Rank: Ordinal description for invariant feature correspondence , 2009, CVPR.

[7]  R. Graham,et al.  Spearman's Footrule as a Measure of Disarray , 1977 .

[8]  Shree K. Nayar,et al.  Ordinal Measures for Image Correspondence , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Stefan Scherer,et al.  The discriminatory power of ordinal measures - towards a new coefficient , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[10]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[11]  Vincent Lepetit,et al.  BRIEF: Binary Robust Independent Elementary Features , 2010, ECCV.

[12]  Visvanathan Ramesh,et al.  An Intensity-augmented Ordinal Measure for Visual Correspondence , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[13]  Andrew Zisserman,et al.  Image Classification using Random Forests and Ferns , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[14]  A. Cayley,et al.  LXXVII. Note on the theory of permutations , 1849 .

[15]  M. Fligner,et al.  Distance Based Ranking Models , 1986 .

[16]  Arthur Cayley.  The Collected Mathematical Papers: Note on the Theory of Permutations , 2009 .

[17]  Rong Xiao,et al.  Rank-SIFT: Learning to rank repeatable local interest points , 2011, CVPR 2011.

[18]  Luc Van Gool,et al.  Speeded-Up Robust Features (SURF) , 2008, Comput. Vis. Image Underst..

[19]  Jie Liu,et al.  I-BRIEF: A Fast Feature Point Descriptor with More Robust Features , 2011, 2011 Seventh International Conference on Signal Image Technology & Internet-Based Systems.

[20]  Timothy B. Terriberry,et al.  GPU Accelerating Speeded-Up Robust Features , 2008 .

[21]  M. Kendall.  A NEW MEASURE OF RANK CORRELATION , 1938 .

[22]  Tayuan Huang,et al.  Metrics on Permutations, a Survey , 2004 .

[23]  Jay Yagnik,et al.  The power of comparative reasoning , 2011, 2011 International Conference on Computer Vision.

[24]  Roland Siegwart,et al.  BRISK: Binary Robust invariant scalable keypoints , 2011, 2011 International Conference on Computer Vision.